{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED1","name":"Handler temporal coupling","shortDescription":{"text":"Handler temporal coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/ED1"},{"id":"ED3","name":"Event naming","shortDescription":{"text":"Event naming"},"helpUri":"https://codehealth.canine.dev/dimensions/ED3"},{"id":"ED4","name":"Outbox / dual-write","shortDescription":{"text":"Outbox / dual-write"},"helpUri":"https://codehealth.canine.dev/dimensions/ED4"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.executeTabSql (cyclomatic 601): queryStore.useQueryStore.executeTabSql has cyclomatic complexity 601 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (queryStore.useQueryStore.executeTabSql::bindLargeValueContext, queryStore.useQueryStore.executeTabSql::executeWithoutManualTransaction) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcdaa3a12db630d49a0ad90634f1da4d97da3a525bbdc46913311b9d28d1cc6"}},{"ruleId":"D1","level":"warning","message":{"text":"settingsStore.useSettingsStore.applyEditorSettingsPatch (cyclomatic 310): settingsStore.useSettingsStore.applyEditorSettingsPatch has cyclomatic complexity 310 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"696b3ebb6838f186cba7ab167d256ba21a2b7c0c1cbaba442a2899442cb5cfc7"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.fetchCapturedTabResultForExport (cyclomatic 186): queryStore.useQueryStore.fetchCapturedTabResultForExport has cyclomatic complexity 186 (threshold 15). Of this number, 155 points are the body\u0027s own statements and 31 belong to 11 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11358}}}],"partialFingerprints":{"codehealthFindingId/v1":"824d3b7f5beab101f3256ea273538a1cad4c266306347dea4c27e46980b8fc42"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::generate_schema_sync_sql_inner_with_oracle_ddl (cyclomatic 181): dbx_sql_schema::schema_diff::generate_schema_sync_sql_inner_with_oracle_ddl has cyclomatic complexity 181 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6688}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c15aa5068438a9d5fc8dabda893bdcaab5ad710486378d55f42cb680a66866"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugSelectNativeTarget (cyclomatic 178): main.plDebugSelectNativeTarget has cyclomatic complexity 178 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea492336f8c866c06afc8af342abb8d4342cf8fc7145af094cf6581fa72c4e9"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginHostBridge.dispatch (cyclomatic 178): PluginHostBridge.dispatch has cyclomatic complexity 178 (threshold 15). Of this number, 177 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"7679b26280808dfbcba7bbba8338bd4e1c7a2f26199a210ce158d39dda2fd65b"}},{"ruleId":"D1","level":"warning","message":{"text":"settingsStore.normalizeEditorSettings (cyclomatic 164): settingsStore.normalizeEditorSettings has cyclomatic complexity 164 (threshold 15). Of this number, 154 points are the body\u0027s own statements and 10 belong to 5 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e14a009dc9278a4c34af2490a1c700fb1cabf8158ac929e51c4e7ff5ff038e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::database_export::export_database_sql_core_inner_with_phases (cyclomatic 152): dbx_core::data::database_export::export_database_sql_core_inner_with_phases has cyclomatic complexity 152 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5135}}}],"partialFingerprints":{"codehealthFindingId/v1":"194979290823e463aa279e76b03e5891bf6121f3b44a8d1121e5a849346b383d"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.performAsyncCompletionWithResult (cyclomatic 147): useQueryEditorCompletion.useQueryEditorCompletion.performAsyncCompletionWithResult has cyclomatic complexity 147 (threshold 15). Of this number, 119 points are the body\u0027s own statements and 28 belong to 7 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"281088cedde722e2da58def35ca232d3b89e59640d0d15b1738161a725301f16"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::parse (cyclomatic 144): dbx_driver_mongodb::mongo_shell::parse has cyclomatic complexity 144 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbef1958dfa0f79bafa5ae7a35f7a1a28028959cf60922a2a69d2084871e933"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTypeManagement.prepareOracleTypeManagement (cyclomatic 141): oracleTypeManagement.prepareOracleTypeManagement has cyclomatic complexity 141 (threshold 15). Of this number, 118 points are the body\u0027s own statements and 23 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fc6e782be55f1fe353e600a96cc7388e816bf56979fa47ffcb6f975cb48033"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::transitions::native_job_scheduler_edit_plan (cyclomatic 136): dbx_sql_schema::native_job_changes::transitions::native_job_scheduler_edit_plan has cyclomatic complexity 136 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/transitions.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"854247ab8f9cb27608e2797fd0d61cbff3aa1a30661e0bfc81f15633c850f431"}},{"ruleId":"D1","level":"warning","message":{"text":"useSidebarDataOpenRuntime.useSidebarDataOpenRuntime.openData (cyclomatic 134): useSidebarDataOpenRuntime.useSidebarDataOpenRuntime.openData has cyclomatic complexity 134 (threshold 15). Of this number, 106 points are the body\u0027s own statements and 28 belong to 9 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDataOpenRuntime.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8070cd2bf121776c5bc16bc69d2e6aa5e5e3ef7f7b23f1629e3ff40919bda2"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonRpcServer.dispatch (cyclomatic 133): JsonRpcServer.dispatch has cyclomatic complexity 133 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a984fc004fcc3496ca199e15df315d1d3f6d2bfa4285bb1cef0b87cfff27a7"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativePlan.render (cyclomatic 132): plDebugNativePlan.render has cyclomatic complexity 132 (threshold 15). Of this number, 106 points are the body\u0027s own statements and 26 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":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b9764549950c766ad4f667257ae69867a53d71199934aeb4ea789b6065f362"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.mutateNativeBreakpoint (cyclomatic 127): plDebugNativeEntry.mutateNativeBreakpoint has cyclomatic complexity 127 (threshold 15). Of this number, 116 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint_write.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dcdea42acd879a6a6a566bc745cfc54a46e2e8b6e9c962554d0dba04e408e1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_table_inner (cyclomatic 123): dbx_core::data::transfer::transfer_table_inner has cyclomatic complexity 123 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":13155}}}],"partialFingerprints":{"codehealthFindingId/v1":"12723680b325db625ae4d622a77afe9faad76642d9e4d8604f75e93b0659fb22"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorObjectNavigation.useQueryEditorObjectNavigation.onEditorMouseDown (cyclomatic 118): useQueryEditorObjectNavigation.useQueryEditorObjectNavigation.onEditorMouseDown has cyclomatic complexity 118 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 101 belong to 7 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78d4c4b17cf0cdbd5cfd36b1ad5c86db15af46d8a1e9e25b46dde1923796933"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportLocalSnapshot (cyclomatic 118): useDataGridExport.useDataGridExport.exportLocalSnapshot has cyclomatic complexity 118 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 70 belong to 13 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0f5c0b9337037029875918a59873b3a11424e5dd0ad7bff90d64169bb23252"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::import_table_file_core (cyclomatic 117): dbx_core::data::table_import::import_table_file_core has cyclomatic complexity 117 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":7844}}}],"partialFingerprints":{"codehealthFindingId/v1":"beda1bb1f3daa3bddbd4ac40d2f532f983aa8cf7c29dfc30da4ebf0e876bc5ee"}},{"ruleId":"D1","level":"warning","message":{"text":"createMockHost (cyclomatic 117): createMockHost has cyclomatic complexity 117 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 92 belong to 28 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaa7239c31248c13af5835587c9b83034b6b3ce7f4529452619617ce028896b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::create_table::build_create_table_sql_impl (cyclomatic 115): dbx_sql_schema::table_structure_sql::create_table::build_create_table_sql_impl has cyclomatic complexity 115 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/create_table.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90aa585cc2acff22e48b4c9b2cad15af9ab05661aa38814664a6552bfd71f09"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.saveChanges (cyclomatic 114): useDataGridEditor.useDataGridEditor.saveChanges has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"d236493515f487b3cad5c1505dc628cd2a963c2e50ea69b0f080f3ac80f2eb40"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.splitSqlStatementRanges (cyclomatic 112): sqlStatementRanges.splitSqlStatementRanges has cyclomatic complexity 112 (threshold 15). Of this number, 95 points are the body\u0027s own statements and 17 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d488434aa8abdd1c498bf13fc9ddebc0eadc8e60856461c049eb48f7d741cc6"}},{"ruleId":"D1","level":"warning","message":{"text":"routineBlockLayout.indentRoutineBlocks (cyclomatic 108): routineBlockLayout.indentRoutineBlocks has cyclomatic complexity 108 (threshold 15). Of this number, 105 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/routineBlockLayout.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"913a1609048af46463bd41ef6fba5865a7bf746f8e8783a9152886ae31607943"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::map_column_type (cyclomatic 107): dbx_core::data::transfer::map_column_type has cyclomatic complexity 107 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":4743}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4cf61824d52ae80d6919eeba7f1e2ee32c480ef180922acfc1a959b7736301"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadTreeNodeChildren (cyclomatic 107): connectionStore.useConnectionStore.loadTreeNodeChildren has cyclomatic complexity 107 (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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8971}}}],"partialFingerprints":{"codehealthFindingId/v1":"312aa92aebf38cf8d6274f90623db9b2df940cb6f6c5cc516258e28e9f197752"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGenerate.buildDefaultGeneratorParams (cyclomatic 101): dataGenerate.buildDefaultGeneratorParams has cyclomatic complexity 101 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce95de044dfc4baabaad3ce44acc8ff99872b51a22a11ce94aa49a332aecbeb"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::columns::build_column_sql (cyclomatic 99): dbx_sql_schema::table_structure_sql::columns::build_column_sql has cyclomatic complexity 99 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/columns.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"409dddccef33bc7d3de80fd786f76823003cbe09a1ec13a7f3f45e7ced43427f"}},{"ruleId":"D1","level":"warning","message":{"text":"oceanbasePrimaryKey.readOceanbasePrimaryKeySnapshot (cyclomatic 99): oceanbasePrimaryKey.readOceanbasePrimaryKeySnapshot has cyclomatic complexity 99 (threshold 15). Of this number, 98 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbasePrimaryKey.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec99af5cdc833a75f7a49d73be4c2cec63f24042ab19d94b8190c92131b397aa"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.getSqlCompletionContext (cyclomatic 99): sqlCompletion.getSqlCompletionContext has cyclomatic complexity 99 (threshold 15). Of this number, 98 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3053}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9df3e5f070ba1590bc5321d0a3c5c3dde32da32cb46e61f0287d5a8ab19abe"}},{"ruleId":"D1","level":"warning","message":{"text":"tableColumnDefinitionPaste.parseColumn (cyclomatic 99): tableColumnDefinitionPaste.parseColumn has cyclomatic complexity 99 (threshold 15). Of this number, 86 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5f17ebba8078797200b6a77b431322c7a5cf19d9da0b252da70b517baffeac"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionConfig::connection_url_with_host (cyclomatic 98): ConnectionConfig::connection_url_with_host has cyclomatic complexity 98 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"4716d3ae6afc5aae9c965194110980d06f1ef0f3180f51ef9da1bac583c11c03"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlCompletionProvider.build (cyclomatic 98): SqlCompletionProvider.build has cyclomatic complexity 98 (threshold 15). Of this number, 92 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"c246e22fbc2b2add482270450d539590e8d3874dc93d97f0b143b8a2e2442233"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferDdl.rewriteCreateTableName (cyclomatic 97): queryResultTransferDdl.rewriteCreateTableName has cyclomatic complexity 97 (threshold 15). Of this number, 84 points are the body\u0027s own statements and 13 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0828f3c735d1d50b3d490ab4e6e471bfb6f351ae8f98588745f4574dd6917a8"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::get_or_create_pool_for_session_inner_with_receipt (cyclomatic 96): AppState::get_or_create_pool_for_session_inner_with_receipt has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4d4db501691e780aaa68b3a9b6f8d72fbb51992cb96709c1d2a3f6098e8bde"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugParseNativeConstructors (cyclomatic 95): main.plDebugParseNativeConstructors has cyclomatic complexity 95 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_object_constructors.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0688ed67dbcdd9d414d93e680be34f8c0405c1043d5b026ba5a84759e59c27b"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferValues.queryResultTransferTargetType (cyclomatic 95): queryResultTransferValues.queryResultTransferTargetType has cyclomatic complexity 95 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4a49b8c97ec8438c2259629fbf42ace26a9dc775c127e08b50a999f4501463"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeJobAdmin.buildNativeJobDefinitionEdit (cyclomatic 95): nativeJobAdmin.buildNativeJobDefinitionEdit has cyclomatic complexity 95 (threshold 15). Of this number, 78 points are the body\u0027s own statements and 17 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d03640e019cef7f3b4c8471219bbab541f5c03def28fdc6016ac407bec1bfb"}},{"ruleId":"D1","level":"warning","message":{"text":"treeNodeIcon.getTreeNodeIconInfo (cyclomatic 95): treeNodeIcon.getTreeNodeIconInfo has cyclomatic complexity 95 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeIcon.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cb41fdf853b12456958955fe858676f2ef2465f11375472d6f025548da3c8b"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.explainTabSql (cyclomatic 94): queryStore.useQueryStore.explainTabSql has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10386}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc28ddab2aa1282ab35f7c5613d6affb52a5a5dde503d18672b7acd8865c7b2"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.provideSqlCompletions (cyclomatic 93): useQueryEditorCompletion.useQueryEditorCompletion.provideSqlCompletions has cyclomatic complexity 93 (threshold 15). Of this number, 88 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"1333565ca7258a367c4a71831dece9013542c6e94c779e330219d90a1a9bdbda"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlFormatter.compressSqlText (cyclomatic 93): sqlFormatter.compressSqlText has cyclomatic complexity 93 (threshold 15). Of this number, 66 points are the body\u0027s own statements and 27 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7643cdeef5e8fde374c7822a8207755fe200bf33f9761be7219218aa572e7f7"}},{"ruleId":"D1","level":"warning","message":{"text":"useSqlExecution.useSqlExecution.executeTargetSql (cyclomatic 92): useSqlExecution.useSqlExecution.executeTargetSql has cyclomatic complexity 92 (threshold 15). Of this number, 79 points are the body\u0027s own statements and 13 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"8127a115292af4304ed524a18579ce89f1956677949afeaa0809e016171c672c"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlStatementSplitter::push_chunk_with_control (cyclomatic 91): SqlStatementSplitter::push_chunk_with_control has cyclomatic complexity 91 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c533c22518c03991fec2e785b490e46067e26502567f1db4f828f6217027a9"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadMoreObjectGroupChildren (cyclomatic 91): connectionStore.useConnectionStore.loadMoreObjectGroupChildren has cyclomatic complexity 91 (threshold 15). Most of this is not in the body itself: 13 of the 91 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 8031, searchIsCurrent, a function literal at line 8053, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7988}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab2f770fd8c809e7b05699331fa7925c6bab9f361e7cbe72c2c6da4eee5ca6d"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleConstraints.executeOracleConstraintPlan (cyclomatic 90): oracleConstraints.executeOracleConstraintPlan has cyclomatic complexity 90 (threshold 15). Of this number, 88 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"003462cfc00effa9bc717fe5da23df805339b5940eb267de3ca0403dddbe5e4d"}},{"ruleId":"D1","level":"warning","message":{"text":"starrocksAlterOptions.starRocksAlterOptionsFromDdl (cyclomatic 90): starrocksAlterOptions.starRocksAlterOptionsFromDdl has cyclomatic complexity 90 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 28 belong to 14 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksAlterOptions.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1d381e9e783adc364187ca005e4019a4504ab0a6df1c0993f753d1d15c9c1f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::list_tables_once (cyclomatic 87): dbx_core::schema::list_tables_once has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c5beb1beb6b5d5659174545845fff228319a6a9b7ff98b8be17ecc59bcea27"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionConfig::redacted_connection_url_with_host (cyclomatic 87): ConnectionConfig::redacted_connection_url_with_host has cyclomatic complexity 87 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"df34808fb392c19786403d93487294d9c94c1b8c71384c1b7c19e084d2be16d8"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorHover.useQueryEditorHover.resolveSqlHoverTooltip (cyclomatic 87): useQueryEditorHover.useQueryEditorHover.resolveSqlHoverTooltip has cyclomatic complexity 87 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 13 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4670751d050bd8f6663d95e495468be1f3bf1da2ddd2ab6b25f50cb80eeba5b"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugLoadNativeTypeGraphOnLoader (cyclomatic 86): main.plDebugLoadNativeTypeGraphOnLoader has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_type_graph.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76221c221149cd804254d78b3cf45261773d0c02d752907dd91b3bc31b312d4"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.findSqlParameterOccurrences (cyclomatic 86): sqlParameters.findSqlParameterOccurrences has cyclomatic complexity 86 (threshold 15). Of this number, 84 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"416905dd00e2bd0072b2a8fefd1311cbb597d76e875a46c213c7c29157d48a73"}},{"ruleId":"D1","level":"warning","message":{"text":"DriversClient.DriversClient (cyclomatic 86): DriversClient.DriversClient has cyclomatic complexity 86 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 37 belong to 12 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ada837f56513e91c89cf2d0ed5402a4b116eea8ba8fc24144b24670d2abfa4"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridActions.useDataGridActions.onReloadData (cyclomatic 85): useDataGridActions.useDataGridActions.onReloadData has cyclomatic complexity 85 (threshold 15). Of this number, 73 points are the body\u0027s own statements and 12 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc062a5c24b405d2e19f0a59192ae5f213a164686713217205c76630dbd37797"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::oracle_constraints::build_changes (cyclomatic 84): dbx_sql_schema::table_structure_sql::oracle_constraints::build_changes has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f13d3f1786a604aab131aae754f20f492534f55c0ee28674a942f4d0396d623"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.getFunctionDescriptions (cyclomatic 84): sqlCompletion.getFunctionDescriptions has cyclomatic complexity 84 (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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de05710018812a0573c9bc2d70a59b22e4d95bc4f99ec5c56ca594a939b2921"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadTables (cyclomatic 83): connectionStore.useConnectionStore.loadTables has cyclomatic complexity 83 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 64 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7588}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41c832596b58f4916a54c483f31fbc14b8bd8deddf7f6d1c826eaf5fa211650"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_plugin_runtime::plugins::manifest::validate_contributions (cyclomatic 82): dbx_plugin_runtime::plugins::manifest::validate_contributions has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b7a65703f7cc4439beb7e045143ea1b294aaa0dad7ba06cdd1f97ccb681a7d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::commands::connection::test_connection_with_info_impl (cyclomatic 82): dbx::commands::connection::test_connection_with_info_impl has cyclomatic complexity 82 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/connection.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fd216917b2ce78d8815a25e9c39849fb05a0721ea1d11cf70be32684560a71"}},{"ruleId":"D1","level":"warning","message":{"text":"queryEditorSqlExtensions.configureQueryEditorSqlExtensions (cyclomatic 82): queryEditorSqlExtensions.configureQueryEditorSqlExtensions has cyclomatic complexity 82 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 56 belong to 13 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb10a6e291dc97e461a2e29d55e80241e6b31dfcd9b8b7488eb942aa45e4aadd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::split_sql_statement_ranges_with_options (cyclomatic 81): dbx_sql_core::sql::split_sql_statement_ranges_with_options has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b2d57241addd8ad2f2000895fca2e6445055b57430aeb1c090bce0f5961639"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleForeignKeys.executeOracleForeignKeyPlan (cyclomatic 81): oracleForeignKeys.executeOracleForeignKeyPlan has cyclomatic complexity 81 (threshold 15). Of this number, 73 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02cf3d46fd3490385d7a62dcebd83b4ebcc565e069aff9919ec8fc6abcad754"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeDeclarations (cyclomatic 80): main.plDebugNativeDeclarations has cyclomatic complexity 80 (threshold 15). Of this number, 76 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_variables.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"11484e83169ce50e9ae3bb33ab1ff91089f1a9bbdab9e71e5d8f2c1e4dbe329f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::query_result_export::export_query_result_core_inner (cyclomatic 79): dbx_core::data::query_result_export::export_query_result_core_inner has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4987571d8db8d10586d58cc50317c7f3d22526e1bcc4bd2dddc7dd43c9ea396"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_export::export_table_data_core_inner (cyclomatic 79): dbx_core::data::table_export::export_table_data_core_inner has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b9356dae1fd3541bcff5022b00a7e5cb51a7cb9049cefa9c6be268f69f4c8f"}},{"ruleId":"D1","level":"warning","message":{"text":"main.applyCassandraURLParams (cyclomatic 79): main.applyCassandraURLParams has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3575f3e505067af32b1b93b82a27ece74650b856129482eb4726409b424f75"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugScanNativeRoutinesMode (cyclomatic 79): main.plDebugScanNativeRoutinesMode has cyclomatic complexity 79 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 60 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b10869937d3dda0ece2e0e96326e280b512dc81a473f12e9579c8f7460d28e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::do_execute_typed (cyclomatic 78): dbx_core::query::do_execute_typed has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c38713bd95a625215e1ad1249bb7c1d6febdbceb267d4751406e0ca7587e6ff"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportMemoryResultSheetsXlsx (cyclomatic 78): useDataGridExport.useDataGridExport.exportMemoryResultSheetsXlsx has cyclomatic complexity 78 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 61 belong to 16 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43a3cca9681f0116f2472e0cbf835a93374e4c24a4861ed3bcedc8751c4df96"}},{"ruleId":"D1","level":"warning","message":{"text":"oceanbasePrimaryKey.executeOceanbasePrimaryKeyPlan (cyclomatic 78): oceanbasePrimaryKey.executeOceanbasePrimaryKeyPlan has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbasePrimaryKey.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d332cae12b7cda12696ad56263e8e6dc83708040754eb12dad22a3dc7b0be67c"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.parseMongoWriteCommand (cyclomatic 78): mongoShellCommand.parseMongoWriteCommand has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a267d33d1abe12887634029ff6e5a27f47bc28964fbaff273a678976def2252"}},{"ruleId":"D1","level":"warning","message":{"text":"useSqlExecution.useSqlExecution.doExecute (cyclomatic 77): useSqlExecution.useSqlExecution.doExecute has cyclomatic complexity 77 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dcd2a9507813e4d51824f072681e2a96bfed4c7058b75c540909be4cc44d26"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarActiveTabTarget.matchesTarget (cyclomatic 75): sidebarActiveTabTarget.matchesTarget has cyclomatic complexity 75 (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":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ec7abd042ea2ca373bade5b5f5525fc110a6ab0fa9ff3568941d78164e648e"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadObjectGroupFirstPage (cyclomatic 75): connectionStore.useConnectionStore.loadObjectGroupFirstPage has cyclomatic complexity 75 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 53 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7768}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c8f8df4862e855ba7d7463ffc73a925038ce8dda2c6cb969a3394f1ba819b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Plan.read (cyclomatic 74): Plan.read has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c198a2902decb3f7849b5a62f0d09ef285ded3f210988ac11c6eea1ddd09d75b"}},{"ruleId":"D1","level":"warning","message":{"text":"openTabsPersistence.serializeOpenTabs (cyclomatic 74): openTabsPersistence.serializeOpenTabs has cyclomatic complexity 74 (threshold 15). Most of this is not in the body itself: 1 of the 74 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 218, 284). 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":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6878026b5ee67d2771a154d64ca46226efda6e0e02770db9296750a5318db55b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::plan::build_plan_with_tables (cyclomatic 73): dbx_core::schema::oracle_routines::plan::build_plan_with_tables has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6026e16f670df857cc82a221c47230a4a9b00474b7ea38770c692d1d5d4135f"}},{"ruleId":"D1","level":"warning","message":{"text":"canvasDataGridRenderer.drawCanvasDataGrid (cyclomatic 73): canvasDataGridRenderer.drawCanvasDataGrid has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (canvasDataGridRenderer.drawCanvasDataGrid::drawCell) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1357a3a873aa5c0eb9da46db67eacbf75199d3104941f47f7d9b6162bcc5729"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlFormatter.maskStringAndCommentSpans (cyclomatic 73): sqlFormatter.maskStringAndCommentSpans has cyclomatic complexity 73 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d3db179c1111371127f32d03138b0e633643a392af6bb313d097ed43e612b6"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_trigger::analyze (cyclomatic 72): dbx_sql_core::object_source_sql::oracle_trigger::analyze has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_trigger.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81fefe5bb055af2942500f04e3663b25721b03118a11a95d1304b5c0caf38d3"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExtractor.useDataGridExtractor.buildRequest (cyclomatic 72): useDataGridExtractor.useDataGridExtractor.buildRequest has cyclomatic complexity 72 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 8 belong to 6 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b874e88effd89d40a9c78c008fb14873a9a402f46830c784c5ed5d76d6f37a5"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferValues.queryResultTransferSqlLiteral (cyclomatic 71): queryResultTransferValues.queryResultTransferSqlLiteral has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38442f7bf49fefd13a97dbdadae05ee3e838c2ff276c63975e2f60377cf9d2e"}},{"ruleId":"D1","level":"warning","message":{"text":"canvasDataGridRenderer.drawCanvasDataGrid::drawCell (cyclomatic 71): canvasDataGridRenderer.drawCanvasDataGrid::drawCell has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (canvasDataGridRenderer.drawCanvasDataGrid) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f898b9179cbf9033d770ac1dffa995064f8fe47afdf501647cb8c9f990772c"}},{"ruleId":"D1","level":"warning","message":{"text":"tabPresentation.tabDisplayTitle (cyclomatic 71): tabPresentation.tabDisplayTitle has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"390f836e04bd43056b1b8ba3cec5e12797df75ce9302a6983cfd9104daa17e7b"}},{"ruleId":"D1","level":"warning","message":{"text":"createMockHost.bridge (cyclomatic 71): createMockHost.bridge has cyclomatic complexity 71 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79452f1f819f2e958e0ab2d2f2894a8a7e89b8736acfa048cc3a6453aec0238"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::refresh_connections (cyclomatic 70): AppState::refresh_connections has cyclomatic complexity 70 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":7165}}}],"partialFingerprints":{"codehealthFindingId/v1":"786511efe04badb801e73f0b8ab154937d0418ef78d447faea6a8f76e6cc5df5"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportMemoryDataFile (cyclomatic 70): useDataGridExport.useDataGridExport.exportMemoryDataFile has cyclomatic complexity 70 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 35 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"e363d4a13e601728872e39758575087458e21ff111123a848df702b591febf30"}},{"ruleId":"D1","level":"warning","message":{"text":"tokens.tokenizeSqlSemantic (cyclomatic 70): tokens.tokenizeSqlSemantic has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/tokens.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51213a6b837419888175d2e911bd3408bcd45a84c118f6e6b0e206f5ae9c880"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeNamedCall.result (cyclomatic 69): plDebugNativeNamedCall.result has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"e818774f9de1a6bc65faadfb824f2ce8f119d65bb680ff106066ba38df8cc186"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_dialect::sql_dialect::type_rewrite::rewrite_cross_dialect_to_sqlserver (cyclomatic 68): dbx_sql_dialect::sql_dialect::type_rewrite::rewrite_cross_dialect_to_sqlserver has cyclomatic complexity 68 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/type_rewrite.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3974c043ecdf9cc3978736c71585540da9ff8b10ea3727d07f09ef4476af9f17"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugLoadNativeTargets (cyclomatic 68): main.plDebugLoadNativeTargets has cyclomatic complexity 68 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 48 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab5f0bc9edf8a43a2076ff82cdfb5a868aff903d75ddc1cd822231bb70a08a6"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferSource.loadQueryResultTransferSourceDdl (cyclomatic 68): queryResultTransferSource.loadQueryResultTransferSourceDdl has cyclomatic complexity 68 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 13 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferSource.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97d04ae35f2009fd8cd87b313f56f606d9a38f2ba3f47e2e1255b62accc00d1"}},{"ruleId":"D1","level":"warning","message":{"text":"useNavigationTargets.openTableTarget (cyclomatic 68): useNavigationTargets.openTableTarget has cyclomatic complexity 68 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aa8eb1904604c56236d943906e627e5afd2252903d7f879f09a28339505407"}},{"ruleId":"D1","level":"warning","message":{"text":"useSchemaDiffSession.runSchemaDiffSession (cyclomatic 68): useSchemaDiffSession.runSchemaDiffSession has cyclomatic complexity 68 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSchemaDiffSession.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33f2fdee7a836bad11a529efc88bf0d11aa03dede15574f79f121a78ef552cc"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineRename.executeOracleRoutineRename (cyclomatic 68): oracleRoutineRename.executeOracleRoutineRename has cyclomatic complexity 68 (threshold 15). Of this number, 66 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17e39be1576bdb307d481e3da1063bbe94a8c2b90366a76d0dd9f7b90da6823"}},{"ruleId":"D1","level":"warning","message":{"text":"server.createMockHost.bridge (cyclomatic 68): server.createMockHost.bridge has cyclomatic complexity 68 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"45468183d0cc65c81cb2a8d0289347b11fbbb245d095be987b4c74c2d1c76a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"MysqlDumpBinaryLiteralNormalizer::normalize (cyclomatic 67): MysqlDumpBinaryLiteralNormalizer::normalize has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e84585453906f79d61a32ed0ee7a703e5123091e675de783c69da8a48b50c0"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::commands::connection::connect_db_inner (cyclomatic 67): dbx::commands::connection::connect_db_inner has cyclomatic complexity 67 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/connection.rs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4f2530b83c098d240925dfac5ce4c20261cd6e0564085bf86e6ddaed734f6e"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugObjectConstructors.parse (cyclomatic 67): PlDebugObjectConstructors.parse has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugObjectConstructors.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac658cf03344c4fca68cff38c543d0cff2cb173b91bc13fa654d9f98076f7fdd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::split_oracle_table_ddl_with_retained (cyclomatic 66): dbx_sql_core::object_source_sql::oracle_indexes::split_oracle_table_ddl_with_retained has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"b418250e9f6af0aff2e7e1231ea71635faf148cfefdeab3260e5917088380176"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTableRename.prepareOracleTableRename (cyclomatic 66): oracleTableRename.prepareOracleTableRename has cyclomatic complexity 66 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 11 belong to 7 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"694ef8f8d9e7acf58cb1342e3133bd6146eae008398c08178aac2a1fd357cb62"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::render_postgres_table_ddl_with_constraints_and_partition_info (cyclomatic 65): dbx_core::schema::render_postgres_table_ddl_with_constraints_and_partition_info has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":18743}}}],"partialFingerprints":{"codehealthFindingId/v1":"610604cc4ef86e009882e75b767e77cb29b7a92267d1d2bb04a0827c78afc7cd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_ddl_indexes::capture_table_ddl_indexes (cyclomatic 65): dbx_core::schema::oracle_ddl_indexes::capture_table_ddl_indexes has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"2873c7744e1be2aae90d11fb2124a152db9489dffa0e760d2ec45116d6cc7712"}},{"ruleId":"D1","level":"warning","message":{"text":"oceanbaseTableClone.buildOceanbaseTableClone (cyclomatic 65): oceanbaseTableClone.buildOceanbaseTableClone has cyclomatic complexity 65 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 19 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseTableClone.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aaa5dcf78c77c837b8ef9cb915bcfc3c35c4306e1ed9b8d7abc006a7850f26"}},{"ruleId":"D1","level":"warning","message":{"text":"Plan.render (cyclomatic 64): Plan.render has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b004bae99ba9b03b7efd07d9dfad9ff99c61c5c6a86a352487b06ba29977711"}},{"ruleId":"D1","level":"warning","message":{"text":"useDatabaseTableEmpty.useDatabaseTableEmpty.requestDatabaseTables (cyclomatic 64): useDatabaseTableEmpty.useDatabaseTableEmpty.requestDatabaseTables has cyclomatic complexity 64 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 7 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDatabaseTableEmpty.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ed2272c34fc17951d348f469987cdad5cfaa38518b312c230e8fd1724a9bc3"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleConstraints.readOracleConstraintSnapshot (cyclomatic 64): oracleConstraints.readOracleConstraintSnapshot has cyclomatic complexity 64 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 11 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa6d9c974cc21695f02419955d4cfadca39f4f030e564d05eda2b4bea9ec9ab"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugComposite.compositeInputComplete (cyclomatic 64): plDebugComposite.compositeInputComplete has cyclomatic complexity 64 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 21 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/plDebugComposite.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f221d122d3eeb1618193d8baaf6e5a538d5c7708d9e80c661df71f0def38427"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineDeploy.validateOracleRoutineDeployment (cyclomatic 63): oracleRoutineDeploy.validateOracleRoutineDeployment has cyclomatic complexity 63 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caf52efc2cd6ad03b92c2db79b0d2a21e26612174591338fa49432c883f8cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"settingsTransfer.parseSettingsTransferFile (cyclomatic 63): settingsTransfer.parseSettingsTransferFile has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cc7ba98af20cbab67c13d9e5bec093de067537124819886aabb4d4f03474a3"}},{"ruleId":"D1","level":"warning","message":{"text":"oraclePackageSource.rewriteOraclePackageSource (cyclomatic 63): oraclePackageSource.rewriteOraclePackageSource has cyclomatic complexity 63 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSource.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88a4a7992153d21474c6c8bf58f4c793f1872847d9bfc71063c741c78650c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeRoutineHeaderMode (cyclomatic 62): main.plDebugNativeRoutineHeaderMode has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"506890d354e538810c98b1e976440d5b0eb78667699fc2af255b3c41b90711e3"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorDiagnostics.useQueryEditorDiagnostics.refreshSemanticDiagnostics (cyclomatic 62): useQueryEditorDiagnostics.useQueryEditorDiagnostics.refreshSemanticDiagnostics has cyclomatic complexity 62 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5de04a2fe3fd92e64510b2f9c2c855409fc98558c180ca00830e18b97bc3eb"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.buildLocalSqlCompletionResult (cyclomatic 62): useQueryEditorCompletion.useQueryEditorCompletion.buildLocalSqlCompletionResult has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c0b7ab80b1efd3c9a22db61c97dc2999876ffe7127da331c859b77bef9dfe4"}},{"ruleId":"D1","level":"warning","message":{"text":"useQuickOpen.useQuickOpen.processDatabaseTreeNodes (cyclomatic 62): useQuickOpen.useQuickOpen.processDatabaseTreeNodes has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c96adb44cf150b25cbde6e871675aecc00943c06f555a371af1ec716ecc5773"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionUrlBuilder.buildSpecialJdbcUrl (cyclomatic 62): connectionUrlBuilder.buildSpecialJdbcUrl has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12eb90a137d0c8fe3ba1fba2a2c723e463f24104defc6123ec0e187d3cfc8df"}},{"ruleId":"D1","level":"warning","message":{"text":"graphCompletion.getGraphCompletionContext (cyclomatic 62): graphCompletion.getGraphCompletionContext has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletion.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbb2dce0c26c068602efdc22fb786b51f1091799ff088a29c5a213d3e7d6fae"}},{"ruleId":"D1","level":"warning","message":{"text":"tableImport.importDataTypeForDatabase (cyclomatic 62): tableImport.importDataTypeForDatabase has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableImport.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6708ae9ce9d4a25977dc73d4a42027833780b09853bba4ea2c8f7584b5151e25"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::remove_stale_connection_pool (cyclomatic 61): AppState::remove_stale_connection_pool has cyclomatic complexity 61 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":5555}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bce0065f71241ab0610f17304a66b41aad9945b5098dcd278606604ef34be9"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer_runner::run_transfer (cyclomatic 61): dbx_core::data::transfer_runner::run_transfer has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f73148e5ba273972a2ad0bfd5d4afd1df4ba62aca77a938c4c1d38f266edc46"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::format_grid_sql_literal_with_spatial (cyclomatic 61): dbx_sql_data::data_grid_sql::format_grid_sql_literal_with_spatial has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2899}}}],"partialFingerprints":{"codehealthFindingId/v1":"197184554b9dbc20115183aa2730a32d9b3f50b9871edaa3f3e93f716917a386"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::run (cyclomatic 61): dbx::run has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lib.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b72393018446203924a54c75aeebdeb1184e3a53343e48da55d2fc98ea1565"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridCopyExtractor.normalizeDataGridExtractorOptions (cyclomatic 61): dataGridCopyExtractor.normalizeDataGridExtractorOptions has cyclomatic complexity 61 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6ecfa59094f3adc34e2ea4eeef2ae4adcb784417c111d6efe3e17855397d44"}},{"ruleId":"D1","level":"warning","message":{"text":"tableTree.buildGroupedObjectTreeNodes (cyclomatic 61): tableTree.buildGroupedObjectTreeNodes has cyclomatic complexity 61 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 38 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":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d41fbb5487cbc250083eb080be25c7d3319fa963d8a19da68e66fa815e25b47"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTarget.resolve (cyclomatic 60): PlDebugTarget.resolve has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"5122eaa0a19aa6bb24fcc637279c4cc50e4c57064254dc56c38a23a0edf56534"}},{"ruleId":"D1","level":"warning","message":{"text":"doltVersionControl.layoutDoltCommitGraph (cyclomatic 60): doltVersionControl.layoutDoltCommitGraph has cyclomatic complexity 60 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 21 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dolt/doltVersionControl.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f5ea2bcf8ae81e079c96b94783e0e153b96a0bc83c99f2fd7cdaaeaf8df558"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaDiff.convertToSchemaDiffObjects (cyclomatic 60): schemaDiff.convertToSchemaDiffObjects has cyclomatic complexity 60 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 11 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"c471efc2509ceafe70d9038f2e6d6e1b51ffe2913d8ee11fc978da1b103bf9b0"}},{"ruleId":"D1","level":"warning","message":{"text":"mysqlRoutineVariables.collectMysqlRoutineVariables (cyclomatic 60): mysqlRoutineVariables.collectMysqlRoutineVariables has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/mysqlRoutineVariables.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9ab74add60cf5973e0444675f1a38ed85dd7801f13d7ed105ae8907d0a1264"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTableRename.executeOracleTableRename (cyclomatic 60): oracleTableRename.executeOracleTableRename has cyclomatic complexity 60 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f805853b5a30add455b8686949766cd1290d23a31deaf70501ef2d3605795d"}},{"ruleId":"D1","level":"warning","message":{"text":"server.createMockHost.server (cyclomatic 60): server.createMockHost.server has cyclomatic complexity 60 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 20 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17a6ca72a740c2f22bd871195b5db2f5af859452505b1d897755dcbdb4938ed"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::dameng::run_steps (cyclomatic 59): dbx_core::schema::native_jobs::operations::dameng::run_steps has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"6490bcb77237aa74ec3696d43399e20a966c271ca53f1272e5e4d557c087b29d"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.handle (cyclomatic 59): DbxJdbcPlugin.handle has cyclomatic complexity 59 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c42ad2870a4524919f601b4b6d4cf5b861c95405058dc559157e05b522c6d54"}},{"ruleId":"D1","level":"warning","message":{"text":"server.dispatch (cyclomatic 59): server.dispatch has cyclomatic complexity 59 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12cad0d20a96adcdb7bab048eff2d6b04e2eed0ff197308765568861c780e37"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.invalidateCompletionCache (cyclomatic 59): connectionStore.useConnectionStore.invalidateCompletionCache has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4817}}}],"partialFingerprints":{"codehealthFindingId/v1":"1087bccd6490f82930062a6f94772323f463c59a3bc3bbbe167a7ad7924f5a34"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_jobs::references::native_job_reference_queries (cyclomatic 58): dbx_sql_schema::native_jobs::references::native_job_reference_queries has cyclomatic complexity 58 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_jobs/references.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5285b2aaf3538cdfdb725aa6a1b1dd83420f37f819f0b359969742d812793a5"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.inspectNativeCurrentProgram (cyclomatic 58): plDebugNativeEntry.inspectNativeCurrentProgram has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_entry.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb635327cd4074960a3ca70c8b3be3c4c47cf156225cf31e559bbcfac4dfc74"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridLargeValues.useDataGridLargeValues.hydrateVisibleLargeValuePreviews (cyclomatic 58): useDataGridLargeValues.useDataGridLargeValues.hydrateVisibleLargeValuePreviews has cyclomatic complexity 58 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"2678a7fa72e5c4bed89cf50958a6055454700a7a40173c8c7a4bf595d1760b18"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionUrl.parseConnectionUrl (cyclomatic 58): connectionUrl.parseConnectionUrl has cyclomatic complexity 58 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"a383112170f2a988da1b57bd80aac83b442249341027f0a2e28d0bf468f0bdde"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::list_objects_once (cyclomatic 57): dbx_core::schema::list_objects_once has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8934}}}],"partialFingerprints":{"codehealthFindingId/v1":"67399d254f4e82a64911688cb44f91b50a0615748a99125543d50b24ef2bdb69"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::execute_query (cyclomatic 57): DbxMcpServer::execute_query has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67b4774309397da4580f7349eb893386a7698d0041b1bb02c5e9e7b01f40981"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::rebase_oracle_table_ddl (cyclomatic 57): dbx_sql_core::object_source_sql::oracle_indexes::rebase_oracle_table_ddl has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a83b577ab70835f0e5085f03968371ef4c6cfc43f808be7b11701a5f3046e2f"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.start (cyclomatic 57): plDebugNativeEntry.start has cyclomatic complexity 57 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fad1529eaeebce4b8291d5e8616badbeb98138640b55e61b0a03102a704470"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGenerate.generateValue (cyclomatic 57): dataGenerate.generateValue has cyclomatic complexity 57 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6dd5f1be109751c89703ab3eaaaccc294225970d66aed33ff930381c6b3922"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleForeignKeys.readOracleForeignKeyReferenceSnapshot (cyclomatic 57): oracleForeignKeys.readOracleForeignKeyReferenceSnapshot has cyclomatic complexity 57 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"a604d0a885a73afa3a4a2e495d02e5806e63b196060c33036a36875fe323c76f"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTypeManagement.executeOracleTypeManagement (cyclomatic 57): oracleTypeManagement.executeOracleTypeManagement has cyclomatic complexity 57 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cb89f6bce064b2a89b3ae8f2a9045a7c157fabc84e598d4d05e0df93851c49"}},{"ruleId":"D1","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportTableData (cyclomatic 56): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportTableData has cyclomatic complexity 56 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 21 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"4938058cbd766584515892ab983bc8213f6948cf1deede396d394b4bdb359f57"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadDatabases (cyclomatic 56): connectionStore.useConnectionStore.loadDatabases has cyclomatic complexity 56 (threshold 15). Most of this is not in the body itself: 6 of the 56 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 6399, 6541). 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6373}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c965159449f89463f9c0f78e68783c10b520802718e298f1699bf31bf0d3ade"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadAllObjectGroupChildren (cyclomatic 56): connectionStore.useConnectionStore.loadAllObjectGroupChildren has cyclomatic complexity 56 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5b9df04103a490df76ac8366422cb976b1798fc1cba7050eb35ed2f8908612"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.publishSnapshot (cyclomatic 56): plDebugStore.usePlDebugStore.publishSnapshot has cyclomatic complexity 56 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8779228c8e5693f3b64ad8141253eccd8540f92fa6b21026bd5e78860f7e232d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::ai::agent_loop::run_agent_loop_inner (cyclomatic 55): dbx_core::ai::agent_loop::run_agent_loop_inner has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_loop.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b40cc648feca97e80ac4b9a228f2ac50ce4c5329e78ddf71c13132f2ca102a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::get_columns_core_for_session_inner_with_pool (cyclomatic 55): dbx_core::schema::get_columns_core_for_session_inner_with_pool has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":9821}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7493e6302e9ca7f8434120978558549e37868712e94f51e763c56eb75cef2b7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::run_claimed (cyclomatic 55): dbx_core::schema::native_jobs::operations::run_claimed has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0682b8dafe886f426ada5372b78ebe80e8e7705be1f8c34940e91ed4000044e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::scheduler::transition::run (cyclomatic 55): dbx_core::schema::native_jobs::operations::scheduler::transition::run has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5a1d5c9f7c17a3ae1977a558fbe0d736e4bbd229138aa9b9cb3a38966f470e"}},{"ruleId":"D1","level":"warning","message":{"text":"server.dispatch (cyclomatic 55): server.dispatch has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c00df7481a79177c1050a725ff7b14d142560f18ed22f45ecb229601be8629"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.diagnoseMongoCommand (cyclomatic 55): mongoShellCommand.diagnoseMongoCommand has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2983ad483b702144abe566e0ce050aab055cc17c5c53b56cd14a11c572d846"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.extractSelectList (cyclomatic 55): sqlCompletion.extractSelectList has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4438}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf1c91e7d6166412e37b6313ad5c4c3c9d09ea14e671def07ebae47dbb666a9"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTriggerStructurePlan.prepareOracleTriggerStructurePlan (cyclomatic 54): oracleTriggerStructurePlan.prepareOracleTriggerStructurePlan has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerStructurePlan.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"062cc74a7dbd9c73f158ff2b8de972d884ae5bb44115a4793b3039a2992ff5d9"}},{"ruleId":"D1","level":"warning","message":{"text":"installBridge (cyclomatic 54): installBridge has cyclomatic complexity 54 (threshold 15). Most of this is not in the body itself: 1 of the 54 points is its own statement and the rest belongs to 53 function items inside it that branch (a function literal at line 171, stream::start::onEvent, applyTheme, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/browser-bridge.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5d2d664a4ec96ba96f65f7992d5b41d3e28f6a3640d9e0afcea42b94ecac3a"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugRecordDecoder.object (cyclomatic 53): plDebugRecordDecoder.object has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_object_input.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"891eafb4009404561ddc677809c519972e82adc3048a90cfa1ba4d1be9d0aeaf"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.topLevelSoftStatementLineStarts (cyclomatic 53): sqlStatementRanges.topLevelSoftStatementLineStarts has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"602156a1387e4a1dee043be270fea2ddbb218b1002d4cb32b214df7e5668736c"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.preparePastedRows (cyclomatic 53): useDataGridEditor.useDataGridEditor.preparePastedRows has cyclomatic complexity 53 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"b078dca0ba54b86364ec511a8e9ef05820a56fa22edb9cb34af157a4bed58ea1"}},{"ruleId":"D1","level":"warning","message":{"text":"aliasHighlights.sqlAliasHighlightGroups (cyclomatic 53): aliasHighlights.sqlAliasHighlightGroups has cyclomatic complexity 53 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/aliasHighlights.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d92baea3d33e336e4268e4695bebec300102d194d0346fe5a9a2307eeb3047"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlDatabaseLinks.collectSqlDatabaseLinkStarts (cyclomatic 53): sqlDatabaseLinks.collectSqlDatabaseLinkStarts has cyclomatic complexity 53 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDatabaseLinks.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46df95ad53b6361d0637d0031af1071939dd38deda0c28e600f86cb170ce4af"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTarget.scalarInput (cyclomatic 52): PlDebugTarget.scalarInput has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a153fbdc2d9d7d4c23994c0d96d3fed4f13cdf850e33e4944bb6dab5871c10d"}},{"ruleId":"D1","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.submitTableExports (cyclomatic 52): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.submitTableExports has cyclomatic complexity 52 (threshold 15). Most of this is not in the body itself: 6 of the 52 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 720, 744, 738, \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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"f883fd2b93cb3748bae663801fd6993b4941f258b464cea5cadf340f38531c3b"}},{"ruleId":"D1","level":"warning","message":{"text":"tableSelectSql.qualifiedTableName (cyclomatic 52): tableSelectSql.qualifiedTableName has cyclomatic complexity 52 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b120ef62bd32d0ef91c487a52b5910a1f080f9c527c17daa33b7d5da13a2562"}},{"ruleId":"D1","level":"warning","message":{"text":"Storage::inspect_data_migration_with_error_cache (cyclomatic 51): Storage::inspect_data_migration_with_error_cache has cyclomatic complexity 51 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37be6fd4faaeb853db7b4addaaa29502120e98c3e57ea9f8724d1bce6b147ce"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::persistence::cloud_sync::apply_sync_snapshot_with_selection (cyclomatic 51): dbx_core::persistence::cloud_sync::apply_sync_snapshot_with_selection has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"480f79a74477efdb30280a10d329b4a197a53c57002498aefff8ff7c225e4503"}},{"ruleId":"D1","level":"warning","message":{"text":"Loader.load (cyclomatic 51): Loader.load has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTypeGraph.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa484b75569df0b8d5015072c92ea4161dd1eb9d02118cedbef38f57bb9aa114"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.resolveNativeNamedSources (cyclomatic 51): plDebugNativeEntry.resolveNativeNamedSources has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_source.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb06fdc792e0c1465a9cd1058567553f8f6a3c97fff05b905097a0a60da8e4f"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.scheduleCompletionMetadataRefresh (cyclomatic 51): useQueryEditorCompletion.useQueryEditorCompletion.scheduleCompletionMetadataRefresh has cyclomatic complexity 51 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 11 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c1be7e585493e162e2f1a16c991c1976dacb0f89241f037db5cb55bd0d817d"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridActions.useDataGridActions.onPaginate (cyclomatic 51): useDataGridActions.useDataGridActions.onPaginate has cyclomatic complexity 51 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"3574342e712ec818fc5b112d706eb1c461be656e09645b90f0483f5a8d6dd032"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.ensureConnected (cyclomatic 51): connectionStore.useConnectionStore.ensureConnected has cyclomatic complexity 51 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 18 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5992}}}],"partialFingerprints":{"codehealthFindingId/v1":"b888114d51fba3de86690e68739527fdd9c4e31b74bfa9c46d57fecd55974f32"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.prepareEditableQueryExecution (cyclomatic 51): queryStore.useQueryStore.prepareEditableQueryExecution has cyclomatic complexity 51 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7739}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a591eadf87e696576139e0c8ac0ee0393af540fc402c18f6e7e2b6d37c56a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_duckdb_driver::query::duckdb_logical_type_to_string (cyclomatic 50): dbx_duckdb_driver::query::duckdb_logical_type_to_string has cyclomatic complexity 50 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/query.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b21750ecd4be59c73396814e8d1141c69d40bc6e42e14cae8ef7ad63bc96e8"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::execute_batch_request (cyclomatic 50): DbxMcpServer::execute_batch_request has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d88b1e6b7b8f8ecbd021537208859c6d60e99b685319b3ff7d23a767831c23b"}},{"ruleId":"D1","level":"warning","message":{"text":"StarRocksAlter::build (cyclomatic 50): StarRocksAlter::build has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/alter_dialect.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb74119ce39bc24244241b0793f8dbefa7a71b4d54ccd5ba09ad679a755085c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::generate_create_table_sql (cyclomatic 50): dbx_sql_schema::schema_diff::generate_create_table_sql has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5877}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59c71a921bf55eef6443cfb1bf29bc7dae4022c873f6d9247dbe1156e6a8146"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeCallMatches (cyclomatic 50): main.plDebugNativeCallMatches has cyclomatic complexity 50 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 6 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":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a4dc6f9b47f91d211c20033c7ad676234673b7d6f5e302a096628879e8846c"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTriggerPlan.prepareOracleTriggerPlan (cyclomatic 50): oracleTriggerPlan.prepareOracleTriggerPlan has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1715d3477bff69d5ed3ededbcea54e00875f397b57650b9a4a7a6f754954cf48"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarActiveTabTarget.activeTabSidebarTarget (cyclomatic 50): sidebarActiveTabTarget.activeTabSidebarTarget has cyclomatic complexity 50 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a4fd21304af61956524e9069b9d8b83f9c322960f9c9c7c02184bc59ad2046"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_alter::build_single_column_alter_sql (cyclomatic 49): dbx_sql_schema::table_structure_sql::column_alter::build_single_column_alter_sql has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3adaf878dfa979a8ac37ccccc72c5c96eb3ff1c34738e8e2f8f7fcad4bba13"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.executeStatement (cyclomatic 49): plDebugNativeEntry.executeStatement has cyclomatic complexity 49 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 21 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_execute.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b257091720f5cc6bee12856ba00c78d488942ff514ba6fcfb97ee367dfa94dc"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.readNativeValues (cyclomatic 49): plDebugNativeEntry.readNativeValues has cyclomatic complexity 49 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 11 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":"agents/drivers/oracle-go/pldebug_frame_value.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f67f38c9007fd2999a861ddda3e2e80398fd2753802837d135c7a5f5f73a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"main.ordinaryProxyMessage (cyclomatic 49): main.ordinaryProxyMessage has cyclomatic complexity 49 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/proxy.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca46de00190dda29c1be30b0da745fcff5cdfcd98a46f025a91a7b783c794e8"}},{"ruleId":"D1","level":"warning","message":{"text":"cellValueTransform.transformCellValue (cyclomatic 49): cellValueTransform.transformCellValue has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellValueTransform.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cdcc52eea82eadb8111151c0bfbf48f69a599a4c162290a30726f9e059ef33"}},{"ruleId":"D1","level":"warning","message":{"text":"mysqlGeneratePartitions.constrainMysqlGenerateColumns (cyclomatic 49): mysqlGeneratePartitions.constrainMysqlGenerateColumns has cyclomatic complexity 49 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/mysqlGeneratePartitions.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67251d196c4077ab487d682dec1f410c538ece1473f48f0312e6ab34e5da40e"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.scanMongoCallArguments (cyclomatic 49): mongoCompletion.scanMongoCallArguments has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"79151f2c08ffb80be80d5fa586b91c5a979a18e0df812ecc70ae6fdbc9f4f52c"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaDiff.injectColumnRenameSql (cyclomatic 49): schemaDiff.injectColumnRenameSql has cyclomatic complexity 49 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"7186c036499a61e157b6b1629155ed51ef3f2d8ce27b664b27f207bf81a8522b"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarTableNameCopy.qualifiedNameForSidebarNode (cyclomatic 49): sidebarTableNameCopy.qualifiedNameForSidebarNode has cyclomatic complexity 49 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTableNameCopy.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44a62aad46fb9de3052844355c2b091f55d7dfd85f4caa2fe13a9b0443675be"}},{"ruleId":"D1","level":"warning","message":{"text":"tableColumnDefinitionPaste.parseTableColumnDefinitions (cyclomatic 49): tableColumnDefinitionPaste.parseTableColumnDefinitions has cyclomatic complexity 49 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"19df2ced6c91a14e3073b092d8446cade0b82251df2a610a08a33d16cd599c3b"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 49): main has cyclomatic complexity 49 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c001ae1c458da9b21dfd331f9902c1122f58fc43774f1a3b9aa83baae30a786d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::pl_debug::pl_debug_operate_submission_core (cyclomatic 48): dbx_core::query::pl_debug::pl_debug_operate_submission_core has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acef8b236ab103824a699f3cbf237e7f5e837d68dec321148ed9e0f55ec3392"}},{"ruleId":"D1","level":"warning","message":{"text":"main.applyHiveParameters (cyclomatic 48): main.applyHiveParameters has cyclomatic complexity 48 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fb5ea632422079368ac24b891f75030081fc607b9f89fbf1eb74cfd894aedc"}},{"ruleId":"D1","level":"warning","message":{"text":"main.applyHiveParameters (cyclomatic 48): main.applyHiveParameters has cyclomatic complexity 48 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e813832bd2a77a83b27ea8efc1a723d27491f2b072f84b1956adf0519f3e50"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.nativeVariableNames (cyclomatic 48): plDebugNativeEntry.nativeVariableNames has cyclomatic complexity 48 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_variables.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8e9acf3e7adbaf1d75213a08445f2922bd6d3491d84c27e0d44cd05eff3095"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.splitStatementRangeAtSoftStarts (cyclomatic 48): sqlStatementRanges.splitStatementRangeAtSoftStarts has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a4d64e840d6440de40c851c16d17ec0fec6ebf3fbde9aea39dffe441964889"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.oraclePlSqlBlockEnd (cyclomatic 48): sqlStatementRanges.oraclePlSqlBlockEnd has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac7e57083d4f2405810a6e4612746181f2fd256be3602c63043b3140540a533"}},{"ruleId":"D1","level":"warning","message":{"text":"redisKeyTree.buildRedisKeySnapshotCooperatively (cyclomatic 48): redisKeyTree.buildRedisKeySnapshotCooperatively has cyclomatic complexity 48 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyTree.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c1f227821b80e649192c545ffb44e24af3941263fef8c822bebc1421225982"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::plan::recovery::package_recovery::prepare_package_recovery (cyclomatic 47): dbx_core::schema::oracle_routines::plan::recovery::package_recovery::prepare_package_recovery has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan/recovery/package_recovery.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d53f88e345def12c0ba8e9b1f20b4b80ff82224140a872bbac3e517209329fd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::indexes::build_create_index_statements (cyclomatic 47): dbx_sql_schema::table_structure_sql::indexes::build_create_index_statements has cyclomatic complexity 47 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/indexes.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30259f1d893e93beb385c344cb12db77073eea67006e91962a871d809736d17"}},{"ruleId":"D1","level":"warning","message":{"text":"server.plDebugProbeOnConnection (cyclomatic 47): server.plDebugProbeOnConnection has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_probe.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6be4575737c38666c063d1ced1206a67231a546f77d48ee88ad08aeaaa8e07"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.writeValue (cyclomatic 47): plDebugNativeEntry.writeValue has cyclomatic complexity 47 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 12 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_frame_write.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6311d9952b998e3084fb18e53094419f6d68225f84c48d21631855f56f169f89"}},{"ruleId":"D1","level":"warning","message":{"text":"triggerToggleSql.buildTriggerToggleSql (cyclomatic 47): triggerToggleSql.buildTriggerToggleSql has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/triggerToggleSql.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c897ca7e9e4b07c5762080db5985341562c38339335f76b5001368ca6eb7fe"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.buildObjectItems (cyclomatic 47): sqlCompletion.buildObjectItems has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 7 of the 47 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5341, 5335). 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5319}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf10585a5f7abed396fe27d690cf46c9f873ec3123491d67b60c885d369d46c7"}},{"ruleId":"D1","level":"warning","message":{"text":"settingsStore.normalizeMcpGlobalPolicy (cyclomatic 47): settingsStore.normalizeMcpGlobalPolicy has cyclomatic complexity 47 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 29 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"760841d95105a976076e5be5c35c5ea06c1e9adc1d4b5dfffac19288612499f9"}},{"ruleId":"D1","level":"warning","message":{"text":"BackupService::export_job (cyclomatic 46): BackupService::export_job has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/engine.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba0fe1b5b1af4faf856439c7ae2d0e2c0337aab35ab8a8be8d066576ad6b948"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::starrocks_layout::build (cyclomatic 46): dbx_sql_schema::table_structure_sql::starrocks_layout::build has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/starrocks_layout.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"903ace6d5068aec0bc213b45ff1a401b1c38973b0c1691287d339be9a1f9549e"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugSession.mutateBreakpoint (cyclomatic 46): PlDebugSession.mutateBreakpoint has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"660f65f64d253003ad9694acd16aae9c64d998cde002af7520fbc0199f54ac43"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportFullTableDataViaBackend (cyclomatic 46): useDataGridExport.useDataGridExport.exportFullTableDataViaBackend has cyclomatic complexity 46 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1864b3e210798dabf6c150e03be2e9a6fff1e6e0f8ba7f434080418af4044dff"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaDiff.setSchemaDiffObjectSelectedWithDependencies::apply (cyclomatic 46): schemaDiff.setSchemaDiffObjectSelectedWithDependencies::apply has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3388f24fd7c956df3bfcce9b2e000fd147a16b9c0f4592ae64da293491f1f2"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.exportQuerySqlDirect (cyclomatic 46): queryStore.useQueryStore.exportQuerySqlDirect has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 11 of the 46 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 11998, assertQueuedSourceAvailable, startExport, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11920}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f0d3c6d053c5dae418bf6f9208456b2d6eb4f5c9f3e706d118b316fd6b8d74"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::escape_value_typed (cyclomatic 45): dbx_core::data::transfer::escape_value_typed has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":3956}}}],"partialFingerprints":{"codehealthFindingId/v1":"006153ec1106d8768a16bbdaeb8d7d6a9e8e98a0fb87c85b4c63e51137586864"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::validate_oracle_object_source (cyclomatic 45): dbx_sql_core::object_source_sql::validate_oracle_object_source has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e854ea629afd5558f33049978ff6e2192d1292f06159d968002e57e30a1b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_dialect::sql_dialect::table_select::build_table_data_select_sql_with_database (cyclomatic 45): dbx_sql_dialect::sql_dialect::table_select::build_table_data_select_sql_with_database has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e547f56718dd9c1bb76006897114262cebb7aeccec1ff5d729f37801dd67201b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::creation::native_job_scheduler_create_plan (cyclomatic 45): dbx_sql_schema::native_job_changes::creation::native_job_scheduler_create_plan has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/creation.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3ecad2a43d20aa76ed021f7be5bf7f0479fc225f2e8e49c441b73ee2af1019"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugCompositeInput.child (cyclomatic 45): PlDebugCompositeInput.child has cyclomatic complexity 45 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"45329f932b51a38067bf548774b0d39ba8f5596df6b67e51e7a9413f6e1c0a54"}},{"ruleId":"D1","level":"warning","message":{"text":"main.applyJavaDriverHOCON (cyclomatic 45): main.applyJavaDriverHOCON has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config_file.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"966994c90875dc0b7407c4e5f808cb00e4b3f156ed02e8b661dfbe594caa34fd"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.cleanup (cyclomatic 45): plDebugNativeEntry.cleanup has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1e1d29f76d6e358d6adc0ffc4e5eaf446b17e183eeae4f001b96fe6671759d"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExtractor.useDataGridExtractor.canCopyWithExtractor (cyclomatic 45): useDataGridExtractor.useDataGridExtractor.canCopyWithExtractor has cyclomatic complexity 45 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3bcddc891629d9fdc73bbbbb2a97d581d58f5c11f48bbfd89b9ed174a5cd24"}},{"ruleId":"D1","level":"warning","message":{"text":"graphCompletionScope.graphCompletionScope (cyclomatic 45): graphCompletionScope.graphCompletionScope has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletionScope.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf71b5977eef0a11e588718f6660487aaa13b94dda1ea1d3a10777bb4b0ef8b3"}},{"ruleId":"D1","level":"warning","message":{"text":"redisCommandPreview.quoteRedisBytes (cyclomatic 45): redisCommandPreview.quoteRedisBytes has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ade4c9d122a57b0a7ca31e417c06f7b2365721066f433137cf98d7a5f6ad40"}},{"ruleId":"D1","level":"warning","message":{"text":"RedisKeyGroupIndex.project (cyclomatic 45): RedisKeyGroupIndex.project has cyclomatic complexity 45 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 18 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyGroupIndex.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43cbb003edbea490823670ba6ba3d90d313ba551a399b9d583cbd883cbee9ea"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlVariables.readValueEnd (cyclomatic 45): sqlVariables.readValueEnd has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92e1bbac252a70675876979b6b8402d9548f50f15110e10e1db8055b10e7a9f"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.listCompletionObjects (cyclomatic 45): connectionStore.useConnectionStore.listCompletionObjects has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 14 of the 45 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 10582, 10541). 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10515}}}],"partialFingerprints":{"codehealthFindingId/v1":"51db48c5cecaf01607459ef41bb719baeb1b26a7302712475ce601d10dedc3a8"}},{"ruleId":"D1","level":"warning","message":{"text":"McpAccessPolicy::to_v1 (cyclomatic 44): McpAccessPolicy::to_v1 has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/mcp_access.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"523381518c6376c0abc7524d169e63666c2c56a013accf4acf30f7f7db0008f0"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugObjectConstructors.tokens (cyclomatic 44): PlDebugObjectConstructors.tokens has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugObjectConstructors.java"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b3fb657a32593b457f20343a6c11c302df03591701e8b3e6e36be72cc0b444"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugCompositeOutputTypes (cyclomatic 44): main.plDebugCompositeOutputTypes has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_record_output.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"449af2a301cbe1db99a56aca7cb91e38d736aeaedc1c42d1ecf082c0896a1856"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.topLevelWordsInRange (cyclomatic 44): sqlStatementRanges.topLevelWordsInRange has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"52341a1ebb3be1282ffc69e18ad8f81c3a2412f5ea587f062129058a76101521"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoFormatter.formatMongoShellText (cyclomatic 44): mongoFormatter.formatMongoShellText has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoFormatter.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"44235ba36770bab26a4936382bb295e26befce0f8169fb62bd8cdda6a8385de4"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.mongoTopLevelCommandLineStarts (cyclomatic 44): mongoShellCommand.mongoTopLevelCommandLineStarts has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cd871452c8791f27ce1329d8857b7f053ee62d31932c534ea52c9cad8a1529"}},{"ruleId":"D1","level":"warning","message":{"text":"frontendPlugin.buildPluginConnectionConfig (cyclomatic 44): frontendPlugin.buildPluginConnectionConfig has cyclomatic complexity 44 (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":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4904dd111ca0345d15d22fcf67abcc0120d83004a0d0f56edbff491bdecc6e5a"}},{"ruleId":"D1","level":"warning","message":{"text":"model.buildCursorIntent (cyclomatic 44): model.buildCursorIntent has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e7f7655ff0322ee5a9e3ef4494f6c3301aa3f14cb5906235754ecc1ddcc507"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.getSqlLexicalContext (cyclomatic 44): sqlCompletion.getSqlLexicalContext has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7b930303d07f277b33eeaa5d2f98ff0855139d0cd635f8efe027a11ab1499f"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTypeManagement.restoreOracleTypeManagementDraft (cyclomatic 44): oracleTypeManagement.restoreOracleTypeManagementDraft has cyclomatic complexity 44 (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":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"337ba1a9f6ca3db2eda49c8c249a417bf237e301447ddd998c7ec4f5e6ceef98"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.resolveEditableSourceMetadataTarget (cyclomatic 44): queryStore.useQueryStore.resolveEditableSourceMetadataTarget has cyclomatic complexity 44 (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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51df19192388a0e4528f7fd9f00878f998319e329684001e8612c055ff1d76c"}},{"ruleId":"D1","level":"warning","message":{"text":"IssueSubmissionClient.IssueSubmissionClient (cyclomatic 44): IssueSubmissionClient.IssueSubmissionClient has cyclomatic complexity 44 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 28 belong to 11 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/issues/IssueSubmissionClient.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fac907fb6806d9ed6c820127e02fdcfa96c028b3151f754922d81037c0c535"}},{"ruleId":"D1","level":"warning","message":{"text":"server.createMockHost.api (cyclomatic 44): server.createMockHost.api has cyclomatic complexity 44 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 28 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4c956a3dfbf65026486795e4bcbb6ea252fe542fa37b2487793ff075f3de55"}},{"ruleId":"D1","level":"warning","message":{"text":"createMockHost.api (cyclomatic 44): createMockHost.api has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 15 of the 44 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 392, 381, 446, \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":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eba05ac3b0b33a1aa506c4e273222eba6f956a5d219277049d97824759fd520"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::query_result_export::try_export_mysql_query_result_stream (cyclomatic 43): dbx_core::data::query_result_export::try_export_mysql_query_result_stream has cyclomatic complexity 43 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"07111173a0985f07aeebfb27e16642741b16e4977a3484eb35857401cb73626c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::generate_create_table_ddl_with_source_profile (cyclomatic 43): dbx_core::data::transfer::generate_create_table_ddl_with_source_profile has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d90e842be2dea36f4203de29345b5097330fc0f4a46db54ed8f8881c71785c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_type_evolution::table_guard (cyclomatic 43): dbx_core::schema::oracle_type_evolution::table_guard has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_evolution.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0751a41cc5d8c8d2923a1247ec1a72487c2a7d36c10ad219fb6aba9fcadae8e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::rewrite_oracle_routine_references (cyclomatic 43): dbx_sql_core::object_source_sql::rewrite_oracle_routine_references has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e646b9fd1727f88b36225dd9d26c1277ed0f8de29aaf77768ca9380977b50856"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::oracle_default_sequence_owner_edits (cyclomatic 43): dbx_sql_core::object_source_sql::oracle_indexes::oracle_default_sequence_owner_edits has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab0d7cb4d4fac3e9c37186c67b376fa1c59cfe5c06b0315a4c79dfc92042c93"}},{"ruleId":"D1","level":"warning","message":{"text":"main.readThriftValue (cyclomatic 43): main.readThriftValue has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/thrift_binary.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"15264277459dd6826282269c6adccb109e8a19d5236316cc7e261121612976d2"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoSql.tokenize (cyclomatic 43): mongoSql.tokenize has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3bbef520f7690e36a84bffd15dae11c2f1eb720b36d8b080a9aab89a823d46"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarSearchTree.filterSidebarTreeWithMatcher (cyclomatic 43): sidebarSearchTree.filterSidebarTreeWithMatcher has cyclomatic complexity 43 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccd0629b706321762fb8b290b2519ff038117545601c2a8ae9deeb0d6277b68"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.buildColumnItems (cyclomatic 43): sqlCompletion.buildColumnItems has cyclomatic complexity 43 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 14 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6141}}}],"partialFingerprints":{"codehealthFindingId/v1":"644064c29dd316c91b1594030e336f3c75b08d7ebe976867c781a73ffbd03f94"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineRename.verifyBeforeDrop (cyclomatic 43): oracleRoutineRename.verifyBeforeDrop has cyclomatic complexity 43 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb2a5a58f669595fb27ac86e08fdf950a5e5b72260cdd0597d0c6479417a54c"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.refreshDataTabInternal (cyclomatic 43): queryStore.useQueryStore.refreshDataTabInternal has cyclomatic complexity 43 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5930}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5b3545923f68a3fdfa2442dd6f2abb40ab5ba9c6897c8ab7430dc3f48209a2"}},{"ruleId":"D1","level":"warning","message":{"text":"TableRestoreFilter::classify (cyclomatic 42): TableRestoreFilter::classify has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import/table_restore.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed555e2676f2cb34c45c9bef628a32cf63fd8821f09dd6b653757953e78a3f7c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::parse_xlsx_preview_file_with_options (cyclomatic 42): dbx_core::data::table_import::parse_xlsx_preview_file_with_options has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3631}}}],"partialFingerprints":{"codehealthFindingId/v1":"99935c074f6a255081ee562438a6bd56332e68e2ccb05f751e4070f939767137"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::oracle_table_contract::types::from_ast (cyclomatic 42): dbx_core::data::transfer::oracle_table_contract::types::from_ast has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract/types.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d18586ec31a6cf98ebc0b9bacbb470f55d2f73d6ba8d42121f4da802fb2feb"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::execute_in_manual_transaction_with_options (cyclomatic 42): dbx_core::query::execute_in_manual_transaction_with_options has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":7085}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba78c606bee3667b401731a921de7db6059299805360e4467289c2990408d3f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::scheduler::transition::prepare (cyclomatic 42): dbx_core::schema::native_jobs::operations::scheduler::transition::prepare has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce8709f0e3344a260297d0626010dd03c0d6fa9310b08480a19d9f9b5760ba7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_type_details::read (cyclomatic 42): dbx_core::schema::oracle_type_details::read has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_details.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e068049672642da83ce73ded705774c030ce17b43d22687719549b68812452"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::build_query_pagination_execution_plan (cyclomatic 42): dbx_sql_data::query_result_sql::build_query_pagination_execution_plan has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"797b6f2ed00ba165b584233c6431795f41eb4a68596fe3ee36f1aa930893c872"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::build_sorted_query_sql (cyclomatic 42): dbx_sql_data::query_result_sql::build_sorted_query_sql has cyclomatic complexity 42 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb008d411eb6ac3dccd2099a375216f8a6c094f30ee5e83687a33c0887796f9f"}},{"ruleId":"D1","level":"warning","message":{"text":"DdlBuilder.buildTableDdl (cyclomatic 42): DdlBuilder.buildTableDdl has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fea9a7f1770d9f30be79d6badfa3acbc60c819dc018181f364a99956ccef73"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugSession.runDebuggeeTarget (cyclomatic 42): PlDebugSession.runDebuggeeTarget has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a9d8bef4cf1da205e3cee3cbb7af1cae817bf8c93a0c3d9ab180fab61ca986"}},{"ruleId":"D1","level":"warning","message":{"text":"server.dispatch (cyclomatic 42): server.dispatch has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0e353023c0923de3bcdffda2a69e8178d503646da796dcba19e10a4b09f634"}},{"ruleId":"D1","level":"warning","message":{"text":"documentStoreProvider.buildDocumentFilterCondition (cyclomatic 42): documentStoreProvider.buildDocumentFilterCondition has cyclomatic complexity 42 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6f0c4dbc54b0ea4e0c054495feb85e6b0668471db6b29de6c271e7c705df0f"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarMenuLayout.buildSidebarMenuLayout (cyclomatic 42): sidebarMenuLayout.buildSidebarMenuLayout has cyclomatic complexity 42 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarMenuLayout.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b8c3b2029c1d1404a800111fd573ee42b055c788bd04b35f74ccdbab0a9a2d"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.currentLineBlockEnd (cyclomatic 42): sqlCompletion.currentLineBlockEnd has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5f4d6deb85dc660145ba9bd9eab3d319f96082b543f848403fc39b6beef1a9"}},{"ruleId":"D1","level":"warning","message":{"text":"starrocksDdlDisplay.formatStarRocksDdlForDisplay (cyclomatic 42): starrocksDdlDisplay.formatStarRocksDdlForDisplay has cyclomatic complexity 42 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 15 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/starrocksDdlDisplay.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"230cbe35c10e7a164d6615e062cb84ef5cda7e7783e31159437561cf7a695279"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.buildQueryMetadataPatch (cyclomatic 42): queryStore.useQueryStore.buildQueryMetadataPatch has cyclomatic complexity 42 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7971}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f9e536fdb237461964667ad5389ae8ca7d2996c422cc60513fc566607fceba"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginDetailClient.PluginDetailClient (cyclomatic 42): PluginDetailClient.PluginDetailClient has cyclomatic complexity 42 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 20 belong to 10 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/plugins/[id]/PluginDetailClient.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb254a9a4b3d0f071e03cc2a6f7f3c07b0728015a7bdc747bef5d3e500a2a452"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::observation::compare (cyclomatic 41): dbx_core::schema::native_jobs::operations::observation::compare has cyclomatic complexity 41 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/observation.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b356a0bb421d4a3d24b3b5646cb907d4c40dbbddc0f9eea5126f26c7b863026a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::query_execution_sql::strip_sql_comments_and_literals_with_metadata (cyclomatic 41): dbx_sql_core::query_execution_sql::strip_sql_comments_and_literals_with_metadata has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6b25cd2838ab90dfd62564dc2a7ade49e32b0c4a0b443c57fdfc5e699e4346"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::build_data_grid_save_statements (cyclomatic 41): dbx_sql_data::data_grid_sql::build_data_grid_save_statements has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8670230975831ed318d46553399766a22a519bca59cc46f7e6244d34540d9de"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::native_job_mutation_plan (cyclomatic 41): dbx_sql_schema::native_job_changes::native_job_mutation_plan has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"60957d70e55e3d1867b8517bfc4e7ad35cec6ec6ca731b26d880ad764e7dbf39"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTemporalJson.temporal (cyclomatic 41): PlDebugTemporalJson.temporal has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTemporalJson.java"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec06e7a1b5c7af1834f17c410e5db760494d83e68bbaaaa18557a2f2a441c62"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugCollectionInitializer.collection (cyclomatic 41): plDebugCollectionInitializer.collection has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_collection_initialize.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"198bdc0ef90203638de90f3c4a97db5217c742432a680e78eb214ec6a1884aed"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativePlan.bind (cyclomatic 41): plDebugNativePlan.bind has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7dfbb0f5c6eef5096d3a6e6b55e0bf1db0605731fd629b64ce202e2aeee384"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseWKBGeometry (cyclomatic 41): main.parseWKBGeometry has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"58aecc003a22833490f77cce8e3aa869f01839b9e03e28151fc09aaa4a118226"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridActions.useDataGridActions.refreshDataTabTableMeta (cyclomatic 41): useDataGridActions.useDataGridActions.refreshDataTabTableMeta has cyclomatic complexity 41 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 18 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"302e1a652309200cd0b73ebe1380d2c4f0958990d9c217d34447514e29932005"}},{"ruleId":"D1","level":"warning","message":{"text":"ai.buildAiContext (cyclomatic 41): ai.buildAiContext has cyclomatic complexity 41 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3d09a2e6215d44d2063f2bc492ec277ff05f59ae8fa7757ad21b5391b1fc96"}},{"ruleId":"D1","level":"warning","message":{"text":"columnFormatter.normalizeColumnFormatter (cyclomatic 41): columnFormatter.normalizeColumnFormatter has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04d069a0315d7386cd24c10993938a02fe3ff7880fffc780f1683726c9b5dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridContextMenu.createDataGridColumnContextMenuItems (cyclomatic 41): dataGridContextMenu.createDataGridColumnContextMenuItems has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f179963ca40c4dd1597f971fb6e41517912c19d1621777ae012ff4288757832"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridPaintTheme.resolveDataGridPaintTheme (cyclomatic 41): dataGridPaintTheme.resolveDataGridPaintTheme has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridPaintTheme.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7460ba0eb4c5e108602bbf2e6709307dfa8ca9f19959c0cdcdbf1e37e5b4a4b"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleForeignKeys.parseOracleForeignKeyDdl (cyclomatic 41): oracleForeignKeys.parseOracleForeignKeyDdl has cyclomatic complexity 41 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 14 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2254f685faa4e58965ca16c9fc318b32e850bc55b3ed42a1ab72e7c0917adc2"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoSql.compileSelect (cyclomatic 41): mongoSql.compileSelect has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f67af738286f17bff310775f6a86ced7c43891e93d63898badf26f82c601002"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineDeploy.acceptOraclePackageTransferApproval (cyclomatic 41): oracleRoutineDeploy.acceptOraclePackageTransferApproval has cyclomatic complexity 41 (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":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb6bbd574d59aa4569a7826aa2d8181c5e05a9b8bc8bb8c0b8b64afd85c3827"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printRuleElement (cyclomatic 41): printer.printRuleElement has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c60d0f55947e524b2ba2d0555ad25acc6bc7e2a2024a88547b61ca5e658c2a7"}},{"ruleId":"D1","level":"warning","message":{"text":"completion.sqlCompletionContextFromSemantic (cyclomatic 41): completion.sqlCompletionContextFromSemantic has cyclomatic complexity 41 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae87870c704ccef4f525e6f89955211723b65b45063840da7df54a79a9dad53a"}},{"ruleId":"D1","level":"warning","message":{"text":"objectSourceTabSave.saveObjectSourceTab (cyclomatic 41): objectSourceTabSave.saveObjectSourceTab has cyclomatic complexity 41 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 14 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectSourceTabSave.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43c5ca6d9a1ab4c0bea29a5de79462ef3d3769557a872041ac1de3e4cd18c72"}},{"ruleId":"D1","level":"warning","message":{"text":"tableTree.buildSimpleObjectTreeNodes (cyclomatic 41): tableTree.buildSimpleObjectTreeNodes has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5602a3ec9c8dfa883e34812ca966c12310882f54fa8ff1049e45a76a229dfc"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.recover (cyclomatic 41): plDebugStore.usePlDebugStore.recover has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 10 of the 41 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 650, isCurrent, a function literal at line 660, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a902d86ae41bc7370e739b0af7a659d4e6c26ce4e49a44c1ebce5220e3c8e49"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_mysql_schema_objects (cyclomatic 40): dbx_core::data::transfer::transfer_mysql_schema_objects has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66152d178480a9e11d1889ad0d5f8ee40583171777334b6bd7ef7d235920b03"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::references::resolve_draft_with_tables (cyclomatic 40): dbx_core::schema::oracle_routines::references::resolve_draft_with_tables has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/references.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8bf241e12e5d5447892c7da45b2cf3c3c580bdfd8d38c97a5755d3c07e5cb3"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::run_product_tool (cyclomatic 40): DbxMcpServer::run_product_tool has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"041dce737030a33cac16cc050b02be45178ba7774886684e63ea4959df6f4436"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::scheduler_attribute_steps (cyclomatic 40): dbx_sql_schema::native_job_changes::scheduler_attribute_steps has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04292806683ba51817838e591c272b1941fe03b82242232cf686f4840f0a7de"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::existing_primary_key::build_existing_primary_key_change (cyclomatic 40): dbx_sql_schema::table_structure_sql::existing_primary_key::build_existing_primary_key_change has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/existing_primary_key.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3629d731eb6bfcfcb33370fef3244dc19b5c13ac8590f76c8a58ff62f31e733"}},{"ruleId":"D1","level":"warning","message":{"text":"EwkbWktDecoder.parseGeometry (cyclomatic 40): EwkbWktDecoder.parseGeometry has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ce44d1b5354ee8a3a8521b8129a0e0ec4de4dc5bebfde1afb4a60fa52b0999"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeMapStack (cyclomatic 40): main.plDebugNativeMapStack has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_stack.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0494999e18bdd67e5d2bafea6efeee30c982a68b2986d006b6db6dad191e44ab"}},{"ruleId":"D1","level":"warning","message":{"text":"server.readExactTriggerRows (cyclomatic 40): server.readExactTriggerRows has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/trigger_metadata.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4ef4d7deb29e126a5bd9b98719f3cace11a8623f16c48045deebf51b1ace60"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.applyNativeBreakpointRules (cyclomatic 40): plDebugNativeEntry.applyNativeBreakpointRules has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint_rules.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea95fb3ae450b90ebe6706f7af4bec34c416676c0252fd3b7b53a54264fc200"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportQueryResultViaBackend (cyclomatic 40): useDataGridExport.useDataGridExport.exportQueryResultViaBackend has cyclomatic complexity 40 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0cc665d9fcd2d90f01b7249987af77de556ad491bc212b45362489c1cf39b5"}},{"ruleId":"D1","level":"warning","message":{"text":"datagripImport.parseJdbcUrl (cyclomatic 40): datagripImport.parseJdbcUrl has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8658674ba27993d2031106badb365951386e5e5dcef749683f819d5debbfa9c2"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::snapshot_export::write_snapshot_export_with_fetch (cyclomatic 39): dbx_core::query::snapshot_export::write_snapshot_export_with_fetch has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/snapshot_export.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a01e59e147807b5a4ca96ae13614beb8894970884798dfe10b9b6ae6ac8e6c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_ddl_indexes::prepare_schema_sync_oracle_ddl_core (cyclomatic 39): dbx_core::schema::oracle_ddl_indexes::prepare_schema_sync_oracle_ddl_core has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbc116010a87490dc0369733852fb4d875582e59d3657ac1da2aea5473951ef"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.listObjects (cyclomatic 39): DbxJdbcPlugin.listObjects has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e432b1d94e035ee4b05e945038887ddbb2e5e7cf9cd045e2c58d99134ea1ecee"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeRoutineParamMode (cyclomatic 39): main.plDebugNativeRoutineParamMode has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2055ae59b24095a57dc4027f4349f4c294fb0cf5f487a23fd50c140360314e"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugBuildNativeTypedSignaturePrepared (cyclomatic 39): main.plDebugBuildNativeTypedSignaturePrepared has cyclomatic complexity 39 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_typed_signature.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"92da17fd4171638cec0c9427ab385423cc2abca110a0cf789daab7597b00c79a"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.nativeExternalPackageVariableNames (cyclomatic 39): plDebugNativeEntry.nativeExternalPackageVariableNames has cyclomatic complexity 39 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_variables.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"764c6e69a8846706dac22c2928e69ca82bfbed2d47f65da9d2165780d33b0ad5"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.commitEdit (cyclomatic 39): useDataGridEditor.useDataGridEditor.commitEdit has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"556b357e95786ce607cacd3f5ee4389cb81c1e1bf821cfe5c860f4940e3c16f7"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionDeepLink.kafkaConnectionDraft (cyclomatic 39): connectionDeepLink.kafkaConnectionDraft has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"946b72090a3aa474628bc0a4946705baacf39e09099c6f918db39938394cd39b"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.classifyStageOptions (cyclomatic 39): mongoCompletion.classifyStageOptions has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcee44547b2235b938ff2108cfeeaec26c69f49017609419b46cb64bf4d96e95"}},{"ruleId":"D1","level":"warning","message":{"text":"ddlDisplay.collectDdlStatementNameTargets (cyclomatic 39): ddlDisplay.collectDdlStatementNameTargets has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37542dcff36b7c4234a92fd8c8b6c75a271fbc588d0a603221f175d443d3a16"}},{"ruleId":"D1","level":"warning","message":{"text":"insertValueHints.selectProjectionStarts (cyclomatic 39): insertValueHints.selectProjectionStarts has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba03e240c0968bf1dbb07ecbdb00da4ba33bde2e36ab09fa3626c8f1ccab65"}},{"ruleId":"D1","level":"warning","message":{"text":"runStep (cyclomatic 39): runStep has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0c5e4713f32c994431328779bf9120d8156d408ff48693b044a3832d1a5bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_claude_with_tools (cyclomatic 38): dbx_ai_provider::ai::stream_claude_with_tools has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4433}}}],"partialFingerprints":{"codehealthFindingId/v1":"704295ef23269f7823c127eb7ddbda46143ec5505b47676382e8917f4ab9a4d1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::collect_snapshot_with_options (cyclomatic 38): dbx_core::schema::oracle_routines::collect_snapshot_with_options has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"1314bc6729e30805ced34bdf0baf5269abdf9a15082e7a9fb35ebd22f41dd95a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::oracle_table_source_statement_ranges (cyclomatic 38): dbx_sql_core::object_source_sql::oracle_indexes::oracle_table_source_statement_ranges has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d303db32db8992c706d31abbb573b5dde574e30093401add49ed4d458f661cd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::oracle_foreign_keys::build_changes (cyclomatic 38): dbx_sql_schema::table_structure_sql::oracle_foreign_keys::build_changes has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_foreign_keys.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"de506db85fdf25ec38feba770d7164e074ca951e58f26e8e88b59f447a80ef40"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugSession.setBreakpoints (cyclomatic 38): PlDebugSession.setBreakpoints has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e19eb7a74c7f2c741b17d7f019b6cb01c2214c6cc36a789294bca5aef57787"}},{"ruleId":"D1","level":"warning","message":{"text":"server.buildCustomTypeDDL (cyclomatic 38): server.buildCustomTypeDDL has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"0407bf354e10027776d9e0bb7827e19c4b2b855ac3d49245987dcce82d244d9b"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeSourceTokens (cyclomatic 38): main.plDebugNativeSourceTokens has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97ff785814989bab115ae8ade93e0fbaeb7b14189881a85e9c1523ea94d843b"}},{"ruleId":"D1","level":"warning","message":{"text":"main.buildCustomTypeDDL (cyclomatic 38): main.buildCustomTypeDDL has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66069d9b2f1f69c3ab74d5116795806d9b997303a99667dbe149c9e559495ee"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.trimRangeEndBeforeNextBoundary (cyclomatic 38): sqlStatementRanges.trimRangeEndBeforeNextBoundary has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7cffd4c7da30d7212d75cdee8a9d0b2935a911b4a95612fe16eeecd6091a99"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGenerate.findGeneratorKey (cyclomatic 38): dataGenerate.findGeneratorKey has cyclomatic complexity 38 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a5437109e019080c50cc5d04942b3264b15fea7c7a6b5b247eb7ff2f3fb013"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleViewRename.prepareOracleViewRename (cyclomatic 38): oracleViewRename.prepareOracleViewRename has cyclomatic complexity 38 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleViewRename.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf436f3bff76a71cf7c0713392ad50f200c38b398e9172159ff45b7c915bdf3e"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.refreshTreeNode (cyclomatic 38): connectionStore.useConnectionStore.refreshTreeNode has cyclomatic complexity 38 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9091}}}],"partialFingerprints":{"codehealthFindingId/v1":"29484018ba63b5bd777f79d6e9047b1afcc122c1b1ebbdee3ebc71b602746084"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.persistTypeManagementDraft (cyclomatic 38): queryStore.useQueryStore.persistTypeManagementDraft has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3068}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd14aeecdd5e05de3cc3de9c85b644b537f817f724fc701d1ae697e343e211d"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.countQueryTotalRowsInBackground (cyclomatic 38): queryStore.useQueryStore.countQueryTotalRowsInBackground has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 9 of the 38 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 8290, clearPendingCount). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb6bae12818f9355268f3717e3aaa9507876051c2741884dea952184c6808e1"}},{"ruleId":"D1","level":"warning","message":{"text":"startDevelopment (cyclomatic 38): startDevelopment has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 13 of the 38 points are its own statements and the rest belongs to 20 function items inside it that branch (spawnCommand, a function literal at line 131, run, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/runtime.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6cd2c19f9e711d3ce6430e49536eb17433ca02b02d3a54e74b53d759f30fde"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::database_export::build_export_insert_statements_excluding_with_dialect (cyclomatic 37): dbx_core::data::database_export::build_export_insert_statements_excluding_with_dialect has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"f504701f41f3cf2f9a902e9ad2322948a4c06c7e22ff9da8e93e215f07fd0b5f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::sql_file_import::execute_sql_file_paths_inner (cyclomatic 37): dbx_core::data::sql_file_import::execute_sql_file_paths_inner has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b05fa66389603a484329407b0c81fa270ea241dee7c691c3f878775487c32c4"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_type_data::describe (cyclomatic 37): dbx_core::schema::oracle_type_data::describe has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39c58c683ccca4195e41097f9f5db429d3d0470baecbc98c1530438f332033d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_agent::agent_service::download_with_progress (cyclomatic 37): dbx_driver_agent::agent_service::download_with_progress has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4861114af8f5ac19808f4b9b780e090c7056eff3f55444b06d7ce3f40e3002"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_agent::agent_service::import_offline_zip (cyclomatic 37): dbx_driver_agent::agent_service::import_offline_zip has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":3186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4bf4fb4c55907b91f74b9870d0b0f3a972ff42f3b23da9eee06063f50c9189"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::ssh_tunnel::connect_and_authenticate (cyclomatic 37): dbx_drivers::db::ssh_tunnel::connect_and_authenticate has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab67baa533addb3f1b6959526d8b5b1d5251a7342ba9d187e1e2fe24f5e771a9"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::oracle_view_rename::rewrite_hints (cyclomatic 37): dbx_sql_core::oracle_view_rename::rewrite_hints has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"407b4966989f7e7e143c3ddb494e0c564b3dbe0ac9a32f99711d0550d14b0873"}},{"ruleId":"D1","level":"warning","message":{"text":"etcdSession.history (cyclomatic 37): etcdSession.history has cyclomatic complexity 37 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 15 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":"agents/drivers/etcd-go/history.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beb138fa5647f69ee23c8d440c744bac534b962989b5eb58d64728d06efd87a"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugLegacyArgumentTree (cyclomatic 37): main.plDebugLegacyArgumentTree has cyclomatic complexity 37 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 11 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":"agents/drivers/oracle-go/pldebug_legacy_arguments.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9577a7830da3d6c95c19f70de1229581cbe8df09480662f3e0d6620b5edd1c8"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listConstraintsWithIdentity (cyclomatic 37): server.listConstraintsWithIdentity has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9150eb733890d1fca85ccdda845350c917c86ad05cbbb66abe98e8cc51e080"}},{"ruleId":"D1","level":"warning","message":{"text":"useAppUpdater.useAppUpdater.checkUpdates (cyclomatic 37): useAppUpdater.useAppUpdater.checkUpdates has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbcca643bde977d944b7f5bc908ebc29f8e1056bece304d06988d49785fc9a1"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor (cyclomatic 37): useDataGridEditor.useDataGridEditor has cyclomatic complexity 37 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 15 belong to 8 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80e5cb2ea1d650c55142df1404e2af06b4abf09be9caae8933e37791c8da038"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.applyCellValueToItem (cyclomatic 37): useDataGridEditor.useDataGridEditor.applyCellValueToItem has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e08c2bcb32d7b42cb9d2a6385c5b5696994bde22ff636d7837006e05b68e81"}},{"ruleId":"D1","level":"warning","message":{"text":"useExportTracker.useExportTracker.updateDataTransferTask (cyclomatic 37): useExportTracker.useExportTracker.updateDataTransferTask has cyclomatic complexity 37 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e921ceb1248f43676a1ba1426ce630e6fad2c7b3c7af16ba3c5e88c6d46355"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridExecutedQuery.dataGridExecutedQueryConditions (cyclomatic 37): dataGridExecutedQuery.dataGridExecutedQueryConditions has cyclomatic complexity 37 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridExecutedQuery.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dd85ea2c5165a8d4feec9005cdc855c818392be7d5d096206200ced6883e9b"}},{"ruleId":"D1","level":"warning","message":{"text":"regexGenerate.parseEscape (cyclomatic 37): regexGenerate.parseEscape has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"194729b765f3bd44b5218eb2353404d4cba322716d2d18407a38cb6a0aa85857"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeJobs.rebaseNativeJobDamengDraft (cyclomatic 37): nativeJobs.rebaseNativeJobDamengDraft has cyclomatic complexity 37 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 12 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02d47d4b8ce959f4b22f14218a39e19ac8fe70cb7be7aba66afcccf255a22cd"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleSessionDiagnostics.parseOracleCachedPlan (cyclomatic 37): oracleSessionDiagnostics.parseOracleCachedPlan has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionDiagnostics.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"790c7c554daa394ecd6ad82c5e4fe207dfc9f90ab550f029979326480cf7eb2e"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTriggerPlan.verifyStep (cyclomatic 37): oracleTriggerPlan.verifyStep has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e05a5df13a7a9d387ac230c15981c88c6a8fb749d4fbdbbd5d690fe519f9cc"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlIntentionActions.buildQualifierActions (cyclomatic 37): sqlIntentionActions.buildQualifierActions has cyclomatic complexity 37 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbc75ba11b22774e78291e14ae9b01d5479521372aeb450ad5deaf20ffcff6b"}},{"ruleId":"D1","level":"warning","message":{"text":"kvValueFormat.validateKvValue (cyclomatic 37): kvValueFormat.validateKvValue has cyclomatic complexity 37 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/kvValueFormat.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"710582416cd30acfdeaeca03b373f96664f731b5861b39dbdafb9cb8ad30dc16"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlFormatter.formatSqlText (cyclomatic 37): sqlFormatter.formatSqlText has cyclomatic complexity 37 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf776d2b9e155ef15819138b159ac7cde6a17fe6f95c0c187e98cda2460b4bfb"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.normalizeConnection (cyclomatic 37): connectionStore.useConnectionStore.normalizeConnection has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"7996bee2b587fffbda6d3a13cb4a95d6d81b10ebebecba00cdf6c3090578edac"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.listCompletionColumns (cyclomatic 37): connectionStore.useConnectionStore.listCompletionColumns has cyclomatic complexity 37 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 9 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10676}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e432fc8cf28a7c3ce47a91b5def96e8e28297d6f102db48fca6eac980fe903a"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.runOracleTriggerSourceAction (cyclomatic 37): queryStore.useQueryStore.runOracleTriggerSourceAction has cyclomatic complexity 37 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 13 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5714f7a1d22e7780bd387a0518d705df08b46cf291cf3c70eac0332bac1e675"}},{"ruleId":"D1","level":"warning","message":{"text":"codeContext (cyclomatic 37): codeContext has cyclomatic complexity 37 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 8 belong to 12 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa3152267c9c539684bbc9416c00082faa632416fb01a2322c1b57194d0492d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::mysql_xugu::column_type (cyclomatic 36): dbx_core::data::transfer::mysql_xugu::column_type has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"500a602a152a85d2c2df28700373bf164d98c4903aff72ac874bd36657b0881e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::get_object_source_once (cyclomatic 36): dbx_core::schema::get_object_source_once has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":13800}}}],"partialFingerprints":{"codehealthFindingId/v1":"557d4722bf3d066204f4864e1c58c849789da9c74fca6a25a030471ad7d4850e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::build_executable_object_source_statements_with_mysql_validation_name (cyclomatic 36): dbx_sql_core::object_source_sql::build_executable_object_source_statements_with_mysql_validation_name has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb47e7cc17c46d001497014a617cea9910e2a928dd7d905e5ab1acd7196606bd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::consume_postgres_cast_type (cyclomatic 36): dbx_sql_schema::schema_diff::consume_postgres_cast_type has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5240}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ea110eb0e1f8f39bcb97524b9fffb5f799910a4677cea72d1f0164eb63035c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_web::routes::mongodb_dump::receive_source (cyclomatic 36): dbx_web::routes::mongodb_dump::receive_source has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_dump.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dd0f89699a79328743aabddb456676f83c1dd49f46fc915a823b9131563822"}},{"ruleId":"D1","level":"warning","message":{"text":"main.sqlRequiresSessionAffinity (cyclomatic 36): main.sqlRequiresSessionAffinity has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/connection_state.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba94b10d2878ea05b45570e43e761118d8a7f140f26e459c1b145efe2dcb2eaa"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.parseExplainLikePrefixAt (cyclomatic 36): sqlStatementRanges.parseExplainLikePrefixAt has cyclomatic complexity 36 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf42ccd10da3e7dcc0e6f1249a50d01ada9d0f9f9c815c5dbaba734aae0a64d"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridInsertPaste.splitTopLevelStatements (cyclomatic 36): dataGridInsertPaste.splitTopLevelStatements has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee5f9a53f725cf182fb87e8793db7a332c6c61a0404ab8ce9cb62291c3f8090"}},{"ruleId":"D1","level":"warning","message":{"text":"db2ExplainPlan.parseDb2ExplainText (cyclomatic 36): db2ExplainPlan.parseDb2ExplainText has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/db2ExplainPlan.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1fd9fbec18ff2f729ceadccf6eca09c00c62403d128278a51f15a76c7f1c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"queryEditorNativeSelection.createQueryEditorNativeSelectionGuard (cyclomatic 36): queryEditorNativeSelection.createQueryEditorNativeSelectionGuard has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 7 of the 36 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 627, 645, 582, \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":"apps/desktop/src/lib/editor/queryEditorNativeSelection.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3b80af522c5882d39956a6e5a0e9768a7336eae0a6f946d39bc008d5fec165"}},{"ruleId":"D1","level":"warning","message":{"text":"cypherReadOnly.isProvenReadOnlyCypher (cyclomatic 36): cypherReadOnly.isProvenReadOnlyCypher has cyclomatic complexity 36 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherReadOnly.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a276c6e183741b78cf01f5b2d3dbc67e881382b978704804c27bddf838c8850d"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlFormatter.protectDuckDbPrefixAliasSeparators (cyclomatic 36): sqlFormatter.protectDuckDbPrefixAliasSeparators has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd85b9fae69103da3b3c3aa0ede8edc62a6dce0900c948b4c4d648cd7c28980"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::stream_xlsx_rows_to_channel_with_control (cyclomatic 35): dbx_core::data::table_import::stream_xlsx_rows_to_channel_with_control has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":4353}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4343c08391b4ec43d58a95e4f538c4c9ca24bd1a650830bd91af893539affc"}},{"ruleId":"D1","level":"warning","message":{"text":"Analysis::parse (cyclomatic 35): Analysis::parse has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71f8ef98fb03aa8d2920b2b5584fd3caa20e290de637ed52ffd04e63ca3ec52"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_routines::analysis::package::body_pass (cyclomatic 35): dbx_sql_core::object_source_sql::oracle_routines::analysis::package::body_pass has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e375cd5bd5431e1b0a91a677e758e374ceefaf993d8915e2e8d74690404e3ce"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.readValue (cyclomatic 35): DbxJdbcPlugin.readValue has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":6283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae068462fc333afd0fcc7c8e23ad9a5378f110bdb7a082662869348a8839acd"}},{"ruleId":"D1","level":"warning","message":{"text":"server.oracleUniqueIndexMetadata (cyclomatic 35): server.oracleUniqueIndexMetadata has cyclomatic complexity 35 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6508db7f3b6b640a0dc6b87a0a403f24d908323e22f45a303a8c41eabc381a7"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.snapshotLocked (cyclomatic 35): plDebugNativeEntry.snapshotLocked has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9068c731e2b80c2310fe298303509871d8b7995c19a3b7e86a7dd65d99027d"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorDiagnostics.useQueryEditorDiagnostics.loadSqlUnknownObjectSpans (cyclomatic 35): useQueryEditorDiagnostics.useQueryEditorDiagnostics.loadSqlUnknownObjectSpans has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f1c01958b5e3c25f20b9d12319259152b231d439104a503c768bd042d1a89f"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferDdl.temporalColumnTypesFromDdl (cyclomatic 35): queryResultTransferDdl.temporalColumnTypesFromDdl has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff02fe53d6289a66b49b9fbbae17a14450b523241a0e04f8728e19e22aa595b"}},{"ruleId":"D1","level":"warning","message":{"text":"openTabsPersistence.restoreOpenTabsArray (cyclomatic 35): openTabsPersistence.restoreOpenTabsArray has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 7 of the 35 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 325, 341, 345). 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":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d9334c07b90ed86565f4f448fc35b1a2774144400cb3fc7ebe3bf2fa5da6b3"}},{"ruleId":"D1","level":"warning","message":{"text":"errorUtils.isBackendError (cyclomatic 35): errorUtils.isBackendError has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 3 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":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3766fa1b2f0197cad1a23595f3ec8d2e2e53838f71bb4bef113607558ca3d01"}},{"ruleId":"D1","level":"warning","message":{"text":"dbAdminSql.buildDuplicateTableStructurePlan (cyclomatic 35): dbAdminSql.buildDuplicateTableStructurePlan has cyclomatic complexity 35 (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":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d822d6810c0416bce3dd9aad0e49685d4ddc93a5e67a4d998f56fcf7fdfd54b6"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleConstraints.constraintRecoveryCandidate (cyclomatic 35): oracleConstraints.constraintRecoveryCandidate has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b398636f0fbe092643cebc0273a03473c76b284e0ac7333bfa2e22a0f5ef91"}},{"ruleId":"D1","level":"warning","message":{"text":"codemirrorSqlDialect.createDbxCodeMirrorSqlDialect (cyclomatic 35): codemirrorSqlDialect.createDbxCodeMirrorSqlDialect has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorSqlDialect.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c70e2deb7509818728a8e5f0e36371fa0666f52d760863f74b471635c6e2ad"}},{"ruleId":"D1","level":"warning","message":{"text":"navicatImport.parseConnection (cyclomatic 35): navicatImport.parseConnection has cyclomatic complexity 35 (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":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"554068b7c21db0ba4a8aafe2cfcb71f989e9a43960accb17b26a339c22e51bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"cypherFormatter.needsSpace (cyclomatic 35): cypherFormatter.needsSpace has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc87c4647bb5623cf3c7dbacf3d2dc9295ea0da7914aacd0984299b419683fee"}},{"ruleId":"D1","level":"warning","message":{"text":"insertValueHints.stepLexState (cyclomatic 35): insertValueHints.stepLexState has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd962372270835169660e261d3001fab85839a1c6b7b4e7bf8950567c7c4e09e"}},{"ruleId":"D1","level":"warning","message":{"text":"tableStructureEditorState.parseExtraToColumnExtra (cyclomatic 35): tableStructureEditorState.parseExtraToColumnExtra has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fe7afa43c3b50793ec72da6f64c03aedc2ef9900d5835c7ea5af5850a36fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.runPublicOperation::dispatch (cyclomatic 35): plDebugStore.usePlDebugStore.runPublicOperation::dispatch has cyclomatic complexity 35 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (plDebugStore.usePlDebugStore.runPublicOperation) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1381a760f91602418669a3b8ec1f4b679e25dd713741db6386ad14e9c6f403"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.setValue (cyclomatic 35): plDebugStore.usePlDebugStore.setValue has cyclomatic complexity 35 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cb78a699ebdbfb03939711302c71ba6dfd789533e9dc340244431f2e137a60"}},{"ruleId":"D1","level":"warning","message":{"text":"json.shellConstructorToExtendedJson (cyclomatic 35): json.shellConstructorToExtendedJson has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"400c454bc3f418b15e9dd39d768363d823d61ad5541d3ee6a1f49defdca2f0da"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::mysql_xugu::prepare (cyclomatic 34): dbx_core::data::transfer::mysql_xugu::prepare has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2acf31280c4a341f094fa9aa3f132335ed011d56fa0c6db304e670267ab030e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::pl_debug::recover_value_operations (cyclomatic 34): dbx_core::query::pl_debug::recover_value_operations has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c5b87aeb8c2fcb28152a4d77f10b64a70b46fba4f4389cd53ada623a3405ef"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::get_table_ddl_once (cyclomatic 34): dbx_core::schema::get_table_ddl_once has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":11735}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df444d2e369fb3508bc5347a168e0db36bafedaca13569548b3a8d498d94c25"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::plan::package::prepare_package_drafts (cyclomatic 34): dbx_core::schema::oracle_routines::plan::package::prepare_package_drafts has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan/package.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76d4fd16519f98765a02486a5ed8d63bfd4aab4632631522ddea04a6fcad408"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_column_type_name (cyclomatic 34): dbx_driver_mysql::mysql::mysql_column_type_name has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b4be6b341409e445628e34cf80aca99ad85de07080ddd3fb2bd03d6e4d5578"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlScanner::step (cyclomatic 34): SqlScanner::step has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1853ced8e67a4ccad0f399fcab71dd436ff608521b5dcf05be7c433ba6bec4de"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::parts::plan_entries (cyclomatic 34): dbx_sql_schema::native_job_changes::dameng::parts::plan_entries has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng/parts.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab69b4b643bae56160d9c9c62398a4027e3e49524eb9f4612372a4767ceb001e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::prepare_schema_diff (cyclomatic 34): dbx_sql_schema::schema_diff::prepare_schema_diff has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1a3be8fae2bdbbf08e3865051f5fceaef047f39fcd42af296b4e5903cdb3cd"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseConnectionConfig (cyclomatic 34): main.parseConnectionConfig has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/driver.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"362393dd8a7d0bfd37c4a9c5bf630c1bb802ccadb4947c68b71307a3c5ee3371"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeCapture.finishReferences (cyclomatic 34): plDebugNativeCapture.finishReferences has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_output.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e708412e41add8e40d227d2f1073c877f42adabc80fa2a9aa9128935e8e04e3"}},{"ruleId":"D1","level":"warning","message":{"text":"codeSnapshot.snapshotElementToPng (cyclomatic 34): codeSnapshot.snapshotElementToPng has cyclomatic complexity 34 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5f52aaa70c2d0442b9e29d505b8194acca17046ab5cf5df850184dd8645ae5"}},{"ruleId":"D1","level":"warning","message":{"text":"oceanbaseSessionDiagnostics.readAudit (cyclomatic 34): oceanbaseSessionDiagnostics.readAudit has cyclomatic complexity 34 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 6 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":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5e6acde0010e2e582be27fb3a73f39b2ea8359f7098c479e96cdd3373b9156"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleConstraints.readbackMatches (cyclomatic 34): oracleConstraints.readbackMatches has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"129b02f105592a415a6bd93f0b013d55ff67cc5b4a4070b1bad99284cda3b193"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleForeignKeys.readOracleForeignKeySourceSnapshot (cyclomatic 34): oracleForeignKeys.readOracleForeignKeySourceSnapshot has cyclomatic complexity 34 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9ee36cbca7740b6ecb228f442dbad07f98c27d4822db1c9550f85b91e41e72"}},{"ruleId":"D1","level":"warning","message":{"text":"hoverTableSql.normalizeAlignedSqlWhitespace (cyclomatic 34): hoverTableSql.normalizeAlignedSqlWhitespace has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebb50860013995235c7f7f0dc7b2d6eed4e3f0bf5482a344f1cafbe6941113e"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.getMongoCompletionContext (cyclomatic 34): mongoCompletion.getMongoCompletionContext has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0b74ab7f5052c945a1bbda6eae5a190e4ab2b17764d1491b664f06c5d458b2"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.buildComparisonValueItems (cyclomatic 34): sqlCompletion.buildComparisonValueItems has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5780}}}],"partialFingerprints":{"codehealthFindingId/v1":"374536a75d476c1f124a1a826aab4ee6e1cf6a85f8a773454b9f7a7d88adb925"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.singularTableName (cyclomatic 34): sqlCompletion.singularTableName has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6709}}}],"partialFingerprints":{"codehealthFindingId/v1":"55da513dc8357a6798897e650ddf0bc41020bce5dcc5ce406af13010dacc106c"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.buildKeywordItems (cyclomatic 34): sqlCompletion.buildKeywordItems has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 10 of the 34 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 7033, 7042). 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7018}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b368401eed465bf1b69428becf045c66cd9976af6a61a228eeb0b033f6ee7eb"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.isMysqlRoutineHeader (cyclomatic 34): sqlParameters.isMysqlRoutineHeader has cyclomatic complexity 34 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 10 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"930b657ab1ac2520287d018f696aca84b982b0d7fc91d6cdd719887d335c08c3"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectComplexTypeFieldSeparatorsInDeclaration (cyclomatic 34): sqlParameters.collectComplexTypeFieldSeparatorsInDeclaration has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e8051af2296fc3f1c466d9a20b2d9815752dcf718f3881562d3b98b521054e"}},{"ruleId":"D1","level":"warning","message":{"text":"oraclePackageSaveAs.executePreparedOraclePackageSaveAs (cyclomatic 34): oraclePackageSaveAs.executePreparedOraclePackageSaveAs has cyclomatic complexity 34 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"3652a1084925849f5a271ece3196a1b2c7002c65a88cca4216d922cc4e1f8f5b"}},{"ruleId":"D1","level":"warning","message":{"text":"tableStructureEditorState.columnDataTypeForEditor (cyclomatic 34): tableStructureEditorState.columnDataTypeForEditor has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0f7f834cf73e8ba58f463c68d39d54eddf906e89db592a1430609359975b0a"}},{"ruleId":"D1","level":"warning","message":{"text":"tabPresentation.tabTooltipLines (cyclomatic 34): tabPresentation.tabTooltipLines has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"067358fa7044e65f9422fef12a23507f04dd9770c518f8e1a0f03c71b2c4ee17"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.connect (cyclomatic 34): connectionStore.useConnectionStore.connect has cyclomatic complexity 34 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5556}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d31c736f787b68910198fb8c24d7144a69cb5afc20d9ad4bc260e4d95194142"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadTableForLocate (cyclomatic 34): connectionStore.useConnectionStore.loadTableForLocate has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 3 of the 34 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 8234, 8312, 8269). 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6104c8c7b5204e7e4c9217b617f3395c02ce842d424d977dc87717bd3f796cc0"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.start (cyclomatic 34): plDebugStore.usePlDebugStore.start has cyclomatic complexity 34 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 16 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e9ffa7f4551e9ae4300ae2f26e916065bf813906ee63e6ea3ae25a221faa78"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.createTab (cyclomatic 34): queryStore.useQueryStore.createTab has cyclomatic complexity 34 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 11 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"700883a454029af814e0d29f4044589aa92c42fe31032c9eabbc62122385ab0b"}},{"ruleId":"D1","level":"warning","message":{"text":"MqttClient::spawn_v4_event_loop (cyclomatic 33): MqttClient::spawn_v4_event_loop has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (MqttClient::spawn_v5_event_loop) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb3458ceeaec7a25a97c7856a0c4e08a70d0fe774584fe50986fc771214c6f9"}},{"ruleId":"D1","level":"warning","message":{"text":"MqttClient::spawn_v5_event_loop (cyclomatic 33): MqttClient::spawn_v5_event_loop has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (MqttClient::spawn_v4_event_loop) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d7723a9377fa5e8302869958ae895768101fbe7c2b25f99b127c307c141a74"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::database_export::export_postgres_all_schemas_sql_core (cyclomatic 33): dbx_core::data::database_export::export_postgres_all_schemas_sql_core has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":4870}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d95096ac1aff0ccfadcaddf2198748bec81d58e1ffd289d28fe6fdf34f4ba10"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::query_result_export::try_export_clickhouse_query_result_stream (cyclomatic 33): dbx_core::data::query_result_export::try_export_clickhouse_query_result_stream has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":2144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb7772905b42d92e0f544ff4f0e76d8801eb37532026ac5ace1cfe7047626dc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::find_column_constraint_start (cyclomatic 33): dbx_core::schema::table_structure_sql::sqlite_rebuild::find_column_constraint_start has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee5a9389fce5748f23b130164df10b918365742654afa38c77027ed27db94fe"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginManifest::compatibility (cyclomatic 33): PluginManifest::compatibility has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"db07c3a1c4180ddda2dbbe9e64a4ddcc16743c1639481829bd7d2dcb8ce5fccf"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::mysql_routine_tokens (cyclomatic 33): dbx_sql_core::sql::mysql_routine_tokens has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8cc3ef4d57a728ba820b7e184c0058e00618a159205dfee7720bae69bd1985"}},{"ruleId":"D1","level":"warning","message":{"text":"DialectYaml::build_capability_flags (cyclomatic 33): DialectYaml::build_capability_flags has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/dialect_yaml.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0310a259915759a0a16406a9f6e14a6cebab6b5ae91567fa07683e779f80d0"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_alter::build_postgres_like_existing_column_sql (cyclomatic 33): dbx_sql_schema::table_structure_sql::column_alter::build_postgres_like_existing_column_sql has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6b0a3de56923192f49b9d38539840933ad64829f6fbd921016605395b1c477"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::oracle_constraints::validate_unique (cyclomatic 33): dbx_sql_schema::table_structure_sql::oracle_constraints::validate_unique has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"771fcb972771f2e822aa1eed3ee2d44a8bf3c2cc99e299b345625e3147642ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::triggers::build_trigger_sql_with_operations (cyclomatic 33): dbx_sql_schema::table_structure_sql::triggers::build_trigger_sql_with_operations has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"964f819fb012bcecfe3226f90080ff0695d6c66673a7657a49caf27d0bef8621"}},{"ruleId":"D1","level":"warning","message":{"text":"DeferredLobValues.read (cyclomatic 33): DeferredLobValues.read has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f75d53280258ab64f37cb1b58925d29885c98398dd58a3d571a5f2015f4f686"}},{"ruleId":"D1","level":"warning","message":{"text":"DeferredLobValues.readAhead (cyclomatic 33): DeferredLobValues.readAhead has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfee456a8826ecf0c80ea944589db3bb1f6a0eda089b70d0bcebcc3dd355f3c"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugCompositeInput.composite (cyclomatic 33): PlDebugCompositeInput.composite has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd64686524d5c5fc483fff85fa59db5ce9461b460e3b549d4f60bed9f7ea53ba"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugSession.debugBefore (cyclomatic 33): PlDebugSession.debugBefore has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fbfb991e51166c5d30843b8d351fd15726061dc0bc080a82e77eb5d8920f1e"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugLegacyCollectionFromSource (cyclomatic 33): main.plDebugLegacyCollectionFromSource has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_declarations.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a64cd65611acc6ee75ff5ae112b6dd1890fbe8c559e0fc0446d14fcc3d3954"}},{"ruleId":"D1","level":"warning","message":{"text":"server.prepareLegacyJob (cyclomatic 33): server.prepareLegacyJob has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/native_jobs.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d20d4b46bbc585177150f015d9c12bc69b1bf2b9b534ee4ee7933d99f5ac152"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugRecordDecoder.record (cyclomatic 33): plDebugRecordDecoder.record has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_record_input.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77f640ee03d89f2727144133c8a858a0f91f52fc1c946c86911a1f64cc1011f"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.mysqlRoutineTokens (cyclomatic 33): sqlStatementRanges.mysqlRoutineTokens has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed65012fd10da510b1c8449a201e26a792ec30b2f7e3a76f598eaf7bb4f47bf"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportXlsxResult (cyclomatic 33): useDataGridExport.useDataGridExport.exportXlsxResult has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 3 of the 33 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1872, 1911). 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"75672057cd4fcf7184e6231927e572169fefb3b3a89295f2640131b1be6e9939"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionDeepLink.parseConnectionDeepLinkUpdate (cyclomatic 33): connectionDeepLink.parseConnectionDeepLinkUpdate has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4fb39df15fae5557b415f07422d9410942c3a2e1404a9e91f78f5a8c7ee7d2"}},{"ruleId":"D1","level":"warning","message":{"text":"oceanbaseSessionDiagnostics.readPlan (cyclomatic 33): oceanbaseSessionDiagnostics.readPlan has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e0fbd8661721149fff7fe1279ea5908ae6513cf8c8286946fd2ebdb496e04c"}},{"ruleId":"D1","level":"warning","message":{"text":"oceanbaseSessionDiagnostics.collectOceanbaseSessionDiagnostics (cyclomatic 33): oceanbaseSessionDiagnostics.collectOceanbaseSessionDiagnostics has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c22532b4352b1a7d78c45ecff48d18831005ca8f231b095ff0aa513a535004c"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleForeignKeys.readOracleForeignKeyMetadata (cyclomatic 33): oracleForeignKeys.readOracleForeignKeyMetadata has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2149dc40740d6e1c6e0f12d51dc4c4a08ce1fc4fc4343f02bd720c2babc2c2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTriggerPlan.executePreparedTriggerPlan::run (cyclomatic 33): oracleTriggerPlan.executePreparedTriggerPlan::run has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (oracleTriggerPlan.executePreparedTriggerPlan) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef93337b46f0716033a776dc7fb6886cc67e08cfe8a0498a5b559c9fd6568fc"}},{"ruleId":"D1","level":"warning","message":{"text":"anotherRedisImport.connection (cyclomatic 33): anotherRedisImport.connection has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/anotherRedisImport.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"07be5770a261f2eb1ecb7429c9ae5f83e104efbd8396bf20e9e230f5e8a74608"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineDeploy.refreshOracleRoutineDeployment (cyclomatic 33): oracleRoutineDeploy.refreshOracleRoutineDeployment has cyclomatic complexity 33 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 7 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34dc0a663ef2627b20d4d05741400080f09593384b5b062fd558c53230de87d"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarSearchTree.mergeSidebarRegexIndexScopes (cyclomatic 33): sidebarSearchTree.mergeSidebarRegexIndexScopes has cyclomatic complexity 33 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb7f98945be36dd0ab425740e4bb94cb661809efd66bae524c7c9ec7f883b81"}},{"ruleId":"D1","level":"warning","message":{"text":"cypherFormatter.tokenizeCypher (cyclomatic 33): cypherFormatter.tokenizeCypher has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc17808ce1c2f8bf51f190f9c9c7bfc89d885de5cd9a181a5b8a9784e0ab8c04"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleViewRename.executeOracleViewRename (cyclomatic 33): oracleViewRename.executeOracleViewRename has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleViewRename.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17770bbe8540be40e082630cf7e14ce29dc6cdbe3a3b478c0d89d4907ebb262"}},{"ruleId":"D1","level":"warning","message":{"text":"tabPresentation.tabIconClass (cyclomatic 33): tabPresentation.tabIconClass has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"82152dcdb868ef49c8d5b8f180b03c0faeb23fac95d7ff3621a9d7aebd5408d3"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.runPublicOperation (cyclomatic 33): plDebugStore.usePlDebugStore.runPublicOperation has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (plDebugStore.usePlDebugStore.runPublicOperation::dispatch) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c79dd41c24535b5a48e6073a09a15bef5367e4a7224876a049bef6a3710a553"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.evaluateCondition (cyclomatic 33): plDebugStore.evaluateCondition has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4d2bbbb1732e3c5bfee7be28d56d514047d63cb8c145fbb116db0202e5e3a3"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.duplicateTab (cyclomatic 33): queryStore.useQueryStore.duplicateTab has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce043366592c20c4fe6c3dc4ebc385f6cd4d1635e215020784789d607e95376e"}},{"ruleId":"D1","level":"warning","message":{"text":"registerDbxMcpBridge (cyclomatic 33): registerDbxMcpBridge has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 11 of the 33 points are its own statements and the rest belongs to 18 function items inside it that branch (a function literal at line 84, execute, a function literal at line 77, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/assets/pi-mcp-bridge.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b047f5e6368a0395256929d84ac92c3502f4abb91d97845704773bd68ba9f3b8"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_export::try_export_native_table_stream (cyclomatic 32): dbx_core::data::table_export::try_export_native_table_stream has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ffc045416cbe171f5954b0f80cd9558e1f0f83b4a76fe853e3d239bf3d2fd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::dameng::verify_step (cyclomatic 32): dbx_core::schema::native_jobs::operations::dameng::verify_step has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b07f07f2e0dc9ea53115ef679911c959d07e906a55c8626e08f6e305b5cee4"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::execute_redis_command (cyclomatic 32): DbxMcpServer::execute_redis_command has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"638112b62415128490349de6eabc683faf83db9de6ad36653e0d080d39bc3acb"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::cypher_read_only::is_proven_read_only_cypher (cyclomatic 32): dbx_sql_core::cypher_read_only::is_proven_read_only_cypher has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/cypher_read_only.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"79463426f8e7367b2dc6838287a7194de22d4a0eb668060cec7e7e91d75ea003"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyGraph::build_with_functions_and_options (cyclomatic 32): DependencyGraph::build_with_functions_and_options has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08575b11aaad0103b6b491b842ff503283a84f9f2591e70c10b273cb58c92c3"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::create_index_sql (cyclomatic 32): dbx_sql_schema::schema_diff::create_index_sql has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":4808}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d33ec4971d963f57e66aa38008dca5ef3663d456fa1546ba1daa6ef67ed7cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::commands::mcp_bridge::start (cyclomatic 32): dbx::commands::mcp_bridge::start 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":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f2c353346c1875a9bdbb9196d15da3144376c9cd445c466080d76ab898d11c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::commands::mcp_bridge::handle_sql_approval (cyclomatic 32): dbx::commands::mcp_bridge::handle_sql_approval has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba12890ac768efd833f5f53afbd93c3123c3697ef87bc4f7a672d841b32b49c"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.listIndexes (cyclomatic 32): DbxJdbcPlugin.listIndexes has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3530}}}],"partialFingerprints":{"codehealthFindingId/v1":"430ffcc25fbc7d3e83fffd74908e922befd1c8fa3ae380ddafcd20cc6b590a5f"}},{"ruleId":"D1","level":"warning","message":{"text":"OceanBaseOracleAgent.isSelectWithClause (cyclomatic 32): OceanBaseOracleAgent.isSelectWithClause has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bc2de0f30be0a06efcb205d7d28bad87f65d73693adfd195ee23f7948eea3e"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTemporalJson.node (cyclomatic 32): PlDebugTemporalJson.node has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTemporalJson.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bf13a3e376c00b9390d5284a25ad95f18151534d28d97538a482cf33d36c98"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listConstraints (cyclomatic 32): server.listConstraints has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f855c6f02899c6b03f3a40d7b01c631a0268484395b6f4853f6f50dc4380e19"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeObjectCallables (cyclomatic 32): main.plDebugNativeObjectCallables has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_object_constructors.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa85744395e9e04ffce65f48c5d9b22eee59b1cfeab308289b52473af8ea07d3"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeTypeLoader.compiledSource (cyclomatic 32): plDebugNativeTypeLoader.compiledSource has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_source.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"938d89adebcad63608bad9b20c17bf5c9318ea52ba7410a6411c3934782fc644"}},{"ruleId":"D1","level":"warning","message":{"text":"main.openClient (cyclomatic 32): main.openClient has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fba3b80713805e44cf1582d48e3251fa4a17045b5b774832f066db6c92192bd"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-schema-objects.main (cyclomatic 32): verify-schema-objects.main has cyclomatic complexity 32 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 12 belong to 7 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1d9cbbbdb53deb803943cdac77d1792e1b1e9ceec5b3dc28998f5b82abedc5"}},{"ruleId":"D1","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportDataLegacyForTarget (cyclomatic 32): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportDataLegacyForTarget has cyclomatic complexity 32 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e52d5d412eb84e011bd58fa809ef708c3d9228a82be465a55c278099bdb251"}},{"ruleId":"D1","level":"warning","message":{"text":"useTauriEvents.useTauriEvents.setupTauriListeners (cyclomatic 32): useTauriEvents.useTauriEvents.setupTauriListeners has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 41, 87, 64, \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":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d6a17e1cf63525561aa9fb92fb807243adb0723757ed4e85cdc3ead5dfddca"}},{"ruleId":"D1","level":"warning","message":{"text":"index.localeFromLanguageTag (cyclomatic 32): index.localeFromLanguageTag has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/index.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5325b4f4e82df5966e29bf0c568be7be067c75fe68b88e9c1dae43b87a3dda7"}},{"ruleId":"D1","level":"warning","message":{"text":"jdbcProperties.parseJdbcProperties (cyclomatic 32): jdbcProperties.parseJdbcProperties has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/jdbcProperties.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83c658f9231e12639d2bd6f4488e485304f6da3a72b4bfbea07475f967c4cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridConditionHighlight.tokenizeDataGridCondition (cyclomatic 32): dataGridConditionHighlight.tokenizeDataGridCondition has cyclomatic complexity 32 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridConditionHighlight.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec1a8167cbde769ab3c2e8aa523ed0f43cf1f7c1a0578349fac19a4375ce8c6"}},{"ruleId":"D1","level":"warning","message":{"text":"xuguUserPermissions.xuguGrantSql (cyclomatic 32): xuguUserPermissions.xuguGrantSql 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":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c9d6125450c11e5545e08a4445c2e301aa470ab737936796ee27c6ed0ec503"}},{"ruleId":"D1","level":"warning","message":{"text":"mcpAccessTree.buildMcpAccessTreeRows (cyclomatic 32): mcpAccessTree.buildMcpAccessTreeRows has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 5 of the 32 points are its own statements and the rest belongs to 6 function items inside it that branch (connectionRows, a function literal at line 252, a function literal at line 232, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mcp/mcpAccessTree.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"60807be582ce3fe104c0326635b25ee6c881f20eb956d9dd934da5ef42e920c5"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineDeploy.includeOraclePackageCompanion (cyclomatic 32): oracleRoutineDeploy.includeOraclePackageCompanion has cyclomatic complexity 32 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea63010fb6f696db611ab9c5b2078738ee50150e31d54c43ffd3ea45657fabf1"}},{"ruleId":"D1","level":"warning","message":{"text":"databaseTableEmpty.buildLayers (cyclomatic 32): databaseTableEmpty.buildLayers has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/databaseTableEmpty.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cf9c22bf3b53bb2f47b072d3c59897213b493822a3afd893c80d0db06ae3df"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.collectSqlServerLocalVariables (cyclomatic 32): sqlCompletion.collectSqlServerLocalVariables has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3220}}}],"partialFingerprints":{"codehealthFindingId/v1":"859df3e6441f38a429430f2eb129957848ad1c6c66ad0e71931e8c83cfe38c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectDuckDbStructFieldSeparators (cyclomatic 32): sqlParameters.collectDuckDbStructFieldSeparators has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e5ad58ec780cfcb0490e6c7b36c8b7c80c46d4c96e682a1b6b05a1fe4e708b"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTableRename.validateDependentDeclaration (cyclomatic 32): oracleTableRename.validateDependentDeclaration has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"071da3f3ff59f8cbe23065db3a7fba390e5c2d7017299a09ff95398b135c7e9f"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadSimpleSupplementalObjectChildren (cyclomatic 32): connectionStore.useConnectionStore.loadSimpleSupplementalObjectChildren has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3476}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9908654fdd60cf1e250356fa741a6ac6add261f79ec12150b4a34f293f4dde"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.listCompletionTables (cyclomatic 32): connectionStore.useConnectionStore.listCompletionTables has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 6 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 10381). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10359}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca491b9c34826beb5c7c1559e7b4c8501dd4465b733a4326d41fc16cd5850c1"}},{"ruleId":"D1","level":"warning","message":{"text":"seo.auditPages (cyclomatic 32): seo.auditPages has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/scripts/seo.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9971ab4ec45d0e201a9cb2e7c920b8657f13483e2db9dc30bf919e001f80f72"}},{"ruleId":"D1","level":"warning","message":{"text":"validateRecord (cyclomatic 32): validateRecord has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/connections.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb7c0eeeadafc0ae87fc02069cfa5da751878a744c13282cab75a2cfccccdba"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::query_result_export::try_export_postgres_query_result_stream (cyclomatic 31): dbx_core::data::query_result_export::try_export_postgres_query_result_stream has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e66caa58ab7d3c899bb8f108075c534bf33c7253d69e203e2778301f712222"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::query_result_export::try_export_sqlserver_query_result_stream (cyclomatic 31): dbx_core::data::query_result_export::try_export_sqlserver_query_result_stream has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7c006640e1f6c27001f538340864abd7bf91e3720ae494c244a9e51947bce1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::ddl_plan::prepare_table_ddl (cyclomatic 31): dbx_core::data::transfer::ddl_plan::prepare_table_ddl has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/ddl_plan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90f2fb0f58b32ab7480837a760c94b591995a914562c342e603fbc0af7187dc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::mongo_ops::execute_mongo_command_core (cyclomatic 31): dbx_core::query::mongo_ops::execute_mongo_command_core has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46988428ef027f6fa13334d9240fd5618180c63a46cfbaa11c2da9f032321b5"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_type_evolution::read (cyclomatic 31): dbx_core::schema::oracle_type_evolution::read has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_evolution.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"67023ec540f742f89b969f9b8c428c1c44de0dbed3ca49fdb0953890f0bccb1a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::extract_oracle_triggers_with_table_owner (cyclomatic 31): dbx_sql_core::object_source_sql::oracle_indexes::extract_oracle_triggers_with_table_owner has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b2e92cb1c10f8c9670f1c6df4efdf96344fa5e9a4ba5943db54d8c8528265b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::parse_oracle_table_ddl (cyclomatic 31): dbx_sql_core::object_source_sql::oracle_indexes::parse_oracle_table_ddl has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe71d01dd5289bf688356e02a178bdeb5329c0d5b99ef4d185a78536ba10a98"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::starrocks_partition::validate (cyclomatic 31): dbx_sql_schema::table_structure_sql::starrocks_partition::validate has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/starrocks_partition.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"de40ef4341443ac3c68ed554fac9d8261493f25535300f1b623767c3d0375209"}},{"ruleId":"D1","level":"warning","message":{"text":"main.applyHOCONAuthentication (cyclomatic 31): main.applyHOCONAuthentication has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config_file.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f88a67377112dcdf33b2ed2afbce57b6c46f41b7c5eeb7f5d16e57815b28e1"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.pendingCleanupContinuation (cyclomatic 31): plDebugNativeEntry.pendingCleanupContinuation has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_drain.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"02194668c2109c90d2a7aba055f972528d68786544873327ff423aad0f754d36"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listConstraints (cyclomatic 31): server.listConstraints has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"2001a0c1571b0bd628b80260bcebd1418a4bc1924ae3d5d84995523838d0389a"}},{"ruleId":"D1","level":"warning","message":{"text":"main.renderXuguTableDDL (cyclomatic 31): main.renderXuguTableDDL has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"384b63e526b5159097fc708e73a0b724f356f1e51db0abc61e84fa558584e987"}},{"ruleId":"D1","level":"warning","message":{"text":"xuguWKBReader.geometry (cyclomatic 31): xuguWKBReader.geometry has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/spatial.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"021c690217ac7c997d82cacbf5285f68471308ee2ead3a1ba94b1fb054aa2fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"Tablet.SetValueAt (cyclomatic 31): Tablet.SetValueAt has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/tablet.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1838a142d2cc81e507945f0baa054918fcb763a138927d6c49253f4103aa249a"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.resultToExport (cyclomatic 31): useDataGridExport.useDataGridExport.resultToExport has cyclomatic complexity 31 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1620a0ec33a0eff8ea80a93c0813ad9a5ee1aea28848b41a86b1154db452c94"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.submitBackendExport::execute (cyclomatic 31): useDataGridExport.useDataGridExport.submitBackendExport::execute has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2629}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b4a9c0beb114231ed11c4b82e7ca05ef953560a1749a2c3276b1f15196c9a0"}},{"ruleId":"D1","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportQueuedMongoCollection (cyclomatic 31): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportQueuedMongoCollection has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 10 of the 31 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 837, 886, 845, \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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3af06f73cb27db1dc45c57822398c1f5695923490549dd4ed8441c5d1f946a"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleIndexes.executeOracleIndexPlan (cyclomatic 31): oracleIndexes.executeOracleIndexPlan has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"958d0baa9614d5b6fa8c7eca0b5015df8772dfa38d0c22fc010d95215c149686"}},{"ruleId":"D1","level":"warning","message":{"text":"productionSafety.sqlTargetSafetyText (cyclomatic 31): productionSafety.sqlTargetSafetyText has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99be7461e6393d078be6def970b1b5ad56fbdc2d6d036728777ea4cb5842497"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlIntentionActions.tokenizeSelectionIdentifiers (cyclomatic 31): sqlIntentionActions.tokenizeSelectionIdentifiers has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a023948fc9c7d045e70a3bc12516ed993ac99c0d999069ea5c7d5944cf5e4fc"}},{"ruleId":"D1","level":"warning","message":{"text":"thriftBinary.readValue (cyclomatic 31): thriftBinary.readValue has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/thriftBinary.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b23d0cfffc895763979283508a9d930106e7b404edfe4490320dfe0d91811f"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaDiff.stripSqlCommentsAndStringLiterals (cyclomatic 31): schemaDiff.stripSqlCommentsAndStringLiterals has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e6aca46457a6901712212ba0a81eca85bf3156acfd014dcb70d707246d1107"}},{"ruleId":"D1","level":"warning","message":{"text":"insertValueHints.parseInsertClause (cyclomatic 31): insertValueHints.parseInsertClause has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8a4fbaacd4d658b009ad32a8530d0574b57f549cc84e6da364f6418480588c"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printRuleList (cyclomatic 31): printer.printRuleList has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 189, 177). 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":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f97e3490638103966661554c30317190642cca3f79ab2f158772fa6f4b43f27"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.collectSqlServerRoutineParameters (cyclomatic 31): sqlCompletion.collectSqlServerRoutineParameters has cyclomatic complexity 31 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6f099184c06aaef2b94f438fb9bb9a922224e512d8fccec1d4528689447547"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.parseTrailingIdentifierContext (cyclomatic 31): sqlCompletion.parseTrailingIdentifierContext has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6416488b6e5a69e1a109262479b6d00b121f5a8a86c877c4f6bf5d55ee75211c"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectSelectAssignmentVariables (cyclomatic 31): sqlParameters.collectSelectAssignmentVariables has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a598a45580e9a9780572a8a0f00a26220130e1e9b17d9abc4bd00a8edc161fc"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlRisk.sqlSafetyText (cyclomatic 31): sqlRisk.sqlSafetyText has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc40f4a8ff7c10b4a9afefea7944fb70b5dcb5a98f4030cb038ed7a20ad19e88"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTypeManagement.assertNoUnapprovedChange (cyclomatic 31): oracleTypeManagement.assertNoUnapprovedChange has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a094bc8cab840f001ea4d329ba8a8bfd2f2363b5582f591035b9f922e1ee213"}},{"ruleId":"D1","level":"warning","message":{"text":"tableCopyTaskStore.useTableCopyTaskStore.run (cyclomatic 31): tableCopyTaskStore.useTableCopyTaskStore.run has cyclomatic complexity 31 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/tableCopyTaskStore.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"97acb61dd9d3288e1e5d3fad4b57647689871bb83fad7699c26a539db7f8a6c2"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_openai_with_tools (cyclomatic 30): dbx_ai_provider::ai::stream_openai_with_tools has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4658}}}],"partialFingerprints":{"codehealthFindingId/v1":"6075d95c54bc80b030d83befbf58ab38e88a8ca6c29f98e90052d9e4d728c9a1"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::prepare_connection_transport_with_claimant (cyclomatic 30): AppState::prepare_connection_transport_with_claimant has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: dbx_core::connection::close_pool_kind_inner (cyclomatic 34) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":4553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fe4aaed23cec056e57f0905620444960de92e89e3a0184fb29ee7441e0124e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::admin::nacos::access_control::plan_operation (cyclomatic 30): dbx_core::admin::nacos::access_control::plan_operation has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"742d7e428d0af2f17536815730671aece86a939f7a34b5b14d640bed39086bd4"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_postgres_schema_objects (cyclomatic 30): dbx_core::data::transfer::transfer_postgres_schema_objects has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14830}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65ec9eb25896968e54abc32ebe3c0385c30c5928a51160073fec934ab8e844b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::get_oracle_type_management_snapshot_with_objects_core (cyclomatic 30): dbx_core::schema::get_oracle_type_management_snapshot_with_objects_core has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":13166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6350f363fa2bdc6368706f394dd75d465bd7293c2d04801251765d5ea4e77efc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::build_change_plan (cyclomatic 30): dbx_core::schema::table_structure_sql::sqlite_rebuild::build_change_plan has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"778f62946c2fe4ed3bee3c9860ce46b547c2c1a7957270ef5c285320c3fa6d29"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::find_sql_keyword_end (cyclomatic 30): dbx_core::schema::table_structure_sql::sqlite_rebuild::find_sql_keyword_end has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44057a76fc41e6d82298ef5f5d1afe670fa6322ed6afbf9f2b11b9acde4128f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_postgres::postgres::pg_ndim_array_element_json (cyclomatic 30): dbx_driver_postgres::postgres::pg_ndim_array_element_json has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a79d713c6bab52c431864cbea305264437ef4c1cb0ad6692dc0c285bfc58c2"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_postgres::postgres::completion_assistant_search_inner (cyclomatic 30): dbx_driver_postgres::postgres::completion_assistant_search_inner has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8091b7357c13904340b21ea84f87a3b4e78a0a37dc96fe3fbdcd297182e616d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_redis::parse_command_argv (cyclomatic 30): dbx_driver_redis::parse_command_argv has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":2587}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ddf513ded64c8c9ec52c027104a90ab1a5bf58a77ba48ccd37055c13c3b115"}},{"ruleId":"D1","level":"warning","message":{"text":"Analysis::select (cyclomatic 30): Analysis::select has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f710a4683c9ce5f0e150536d49e846ea5234de9dc72aad3ef4dccf118249dc"}},{"ruleId":"D1","level":"warning","message":{"text":"Projection::read (cyclomatic 30): Projection::read has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"45aac07b82fca7ad20a7488e7f98b865051ceefd169f6e3f6058ff0652a99aed"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::rewrite_oracle_table_references (cyclomatic 30): dbx_sql_core::object_source_sql::rewrite_oracle_table_references has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9c44baa4e218daf72241552b8c5c49c9f69cd27376988f5558c2aa3c1b4065"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql_analysis::spark_datasource_clause_removals (cyclomatic 30): dbx_sql_core::sql_analysis::spark_datasource_clause_removals has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d43566c2c077b3e07b68a03c9bf20368f58098d48f0a23289d914173df8159b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql_diagnostics::redact_literals (cyclomatic 30): dbx_sql_core::sql_diagnostics::redact_literals has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_diagnostics.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5283ab0379233772a1b91472fe648360c2edcf9637bead22365fe551557a9d92"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_jobs::native_job_catalog_queries (cyclomatic 30): dbx_sql_schema::native_jobs::native_job_catalog_queries has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_jobs.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaebd074e24df42e556a2d8ff95144956a467e4a96a838956692352773d34ae"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::diff_columns_with_identifier_options (cyclomatic 30): dbx_sql_schema::schema_diff::diff_columns_with_identifier_options has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba51e4134f72e65e78d5bea13b28ced3e963a83bb18440a5b79784ab24e1d09"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleTriggerMetadataReader.summaries (cyclomatic 30): OracleTriggerMetadataReader.summaries has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ada1666b188952ed939ab6650ce9d9400a63aaaee54f3e5a4acb611e374855"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatchNativeDebug (cyclomatic 30): runtimeServer.dispatchNativeDebug has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e33e8c7c98d6d06bf0f3a04db88c48c2face77d01fd2c311515680bfbc4e1ec"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridScrollbars.useDataGridScrollbars (cyclomatic 30): useDataGridScrollbars.useDataGridScrollbars has cyclomatic complexity 30 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridScrollbars.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc112e509fa99fd2eb7835dafa5e748583ba9031671df340d3169ef4a697f113"}},{"ruleId":"D1","level":"warning","message":{"text":"ai.buildModePromptLines (cyclomatic 30): ai.buildModePromptLines has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37a101a61b87dd22506534cbf3ee085abd5947c07b24e3a5e1c7d6d78500ab9"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyLargeValueExport.fetchLegacyLargeValueRequestChunk (cyclomatic 30): legacyLargeValueExport.fetchLegacyLargeValueRequestChunk has cyclomatic complexity 30 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/legacyLargeValueExport.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"69844a43b93338f85487156e4f1bf55d4fa2d3d0060ec820f07fbb8fc680a1c1"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleForeignKeys.validateOracleForeignKeySourceChanges (cyclomatic 30): oracleForeignKeys.validateOracleForeignKeySourceChanges has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2683867c69a727dd824ddadfbff657858ac24ff79d902412a8e3ef6cdc5f539"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleForeignKeys.prepareOracleForeignKeyPlan (cyclomatic 30): oracleForeignKeys.prepareOracleForeignKeyPlan has cyclomatic complexity 30 (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":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73ec6cd6fb757fbc326306447b3e20dbc58b0f17c29c2892f8380d2fdcf1f87"}},{"ruleId":"D1","level":"warning","message":{"text":"xuguUserPermissions.xuguRevokeSql (cyclomatic 30): xuguUserPermissions.xuguRevokeSql has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"142c554f2ba9c06914a0c95a1740984bb8a26b7ef2c6d5e109570ca0ca1a8c34"}},{"ruleId":"D1","level":"warning","message":{"text":"graphCompletion.buildGraphCompletionItems (cyclomatic 30): graphCompletion.buildGraphCompletionItems has cyclomatic complexity 30 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 14 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletion.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"82296130b410787cf17b2746c420af0a0e47cec17e9c52d5ba1ba18b429d8dac"}},{"ruleId":"D1","level":"warning","message":{"text":"dbeaverImport.buildConnection (cyclomatic 30): dbeaverImport.buildConnection has cyclomatic complexity 30 (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":"apps/desktop/src/lib/imports/dbeaverImport.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ec7b5173301b7b48aa8d36af54b5e578ca7a334114d340c88e8de1975ecf5f"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.collectInnermostObjectKeys (cyclomatic 30): mongoCompletion.collectInnermostObjectKeys has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"9205bab0a160ae065e5d07895ee74cdc65a7938ba9ac930a86d2b38c3bbb49c2"}},{"ruleId":"D1","level":"warning","message":{"text":"primitives.renderInline (cyclomatic 30): primitives.renderInline has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/primitives.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70ec55c4d3ff10c4490c8b7e7433e0e1be04e59b5e435e23cbd2b4eb2c70186"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.extractReferencedTables (cyclomatic 30): sqlCompletion.extractReferencedTables has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e3882c569aca78db4737565632ecea5e2b42382a02c717d3dc3c968fd045f7"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.buildTableItems (cyclomatic 30): sqlCompletion.buildTableItems has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to one function literal inside it that branches (line 5173). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5153}}}],"partialFingerprints":{"codehealthFindingId/v1":"feffff5e9e972cb7c9b6d7469fb86d1f790886bd37c60848f041fd1828a2326c"}},{"ruleId":"D1","level":"warning","message":{"text":"oraclePackageSaveAs.prepareOraclePackageSaveAs (cyclomatic 30): oraclePackageSaveAs.prepareOraclePackageSaveAs has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1816ae878fff9ed67aafd8fa265f846aafade4ebd9a46d4700472518084311"}},{"ruleId":"D1","level":"warning","message":{"text":"tableSelectSql.quoteTableIdentifier (cyclomatic 30): tableSelectSql.quoteTableIdentifier has cyclomatic complexity 30 (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":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e3f4e1178315079b44eb56a0bc5551e8fd02b734e371fe14a8e7103d1f8e40"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.setChildren (cyclomatic 30): connectionStore.useConnectionStore.setChildren has cyclomatic complexity 30 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a43e496d7d050082c6c606117f86d3d0e9323404fbc05524a8f6bfda0ff77d5"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.closeOriginal (cyclomatic 30): plDebugStore.usePlDebugStore.closeOriginal has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dc0408084e2b783b0c69b35c31b08cac91629861b3b16a8e342ef0b8c7a3f4"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.openObjectBrowser (cyclomatic 30): queryStore.useQueryStore.openObjectBrowser has cyclomatic complexity 30 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3913}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2998a496280df298cb4dacb2c962408a615ef0342fd0f955bcb2945d9446f4d"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.buildHiddenPrimaryKeyPreparation (cyclomatic 30): queryStore.useQueryStore.buildHiddenPrimaryKeyPreparation has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7695}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d42cfd7acd5c95e65f4c995c1931d1aa2cd488d4780c5b0e14893fc91574bb7"}},{"ruleId":"D1","level":"warning","message":{"text":"IssueSubmissionLimiter.fetch (cyclomatic 30): IssueSubmissionLimiter.fetch has cyclomatic complexity 30 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 10 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/worker.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"37308d6d17b1750b6b82b0e558c3d2dab7176ecb9cc0bba22dcae32d6438a6f7"}},{"ruleId":"D1","level":"warning","message":{"text":"locate (cyclomatic 30): locate has cyclomatic complexity 30 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 12 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2d789797cd449e8a3cb545b254df776e93f6b09dd41af3ea95c632949ee9e0"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_mongodb_table (cyclomatic 29): dbx_core::data::transfer::transfer_mongodb_table has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":11933}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5c9a9502c18e5723c33be0cf31c1be0bb77e784b9a3eb0c48bb7fbc4a480ec"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::xugu_objects::render_definition_in_scope (cyclomatic 29): dbx_core::data::transfer::xugu_objects::render_definition_in_scope has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e40447f35a27496ff4066792475fe910fbdc6b09c7c9e499d4ced9dc8eb2d9e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_type_data::read_data (cyclomatic 29): dbx_core::schema::oracle_type_data::read_data has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"55acabcac09cc9cce475bdc775bd993fcb0d8b03528da5087f6b5b8dcefe5643"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::sql_words_outside_comments_and_quotes (cyclomatic 29): dbx_core::schema::table_structure_sql::sqlite_rebuild::sql_words_outside_comments_and_quotes has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fed60303bffa62a3ff257c0f820648a5483b5ed1e3d92b6a11be0731cdca52"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_async_url (cyclomatic 29): dbx_driver_mysql::mysql::mysql_async_url has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3262}}}],"partialFingerprints":{"codehealthFindingId/v1":"787557f9538a8b96c776fc9a03e02b92039bcf8705a5b2de32e679ca0ffe58da"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_postgres::postgres::classify_pg_type (cyclomatic 29): dbx_driver_postgres::postgres::classify_pg_type has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6414ce93c88bdb2520a0059b8d2333e2b1fea2db5a3aa7c56a2eb3b52c7d93"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_postgres::postgres::pg_value_to_json_classified (cyclomatic 29): dbx_driver_postgres::postgres::pg_value_to_json_classified has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4885a569b9ef8b2e8f45f5b9c334c43586cd8eb695f21b13664261fdddea340"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::visit_expr (cyclomatic 29): Analyzer::visit_expr has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2bb01ae454ca217942b0374e177e921831303a7c5124945d9184f792dd93ea"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::rebase_oracle_trigger_ddl (cyclomatic 29): dbx_sql_core::object_source_sql::oracle_indexes::rebase_oracle_trigger_ddl has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c055599b5862c2c4a8b1fd8456c15ce8a4a34cc96a68c238d84a9d6b0f6ff6f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::next_executable_sql_token_with_options (cyclomatic 29): dbx_sql_core::sql::next_executable_sql_token_with_options has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3734}}}],"partialFingerprints":{"codehealthFindingId/v1":"902ce18a088c1fc30a3631719d30ad1ca2e4e24f032273b81a3095e23f99e983"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::mysql_statement_references_session_variable (cyclomatic 29): dbx_sql_data::query_result_sql::mysql_statement_references_session_variable has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3446515b31babde647cacd6ec21eb0974ff709c492b729b9763b3875172911"}},{"ruleId":"D1","level":"warning","message":{"text":"StarRocksCreateTable::validate (cyclomatic 29): StarRocksCreateTable::validate has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/create_dialect.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d15be98618aa5d298dcb8fc3cf2dee7c4772058385d2d25797db65550499d4c"}},{"ruleId":"D1","level":"warning","message":{"text":"BlobBoundExecutor.execute (cyclomatic 29): BlobBoundExecutor.execute has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/BlobBoundExecutor.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb93396663215b2381667c9ace5155b4fa24e64f38c69c8f9d7fa8e496f2b65"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.getObjectSource (cyclomatic 29): DbxJdbcPlugin.getObjectSource has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5664}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cc01461a541dcbbfc9f6b7d31980612f19cd7e4623d86d3fe55c627cc2d876"}},{"ruleId":"D1","level":"warning","message":{"text":"Db2ExplainPlan.singleQuery (cyclomatic 29): Db2ExplainPlan.singleQuery has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fa08b6fbfc2adc3725a20e68a3d9ea553fc44e0a2537add221b668bc78f931"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTarget.requiresTypedLobConnection (cyclomatic 29): PlDebugTarget.requiresTypedLobConnection has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1417f6a9f0143df295521721ca151bb743c2269a0586f748067dfb5154cab293"}},{"ruleId":"D1","level":"warning","message":{"text":"main.buildTLSConfig (cyclomatic 29): main.buildTLSConfig has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"393083718550cdac0c0d893f6df0d86e20975d3df2510d385b062a107ad28ffd"}},{"ruleId":"D1","level":"warning","message":{"text":"kerberosConfig.finalize (cyclomatic 29): kerberosConfig.finalize has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/kerberos.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d602b07ac45e27ab96f0fa8d13e4faa5f18127695652955d027d72a0c9b46ea"}},{"ruleId":"D1","level":"warning","message":{"text":"main.buildTLSConfig (cyclomatic 29): main.buildTLSConfig has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff8b22ac2e997ede0dec16fadec9766c9e6f9f274b1adab211088e39ec8f4b5"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugDecodeCollectionEnvelope (cyclomatic 29): main.plDebugDecodeCollectionEnvelope has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_collection_input.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e87b6bf8814888cff82e9d8d60250d94d98e8fcd113a82b38644a5dec17c77"}},{"ruleId":"D1","level":"warning","message":{"text":"main.errorResponse (cyclomatic 29): main.errorResponse has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/rpc_errors.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"965cc41840314a5b1fd33af6859f65e96d533296ab4a3540b62930eb36aa5028"}},{"ruleId":"D1","level":"warning","message":{"text":"server.getExactTriggerSource (cyclomatic 29): server.getExactTriggerSource has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/trigger_metadata.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69341d278fc9e22a01363f336075609eba239fb7f32d20adbf2aa683937cb73"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugSession.setBreakpoints (cyclomatic 29): plDebugSession.setBreakpoints has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"183e14635a24519c2283db5880160b61b9863bd10219dd921843f4be9307f772"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridCanvasRuntime.useDataGridCanvasRuntime (cyclomatic 29): useDataGridCanvasRuntime.useDataGridCanvasRuntime has cyclomatic complexity 29 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridCanvasRuntime.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8a44a180f85ccaf274ab71091412bfad9e78bebcf024789c0fd75f215ca03b"}},{"ruleId":"D1","level":"warning","message":{"text":"useMultiDbTargetSelection.useMultiDbTargetSelection.validateTarget (cyclomatic 29): useMultiDbTargetSelection.useMultiDbTargetSelection.validateTarget has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useMultiDbTargetSelection.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdffd20e9223b56438e12edf3848f07e876c539e5855682dca14c3265960184"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridCellCoercion.parsePostgresArrayText (cyclomatic 29): dataGridCellCoercion.parsePostgresArrayText has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3657888399e368ba805c90df0589ccdacc8951f0b9de454ad680271fdcc6a542"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleConstraints.oracleConstraintDefinitionFromInfo (cyclomatic 29): oracleConstraints.oracleConstraintDefinitionFromInfo has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabd2273347547f91d84704fca891033504c4f152d832b79679a2e36b26449e8"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTriggerPlan.executePreparedTriggerPlan (cyclomatic 29): oracleTriggerPlan.executePreparedTriggerPlan has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (oracleTriggerPlan.executePreparedTriggerPlan::run) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a556a4da0419ca66de57aa6a975913b6507594d569ed3cd1645d802a5131e6a4"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlSemanticSelectionRanges.collectSqlRanges (cyclomatic 29): sqlSemanticSelectionRanges.collectSqlRanges has cyclomatic complexity 29 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60fa1370de1b27192f23444f912153b3a16b939f7803256feab91ee579431a2"}},{"ruleId":"D1","level":"warning","message":{"text":"graphSignatureHelp.getGraphFunctionSignatureHelp (cyclomatic 29): graphSignatureHelp.getGraphFunctionSignatureHelp has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphSignatureHelp.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92d76a94bb2c4ce1dd4ddc9b8b3a1a3dbe0c5db74fd71ba862a30320468bc9a"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.splitMongoSemicolonSeparatedSegments (cyclomatic 29): mongoShellCommand.splitMongoSemicolonSeparatedSegments has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4848c84753f5dffc8a2f6fa409ab2ca7ed3ebfb8e4fbb88be5c996ab7a4787"}},{"ruleId":"D1","level":"warning","message":{"text":"editableQueryHiddenKeys.appendSelectProjections (cyclomatic 29): editableQueryHiddenKeys.appendSelectProjections has cyclomatic complexity 29 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 12 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/editableQueryHiddenKeys.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8d89e2bdc4041f768eb212bdff06d1696a2dc2a291b37c0478385a2821b498"}},{"ruleId":"D1","level":"warning","message":{"text":"rules.hasRuleLineBreak (cyclomatic 29): rules.hasRuleLineBreak has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 6 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 41). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/rules.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aee2e750b538fc3fff36ab43fb555f9dfdb28a5029bc83adafae67a1563c4a6"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.parsePostgresRegclassPrefix (cyclomatic 29): sqlCompletion.parsePostgresRegclassPrefix has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e29ac20a6ad3bb095ecd7cc0605a3b51387daef7d2ce58dcb23f00f701e7b23"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectTriggerPseudoRecordFieldStarts (cyclomatic 29): sqlParameters.collectTriggerPseudoRecordFieldStarts has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d060c2a7a09c6049813f579ba919fbc2a154dafab0f7ab5961cd7373978e8a"}},{"ruleId":"D1","level":"warning","message":{"text":"tableVGroup.findTableVGroupContainerNode (cyclomatic 29): tableVGroup.findTableVGroupContainerNode has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 4 function items inside it that branch (walk, a function literal at line 663, matchesOptional, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce8eabf71d18cf0e66c0d0e8ea769328466da4deab226c290b6d120cec89544"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.searchSidebarObjects (cyclomatic 29): connectionStore.useConnectionStore.searchSidebarObjects has cyclomatic complexity 29 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 8 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2fbea723b17a95de151f5fb0fd44faa4914fe00d11cac428e8ece484533a2e"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadDorisCatalogTables (cyclomatic 29): connectionStore.useConnectionStore.loadDorisCatalogTables has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 9 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 7526). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7502}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ede7f789488ea33157bf88d2ca71067a88d6d88ea6b1d64b9e19387c30a432"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.readPublic (cyclomatic 29): plDebugStore.usePlDebugStore.readPublic has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea543b7503cf63527e02e1d9f85c20e17e413b17b9063139f6beaa11afa51cb"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.captureResultLegacyValuesForExport (cyclomatic 29): queryStore.useQueryStore.captureResultLegacyValuesForExport has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10858}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ddf03c444019bf7bd13d48f4ae13cc83cb4e23c875a6076e46223787e66749"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.resolveResultMetadataForBatch (cyclomatic 29): queryStore.useQueryStore.resolveResultMetadataForBatch has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10954}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a95b3abf7204454d64e35c48293e7663e90406f1090c2273497bdcac0d9eaf2"}},{"ruleId":"D1","level":"warning","message":{"text":"settingsStore.useSettingsStore.initEditorSettings (cyclomatic 29): settingsStore.useSettingsStore.initEditorSettings has cyclomatic complexity 29 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 14 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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce72116da6e60392fde62cdb29623706d604ffa1f6443d2717d5cb2daf7a36d9"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::admin::mq::adapters::rabbitmq::read_thrift_value (cyclomatic 28): dbx_core::admin::mq::adapters::rabbitmq::read_thrift_value has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4f99fb78df43480b87126a24a86260ed8afc721625989309aa1ac692469370"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::pl_debug::transport::reserve_transport (cyclomatic 28): dbx_core::query::pl_debug::transport::reserve_transport has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/transport.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38e8dfb5dce7411783e120677cf36946e21f7af81da980a93c67138c917bb75"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::verify_effect_with_extra (cyclomatic 28): dbx_core::schema::native_jobs::operations::verify_effect_with_extra has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6f0b8e8e70b9dbc7f271fe12616817b34badd812936bf083fbed710d7efb85"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::dameng::parts::verify (cyclomatic 28): dbx_core::schema::native_jobs::operations::dameng::parts::verify has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng/parts.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9f92e49f1c7d570b871d2ec1d1f63a835319a9353e68d07975c8bdb0ddad02"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_type_management::object_metadata (cyclomatic 28): dbx_core::schema::oracle_type_management::object_metadata has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_management.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"69defd99a0b8c41fb83bd9de4d8acad728f85b5a62d893b5a4bb85157bfe3842"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::find_create_table_body_span (cyclomatic 28): dbx_core::schema::table_structure_sql::sqlite_rebuild::find_create_table_body_span has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b1735159cb61fd0e9eaf537913c54a8e7c158823da321bbbb60e2e0ca9bd0d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::rewrite_oracle_routine_self_references (cyclomatic 28): dbx_sql_core::object_source_sql::rewrite_oracle_routine_self_references has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9e2fba24abb766026e9c82ad2b5c981f4355a66472c1632aa81d6845fa4f7c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::oracle_trigger_metadata_matches (cyclomatic 28): dbx_sql_core::object_source_sql::oracle_indexes::oracle_trigger_metadata_matches has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2b50cc258fede223ffaeb69ef47fc31d059adec31ca1b89283ebc62a1fd39d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::mysql_charset::without_create_charset (cyclomatic 28): dbx_sql_schema::schema_diff::mysql_charset::without_create_charset has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/mysql_charset.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e485eef4776c3f69a267c4436fb7e267c3dc40948e7f7d64ddf005122813678c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::indexes::build_index_sql (cyclomatic 28): dbx_sql_schema::table_structure_sql::indexes::build_index_sql has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/indexes.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b5bbbb6fd566d3b417fdd316edf9c3426867802ad20d72cc7309bfa78ec141"}},{"ruleId":"D1","level":"warning","message":{"text":"KafkaAgent.peekMessages (cyclomatic 28): KafkaAgent.peekMessages has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bc0cef635488df2bd3848d8454117b26cbb48a827c003c5b114c400f90b9ad"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTarget.lobInput (cyclomatic 28): PlDebugTarget.lobInput has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efb17c94c6811427be9b57bad64f5bb17cfba2d1eebd58fd7dc44e03cabf0ff"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseConnectionConfig (cyclomatic 28): main.parseConnectionConfig has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"16290d45f7b7cedcf2d5ca8c23ea01098ef2c17f39a2a2c248d8528df397dbb4"}},{"ruleId":"D1","level":"warning","message":{"text":"server.getObjectSource (cyclomatic 28): server.getObjectSource has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3702}}}],"partialFingerprints":{"codehealthFindingId/v1":"becade3ffb344505be1b33db17849e2c39ff54e50a96fd009a1557fa6c47a881"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.executeTarget (cyclomatic 28): plDebugNativeEntry.executeTarget has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 621, 682, 672). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a84af7410f0d0ac3e82e75c841ee32a8e5f1c405caa870cbacd346861b15be"}},{"ruleId":"D1","level":"warning","message":{"text":"SPNEGORoundTripper.RoundTrip (cyclomatic 28): SPNEGORoundTripper.RoundTrip has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/gosasl/http_spnego.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"14322c8dbb209abe00b9622d8268eba46af340929823d9135edaddf532f0a38e"}},{"ruleId":"D1","level":"warning","message":{"text":"ddlStorage.stripOracleStorageAttributes (cyclomatic 28): ddlStorage.stripOracleStorageAttributes has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8a9f7fa8ed5b3c6906678d8d688cf567e3a3679f7051a938d8172d984a4a5e"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.skipBalancedParens (cyclomatic 28): sqlStatementRanges.skipBalancedParens has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a33f45a8451a94e27a83158bcab895391fc10713576dea53646e99571054a53"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridColumnFormatter.useDataGridColumnFormatter.loadFormatterForeignKeyColumns (cyclomatic 28): useDataGridColumnFormatter.useDataGridColumnFormatter.loadFormatterForeignKeyColumns has cyclomatic complexity 28 (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":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cef98ec1db265070595490236cd203c5055658ae418758e6a91ee25e57bde0"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridLargeValues.useDataGridLargeValues.resolveLargeValueCells (cyclomatic 28): useDataGridLargeValues.useDataGridLargeValues.resolveLargeValueCells has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7db06ee10e8fcc06139db27f642914919af39b80d428c1fb0974737a1c7351"}},{"ruleId":"D1","level":"warning","message":{"text":"useNavigationTargets.useNavigationTargets.onStructureEditorSaved (cyclomatic 28): useNavigationTargets.useNavigationTargets.onStructureEditorSaved has cyclomatic complexity 28 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c08c1daf385b4714331818457d4a662f151481f6c853245a807109f743f874"}},{"ruleId":"D1","level":"warning","message":{"text":"documentStoreProvider.parseMongoFilterValueAs (cyclomatic 28): documentStoreProvider.parseMongoFilterValueAs has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f82b68cb8dee3d9ca49909e915ac62bb822a09d66ae517d2ce0ea6198adf28"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionParameterDocument.parseConnectionParameters (cyclomatic 28): connectionParameterDocument.parseConnectionParameters has cyclomatic complexity 28 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionParameterDocument.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca7e6a2e3461861924d04dcca6a93c8bcf2eea1491915a3ae76fd2e9eaa1c76"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionPickerTree.buildConnectionPickerRows (cyclomatic 28): connectionPickerTree.buildConnectionPickerRows has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 9 of the 28 points are its own statements and the rest belongs to 3 function items inside it that branch (visitSearch, visitTree, subtreeHasConnection). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionPickerTree.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7af607fd41fd1c53a13121c230695949015232d662b55db3377c96b7d898015"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionUrl.urlParamsRequireTls (cyclomatic 28): connectionUrl.urlParamsRequireTls has cyclomatic complexity 28 (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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"868ac93bb524fde16bc64a6120349c488e00529f7be34428606a33a101ffc7dd"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridInsertPaste.readTableReferenceToken (cyclomatic 28): dataGridInsertPaste.readTableReferenceToken has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e86791970e0e8367dc30678d57d464f560219f2ad62f4702b55c59e1753317"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleIndexes.prepareOracleIndexPlan (cyclomatic 28): oracleIndexes.prepareOracleIndexPlan has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a599f14741765e5f02bce0fcdf79a24535f68ee2cb387014774a04a7bb0f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"codemirrorCurrentStatementFrameLayer.currentStatementFrameRect (cyclomatic 28): codemirrorCurrentStatementFrameLayer.currentStatementFrameRect has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorCurrentStatementFrameLayer.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3059b94a6f7cfe7827e00d6ea5aeeb6106603068b42c67ee0adfc42b3b6c67d"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.validateBulkWriteOperations (cyclomatic 28): mongoShellCommand.validateBulkWriteOperations has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee9b9cf6ea713ef115bf37921f068cef12d1efbf9a543b242f445b0df1cb2d2"}},{"ruleId":"D1","level":"warning","message":{"text":"nacosAdmin.normalizeNacosEndpoint (cyclomatic 28): nacosAdmin.normalizeNacosEndpoint has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0657db1d03f3c22f03d579fb161b5bb8d8f32f97e5f789e7a76726f3e484ee81"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginAiCompletion.createPluginAiCompletion.runGeneration (cyclomatic 28): pluginAiCompletion.createPluginAiCompletion.runGeneration has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginAiCompletion.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd78aca1d83445f58cf63fbbb3d2ba06bc3da5756f3ad05be862a7ece48129b"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.findMatchingParen (cyclomatic 28): sqlCompletion.findMatchingParen has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4527}}}],"partialFingerprints":{"codehealthFindingId/v1":"67861d959139aeededf44121da691234afedb35a0e74fa7ec91275dc915e8b0e"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.splitTopLevel (cyclomatic 28): sqlCompletion.splitTopLevel has cyclomatic complexity 28 (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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4802}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c15dc3ca6fb27ccab5404005ea92629e69d7c0ba39f413f299812af4f7139a9"}},{"ruleId":"D1","level":"warning","message":{"text":"oraclePackageSource.tokens (cyclomatic 28): oraclePackageSource.tokens has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSource.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd29e058f8e37b8d737e7e6a4b3902d1147bcbcd4571de75f240bb09a471446f"}},{"ruleId":"D1","level":"warning","message":{"text":"starrocksLayoutCopy.buildStarRocksLayoutCopyDdl (cyclomatic 28): starrocksLayoutCopy.buildStarRocksLayoutCopyDdl has cyclomatic complexity 28 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 13 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksLayoutCopy.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b128dcbcf840529f54998f49321ca65b95beaf9f76e9305edfa3bfc33e73ea"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.appendQueryResultSegment (cyclomatic 28): queryStore.appendQueryResultSegment has cyclomatic complexity 28 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe691c33e2a6571c97c19e342c85ff6d36d555edc62b8cb4f14fa4d0b692037a"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.applyLoadedObjectSource (cyclomatic 28): queryStore.useQueryStore.applyLoadedObjectSource has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3648}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0707f30c26e4e92e256449fb0e5ca418202526dc66862c2fd43d5eedb277b3"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.resolveQueryDisplayMetadata (cyclomatic 28): queryStore.useQueryStore.resolveQueryDisplayMetadata has cyclomatic complexity 28 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7867}}}],"partialFingerprints":{"codehealthFindingId/v1":"28656256582eeb0f3e503e82b5791f40bb8cb6fdbdaf35fc1d233579a0cee785"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_cli::run_query (cyclomatic 27): dbx_cli::run_query has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/main.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8ab06ec8620596a8b13fb4cdae8f4f94be4fea5ca481699016bf4e414c642d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::xugu_objects::prepare (cyclomatic 27): dbx_core::data::transfer::xugu_objects::prepare has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f443c4e11614be577309ccd23707b17e4324058171ccef5c02a9103746dd42"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::request_large_value_internal (cyclomatic 27): dbx_core::query::request_large_value_internal has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":3540}}}],"partialFingerprints":{"codehealthFindingId/v1":"941aba54153e18fb3c0c9e37e4866f33ec83935f6ee2e47b1a158c59040ec90f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::render_sqlserver_table_ddl_details (cyclomatic 27): dbx_core::schema::render_sqlserver_table_ddl_details has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":19243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c99637434d1bafec2791935ef48246ab7c587f0861b3742146ccc2e5c60f9db"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::split_entry_ranges (cyclomatic 27): dbx_core::schema::table_structure_sql::sqlite_rebuild::split_entry_ranges has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dbb696e75976fb20576bd26c442c5eb09bd54f7f2df07034094fb8ba3b4ea3"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::sqlite::normalize_sqlite_sql (cyclomatic 27): dbx_drivers::db::sqlite::normalize_sqlite_sql has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2780}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e68c92c5de9ac1544140dec0056fab4b8c3bcc7833d08fb2eb5f7d4bf5e4ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::build_data_grid_copy_insert_statements_with_formatters (cyclomatic 27): dbx_sql_data::data_grid_sql::build_data_grid_copy_insert_statements_with_formatters has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"526e2702d3cfa893c2962cd8b912ef79b59057ba2aebffd11ead3727046fce1e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_types::models::connection::normalize_postgres_url_params (cyclomatic 27): dbx_types::models::connection::normalize_postgres_url_params has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a87bdccef62c591e82f9b23216ed23535a8ff9581e55b72ceb7ca48b2a7091"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.oracleColumnDataType (cyclomatic 27): DbxJdbcPlugin.oracleColumnDataType has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":6202}}}],"partialFingerprints":{"codehealthFindingId/v1":"693c1e0c58197b3d9b554aa918838e76ae03f2de549a11c73b22ae4e8cd87433"}},{"ruleId":"D1","level":"warning","message":{"text":"OceanBaseOracleAgent.formatDataType (cyclomatic 27): OceanBaseOracleAgent.formatDataType has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab045992aa5b5f958a6046eef044463452695e53a5bd0869effbcd01bbef073"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugCompositeOutput.child (cyclomatic 27): PlDebugCompositeOutput.child has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeOutput.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daaf0fb9fa2f37923c1177fc56de246b588b319fb04178bbb6a5df60b367a6b"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTarget.load (cyclomatic 27): PlDebugTarget.load has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea4323dcc5010c30ab7948ac35dc43be2e933579bdd60ded6df942d94426d47"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseConnectionConfig (cyclomatic 27): main.parseConnectionConfig has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5e6ec554b5971ed4d00b9f01dd28a650ed889256bc93ae395f26282ac43ee2"}},{"ruleId":"D1","level":"warning","message":{"text":"etcdSession.leaseList (cyclomatic 27): etcdSession.leaseList has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/lease.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd5d6064567ee5f9139a26145a9c53e5f8712adb305a43442ac5cd990709649"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugEvaluateCondition (cyclomatic 27): main.plDebugEvaluateCondition has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_condition.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a4fe247e4a54789d443368f368deab6469a601d715428a22d112be87fb3b2e"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugLegacyCollectionElementMatches (cyclomatic 27): main.plDebugLegacyCollectionElementMatches has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_type_graph.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"960e6e6419af00208ab759e81906549084f054e0c30af7bcbb6a79ec8535cbb9"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeSelectConstructor (cyclomatic 27): main.plDebugNativeSelectConstructor has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_object_select.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c39c2a651df90aecdc646bd25ae765da995883ddf0e9b1eb75e73b9daa38b9"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugDecodeTimezoneInput (cyclomatic 27): main.plDebugDecodeTimezoneInput has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_timezone.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1263e9095014da539267771e04e121af0f5aafa60928ee9decbb38ee330959e"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugLobOutput.collect (cyclomatic 27): plDebugLobOutput.collect has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 125). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_lob_output.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76acf0654a7fab134392351c54e7fba39784a207a0357d56b04ea4fa6d41a47"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.driveNativeEntry (cyclomatic 27): plDebugNativeEntry.driveNativeEntry has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_entry.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"69910a6533763acf0469194d16b8d435e29f6a9a6f07d8015c8b69ef67041a1d"}},{"ruleId":"D1","level":"warning","message":{"text":"main.convertObjectKeyedInt64Map (cyclomatic 27): main.convertObjectKeyedInt64Map has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b5e4a19c33c5dfef6309ceba50e9efb210303e963df12c967cc60cb6fc53e7"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.completionOptionForItem (cyclomatic 27): useQueryEditorCompletion.useQueryEditorCompletion.completionOptionForItem has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b72cd65628829f5e35a2c898967221633acd8e5194de1df9a367cf8918dcd3"}},{"ruleId":"D1","level":"warning","message":{"text":"useCellDetailEditor.useCellDetailEditor.create (cyclomatic 27): useCellDetailEditor.useCellDetailEditor.create has cyclomatic complexity 27 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useCellDetailEditor.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bc8b63dce21a35648fd2091011bf9ed3f0c2e3792cde5873dd12a9f125e5f2"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGenerateSession.streamInsertTable (cyclomatic 27): useDataGenerateSession.streamInsertTable has cyclomatic complexity 27 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGenerateSession.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d072ac5ed411e290a9e644a68278fed8f691a664f2783f5b277392073157fbe7"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridActions.useDataGridActions.onSort (cyclomatic 27): useDataGridActions.useDataGridActions.onSort has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cf9b54c6d1d0328f8574c7ce7ee12c12f2ab9171240bc37ac8f24a5b9af8ca"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportCsv (cyclomatic 27): useDataGridExport.useDataGridExport.exportCsv has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1562, 1585). 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d20af666f1e553c92fd47fd8a4babdc1793a24dfb8500ffc0030cbfb152c1de"}},{"ruleId":"D1","level":"warning","message":{"text":"useExportTracker.useExportTracker.cancelTask (cyclomatic 27): useExportTracker.useExportTracker.cancelTask has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e77124564a51b7c551867d7358178276b7bc4900dddb6f39b1f03acb00792f"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionParameterDocument.writeConnectionParameters (cyclomatic 27): connectionParameterDocument.writeConnectionParameters has cyclomatic complexity 27 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 13 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionParameterDocument.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71a9394d542f30d886229a28372e7480273b2429b7e106b3ee7af48dccea01a"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridColumnType.resolveDataGridTypeVisualKind (cyclomatic 27): dataGridColumnType.resolveDataGridTypeVisualKind has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnType.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6656db039e078fda92d01b88f8a03e49cb2aabc96ceecb59bece87c3e436b3"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridInsertPaste.readBracketedGroup (cyclomatic 27): dataGridInsertPaste.readBracketedGroup has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bb1918890fdb618649c4e3bc24f6a2e43ac620dd0ec0ec2ce8c5e15cc69674"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridSelectionPersistence.captureDataGridSelection (cyclomatic 27): dataGridSelectionPersistence.captureDataGridSelection has cyclomatic complexity 27 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSelectionPersistence.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbec407d092075979c3e5899318b5da923fdcfbdd90564212b896b21967e162c"}},{"ruleId":"D1","level":"warning","message":{"text":"databaseAuthorizationPlan.buildGrantAuthorizationPlan (cyclomatic 27): databaseAuthorizationPlan.buildGrantAuthorizationPlan has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"249b68682a50a895764eeb9794ac57d95782e3c2d6d66363ff6d859ec4dd5d64"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeJobAdmin.nativeJobProgramArgumentLayout (cyclomatic 27): nativeJobAdmin.nativeJobProgramArgumentLayout has cyclomatic complexity 27 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 13 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff11c143247214f494a03b0a3ad3415adddb82659fcc9a6914c7283783a496c0"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleIndexes.oracleIndexSnapshotMatchesLoadedColumns (cyclomatic 27): oracleIndexes.oracleIndexSnapshotMatchesLoadedColumns has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 131, 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":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a67c33e59fc6c9c605614fccbbedcba1f0a8d4396ec60b22362e04729144017"}},{"ruleId":"D1","level":"warning","message":{"text":"dataDictionaryExportTask.startDataDictionaryExport (cyclomatic 27): dataDictionaryExportTask.startDataDictionaryExport has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 43, 91, 67, \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":"apps/desktop/src/lib/docs/dataDictionaryExportTask.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded2d23a910a2b64d46314a89fed483aecba87037f66d63fb225fb57245a7853"}},{"ruleId":"D1","level":"warning","message":{"text":"codemirrorSqlAliasHighlights.createSqlAliasHighlights (cyclomatic 27): codemirrorSqlAliasHighlights.createSqlAliasHighlights has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorSqlAliasHighlights.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45f695a78c25cf94e6f9537b5877ecff6d173dc5b0289b486163a42cb626d8b"}},{"ruleId":"D1","level":"warning","message":{"text":"shortcutDisplay.shortcutKeyLabel (cyclomatic 27): shortcutDisplay.shortcutKeyLabel has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/shortcutDisplay.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"53118bb45688381c8b94b6a8d84fc7c1caf17e2e715b37a76e8b57c2186d4e21"}},{"ruleId":"D1","level":"warning","message":{"text":"gridSnapshot.renderGridSnapshotHtml (cyclomatic 27): gridSnapshot.renderGridSnapshotHtml has cyclomatic complexity 27 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/gridSnapshot/gridSnapshot.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e74a2db39ec4b3d70d5cee418424ae781d3b84fde1156f5a1222e6831b8de20"}},{"ruleId":"D1","level":"warning","message":{"text":"nacosConfigValidation.validateHtml (cyclomatic 27): nacosConfigValidation.validateHtml has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosConfigValidation.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ba4cc278b6ac8ba4c5a89e2d3819b9daab5b6a4981b317023df97adda6df56"}},{"ruleId":"D1","level":"warning","message":{"text":"editorSettingsDraft.normalizedDraftValue (cyclomatic 27): editorSettingsDraft.normalizedDraftValue has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/editorSettingsDraft.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d902b532588d472a99f6a738081f62385beed6217d5af8cf0cee912d3f755a7c"}},{"ruleId":"D1","level":"warning","message":{"text":"treeNodeClick.treeNodeRowDoubleClickAction (cyclomatic 27): treeNodeClick.treeNodeRowDoubleClickAction has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6121cbee1d15eb4c25eec803c448711243143c471232298bdaca082e60a7cd8"}},{"ruleId":"D1","level":"warning","message":{"text":"solrAdmin.buildSolrQuery (cyclomatic 27): solrAdmin.buildSolrQuery has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/solr/solrAdmin.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"193c30de85e0fa16d10024784732b5ceabeb589ace0de5e4638a30acb043a708"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printClause (cyclomatic 27): printer.printClause has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 10 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 85, 99). 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":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d67566a25fa339e139f10cac55854eab3eba0ac6ac2234a9664b621a47556c"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlAnalysis.analyzeEditableQueryEditability (cyclomatic 27): sqlAnalysis.analyzeEditableQueryEditability has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7e07b34de340afb8e7a8a12eb98ede35169b6788f1d76a68c8b1e955dede83"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.parseTrailingIdentifierPart (cyclomatic 27): sqlCompletion.parseTrailingIdentifierPart has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c33d79d564ecce44d7d1315b47458eabfda5f58e300011ac3a2c54d47f362b"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.scanCteDefinitions (cyclomatic 27): sqlCompletion.scanCteDefinitions has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4667}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd425406850ada0727e8ce3e7c03225845694778f635f5680f58a00891e4ce8"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.objectMatchesCompletionContext (cyclomatic 27): sqlCompletion.objectMatchesCompletionContext has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5506}}}],"partialFingerprints":{"codehealthFindingId/v1":"61505a942eaed157e43bc33aa80b95da7ed24d98b3343ff41c1ab7e2020b002d"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineWrite.prepareOracleRoutineSourceSave (cyclomatic 27): oracleRoutineWrite.prepareOracleRoutineSourceSave has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 9 of the 27 points are its own statements and the rest belongs to 3 function items inside it that branch (execute, a function literal at line 75, a function literal at line 138). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineWrite.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2c1349d8cd2934dced853f06c5c06962b7b2da7485f0198a423065eeb2ba30"}},{"ruleId":"D1","level":"warning","message":{"text":"routineDefinitionSave.routineDefinitionKind (cyclomatic 27): routineDefinitionSave.routineDefinitionKind has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineDefinitionSave.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e34f0cf5576a9f7fbd4ccb55f22a3f4afd735c3363d153cd0767dcbbee8e656"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.isReusableTreeSnapshot (cyclomatic 27): connectionStore.useConnectionStore.isReusableTreeSnapshot has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3757}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fe4cd2880a554355527b5641ab1b0ea4da9664fc6f6bd81ab2ba89143132ca"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.loadDdlViewerTab (cyclomatic 27): queryStore.useQueryStore.loadDdlViewerTab has cyclomatic complexity 27 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3730}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04b84f7f8ffef51940c2cb53172b7c60c882ac6b403ba2ef755dced720a77da"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.closeTab (cyclomatic 27): queryStore.useQueryStore.closeTab has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5317}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa6eddc99f86643128865a8946d82d064b652a4553820ab1b755a42ad5d8e7a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_duckdb_driver::sql::rewrite_duckdb_current_date_literal_arithmetic (cyclomatic 26): dbx_duckdb_driver::sql::rewrite_duckdb_current_date_literal_arithmetic has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"124dc9d03f5c6c662daa246faf0773171cefe53f9ef5bb37ab5557ce55b447da"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::insert_connection_pool_inner (cyclomatic 26): AppState::insert_connection_pool_inner has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dbx_core::connection::close_pool_kind_inner (cyclomatic 34) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d7f9e402223b4404e3755ce7955561e6bd7b04bad19a378fa6333f43897a02"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeJobRegistry::remember (cyclomatic 26): NativeJobRegistry::remember has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/service.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10025629187a8d97f2b71896ab3eb8a248368f98d011e125db5c8b907169429"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::persistence::cloud_sync::build_sync_snapshot_with_selection (cyclomatic 26): dbx_core::persistence::cloud_sync::build_sync_snapshot_with_selection has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d8e9664399b8c81e3f3e20985f77753e72603d37477852bf89baa3dfc57c22"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::execute_multi_core_with_options_for_client_and_progress_typed_inner (cyclomatic 26): dbx_core::query::execute_multi_core_with_options_for_client_and_progress_typed_inner has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":4038}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd395628590d5521be508e83edbc57fd0cee79f374a8ff2aaf4a95da6a265c0"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::list_databases_once (cyclomatic 26): dbx_core::schema::list_databases_once has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c61d3463a883bf0fa3fb7c5277e575cef453d5ef8fd06b3dc6f315908ee0f4"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::scheduler::run_create (cyclomatic 26): dbx_core::schema::native_jobs::operations::scheduler::run_create has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"146bedfbbdee97e552286b851944acf0adc4e74b9a7b844bdd2842eb2f3987ec"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_table_triggers::enrich (cyclomatic 26): dbx_core::schema::oracle_table_triggers::enrich has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_table_triggers.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea3d793ae827b5ba602455131144c76970b4cf7a53df1e051489868058054af"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_agent::agent_offline_export::append_jre_tree_with_limits (cyclomatic 26): dbx_driver_agent::agent_offline_export::append_jre_tree_with_limits has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"6753b408dd605b0b80a8039d52d7679c6e65150863a359ead64f0a7df343d4a9"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::parse_bulk_write_operation (cyclomatic 26): dbx_driver_mongodb::mongo_shell::parse_bulk_write_operation has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba6872f697f3ba320099d167d9535bae0eaf4f8fa3318764a3af464703c5f5d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::trim_mongo_outer_comments (cyclomatic 26): dbx_driver_mongodb::mongo_shell::trim_mongo_outer_comments has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a2689abdd4b9a3650d927ada4b923c403572c4553add1ede30a62ec2d2f5e8"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::find_if_not_exists_clause (cyclomatic 26): dbx_driver_mysql::mysql::find_if_not_exists_clause 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. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7735}}}],"partialFingerprints":{"codehealthFindingId/v1":"646fbd5b76bb17119e3e44a0b26b6e6af74f92984d2030974811e3cc1d453138"}},{"ruleId":"D1","level":"warning","message":{"text":"SshConfigLoader::parse_lines (cyclomatic 26): SshConfigLoader::parse_lines has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/ssh_config.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc970e1b0f521dd26e40972579a1563fa1803b972f4adab95200a4e2cabc9e1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::cloudflare_d1::sql_lexer::lex_sql (cyclomatic 26): dbx_drivers::db::cloudflare_d1::sql_lexer::lex_sql has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1142d0e2fb44b9f8113b4616df45156a1ed266743fb79524807de9e584a0cee"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::sqlite::parse_sqlite_autoincrement_pk_columns (cyclomatic 26): dbx_drivers::db::sqlite::parse_sqlite_autoincrement_pk_columns has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66e611e1933a9fa035270053b1a036c97789fd2b4da29c830b4f3c28910e688"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_routines::analysis::package::parse_specification (cyclomatic 26): dbx_sql_core::object_source_sql::oracle_routines::analysis::package::parse_specification has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a634761817b753e52ccfd2bdcf8467f97d339384cf42ee952e79ac5c41135e9f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::build_data_grid_rollback_statements (cyclomatic 26): dbx_sql_data::data_grid_sql::build_data_grid_rollback_statements has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8477b6d664eef4267bb54b935806c21fc359160cf5b9f21d9998d1fbb094e1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::order_diffs_for_execution (cyclomatic 26): dbx_sql_schema::schema_diff::order_diffs_for_execution has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6557}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86dc570c93812b285793ecf8bf8f9ec405c2a5cb686247c5a7be3021ab59b52"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleTriggerReader.summary (cyclomatic 26): OracleTriggerReader.summary has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a62e3e0646e737d2b28ff616a883f5d4e54829f8d654727bce3cdf1acbae66"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeLegacyJobSession.prepare (cyclomatic 26): NativeLegacyJobSession.prepare has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/NativeLegacyJobSession.java"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0883dc643fec76e0d3b2d94f14ab0d16125a812f0300085a8dc094a46392f8c7"}},{"ruleId":"D1","level":"warning","message":{"text":"MongoAgent.configureBuilder (cyclomatic 26): MongoAgent.configureBuilder 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. This is NOT this file\u0027s highest cyclomatic complexity: MongoAgent.dispatch (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e825b82f90a5b14493d697affb246fafb64d0460e5c44d2e6425ea60701eb353"}},{"ruleId":"D1","level":"warning","message":{"text":"OceanBaseOracleAgent.completionAssistantPackageMembers (cyclomatic 26): OceanBaseOracleAgent.completionAssistantPackageMembers 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e12067f648fb40bfc148ada8b8e4fc441a88e6e58720a101654b4eee9f4146c"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugLegacyPackageDeclarations (cyclomatic 26): main.plDebugLegacyPackageDeclarations 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":"agents/drivers/oracle-go/pldebug_legacy_declarations.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7bc17490a6ee8937ad51ed2a0e409e84bcf23a9ce56884f02e39b01717a6c8"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeTimezoneResult (cyclomatic 26): main.plDebugNativeTimezoneResult has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_timezone.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"078fbc2990fc55e6402de4ca916f6271882c80c0967315701322d79006da5ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.recoverOutput (cyclomatic 26): plDebugNativeEntry.recoverOutput has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a741b20378795db0eed3d7c530ca9c8cb43ec0bed96d81756a7c6c5ad907ef56"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeRoutineScan.identify (cyclomatic 26): plDebugNativeRoutineScan.identify 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":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"815e83d4789ea40d4faf1be18b81a3d68d1321a2507f9cfb4290c4e29d2b5a48"}},{"ruleId":"D1","level":"warning","message":{"text":"main.renderXuguPartitionDDL (cyclomatic 26): main.renderXuguPartitionDDL 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":"agents/drivers/xugu/main.go"},"region":{"startLine":4984}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44c1c0787b413f8ae913c8a64b826f2b3971317d6b05dbe67d2a44f44c0d99f"}},{"ruleId":"D1","level":"warning","message":{"text":"main.classifyRPCError (cyclomatic 26): main.classifyRPCError 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":"agents/drivers/xugu/protocol_error.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"47673498ee7007309c92965a4fba34f72925e660c0fe6597b6dfea31d67cf5e7"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.completionItemsForBypassedFilter (cyclomatic 26): useQueryEditorCompletion.useQueryEditorCompletion.completionItemsForBypassedFilter has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 5 of the 26 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 452, 464). 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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f3625287051524b6e3f9cb893bc52b91b3ba7db0408edd24c1116206f38d7a"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.provideGraphCompletions (cyclomatic 26): useQueryEditorCompletion.useQueryEditorCompletion.provideGraphCompletions has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2276c59df0d6e286bc8ea1511a2e1edae9435c151ce53d9ad29d3aba0356a1"}},{"ruleId":"D1","level":"warning","message":{"text":"transferStrategy.createTransferSubmission.start (cyclomatic 26): transferStrategy.createTransferSubmission.start has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/transferStrategy.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc7c996f66239554c7c851db4c148bfa29a45a18633069802f6039a404b1c0c"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridConditionEditor.useDataGridConditionEditor.loadSuggestions (cyclomatic 26): useDataGridConditionEditor.useDataGridConditionEditor.loadSuggestions has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c832f11c16ce9a06b09114a757c978daf62fbc1f9abb62762085c2d1fa2a9d6"}},{"ruleId":"D1","level":"warning","message":{"text":"errorUtils.normalizeBackendErrorAtDepth (cyclomatic 26): errorUtils.normalizeBackendErrorAtDepth 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":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"35025528856d225d99b965df257e518744819acd7271be2cda7656b084cb960e"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeJobAdmin.buildNativeJobDefinitionCreate (cyclomatic 26): nativeJobAdmin.buildNativeJobDefinitionCreate has cyclomatic complexity 26 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 13 belong to 7 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a75d59a76c1c3318bad2758bfc1a7741a40c2a79a9521a0defd8fff464f7444"}},{"ruleId":"D1","level":"warning","message":{"text":"historyRestoreTarget.resolveHistorySqlRestoreTarget (cyclomatic 26): historyRestoreTarget.resolveHistorySqlRestoreTarget has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/history/historyRestoreTarget.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0795ef746bc4901c1a8a17e5fc2fad6dd9005e3339f655195cf09f2170fb1d17"}},{"ruleId":"D1","level":"warning","message":{"text":"influxDbV1Delete.resolveInfluxDbV1DeleteTarget (cyclomatic 26): influxDbV1Delete.resolveInfluxDbV1DeleteTarget 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":"apps/desktop/src/lib/influxdb/influxDbV1Delete.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5818d28209d2f232cbbb68ff8de97200b079706fdf5a195aaf75b23a7c21c3d5"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.classifyCursorInCall (cyclomatic 26): mongoCompletion.classifyCursorInCall 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. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f949af6ed0bd82308601180926d21daab1681e822b99bd873d1ccaba11506b0"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoDocumentValues.renderMongoShellLiteral (cyclomatic 26): mongoDocumentValues.renderMongoShellLiteral 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":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a859366e31b1dc7472271179929fa7286239e5f5850bdc24d92e98c0c0f6819"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginFloatingWindow.parseFloatingWindowRequest (cyclomatic 26): pluginFloatingWindow.parseFloatingWindowRequest has cyclomatic complexity 26 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3edea93ab434d8de35f47b364bf2475d621ad34e635ed5c4464456fa81ccc8"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultBatchInsert.batchResultInsertRequest (cyclomatic 26): queryResultBatchInsert.batchResultInsertRequest has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/query/queryResultBatchInsert.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e594854e040e3f51f91814404e7305f5bd590b42962a88b3780add8a173b804"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineDeploy.matchesPendingTransferInput (cyclomatic 26): oracleRoutineDeploy.matchesPendingTransferInput has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 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":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5381e603f8178aad161727a83101d6449a4789d8ffd583478a661eed2232745e"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaDiffDdlNormalize.stripSchemaFromSql (cyclomatic 26): schemaDiffDdlNormalize.stripSchemaFromSql has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffDdlNormalize.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaef747eb550cceb740347700b340ad86a81bd85b63acbb27baab34f7999463"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.activeSingleQuotedLiteralStart (cyclomatic 26): sqlCompletion.activeSingleQuotedLiteralStart 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b173e4d70e5ef59e14fbda7e7e181d30fc0b5b1ef072c3b1b58feea16db6f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectNativeSqlServerParameters (cyclomatic 26): sqlParameters.collectNativeSqlServerParameters 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6830654a7b77a7a7cb5046e047d42a1c6dbda9e2ee93b9019ace9ee28885f254"}},{"ruleId":"D1","level":"warning","message":{"text":"routineParameters.jdbcRoutineParameterType (cyclomatic 26): routineParameters.jdbcRoutineParameterType has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1862db526c68fd2ec309146cd2afbd19ea05a5320f4a1a0d61ea43184b682335"}},{"ruleId":"D1","level":"warning","message":{"text":"tableStructureEditorState.isDataTypeLengthDisabled (cyclomatic 26): tableStructureEditorState.isDataTypeLengthDisabled has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b3c5b50350bd887749dea71e9f0bbe0cb32052ecdb384c4641d2d7c9e5ce9b"}},{"ruleId":"D1","level":"warning","message":{"text":"tabPresentation.statementExecutionMarkers (cyclomatic 26): tabPresentation.statementExecutionMarkers has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27ae7583e16abd3c50fc7282fe24955a856dc05c83855db7f469bde0075fdaa"}},{"ruleId":"D1","level":"warning","message":{"text":"server.requireAiRecommendationUpdate (cyclomatic 26): server.requireAiRecommendationUpdate has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0561256cc67f7aad2cf6db35e34e3e18cb44c425bfe98c85372e74326b6874"}},{"ruleId":"D1","level":"warning","message":{"text":"publish (cyclomatic 26): publish 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":".github/ui-preview/publish.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"374edb377df386ab72bd6708ca584ab5af6c61c8b82913de80b3077b62cde0b5"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_duckdb_driver::sql::split_sql_statements (cyclomatic 25): dbx_duckdb_driver::sql::split_sql_statements has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"187b80bb33cfa7e715ae74df009232df6ae1514896fbf7b3b0351c4ef8a67e0b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::data_compare::build_sampling_select_sql (cyclomatic 25): dbx_core::data::data_compare::build_sampling_select_sql has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f891d3accffe5ce6d89c6fc641d84fd42cce316cd2697ff314a9f9130ff55e5"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::stream_rows_in_manual_transaction_with_cancel (cyclomatic 25): dbx_core::query::stream_rows_in_manual_transaction_with_cancel has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":7416}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c32f82d8486dbf2dad3f56e9b5c9a222dee05c44cf8004e76a99b5279cd236"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::safety::production_safety::append_sql_target_safety_text (cyclomatic 25): dbx_core::safety::production_safety::append_sql_target_safety_text has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0d189ef3154429a5fbe61f79beea2cacc93e630d511e07788f32efe304456a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::legacy::run_create (cyclomatic 25): dbx_core::schema::native_jobs::operations::legacy::run_create has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/legacy.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2d6e7047fcd6304cc61ce2b5462c2ba9e950cab7b1bdf93236d5651a7b0536"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::duckdb_sql::split_sql_statements (cyclomatic 25): dbx_drivers::db::duckdb_sql::split_sql_statements has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_sql.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aea32dceb1e8aad94d2cc402953a06cce3f588fda231c2964dbff90b3c24f6"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::solr_driver::translate_field_operator_filter (cyclomatic 25): dbx_drivers::db::solr_driver::translate_field_operator_filter has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/solr_driver.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74f788d138c00521980882a58b50aefdfcd95a98814d9e78ce99b0b6861d799"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginPackageInstaller::install_bytes_locked (cyclomatic 25): PluginPackageInstaller::install_bytes_locked has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e3874a5348b1da141cae6bce39a2f96f9ab13361a519a0d2b4b9b4fc974563"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oceanbase_sequence_edit_sql (cyclomatic 25): dbx_sql_core::object_source_sql::oceanbase_sequence_edit_sql has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f07e3dbfe3a5817b6c7a72977f78e95a7315b8caf067df2600f93e32abee055"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::oracle_type_migration_sql::evolution_shape (cyclomatic 25): dbx_sql_core::oracle_type_migration_sql::evolution_shape has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0adcfe6b7212bf7997b238719bfc4972ec31e745eb5ec61d050ba04814628c1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::oracle_view_rename::parse_view (cyclomatic 25): dbx_sql_core::oracle_view_rename::parse_view has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"335f161a0211fb9fb32f0f788ebdd60933df4749ba41b592deafa99203e6774a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::sqlserver_top_level_tokens (cyclomatic 25): dbx_sql_core::sql::sqlserver_top_level_tokens has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d770e601148936a7f8153b1ef3796d23a0a7c9dd7f716acee7a4b2f8820ceb"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::oracle_plsql_tokens_fallback (cyclomatic 25): dbx_sql_core::sql::oracle_plsql_tokens_fallback has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4695}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bf761beca065b4c4f0123f2356feec406d99a14f1dd4edf04e3a11b113f518"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::alter_dialect::build_column_order (cyclomatic 25): dbx_sql_schema::table_structure_sql::alter_dialect::build_column_order has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/alter_dialect.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fe209b5cb3dde4f81ef023a8a396ceb370673a9abd1c77fce7c05c971fdb8b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_format::column_definition (cyclomatic 25): dbx_sql_schema::table_structure_sql::column_format::column_definition has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"314b69bd633f4694920f71798be79d0cf97ce66d679755f4f0b449b69dfd6245"}},{"ruleId":"D1","level":"warning","message":{"text":"BlobBoundStatement.scanSql (cyclomatic 25): BlobBoundStatement.scanSql has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/BlobBoundStatement.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"654d1edbc40a58750dcca1232efd2d0b4e2cee3135aa5f5089bbe6b5f6cfde5d"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.oracleListIndexes (cyclomatic 25): DbxJdbcPlugin.oracleListIndexes has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c34ca1e94344758530bef5036d72c39553ad43d9ab2d74aab9bcef1647523a5"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugSession.continueWith (cyclomatic 25): PlDebugSession.continueWith has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b698cf2247d02bd79670333b91e15d9a9131d9cb77c165a691f6c85c4b4a3a9f"}},{"ruleId":"D1","level":"warning","message":{"text":"Plan.bind (cyclomatic 25): Plan.bind has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f96c58e340a8424cf0a88b9eeb6927886e2eb8255f52832a09c87e9de9b13f1"}},{"ruleId":"D1","level":"warning","message":{"text":"etcdSession.put (cyclomatic 25): etcdSession.put has cyclomatic complexity 25 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 7 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":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba8a802b459cd011f5b85dbd1ba106c2b02870c63e988edae790d68687728e7"}},{"ruleId":"D1","level":"warning","message":{"text":"server.getTypeDetails (cyclomatic 25): server.getTypeDetails has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"638b48fcf116d43cb6f8ef3e008cfd71b7411e3da0f5cc72863b99a50ab0cefe"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseSingleOracleTableRef (cyclomatic 25): main.parseSingleOracleTableRef has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5565}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ca8629a6f465c4d1c9f059d42dcbf552ec67823da4994844f959255d3d632b"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatch (cyclomatic 25): runtimeServer.dispatch has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"724f722b30d5e6707be2242181aa0f5aedd37ebb2cc091cbd57be6d404358fa2"}},{"ruleId":"D1","level":"warning","message":{"text":"server.getTypeDetails (cyclomatic 25): server.getTypeDetails has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0f9c7e3d4c59323a11ca1ebc54b604b5b1515200f4b432aa72ec66232dd43c"}},{"ruleId":"D1","level":"warning","message":{"text":"ddlStorage.stripOceanBaseOracleStorageOptions (cyclomatic 25): ddlStorage.stripOceanBaseOracleStorageOptions has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8487c7717a901a60178a7855f1a3d40b6720b0adda2a6e286ca5b30886a62c2"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.oraclePlSqlTokens (cyclomatic 25): sqlStatementRanges.oraclePlSqlTokens has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"77979a0bd51e26a719010ebb6c09d9f2a79ac03f5f66a821a1a78ed352d5f2cc"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletionMetadata.useQueryEditorCompletionMetadata.ensureColumnsForTable (cyclomatic 25): useQueryEditorCompletionMetadata.useQueryEditorCompletionMetadata.ensureColumnsForTable has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d42a83d592a0545b5315c85918075b1e9c7e6b98558d9cb7e04d844878e74d"}},{"ruleId":"D1","level":"warning","message":{"text":"useSessionDiagnostics.useSessionDiagnostics.refresh (cyclomatic 25): useSessionDiagnostics.useSessionDiagnostics.refresh has cyclomatic complexity 25 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSessionDiagnostics.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"922c777343014eaea3659c0c8785e4c9752f92d1ba8a6bf694fb26022d3182e0"}},{"ruleId":"D1","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.loadStructurePreview (cyclomatic 25): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.loadStructurePreview has cyclomatic complexity 25 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0419d4acc1275334deae5a47f1e0713d2edf07c3301f38a4ea4bd79370dc885"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionUrlBuilder.connectionUrlCopyFormats (cyclomatic 25): connectionUrlBuilder.connectionUrlCopyFormats has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"079ee3da0e5a482da2709669af4ceb4804b3035464e07d70e949e130f87a052f"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridClipboard.prepareDataGridClipboard (cyclomatic 25): dataGridClipboard.prepareDataGridClipboard has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridClipboard.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0060eb7a05d83f2dd7ea0f8da99df123cca946c52bd738554834c2d82eea1a7"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridCopyExtractor.validateDataGridExtractorOptions (cyclomatic 25): dataGridCopyExtractor.validateDataGridExtractorOptions has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ad587b9b92926d1fc57413f84a0d930d8e077a4d9a196c7b41887a346e300b"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridSelectionPersistence.restoreDataGridSelection (cyclomatic 25): dataGridSelectionPersistence.restoreDataGridSelection has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSelectionPersistence.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f206808b8652432ffe612630f1e6a05af0686509309b956a5480fdec69d856f"}},{"ruleId":"D1","level":"warning","message":{"text":"databaseAuthorizationPlan.buildCreateUserAuthorizationPlan (cyclomatic 25): databaseAuthorizationPlan.buildCreateUserAuthorizationPlan has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d89cc10b8a9c0c48f08b08b6f43a004b2f06ecd20b697a6606b87d42f2071c"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleConstraints.prepareOracleConstraintPlan (cyclomatic 25): oracleConstraints.prepareOracleConstraintPlan has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"873a77771fd3d4af6032f3002ce279032607700f637e5630783bfa7275e9a135"}},{"ruleId":"D1","level":"warning","message":{"text":"explainPlan.parseDamengExplainText (cyclomatic 25): explainPlan.parseDamengExplainText has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd4c9718ee4d009442d21e6abd9b477795fc182763ec5b950f5d2fef81a3565"}},{"ruleId":"D1","level":"warning","message":{"text":"queryEditorTableDrop.parseTableReferencePayload (cyclomatic 25): queryEditorTableDrop.parseTableReferencePayload has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorTableDrop.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f1061f50acb64510687d9c29f5d7e48c9ef3cd2c8d038ad91c399f7a0598b1"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlSemanticSelectionRanges.collectExpressionSection (cyclomatic 25): sqlSemanticSelectionRanges.collectExpressionSection has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"89658f5d00ff4032e4f193bfe73b3d965e8d2c80570a7d8f7ac141be581781a7"}},{"ruleId":"D1","level":"warning","message":{"text":"vimImeGuard.createVimImeGuard (cyclomatic 25): vimImeGuard.createVimImeGuard has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 48, 74). 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":"apps/desktop/src/lib/editor/vimImeGuard.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"faffdddfcb829ed2432b732c9705170440c89fa26fb8f6cac75c244f360ff77a"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.extractActiveDatabase (cyclomatic 25): mongoCompletion.extractActiveDatabase has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b073d798920930e2359a72e53f6a32a592963486c3aa8ca19cfd9bd5689b09f"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics.isSqlServerGoSeparatorLine (cyclomatic 25): diagnostics.isSqlServerGoSeparatorLine has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f56b28ef93269a5f833d37f2f460a8749f9a8861e7d38745a6ddf3d75a56c18"}},{"ruleId":"D1","level":"warning","message":{"text":"model.sqlSemanticTableNameSpans (cyclomatic 25): model.sqlSemanticTableNameSpans has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7253a49c548fad657a4c3896c35aebbfbfa77e108b73558e8defe408ca196411"}},{"ruleId":"D1","level":"warning","message":{"text":"model.cteBodyProjectionShape (cyclomatic 25): model.cteBodyProjectionShape has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"264e9850426a0de0cdbc3895b09ea92df5d4778f0daf0879d6acc5b1f3093ac1"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.scanSelectListContext (cyclomatic 25): sqlCompletion.scanSelectListContext has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab8359219692c10136b9b94480e794c3382a2c94a0794fef49ff70c12df7f38"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlDatabaseLinks.collectSqlXmlKeywordPositions (cyclomatic 25): sqlDatabaseLinks.collectSqlXmlKeywordPositions has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDatabaseLinks.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"07333fd20880d8202df0332808680f8d029e2f0bf7f3e4878eaa752e9513062c"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlRisk.classifySetTokens (cyclomatic 25): sqlRisk.classifySetTokens has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ac1fb962696cb1e71bc63e7c23d233048f9b86d995a874427b8b10e0bcda80"}},{"ruleId":"D1","level":"warning","message":{"text":"objectSourceLoad.oracleTriggerErrorEditorOffset (cyclomatic 25): objectSourceLoad.oracleTriggerErrorEditorOffset has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"apps/desktop/src/lib/table/objectSourceLoad.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce86199d47ed94156338d12702b3aac4c1db1b95f7f2ed55d41e68ddf86c067"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineRename.prepareOracleRoutineRename (cyclomatic 25): oracleRoutineRename.prepareOracleRoutineRename has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (oracleRoutineRename.prepareOracleRoutineRename::walk) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbe967e6100b23f00edc3c1fbfe47aee6707751376eadc43861eda6fa2e7aef"}},{"ruleId":"D1","level":"warning","message":{"text":"tableSqlTemplates.columnPlaceholderValue (cyclomatic 25): tableSqlTemplates.columnPlaceholderValue has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableSqlTemplates.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc013fb23027a1ffac940236866017d58b491df5386df31962684785e74cda3c"}},{"ruleId":"D1","level":"warning","message":{"text":"tableTree.mergeTableTreePageChildren (cyclomatic 25): tableTree.mergeTableTreePageChildren has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 11 of the 25 points are its own statements and the rest belongs to 5 function items inside it that branch (addNode, collect, addToParent, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e3c517be473cd6cb3ef0dac9c67f4ad7646199d04e98e61d23b2294dbbb63f"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadPagedObjectGroupChildren (cyclomatic 25): connectionStore.useConnectionStore.loadPagedObjectGroupChildren has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2393bb497ea579d737c092b9cfab6928cd31edc58646ca64d1201e288c773376"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadPagedSimpleTableChildren (cyclomatic 25): connectionStore.useConnectionStore.loadPagedSimpleTableChildren has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dd70c61e65c0f588561bdb8c82bbfe6b6e98ac28b56f82e65de20574510868"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.revalidateObjectSourceTab (cyclomatic 25): queryStore.useQueryStore.revalidateObjectSourceTab has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9106e8aef8b6a7827833eb58b7d6cd76d2e324bbf31108df8c4650823ba5f5c4"}},{"ruleId":"D1","level":"warning","message":{"text":"transferTaskStore.normalizeTask (cyclomatic 25): transferTaskStore.normalizeTask has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7e631913d0d68814be51d551364aea8f3761ecdce3037a2113a042a962b04c"}},{"ruleId":"D1","level":"warning","message":{"text":"RoutineOperationRegistry::prepare_batch (cyclomatic 24): RoutineOperationRegistry::prepare_batch has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/operations/retention.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c18b2913f39736f3118931647bcec7a97e319c8dbe02f4e90c61255dd2f5941"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::database_export::is_dameng_auto_increment_ddl (cyclomatic 24): dbx_core::data::database_export::is_dameng_auto_increment_ddl has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfee553c308f2168de7434c63ad6078c8c9114a1e3250ab8f9ea31d962e9195"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::parse_sql_insert_statement (cyclomatic 24): dbx_core::data::table_import::parse_sql_insert_statement has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2854f81600f0a7ef71e702c2c01f58a9f3cf7f539942d1815aeff4728a9604c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::rename_tables_to_backup (cyclomatic 24): dbx_core::data::transfer::rename_tables_to_backup has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":12689}}}],"partialFingerprints":{"codehealthFindingId/v1":"7132f49f93049fc6d1c9be2809cd0b4dcb686d578a859398696ddc34eb25cc88"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::db2::map_column_type (cyclomatic 24): dbx_core::data::transfer::db2::map_column_type has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/db2.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"53785a78e402cbe0ba62b838f1fcac731f3cea552b55d47aa3d42042c63fa33a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::mysql_xugu::validate_target (cyclomatic 24): dbx_core::data::transfer::mysql_xugu::validate_target has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7897202ae24e1e5414ac0d4ed84880f06e07b3fc51faf39369c1042a549aa79b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::oracle_table_contract::types::from_catalog (cyclomatic 24): dbx_core::data::transfer::oracle_table_contract::types::from_catalog has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract/types.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"714e8f0f052e9744b819f776970307a3b331e32f4cac4973162400437f2d9a77"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::pl_debug::mutation::pl_debug_claim_mutation_core (cyclomatic 24): dbx_core::query::pl_debug::mutation::pl_debug_claim_mutation_core has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/mutation.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d522535267e57160739238bb801376e3e915b98175cf037ab36b7e90c82a33f1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::sqlserver_manual_transaction::execute (cyclomatic 24): dbx_core::query::sqlserver_manual_transaction::execute has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/sqlserver_manual_transaction.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd2723345f4fec9a7e8f60abf74eac2b3bd084ce21fd6640dcec86ad2d0eeda"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentDriverClient::call_typed_with_timeout_and_cancel (cyclomatic 24): AgentDriverClient::call_typed_with_timeout_and_cancel has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: AgentMethod::as_str (cyclomatic 46) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f4e761c4471592950b48e9dbb09e7a1f5edb3ce0ca97f3e3fa49c70dfdd3db"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::execute_result_sets_with_text_protocol_on_conn (cyclomatic 24): dbx_driver_mysql::mysql::execute_result_sets_with_text_protocol_on_conn has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d086804bc2789811b3c8c7f9e00451e9907889a0f81195e2b49d571e947e10c2"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::ssh_tunnel::forward_loop (cyclomatic 24): dbx_drivers::db::ssh_tunnel::forward_loop has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d975aef05cdf5ca13ee09c429914b0fd3d6577ecfe9dc366d8867fd015115b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_mcp::transaction::handle_command (cyclomatic 24): dbx_mcp::transaction::handle_command has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/transaction.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"550ad23e2247514cc6defe3e751d3fb1fe038b9b405a66a1c94eeff782d2689f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_plugin_runtime::plugins::manifest::validate_form_fields (cyclomatic 24): dbx_plugin_runtime::plugins::manifest::validate_form_fields has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b55d0964862ceeb32a8b9a3e532e9d29c9bdcd911bcbfe9fe989e7c9e77b7e7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_routines::analysis::package::statements (cyclomatic 24): dbx_sql_core::object_source_sql::oracle_routines::analysis::package::statements has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1773fece7d421a0ce48f11cb1a0938f2011ae60fbaa879e330b2ff36e650e7c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::top_level_sql_tokens (cyclomatic 24): dbx_sql_data::query_result_sql::top_level_sql_tokens has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":3064}}}],"partialFingerprints":{"codehealthFindingId/v1":"a999c28bb6547f266a21f1bdc5190d3fd71d6bbb3f28c0d0bcbb7d0fd499ceca"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_dialect::sql_dialect::table_select::large_value_preview_kind (cyclomatic 24): dbx_sql_dialect::sql_dialect::table_select::large_value_preview_kind has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb4b912de057ddc94323a878e94e1d67a8ff154d49266a7f5e7bcb17f1f12bd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::sqlserver_default_literal_for_schema (cyclomatic 24): dbx_sql_schema::schema_diff::sqlserver_default_literal_for_schema has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5529}}}],"partialFingerprints":{"codehealthFindingId/v1":"a635b2f0a77849986ffaea4353cf262ecb728998e0c7e733c198d167124afd8c"}},{"ruleId":"D1","level":"warning","message":{"text":"KafkaAgent.validatePeekRequest (cyclomatic 24): KafkaAgent.validatePeekRequest has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: KafkaAgent.dispatch (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edfe56d99bc92c3bbe902d9c6c215ec1b0d04c63481d000c1c8f77f20fc0a54"}},{"ruleId":"D1","level":"warning","message":{"text":"main.finalizeKerberosConfig (cyclomatic 24): main.finalizeKerberosConfig has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0aff786eaae37f752fbe196d606a933c706b60a2d538f1b01f955c73794016"}},{"ruleId":"D1","level":"warning","message":{"text":"cassandraConfig.finalize (cyclomatic 24): cassandraConfig.finalize 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":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5214555ef3f0b44a4e1b277cab470ea8f8e55428cd87dc42f937c0834448325"}},{"ruleId":"D1","level":"warning","message":{"text":"main.finalizeKerberosConfig (cyclomatic 24): main.finalizeKerberosConfig has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c4caa642df40181f6ec3c21f166fdac5584d899ebf9eba679120ffac5bdf4c"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listIndexesWithoutOrdinality (cyclomatic 24): server.listIndexesWithoutOrdinality 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"72570e39bdae80e84eaaa01af6db9c8e90ac3dfa1bf820906bea609ffacb5ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"main.rewriteOracleSelectItems (cyclomatic 24): main.rewriteOracleSelectItems 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5681}}}],"partialFingerprints":{"codehealthFindingId/v1":"9212f10b6e42d2cd39e212a5df15efb126bb041c22bc13fab744e14ff664bd68"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleLegacyCharset.validateValue (cyclomatic 24): oracleLegacyCharset.validateValue 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":"agents/drivers/oracle-go/legacy_charset.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e6ac03ab047be0c59048a3f0274563593b4cb2f72c53cc3d79621becd56997"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugLobOutput.freezeNationalSource (cyclomatic 24): plDebugLobOutput.freezeNationalSource 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":"agents/drivers/oracle-go/pldebug_lob_output.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e5c9b39fcb61c47b48996c00ab94164ad3071f5a38220fa69ed71df7a5f15c"}},{"ruleId":"D1","level":"warning","message":{"text":"main.applyMessageProperties (cyclomatic 24): main.applyMessageProperties 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":"agents/drivers/rabbitmq/message_properties.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad3866acbb7e0027c90a4cdd9a3bde64512df2b4d1c6a364543e3741cd27aba"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderNotice (cyclomatic 24): index.html.renderNotice has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/index.html"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6987458d7bb30dbb2371c095725abde092ec730f53ade079d5b4de206b7eda0"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletionKeys.useQueryEditorCompletionKeys.acceptSqlServerCompletionOnSpace (cyclomatic 24): useQueryEditorCompletionKeys.useQueryEditorCompletionKeys.acceptSqlServerCompletionOnSpace has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca4ea57f7ebe21fe8b3ca85bec60ed1f0fd55a837cb440f82306c89a644f29e"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportResultSheetsXlsxFallback (cyclomatic 24): useDataGridExport.useDataGridExport.exportResultSheetsXlsxFallback has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 2235, 2257, 2275, \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"69af2f63fba06b1ef939316c0515dccbe6c5094062a5c429e1bcc3a441d8be5e"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridLargeValues.useDataGridLargeValues.prepareSaveBaseline (cyclomatic 24): useDataGridLargeValues.useDataGridLargeValues.prepareSaveBaseline has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, 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":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33cd7b809e7dfa1864f0367fab5bec4fa3e578473edd88a23ee1a7c5a8c7591"}},{"ruleId":"D1","level":"warning","message":{"text":"useFileDrop.useFileDrop.setupFileDrop (cyclomatic 24): useFileDrop.useFileDrop.setupFileDrop has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 48, 125, 139). 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":"apps/desktop/src/composables/useFileDrop.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ad572e80bdbba5e699952d3d4dae1602a14eec62e7b84b50dfe8496e66064a"}},{"ruleId":"D1","level":"warning","message":{"text":"safeJsonFormat.myersDiff (cyclomatic 24): safeJsonFormat.myersDiff has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f047d7eeb61b1686b957a036a3017bdca63f34bef2da6a2ed938c4aa05e05ff9"}},{"ruleId":"D1","level":"warning","message":{"text":"xmlFormat.parseXmlDocument (cyclomatic 24): xmlFormat.parseXmlDocument has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/xmlFormat.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"728cb8a30556bef49e9ff79f1262b5fbb37c9be264535f99a7cc3cb04bbe6c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"agentTarget.consulAgentWriteBlockedReason (cyclomatic 24): agentTarget.consulAgentWriteBlockedReason has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/consul/agentTarget.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1bac7bea67298dca662b23000205c6edff908db0383f640479d5baa4657c4d"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridCellCoercion.coerceDataGridCellValue (cyclomatic 24): dataGridCellCoercion.coerceDataGridCellValue 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":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"867352893b71e7598fa26ae0b12af4c6f58826d45fc485297ae10011fd690684"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeJobAdmin.nativeJobDefinitionForEdit (cyclomatic 24): nativeJobAdmin.nativeJobDefinitionForEdit has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"195766e9d73272961338ae33af326ea4d9452e990f9a8906e3f66d4938f587cf"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleIndexes.mergeOracleIndexDraftsAfterRefresh (cyclomatic 24): oracleIndexes.mergeOracleIndexDraftsAfterRefresh has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3825676c4b7a8b85baad0e32018ca27282ea00b58bdfa5b7ddde52b61f5bc4"}},{"ruleId":"D1","level":"warning","message":{"text":"keyboardShortcuts.matchesShortcut (cyclomatic 24): keyboardShortcuts.matchesShortcut 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":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"377cacc88bc9f4f922be7283bfd50b1db37fb227a84fbd36a38a913d3a3744d7"}},{"ruleId":"D1","level":"warning","message":{"text":"elasticsearchCompletion.inspectJsonBody (cyclomatic 24): elasticsearchCompletion.inspectJsonBody 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":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"631b189ccd5a2ea217c0032fd3c5b45cc9fa9e604e4a3cc3083aab14a5381ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoQueryInputBrackets.handleMongoQueryInputBrackets (cyclomatic 24): mongoQueryInputBrackets.handleMongoQueryInputBrackets has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoQueryInputBrackets.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52975d1b909f85eadff054c5ad46cd7ae80696a1deac27d827adae0d7c5ee4d"}},{"ruleId":"D1","level":"warning","message":{"text":"mqConsoleDefaults.resolveAvailableMqTabs (cyclomatic 24): mqConsoleDefaults.resolveAvailableMqTabs 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":"apps/desktop/src/lib/mq/mqConsoleDefaults.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03a5a43e03dc5f66b9f031e80f3accdd5addac5369c546f9f02b73699faf978"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineDeploy.synchronizeOracleRoutineSelection (cyclomatic 24): oracleRoutineDeploy.synchronizeOracleRoutineSelection has cyclomatic complexity 24 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a23d5a946e23358280edbb5599b97d986c9e4406129be3ac25720c9242ba98a"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarLayoutMonitor.detectLayoutAnomalies (cyclomatic 24): sidebarLayoutMonitor.detectLayoutAnomalies has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3e2dcd8698b89581f5925f693aa8ec3f297674a8c44175826157f065e9b238"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarNodeOrdering.orderSidebarTreeChildrenForParent (cyclomatic 24): sidebarNodeOrdering.orderSidebarTreeChildrenForParent has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarNodeOrdering.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3a96058338d21da63fc10cd91be00df81ef18088bd0c9476feb8170ce01423"}},{"ruleId":"D1","level":"warning","message":{"text":"model.parseRowSourcesAtDepth (cyclomatic 24): model.parseRowSourcesAtDepth 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":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b495b6bc7cc0cab958af63cfb49ec05189710b14573f1f9ec2838ecca5870d"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlAnalysis.analyzeSelectStructureForDisplay (cyclomatic 24): sqlAnalysis.analyzeSelectStructureForDisplay has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c636cdd870a15887c1f49b35edfe68b11077ba519cf9d33897293513afa598"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.maskSqlLiteralsAndComments (cyclomatic 24): sqlCompletion.maskSqlLiteralsAndComments has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"917138bc03bd3f86493c5b935610e2c67c09572b0e2cbf58ba73a1f479558d0b"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.buildForeignKeyRelatedTableItems (cyclomatic 24): sqlCompletion.buildForeignKeyRelatedTableItems has cyclomatic complexity 24 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 12 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5217}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda3bcaa6d3a2c6b975eb2913b31f624c162f52f06112193bdf384bff339fd6e"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlVariables.replaceReferences (cyclomatic 24): sqlVariables.replaceReferences 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":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1390b2a0f7ead078acd13c10c9b0d7a9456ba9afcd040d736b2cef2d6406429"}},{"ruleId":"D1","level":"warning","message":{"text":"objectRenameSql.supportsObjectRename (cyclomatic 24): objectRenameSql.supportsObjectRename has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectRenameSql.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"68af7d8df9a5a95a637e75efc7eb5799f5f8c86c87d92f2d282305dc60ff4065"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTableRename.readOnlyReconcile (cyclomatic 24): oracleTableRename.readOnlyReconcile has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f7987b40b454dd9095ae06007c19e533bb98d2450906fb26ba273631c1be0f"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTypeManagement.stepSatisfied (cyclomatic 24): oracleTypeManagement.stepSatisfied has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"001ec74c7e1055b9ac4da2c6fa553970fee613a8543ae6eef6ee20fa701e2be5"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTypeDataMapping.executeOracleTypeDataInsert (cyclomatic 24): oracleTypeDataMapping.executeOracleTypeDataInsert has cyclomatic complexity 24 (threshold 15). Of this number, 23 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":"apps/desktop/src/lib/table/oracleTypeDataMapping.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc3f02746d33425c89ea823c4fdcc991bfba2acc8b824c5e99320dd760d811f"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.disconnect (cyclomatic 24): connectionStore.useConnectionStore.disconnect has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5809}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d0061be7e03acf0c42e588eeb2c420ceee52ff9de68f631c6570362db21f14"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.migrateTimeoutInheritance (cyclomatic 24): connectionStore.useConnectionStore.migrateTimeoutInheritance has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to one function item inside it that branches (resolveInheritance). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11008}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a7f6ee2c6301c205ac62770c590d755b1a4c08ce5318a34af9970d7588a17c"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.captureQueryResultExportRequest.\u003Creturned closure\u003E (cyclomatic 24): queryStore.useQueryStore.captureQueryResultExportRequest.\u003Creturned closure\u003E has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11860}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce4e085be4eb2d7b99e857e6e87d65cf8d73e49c1767413d6d242ac0befd4f7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_duckdb_driver::sql::contains_unquoted_sql_keyword (cyclomatic 23): dbx_duckdb_driver::sql::contains_unquoted_sql_keyword has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f384a2f270b1da475d366c6a24b917bee08b49b813ea71d2f38f655952035ff"}},{"ruleId":"D1","level":"warning","message":{"text":"TdengineDriver::completion_assistant_search (cyclomatic 23): TdengineDriver::completion_assistant_search has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/tdengine/src/driver.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"200ea2788ee6a11087175e21f568df84a0a35e1663b0d5060d5d96364d3c98de"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::start_keepalive_task (cyclomatic 23): AppState::start_keepalive_task has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dbx_core::connection::close_pool_kind_inner (cyclomatic 34) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b17e46cb57e05c7ee15283795277a917a40a3c429dba9d7a34e116dc2177c0f"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlServerBatchSplitter::push_line (cyclomatic 23): SqlServerBatchSplitter::push_line has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"af24088aaedc30fee046df8f354cc1665479491db73287e84d7a1fe594642cad"}},{"ruleId":"D1","level":"warning","message":{"text":"SnippetSyncClient::put_snapshot_with_expected_remote_hash (cyclomatic 23): SnippetSyncClient::put_snapshot_with_expected_remote_hash has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1855aa9eb5d02a6160333dd5f35afda308d56756642f8cac42ff2eb6a9da8d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::data_compare::build_data_compare_select_sql (cyclomatic 23): dbx_core::data::data_compare::build_data_compare_select_sql has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc2d004f1a916d6c0c830f41337bb60633d9c19dc4cdb4b9e3ba1e6ffce0e50"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::database_export::format_export_sql_literal_typed (cyclomatic 23): dbx_core::data::database_export::format_export_sql_literal_typed has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe0286df38e29ffc734f962f87ad7f0c7f82472b4fa72876bb938bce0225ac5"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::sql_non_code_spans_with_mysql_identifiers (cyclomatic 23): dbx_core::data::transfer::sql_non_code_spans_with_mysql_identifiers has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"754015c21a45916d34edd7c1bdb15b90eaf10b4f9bf055c08aff3d8d06857253"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::sqlserver_ddl_tokens (cyclomatic 23): dbx_core::data::transfer::sqlserver_ddl_tokens has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6658}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f34d18f387590feaad6f1e1bafcab7422cfb7a3eb1cc7bd7ebf67671c357e8b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::rewrite_mysql_create_table_name (cyclomatic 23): dbx_core::data::transfer::rewrite_mysql_create_table_name has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6732}}}],"partialFingerprints":{"codehealthFindingId/v1":"603845c4b8927903ca3055f748aca42b0634af0f294a7e3503791cddb8462728"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::structure_plan::build_structure_preview (cyclomatic 23): dbx_core::data::transfer::structure_plan::build_structure_preview has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/structure_plan.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d03f793ca4467e2d19ba56cae4ad5e4607be462a0e3f8f6e4611ea9fd1e4921"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::begin_transaction_session (cyclomatic 23): dbx_core::query::begin_transaction_session has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":6754}}}],"partialFingerprints":{"codehealthFindingId/v1":"f891189c199579afb9b224fd5e99cb9ca34a5a3bab39bacb2f38131b9599a5ef"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::pl_debug::lifecycle::drain_connection_inner (cyclomatic 23): dbx_core::query::pl_debug::lifecycle::drain_connection_inner has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/lifecycle.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb6f7e0017d89a8b27639d8237d7e108dd68058c5efdbc9c3d4f64d3f9f5162"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::completion_assistant_fallback_core (cyclomatic 23): dbx_core::schema::completion_assistant_fallback_core has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8539}}}],"partialFingerprints":{"codehealthFindingId/v1":"4254c7ead86c9e9fcd8a564a4152fedd789bdf25f2d60b022fc049abb512aca1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::readback::readback (cyclomatic 23): dbx_core::schema::oracle_routines::readback::readback has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/readback.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b6cb24fc73177dec427d229396a97349258b81f3ce5674bfd0a6fe378b01b7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::transfer::packages::external_types::read_type (cyclomatic 23): dbx_core::schema::oracle_routines::transfer::packages::external_types::read_type has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages/external_types.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b56d3a06cee9df5fbc6f33fdd44bb106400be9e344f7b0f36eebdd3b3f8047"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::parse_mysql_enum_values (cyclomatic 23): dbx_driver_mysql::mysql::parse_mysql_enum_values has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a2d4bb759d4e50f31b5c71d93efba831df1705be8526f1d14bc3b78508c09a"}},{"ruleId":"D1","level":"warning","message":{"text":"TextEncoding::encode_copy_text (cyclomatic 23): TextEncoding::encode_copy_text has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/text_encoding.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5aa4ae450dfbc7a1fb6dddf821cd19273c28f7f9a1d1fb979855d377a23da0"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_postgres::postgres::postgres_connection_url (cyclomatic 23): dbx_driver_postgres::postgres::postgres_connection_url has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":3504}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92e19c67151de918db9f47c8e140ab1335fe5dc4dcddbd0f99f14515c8b8ecb"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_redis::scan_keys_batch_inner (cyclomatic 23): dbx_driver_redis::scan_keys_batch_inner has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"371f63d5b8658c93fef6eadc5f1bb7e69d435c0738c971882d52f47c0300e1dc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::dynamodb_driver::parse_dynamodb_statement (cyclomatic 23): dbx_drivers::db::dynamodb_driver::parse_dynamodb_statement has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9df7fac08f9b807d04dbf693e16b49b748ec4a64c5ab78e83836495e26ce2d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::sqlite::tokenize_entry (cyclomatic 23): dbx_drivers::db::sqlite::tokenize_entry has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"922dac454b51f71968df85c104b76fb4f4991e829181d4b224edff9c6b15a238"}},{"ruleId":"D1","level":"warning","message":{"text":"Analysis::statement (cyclomatic 23): Analysis::statement has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"113542d087780df08c6238fe420f2bf1ea469576032dca6626cd7af5737ac482"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::oracle_post_table_constraints (cyclomatic 23): dbx_sql_core::object_source_sql::oracle_indexes::oracle_post_table_constraints has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"322c4042cc7b25c7de50ef2f02986a9c39411e2afcb65cbe4063d8c38fbb167e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::query_execution_sql::is_safe_read_only_set (cyclomatic 23): dbx_sql_core::query_execution_sql::is_safe_read_only_set has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e117597aae325b8ad4597f7607946ee42893171742690c5e88c47d9f9b05cf"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql_editability::analyze_editable_query_editability (cyclomatic 23): dbx_sql_core::sql_editability::analyze_editable_query_editability has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e5483ed5f40bc3819a499e50b9ff45136f1f1fef22499aafe3ee0299ba927d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::data_grid_salesforce_sql::build_salesforce_data_grid_save_statements (cyclomatic 23): dbx_sql_data::data_grid_salesforce_sql::build_salesforce_data_grid_save_statements has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_salesforce_sql.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ecc7b7dde2e21ca022ee33bb743cb10c001f51ce799343f3baf042ff889a59"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::validate_data_grid_save (cyclomatic 23): dbx_sql_data::data_grid_sql::validate_data_grid_save has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: dbx_sql_data::data_grid_sql::build_data_grid_context_filter_condition (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eca60818321c5d64b8817f84824ffc5369ab757986e990427f76ca80c317bca"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_dialect::sql_dialect::table_select::build_large_value_preview_items (cyclomatic 23): dbx_sql_dialect::sql_dialect::table_select::build_large_value_preview_items has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ff203db0663d04791ac1f00fcc6b47bc795d0c69bc1186c5584a022128547f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::metadata_changes (cyclomatic 23): dbx_sql_schema::native_job_changes::dameng::metadata_changes has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ba41c84bb971d2577c4febba08a250e79a0462774b73896f2b45734ef01ad2"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::parts::apply_changes (cyclomatic 23): dbx_sql_schema::native_job_changes::dameng::parts::apply_changes has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng/parts.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"806ffc9f6a931faac40c1bce49b52b94e8723f17dce6f739629813f97ceb37d8"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::diff_schema (cyclomatic 23): dbx_sql_schema::schema_diff::diff_schema has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fdd481cd7b524cc3f12fe0b81f710cbbedcc266045b813564e4079c35a14dc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::oracle_routines::diff_oracle_routines (cyclomatic 23): dbx_sql_schema::schema_diff::oracle_routines::diff_oracle_routines has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/oracle_routines.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"46aab4056f202de8fc16fe1c8d589d9d2f7b1addd5e1812642ceddfc2445fc8a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::oracle_foreign_keys::build_new_table_keys (cyclomatic 23): dbx_sql_schema::table_structure_sql::oracle_foreign_keys::build_new_table_keys has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_foreign_keys.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fce156da1bc3b6adc605ee3859df5b4cd082bb350823d75d5e8df5fe2aa43a"}},{"ruleId":"D1","level":"warning","message":{"text":"EwkbWktDecoder.geometryToWkt (cyclomatic 23): EwkbWktDecoder.geometryToWkt has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb227e7bd000c39bf915c208676415bc41ca9c062888cb5bbdd908df236811ff"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.handleRequest (cyclomatic 23): DbxJdbcPlugin.handleRequest has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fb0639cde337c7dcff5a384fa64e0152587ad5a471215afc27be2d719eb8c9"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.stripCommentsAndLiterals (cyclomatic 23): DbxJdbcPlugin.stripCommentsAndLiterals has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2436f2c4cd287c7959a9e1b3f8bebdef6e8a1931bc2cc4f8930a37af3fcf33"}},{"ruleId":"D1","level":"warning","message":{"text":"FirebirdObjectSource.read (cyclomatic 23): FirebirdObjectSource.read has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdObjectSource.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf61653a4cffc9ae8c90e1bbaf91a4f0854c0a0f8fc864190c5e1f7ae387dcd"}},{"ruleId":"D1","level":"warning","message":{"text":"KafkaAgent.applySecurityProperties (cyclomatic 23): KafkaAgent.applySecurityProperties has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: KafkaAgent.dispatch (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"759e06b39ded6cb082fe0dec60609436a812fba157c35f8e1c8e5a72d48f79d6"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugCondition.evaluate (cyclomatic 23): PlDebugCondition.evaluate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCondition.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd556850d7ab4f6de666f996f11de7731538f6f5d36ac3f4b9a403ed22781d9"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTemporalJson.copy (cyclomatic 23): PlDebugTemporalJson.copy has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTemporalJson.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dbdb0157bc928203a1f8c97af7b36cc8fcf45eb60748790789eca1066382b7"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listTables (cyclomatic 23): server.listTables has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"320b18d08618323f0263600e8d9ee66acbc96185324f43e3a379f88e2aad8746"}},{"ruleId":"D1","level":"warning","message":{"text":"main.renderCQLValue (cyclomatic 23): main.renderCQLValue has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/values.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0207ad9061f55a536d08b82b7a89ae4135dcbe32bc4f3972480e7c0c5839a93a"}},{"ruleId":"D1","level":"warning","message":{"text":"main.pumpLongPollWatch (cyclomatic 23): main.pumpLongPollWatch has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/watch.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"8065cf5275a0b8d2cbe955ff13f98b9d71c9b6bb28f4602cfb0950d81b29627f"}},{"ruleId":"D1","level":"warning","message":{"text":"etcd2Session.put (cyclomatic 23): etcd2Session.put has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/kv.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc4589d50683f25ce417b57c16facbb7649808bd64328c43bf992d8237f04e1"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listTables (cyclomatic 23): server.listTables has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/metadata.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"796ef7bc42b9074b68fe770122a7638f48b2bd316f3da20b430244560a520c0b"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugExecuteNativeStatement (cyclomatic 23): main.plDebugExecuteNativeStatement has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_execute.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"52868315ff80390cc2a48c48c883b101f85b671d28a833242045b609391a45a7"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugDecodeBinaryOrLobInput (cyclomatic 23): main.plDebugDecodeBinaryOrLobInput has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_lob_input.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ceab339644143d97321d1b7494dcb968ba73b58b6cd3b204d289285760c6eea"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listIndexesWithIdentity (cyclomatic 23): server.listIndexesWithIdentity has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3212}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba88e3787607d15f9e06e234755b9e1fb54a3880bb0fcfab1bdca30c1ddde7b"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.compileNativeTarget (cyclomatic 23): runtimeServer.compileNativeTarget has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_compile.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12bb7e8906bf558102007eb6733d108274a6affedb2f1bb5eee1eaa003d8c41"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugRecordDecoder.leaf (cyclomatic 23): plDebugRecordDecoder.leaf has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_record_input.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfd7ae1ebe2e28f554ec8f62c7101b7d2da3ddb44aaaa13cdb166082fad60a6"}},{"ruleId":"D1","level":"warning","message":{"text":"proxyManager.rewriteJSON (cyclomatic 23): proxyManager.rewriteJSON has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/routing.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"be30831adc65b25d6c265bf4969661fc5be7f479d52f7e4599bf512cf39f5614"}},{"ruleId":"D1","level":"warning","message":{"text":"rocketMQAgent.connectProxy (cyclomatic 23): rocketMQAgent.connectProxy has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/proxy.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e95bfd5dbe35bd6480524c8071f8b6df1a9ab2a81b1b9d0549ef09c50f08f6"}},{"ruleId":"D1","level":"warning","message":{"text":"main.isQuerySQL (cyclomatic 23): main.isQuerySQL has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: server.dispatch (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd769467d5a79f83afe5d2dc4df72b53d4702a7946e13856a2929bff4687ca9e"}},{"ruleId":"D1","level":"warning","message":{"text":"main.renderXuguIndexPartitionDDL (cyclomatic 23): main.renderXuguIndexPartitionDDL has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":5254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a456b3c36c20bbdc270418d0f068c04e2e4146c6712341e2f11cca518e19afc8"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.scanSqlServerControlFlow (cyclomatic 23): sqlStatementRanges.scanSqlServerControlFlow has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec16c3d182cc85b1fa62e07d03426ad8bb6c82b110be7097d7a1782669618ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.listCompletionObjectsForContext (cyclomatic 23): useQueryEditorCompletion.useQueryEditorCompletion.listCompletionObjectsForContext has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"6302813aab3ad9dbbeca230e4039f24aec81ed49d4adff5f14367cd86ef05a0e"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferDdl.sqlServerDescriptionParameters (cyclomatic 23): queryResultTransferDdl.sqlServerDescriptionParameters 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":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16bd06dd5b94ee031e8018635f1199a4f671dc2dc0d7732af74ba5ff15ee8ba"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportSql (cyclomatic 23): useDataGridExport.useDataGridExport.exportSql has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 2853, 2856). 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fd5a30d80423efe3a8483abeeba2917cd8e77790b518b5e82931ef78d98787"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExtractor.useDataGridExtractor.copyWithExtractor (cyclomatic 23): useDataGridExtractor.useDataGridExtractor.copyWithExtractor has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"5717b59324ce9afd5bcea326794cf4578959460814b8c2277b4868c6c637aba5"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridSearch.useDataGridSearch (cyclomatic 23): useDataGridSearch.useDataGridSearch has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 3 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 122, 162). 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":"apps/desktop/src/composables/useDataGridSearch.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0a3e2f5ed059954e037cba1a96aeb0b53b661d51c4cb9698e2f6eec26dc378"}},{"ruleId":"D1","level":"warning","message":{"text":"useDialogSources.useDialogSources (cyclomatic 23): useDialogSources.useDialogSources has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 20 function literals inside it that branch (lines 270, 176, 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":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c1d08d5c58a3d1d44d05dc8d76c3d61fc593c2bfdaed1093cf44ea05770cd1"}},{"ruleId":"D1","level":"warning","message":{"text":"ai.buildSystemPrompt (cyclomatic 23): ai.buildSystemPrompt has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b1a62fee6b69f469b6be0d28f5eb48c235f41b41053aaa9277ee82a714cd0d"}},{"ruleId":"D1","level":"warning","message":{"text":"aiGenerationStatus.applyStatusEvent (cyclomatic 23): aiGenerationStatus.applyStatusEvent has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiGenerationStatus.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"de30d85eacf4ff01a6f8c69bc08df303e858ed72a9dc912cf8e894465ab6d45b"}},{"ruleId":"D1","level":"warning","message":{"text":"aiIntentRouter.routeByRulesUnchecked (cyclomatic 23): aiIntentRouter.routeByRulesUnchecked has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiIntentRouter.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c81d86a8450d07af9095f97e3a0a9d3eaca7eff9d3b9a507077290d7c9f0ca"}},{"ruleId":"D1","level":"warning","message":{"text":"documentStoreProvider.rewriteUnsafeIntegerTokens (cyclomatic 23): documentStoreProvider.rewriteUnsafeIntegerTokens has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4530f9fd7593d72b885b1f5f7d1319d0417e9a3e5d7a3434c5f23216b07f466"}},{"ruleId":"D1","level":"warning","message":{"text":"oceanbaseSessionDiagnostics.parseOceanbaseCachedPlan (cyclomatic 23): oceanbaseSessionDiagnostics.parseOceanbaseCachedPlan has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"50033fbe632367c416433239c3226509b02728c24761d1f411e27a84cb6299ac"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleForeignKeys.prepareOracleForeignKeyCreatePlan (cyclomatic 23): oracleForeignKeys.prepareOracleForeignKeyCreatePlan has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a1eb2024292e5e09a69ba416f81613616eae97e820683dc1317a6a9d9551b1"}},{"ruleId":"D1","level":"warning","message":{"text":"codemirrorCurrentStatementFrameLayer.currentStatementFrameLayer (cyclomatic 23): codemirrorCurrentStatementFrameLayer.currentStatementFrameLayer has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorCurrentStatementFrameLayer.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"706fd4ca99509209378729ecd940a8968fdb8626113a6452b22b094a65b83925"}},{"ruleId":"D1","level":"warning","message":{"text":"keyboardShortcuts.eventToShortcut (cyclomatic 23): keyboardShortcuts.eventToShortcut 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":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c4714fd1eac08167705f4692571fc1d1f9de46bc02e224417536455ccae86a"}},{"ruleId":"D1","level":"warning","message":{"text":"mcpCapabilitySearch.searchMcpCapabilities (cyclomatic 23): mcpCapabilitySearch.searchMcpCapabilities has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mcp/mcpCapabilitySearch.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ecfdc56f2680db45139c7864ba161895e6ae39333b033eb6759194105b4416"}},{"ruleId":"D1","level":"warning","message":{"text":"tableMetadataCache.loadTableMetadata (cyclomatic 23): tableMetadataCache.loadTableMetadata has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ef52ac6cc013c11836e8a300f28f2810b503b7d08c5b1fa1517030cb1cc1dc"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.classifyFilter (cyclomatic 23): mongoCompletion.classifyFilter has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a05cc8e976f031d9d44df31c3e19bf9f4e961c51f88e72b9b926c3069ef5a5f"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.parseMongoCommand (cyclomatic 23): mongoShellCommand.parseMongoCommand has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 1053, 1057, 1061, \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"1198292de0bbec452b734d9d726259338fd023b37ef1f8b2cca8df4088b4d628"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parsePredicate (cyclomatic 23): Parser.parsePredicate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b34c00299f268a3f8dd7a5bd1b7c964eddfe1b7af339fd07ec37c265393087b"}},{"ruleId":"D1","level":"warning","message":{"text":"queryCursorOffsetPagination.executeCursorOffsetPage (cyclomatic 23): queryCursorOffsetPagination.executeCursorOffsetPage has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/query/queryCursorOffsetPagination.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d860717e55f6455e61c5e3459f856323c732a9a85ca740803daff6fc6e8078c4"}},{"ruleId":"D1","level":"warning","message":{"text":"redisKeyTree.sortRedisTreeLevelCooperatively (cyclomatic 23): redisKeyTree.sortRedisTreeLevelCooperatively has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyTree.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b812f7decf9026ef2ba0e4c78c8fef244af6db71fd1d34e0933171ffc133fd"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarSearch.matchSidebarLabelWithRegex (cyclomatic 23): sidebarSearch.matchSidebarLabelWithRegex has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearch.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d135ae44e855ae297d769d5e7ca71b9515043d931328872abbf38d8cce20392"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarTreeLabel.sidebarTreeDisplayLabel (cyclomatic 23): sidebarTreeLabel.sidebarTreeDisplayLabel has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTreeLabel.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f624915f3debe926046265a82a472b920dcda6148b5cfafad6743026787eec"}},{"ruleId":"D1","level":"warning","message":{"text":"CypherPrinter.format (cyclomatic 23): CypherPrinter.format has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"408463ff3ed029506af242b16f9e796992a075c88bd610ae538b17dda7e402bc"}},{"ruleId":"D1","level":"warning","message":{"text":"ddlDisplay.findCreateTableBody (cyclomatic 23): ddlDisplay.findCreateTableBody has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0aef889112b91d99ca09c3f04e00830b7307d1874cd7608505a5b5dabd80793"}},{"ruleId":"D1","level":"warning","message":{"text":"completion.sqlSemanticSelectStarIsOnlyProjection (cyclomatic 23): completion.sqlSemanticSelectStarIsOnlyProjection has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e99d2ebef5fbc94e738cc15dc415bec99b006382f839a70972db3850bb8087"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics.buildSqlSemanticDiagnostics (cyclomatic 23): diagnostics.buildSqlSemanticDiagnostics has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe367ef79cab8f08740cf716dea8c0629266ab02c98fc24159fbd29964a065c"}},{"ruleId":"D1","level":"warning","message":{"text":"model.parseCteSources (cyclomatic 23): model.parseCteSources has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b23049674c08c1b7bf7b185c4907f24a892be9010ae2a34107cd93637b6cb3"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlAnalysis.containsTopLevelAggregate (cyclomatic 23): sqlAnalysis.containsTopLevelAggregate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1177e71f51e78d6dcf67c642fd5c07df016bdbc23361ac63d36d3978c51cdc"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.currentSqlLikeLineBlockSpan (cyclomatic 23): sqlCompletion.currentSqlLikeLineBlockSpan has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"801897bf62f1bdf76a81bc702c8c410674043a0d913b427b14d43b07fb9477a6"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.buildJoinConditionItemsForPair (cyclomatic 23): sqlCompletion.buildJoinConditionItemsForPair has cyclomatic complexity 23 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a975cec8afaf2882586515715b90d10c591496e07028c2eec6e14497e9652aff"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.isPostgresQuestionMarkOperator (cyclomatic 23): sqlParameters.isPostgresQuestionMarkOperator 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cd7162fd16bda40b18d640ab21c50cb03cc7c0345d4ed4bcc20395e11e9a07"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlServerHostPort.parseSqlServerHostPort (cyclomatic 23): sqlServerHostPort.parseSqlServerHostPort has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sqlserver/sqlServerHostPort.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3712db7c4de6c767c8d92ba8e1d35a77435b9230a0064e82180792d40166ea"}},{"ruleId":"D1","level":"warning","message":{"text":"routineParameters.tokenizeXuguRoutineDefinition (cyclomatic 23): routineParameters.tokenizeXuguRoutineDefinition has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab1b997fcc401cb99afcecf82078f4189c09e81a21c7b80e69c72ddede292e9"}},{"ruleId":"D1","level":"warning","message":{"text":"tableSelectSql.sqlCteVisibilities (cyclomatic 23): tableSelectSql.sqlCteVisibilities has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: tableSelectSql.requiresIdentifierQuote (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50e42961448f732a549c6ea74caa23174e31d6de7a1b44e8f091b74481c53ca"}},{"ruleId":"D1","level":"warning","message":{"text":"tabPresentation.tabModeLabel (cyclomatic 23): tabPresentation.tabModeLabel has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b2a04a091c2b6b718b3171eec8f53b1e536d03bdd28fb7f0b62312b8626778"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.invalidateMetadataCachesForNode (cyclomatic 23): connectionStore.useConnectionStore.invalidateMetadataCachesForNode 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a829cc36204b84a1c94221de35463bd89926009e1bd5cd98f6c4165d462086a"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadTableGroups (cyclomatic 23): connectionStore.useConnectionStore.loadTableGroups has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8514}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf0eef17f1466d94d3fc6d105c57a0a4beafd47a681ca10bc9989e40b9f9717"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadTriggers (cyclomatic 23): connectionStore.useConnectionStore.loadTriggers has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 8838). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8815}}}],"partialFingerprints":{"codehealthFindingId/v1":"411eebd05fc19aa1a414b1189b4cbd369f47b0f801cb17b21445814242a3475f"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.decodeVariable (cyclomatic 23): plDebugStore.decodeVariable 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"81534487c8609836ebc33b9502f95a6f500b4a953518590eef730ab91218ef14"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.applyRestoredOpenTabs (cyclomatic 23): queryStore.useQueryStore.applyRestoredOpenTabs has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2806}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d11c92ac41f1938282566efc078aa5ec0e5efcf0c1612ff675df134ce6ea62"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.captureResultLegacyValuesForExport.read (cyclomatic 23): queryStore.useQueryStore.captureResultLegacyValuesForExport.read has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10893}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf278633656e7527a17c5fd9a74c9cb1e1a3dda60b73d1652eab19f16828c16b"}},{"ruleId":"D1","level":"warning","message":{"text":"savedSqlStore.useSavedSqlStore.updateFilesExecutionTarget (cyclomatic 23): savedSqlStore.useSavedSqlStore.updateFilesExecutionTarget has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a09bda0d32fe78c535318e30273121c1356e982bcac3930bb286d94d63f9f0"}},{"ruleId":"D1","level":"warning","message":{"text":"LandingSelect.LandingSelect (cyclomatic 23): LandingSelect.LandingSelect has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 9 function items inside it that branch (toggle, onListKeyDown, onButtonKeyDown, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/landing/LandingSelect.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be5898a64321f42788b9584d789a12a5033aa7e5e57bf41f8969cb0e85b05d8"}},{"ruleId":"D1","level":"warning","message":{"text":"agentBundle.assembleCustomBundle (cyclomatic 23): agentBundle.assembleCustomBundle has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 506, a function literal at line 535, reportDownload). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/lib/agentBundle.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2b8f61627110d97f06dcae343516f823315f1eaf206a11e21e9afbd89057fc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_ai_provider::ai_pi_agent_cli::emit_pi_event (cyclomatic 22): dbx_ai_provider::ai_pi_agent_cli::emit_pi_event has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_pi_agent_cli.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec391e0e63b02587bf84cbff42064914088d7be1b337d25b3265374c5c16dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::call (cyclomatic 22): Resolver::call has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/references.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6f5acee001854c19b07fe91d8e582153aafcae215ecbbbff0910d983576a6d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::open_xlsx_shared_strings_with_control (cyclomatic 22): dbx_core::data::table_import::open_xlsx_shared_strings_with_control has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b73780d801676d7c655bf20ad19483bc4ebe658a1b8f351873b8318d92322e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::validate_transfer_database_pair (cyclomatic 22): dbx_core::data::transfer::validate_transfer_database_pair has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"320d3d3ea47f12bf2146e55df8282c4c6b4c51764677d53f049ad4f8bcd31dc4"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer_rebuild::view_query_target_references (cyclomatic 22): dbx_core::data::transfer_rebuild::view_query_target_references has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_rebuild.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daf4ba32dbd02fc870ca44736b2a7699e41e16b487026df96afbb3041c39916"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::persistence::cloud_sync::validate_sensitive_payload (cyclomatic 22): dbx_core::persistence::cloud_sync::validate_sensitive_payload has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"8328000a9fbaaef27bc615ce25b18651a1ae3488afbc8b8939b0003bfe53a316"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::service::summaries (cyclomatic 22): dbx_core::schema::native_jobs::service::summaries has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/service.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfff4d2536ae4fa2d37291f5de9f96ee27dc2bfba1385da8811d64190f8ed3d1"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentRuntimeClient::call_typed_with_policy (cyclomatic 22): AgentRuntimeClient::call_typed_with_policy has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: AgentMethod::as_str (cyclomatic 46) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b45b8575e9fd953d20f5848b57c9ba8ce9e95c9ba09cd8bc8640dda56d87f20"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_elasticsearch::es_send_page (cyclomatic 22): dbx_driver_elasticsearch::es_send_page has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdcf24c22002166c8da0f420a2da0bc97c8e6a82249ce5ee81f3fd83eabadd3"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_postgres::postgres::build_custom_type_ddl (cyclomatic 22): dbx_driver_postgres::postgres::build_custom_type_ddl has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":7984}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b310502b8ca80a634ff3262859be9020a95e189b7204b16f7308cb7fa1be4d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::top_level_sqlserver_tokens (cyclomatic 22): dbx_driver_sqlserver::sqlserver::top_level_sqlserver_tokens has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"716b153569d4624d43dd7ddb192c62f1e966896186a620382b3e78377393d6dd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::sqlserver_top_level_blocks (cyclomatic 22): dbx_sql_core::sql::sqlserver_top_level_blocks has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c278d327997933001e4d29feb518667e778380111e302357bbdcca838079b44"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql_analysis::analyze_sql_references (cyclomatic 22): dbx_sql_core::sql_analysis::analyze_sql_references has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e34c0678ea26f9501bdec8870a92efb042f0683c47d1ebcbf01dc30b0f979c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::sql_server_count_sql (cyclomatic 22): dbx_sql_data::query_result_sql::sql_server_count_sql has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93bed3ace69573859e70ee07239cd9ad945d2102f83e85ec8138c60060fc1de"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_plugin_cli::dev::build_config (cyclomatic 22): dbx_plugin_cli::dev::build_config has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/cli/src/dev.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab460a439d2dac9ea91b26b163586bc4c674536472c3c3f898b7eb44ad6ecb6"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::commands::list_sql_files::scan_sql_files_with_diagnostics (cyclomatic 22): dbx::commands::list_sql_files::scan_sql_files_with_diagnostics has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/list_sql_files.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5ff89c02b24999ebb3ac248843a88221430d0f11d87b4231dfaa0a3ae6530e"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.getExplainInfo (cyclomatic 22): DbxJdbcPlugin.getExplainInfo has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"778e0c52b3b16d4adc149803544a9705c4b54f61aa9b7e94c1220c9d225792fe"}},{"ruleId":"D1","level":"warning","message":{"text":"KafkaAgent.brokerEndpoints (cyclomatic 22): KafkaAgent.brokerEndpoints has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: KafkaAgent.dispatch (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a86b75e6be01b2809a69557f9284bb3f1eb373c0ab20406001fef0e8dd87c68"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer.composite (cyclomatic 22): Writer.composite has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a287b79646ca7e600335788a8cef7066112cab947aa48c2460f6ec8dcc430889"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugSource.load (cyclomatic 22): PlDebugSource.load has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSource.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c48a4533fee79c9dd0ab266dbd70c69e149a8aef439579bfce29641f3f1f204"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTarget.constructorLobProfile (cyclomatic 22): PlDebugTarget.constructorLobProfile has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"355d0f7f526b676fe88e157638eb4cbf14d929dea28300e3206c39ce05ac2463"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTarget.decodeZoned (cyclomatic 22): PlDebugTarget.decodeZoned has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"361ec448955a0967b98c7f4912f1293d42df0c788db9387c5d2e7c2d41c09758"}},{"ruleId":"D1","level":"warning","message":{"text":"Loader.ddlSource (cyclomatic 22): Loader.ddlSource has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTypeGraph.java"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0e6103419d5777d70fbd468439bdb2186d3d9c18146a3a26b5771d7b2309ed"}},{"ruleId":"D1","level":"warning","message":{"text":"agentSession.dispatch (cyclomatic 22): agentSession.dispatch has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/query.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ac13bad5c66facae1227e59bd04d1b9c48837b233d47672c0b5a2ab64b1965"}},{"ruleId":"D1","level":"warning","message":{"text":"main.readOracleTNSAliases (cyclomatic 22): main.readOracleTNSAliases has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/tns.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"66488b2368c85ce72aec53a88f2652816c3ec5c9a6b2ddc9a439dde60a7a3250"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listObjects (cyclomatic 22): server.listObjects has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baa4badb4ba1acd53cfab39068eb72d2ec1993e360af6cfc312816d4d842ae5"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.statementRangeAtCursor (cyclomatic 22): sqlStatementRanges.statementRangeAtCursor has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4917c110b8ee48e94a6e9becf8fd4f8eba201d7a0fb173d1484c5513c923737"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferValues.escapedTextLiteral (cyclomatic 22): queryResultTransferValues.escapedTextLiteral has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81d14870ef6d8885747433424af83475cc2d6f4f759012120be764482a95d86"}},{"ruleId":"D1","level":"warning","message":{"text":"useAppUpdater.useAppUpdater.performInstall (cyclomatic 22): useAppUpdater.useAppUpdater.performInstall has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c8e4e36f9d36e598ca8741fc0a8470ec56c3c0fb025c2eb6b6409283cb3339"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridCellDetail.useDataGridCellDetail (cyclomatic 22): useDataGridCellDetail.useDataGridCellDetail has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 38, 67, 30, \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":"apps/desktop/src/composables/useDataGridCellDetail.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"27eb7b2671bebac60c6bda858dec76336694eb1f3ffa107a7ace9c6a7b5c3ea0"}},{"ruleId":"D1","level":"warning","message":{"text":"useQuickOpen.matchQuickOpenText (cyclomatic 22): useQuickOpen.matchQuickOpenText has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5f6034da5ab624eab5b280ef2a0f0378a636e700402cf97e4dcf465dea63b8"}},{"ruleId":"D1","level":"warning","message":{"text":"documentStoreProvider.translateFieldFilterToElasticsearchQuery (cyclomatic 22): documentStoreProvider.translateFieldFilterToElasticsearchQuery has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"245b1491167144a839b2b46dbc556b01aa2e80a03f3e4ae111b6259f74efbf45"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionUrl.databendUrlOptions (cyclomatic 22): connectionUrl.databendUrlOptions has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed87ac1afe874e44eccea6a83a2d9e537a6ef162cb471e50070aac1522d88be4"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridColumnLayoutStorage.queryLayoutSql (cyclomatic 22): dataGridColumnLayoutStorage.queryLayoutSql has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 11 belong to 4 function literals inside it that branch. To reduce it, 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":"apps/desktop/src/lib/dataGrid/dataGridColumnLayoutStorage.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2720b143376972e610274017e5b72100455ebf8eed1256ee91ca477bd04ba451"}},{"ruleId":"D1","level":"warning","message":{"text":"geometryMapPreview.buildGeometryMapFeatureCollection (cyclomatic 22): geometryMapPreview.buildGeometryMapFeatureCollection has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryMapPreview.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea0973ae3177f96ff2a4ef8905c393f2e4d4d1495f11fa12edeee9d19ebd472"}},{"ruleId":"D1","level":"warning","message":{"text":"regexGenerate.parseAtom (cyclomatic 22): regexGenerate.parseAtom has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bf9949665a02aed173571b656fbc3b9e16203b95cd463cedf4511c766d8568"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleConstraints.prepareUniqueTargetIndex (cyclomatic 22): oracleConstraints.prepareUniqueTargetIndex has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e043ea3e4d345ff9f81a45ba87c8aa1cae6a638fee1e3ad0ec130e4a94bf16b3"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTriggerPlan.verifyBinding (cyclomatic 22): oracleTriggerPlan.verifyBinding has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5748230ff8c870fe036138faa1212ba7e7fdd00c2d9b2cb5ad1329bc3200e57"}},{"ruleId":"D1","level":"warning","message":{"text":"codemirrorTrimmedSelectionLayer.trimmedSelectionLayer (cyclomatic 22): codemirrorTrimmedSelectionLayer.trimmedSelectionLayer has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorTrimmedSelectionLayer.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bc3a675e88d54044b15308c57cca4951e275014304c428b4500bb20b18190b"}},{"ruleId":"D1","level":"warning","message":{"text":"keyboardShortcuts.matchesModifierOnlyShortcut (cyclomatic 22): keyboardShortcuts.matchesModifierOnlyShortcut has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa7b78501b92c53ce97f86a499067a5d12c952377ac59e824082e1853483858"}},{"ruleId":"D1","level":"warning","message":{"text":"shortcutRegistry.computeNormalizedShortcutSettings (cyclomatic 22): shortcutRegistry.computeNormalizedShortcutSettings has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1021, 1060, 1075). 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":"apps/desktop/src/lib/editor/shortcutRegistry.ts"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"40038a87b6268e7e4808bf7d183c82339cd0372df8b73cbb0f43619ed15879ad"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.classifyMethodOptions (cyclomatic 22): mongoCompletion.classifyMethodOptions has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"47307e7b6a677fc97fa928d1f68b04fb7f5387848b43104dbb84de689d4b0ac3"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoDocumentValues.parseMongoDocumentInputValue (cyclomatic 22): mongoDocumentValues.parseMongoDocumentInputValue has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7faeed77776305843e4863ddbcbbb8b3c0941852e8b0310df8dded9521cdd9b"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.parseMongoFindCommand (cyclomatic 22): mongoShellCommand.parseMongoFindCommand has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5688850e2bbdc0db1d34fdd7980a2215d1520d4b5359c5d315697f9d7025eeac"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarRemoteSearch.collectSidebarRemoteSearchResults (cyclomatic 22): sidebarRemoteSearch.collectSidebarRemoteSearchResults has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 4 function items inside it that branch (visit, a function literal at line 30, publish, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarRemoteSearch.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d355f42ec14f0ec3c3c11e6a2f4f23122bf8658244ac5aebd9a7e5f15eae9c"}},{"ruleId":"D1","level":"warning","message":{"text":"treeNodeClick.treeNodeRowAction (cyclomatic 22): treeNodeClick.treeNodeRowAction has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a464f042dd1925ef5bea821f774102be9e41ebe90275a8357851b899c530aa"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.computeMatchScore (cyclomatic 22): sqlCompletion.computeMatchScore has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7095}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30b0da0791b1db060779f111a00b4c37f2b8a8ef0066b685f947b99865b06d6"}},{"ruleId":"D1","level":"warning","message":{"text":"tabUiState.sanitizeValue (cyclomatic 22): tabUiState.sanitizeValue has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabUiState.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72e6b675c102fc21cbf14ce2b4969b3b63016b117a5a7f37d7e39c4e099ed0e"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.buildSidebarTableSearchIndex (cyclomatic 22): connectionStore.useConnectionStore.buildSidebarTableSearchIndex has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4e6e2e05841c751e2fcef9ebdf19fa2f180a84c042b373158aebfd6637d064"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadSchemas (cyclomatic 22): connectionStore.useConnectionStore.loadSchemas has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 7194, 7237). 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7179}}}],"partialFingerprints":{"codehealthFindingId/v1":"072e374c4c0fcc34e1c9546fd446dd01f7d1e52500a1d7b104da3da0b03c22db"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.refreshStack (cyclomatic 22): plDebugStore.usePlDebugStore.refreshStack has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"da74550445423dc68d5d1db1c6b947dec8aa622398fd65cf1072cfa0f252d1d0"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore (cyclomatic 22): queryStore.useQueryStore has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 4882, 1237, 11150, \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26132b36ed1f150d46a0bf865ea93a15c12f11f6aeaaa53534e35cc1d7323b9"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.openTableStructure (cyclomatic 22): queryStore.useQueryStore.openTableStructure has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 11 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4800}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0b49070c9f223dc66bd97ed71be67767484da073fd89bff8bf6bbd0f101958"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.ensureManualTransactionSession (cyclomatic 22): queryStore.useQueryStore.ensureManualTransactionSession has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6266}}}],"partialFingerprints":{"codehealthFindingId/v1":"919bdf7aad05d9a6e58934ca542306a2456cdde0990e998cd301b870f531250e"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.executeTabSql::executeWithoutManualTransaction (cyclomatic 22): queryStore.useQueryStore.executeTabSql::executeWithoutManualTransaction has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 2 other methods here (queryStore.useQueryStore.executeTabSql, queryStore.useQueryStore.executeTabSql::bindLargeValueContext) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9615}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee137aead48fc5b7f4c914d41e651fac775fcff5e010342aa7825eb0ebf57bc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_export::fetch_table_export_batch (cyclomatic 21): dbx_core::data::table_export::fetch_table_export_batch has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ebea722d21e2d366dec7d3412d618b1f3bc8f7415066a39b7a3ea6876f7f4c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::write_large_value_snapshot (cyclomatic 21): dbx_core::query::write_large_value_snapshot has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"d550bc48ef6dfdade43fc5fb09080cd9c19cbbad4830c85faae36dc3c5707d58"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::get_table_ddl_core_with_options (cyclomatic 21): dbx_core::schema::get_table_ddl_core_with_options has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":11397}}}],"partialFingerprints":{"codehealthFindingId/v1":"0054c3ce9c4d9e3633fe684adde4b13dfd1309f89896de7edc6ddba87fde4554"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::exact_metadata::request (cyclomatic 21): dbx_core::schema::exact_metadata::request has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/exact_metadata.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad1703fc460da16f1ca58005169fb5b44c91d8465330229779f06a216d1c75f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::service::runtime_identity_in_session (cyclomatic 21): dbx_core::schema::native_jobs::service::runtime_identity_in_session has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/service.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a6df6f4b744d36716f2ae47f4bc858c60e293a7053fe8d4ada558255786d51"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_triggers::validate_source_definition (cyclomatic 21): dbx_core::schema::oracle_triggers::validate_source_definition has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_triggers.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f4f0356cd931496bd6998a7bb4a450bc3493956ce679e7f682d12dd491abc6"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_agent::agent_service::is_macho_binary_for_cpu (cyclomatic 21): dbx_driver_agent::agent_service::is_macho_binary_for_cpu has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":4454}}}],"partialFingerprints":{"codehealthFindingId/v1":"600b09e09fd6305c20f8aec91f073b533a405a06c0f74dce8c57cb37407ed771"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_driver::json_filter_value_to_bson (cyclomatic 21): dbx_driver_mongodb::mongo_driver::json_filter_value_to_bson has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb873302451eec7884a77c3ed961e2816618c18ab271ae56cafe2b1684a5edb"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeConfig::from_environment_and_args (cyclomatic 21): RuntimeConfig::from_environment_and_args has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/runtime.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b11809a1912478baf1c307a58f0923a023c79fa80078bc5b68d66e08ef8dfda"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::remove_connection (cyclomatic 21): DbxMcpServer::remove_connection has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5c938ba0645b02a546fd170d6061382534faf2159e66cc1b6ca1a9366b0749"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::ensure_plugin_tool_policy (cyclomatic 21): DbxMcpServer::ensure_plugin_tool_policy has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4933}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd1dd926b21ff0ccbee21b0931ccee859f45d7c4b9c38485361b656d1a99c43"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::iotdb_tree_count_sql (cyclomatic 21): dbx_sql_data::query_result_sql::iotdb_tree_count_sql has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce025cd41e74d4ac198bdee5b4003ac20506ab0304055a431ec8d98944c86097"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::triggers::oracle_trigger_body_start (cyclomatic 21): dbx_sql_schema::table_structure_sql::triggers::oracle_trigger_body_start has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"16684787f4a0f76526538618f1f1d980950b19cecad62ef205bdc9059778ddad"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_types::models::connection::parse_as400_jdbc_endpoint (cyclomatic 21): dbx_types::models::connection::parse_as400_jdbc_endpoint has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e16ed7181202ef19f1664a00526a92f323678a388e5d6e798d2eb68e1943c0a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_web::serve (cyclomatic 21): dbx_web::serve has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"800b1ac47048fdd3e7459a94eb8b68932ba9ea646435e4a01e73fab088203481"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_plugin_packager::run_package_cli (cyclomatic 21): dbx_plugin_packager::run_package_cli 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":"plugins/sdk/packager/src/main.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb158475e3254cd53bf2898ceb38acb62da362cba9e5272924a6d0dedddd19f"}},{"ruleId":"D1","level":"warning","message":{"text":"TrackedPhysicalConnection.\u003Cinit\u003E (cyclomatic 21): TrackedPhysicalConnection.\u003Cinit\u003E 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":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"9506425ee592b6bade4b23a2d965e33d6a9ebd7252e5273abc8eb5ebef35cb07"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeLegacyJobSession.\u003Cinit\u003E (cyclomatic 21): NativeLegacyJobSession.\u003Cinit\u003E has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/NativeLegacyJobSession.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf82988c8db6622bc75c7e618b1e8fc2c3b71f119e8f6c39b2df28b2d420d4a"}},{"ruleId":"D1","level":"warning","message":{"text":"DamengAgent.queryConstrainedTables (cyclomatic 21): DamengAgent.queryConstrainedTables has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: DamengAgent.resultValue (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7c020674f3b59a3398bee173560b69b3d8e757b2bb97fc0a20da8553a5ce6c"}},{"ruleId":"D1","level":"warning","message":{"text":"OceanBaseLobValues.read (cyclomatic 21): OceanBaseLobValues.read 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseLobValues.java"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff359bbe97e45993b4b1f6268671ff965167b52144c32791fe14c8dd4e235ffa"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugCapabilities.probe (cyclomatic 21): PlDebugCapabilities.probe has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCapabilities.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"066aa927ad865a688c1ec7305eb0d18bc7bf9037ff6aa7acd3ea01a5e86d8e7f"}},{"ruleId":"D1","level":"warning","message":{"text":"TranswarpAgent.getColumns (cyclomatic 21): TranswarpAgent.getColumns has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/transwarp/src/main/java/com/dbx/agent/transwarp/TranswarpAgent.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d32784e1b39902daee928f90db874d266460d523bffabc3ce3057c74f85c47"}},{"ruleId":"D1","level":"warning","message":{"text":"ci-gradle.acquire_and_run (cyclomatic 21): ci-gradle.acquire_and_run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/ci-gradle.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5deec49ae19761572db71fe36b89c5d0a86c5a8edbdb1340e2ebbdabf1a6b3"}},{"ruleId":"D1","level":"warning","message":{"text":"zooKeeperDiscovery.Endpoints (cyclomatic 21): zooKeeperDiscovery.Endpoints has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"74eaf51dcc99fc869e324f7613e4fffb2023fa7f95f15ee9a8bcdde35de3d395"}},{"ruleId":"D1","level":"warning","message":{"text":"cassandraConfig.clusterConfig (cyclomatic 21): cassandraConfig.clusterConfig has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"0611e7f9781b0aa57c73b6920576ef19eb1378814e8f317c4e08f2f8be23ac13"}},{"ruleId":"D1","level":"warning","message":{"text":"etcd2Session.status (cyclomatic 21): etcd2Session.status has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/status.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e133fd008cd98a04d888a859e7d2b31c35bc89f4c4b561db16db7d6f121cae8"}},{"ruleId":"D1","level":"warning","message":{"text":"zooKeeperDiscovery.Endpoints (cyclomatic 21): zooKeeperDiscovery.Endpoints has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/discovery.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e9c87734867d0c7031431175459d8249ae049cdac1ec887be16e455ca48351"}},{"ruleId":"D1","level":"warning","message":{"text":"server.completionAssistantSearch (cyclomatic 21): server.completionAssistantSearch has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/metadata.go"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e4ca43f45ae66c7ecef4efb89f8d38bbc46bf2c99ed5e9c0565b95fa323ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"main.hasTopLevelSQLKeyword (cyclomatic 21): main.hasTopLevelSQLKeyword has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d160c69125ec40a0e1ac2dc4243562c8f7d68a1b08ecf34a5c0a88d6cb2c33a"}},{"ruleId":"D1","level":"warning","message":{"text":"main.skipSQLParenthesized (cyclomatic 21): main.skipSQLParenthesized has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"235724a0ee9def73303ae6a1a73618048838beb0e2116e11899ba7f854453f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"server.getTablePartitioning (cyclomatic 21): server.getTablePartitioning has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6eea1c6fbb72cfe3254204bf3774e48afc07c846776bee090e2b7d063cd812"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listIndexes (cyclomatic 21): server.listIndexes has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3f62f57f4ed8fdd8c43acdb621a979565c25deaadca097aa0179d5330e0792"}},{"ruleId":"D1","level":"warning","message":{"text":"main.appendGraphDisplay (cyclomatic 21): main.appendGraphDisplay has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/graph_display.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02cf9aa63ffe8da340f82f0cb4d4ed276ebd0cdd6602ac1ed8245a9a7598548"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugLegacyIndexType (cyclomatic 21): main.plDebugLegacyIndexType has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_declarations.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f0cbeab83e0f9299eceabf7781a86c614574d2add6679ddff7cc5606b50e47"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeInputTransport (cyclomatic 21): main.plDebugNativeInputTransport has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_transport_preflight.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d909bea9ad4691d61484784d8bfe213692b32149110b2f5b10d5dbdd5b450c"}},{"ruleId":"D1","level":"warning","message":{"text":"server.completionAssistantTables (cyclomatic 21): server.completionAssistantTables has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"148e93b208a207a44b86b983fdfa5aa9beca9b00bf24f865f81ac89e28eeff55"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugSession.currentProgramLabel (cyclomatic 21): plDebugSession.currentProgramLabel has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":5517}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe8f4ef1ea41871bd5fd35b86869a0a85f56f4ab90d0eab6d6550c860034c20"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugCollectionInitializer.object (cyclomatic 21): plDebugCollectionInitializer.object has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_object_initialize.go"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c62a7b832db97ac4968086ad7cfbdec90acbd04564368116696c0432ccc4f1"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.resolveNativeAnonymousSources (cyclomatic 21): plDebugNativeEntry.resolveNativeAnonymousSources has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_anonymous_source.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ab3408243dd0d6c395f6ed9e4cf1a8f49b08d33dab0b9d8569a16faf7690ab"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.listNativeBreakpoints (cyclomatic 21): plDebugNativeEntry.listNativeBreakpoints has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 146). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a20f4a232f68a676a2daf10bce32162bf96d8d4a6af601873c18292e80a1f2d"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.control (cyclomatic 21): plDebugNativeEntry.control has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed7cfb6baea34ca30a949f6c68026b5c4df7b4ab231eb131331b3a063a3d6f2"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.publishNativeStackLocked (cyclomatic 21): plDebugNativeEntry.publishNativeStackLocked has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_stack.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ce88bc5477697b90dab4d5ab1e4e1bd02fd36a4dc1146c2b910ab0bfc73067"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugResultCache.page (cyclomatic 21): plDebugResultCache.page has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_results.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9988307cf793f4e7992c15bb5e28440fa262c6428f0fb4c69bd56d8ee84a0d0"}},{"ruleId":"D1","level":"warning","message":{"text":"main.convertObjectKeyedMap (cyclomatic 21): main.convertObjectKeyedMap has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/routing.go"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"6873908e148404147a620091fd4cd0b32afacbd617bcb54e93434a9dad12eeff"}},{"ruleId":"D1","level":"warning","message":{"text":"server.completionAssistantSearchTypeMembers (cyclomatic 21): server.completionAssistantSearchTypeMembers has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/type_members.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf35cd84cd8629e2e0e08cc09da3b0647032154b24f793a5295587fdd859135f"}},{"ruleId":"D1","level":"warning","message":{"text":"krb5.newInitiatorClient (cyclomatic 21): krb5.newInitiatorClient has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/go-gssapi/krb5/krb5.go"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"78288b2beb161e439e5f29cad45a4fc6910651f78c65aa80e2748fd096c466a4"}},{"ruleId":"D1","level":"warning","message":{"text":"client.valuesToBytes (cyclomatic 21): client.valuesToBytes has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bdb7eb945ecd4d51d4473e9a168590366e31a643c9873274376f84623d032b"}},{"ruleId":"D1","level":"warning","message":{"text":"ddlStorage.oracleStorageClauseEnd (cyclomatic 21): ddlStorage.oracleStorageClauseEnd 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":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f6929dec28e3643672601b40270ed8834225a17d29242a58ef54ffeb227380"}},{"ruleId":"D1","level":"warning","message":{"text":"queryEditorHoverContent.createQueryEditorHoverContent.createHoverDom (cyclomatic 21): queryEditorHoverContent.createQueryEditorHoverContent.createHoverDom has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorHoverContent.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb486dfbe5ee5f1b6e11c8c0194c7873e611daada8a142152912b3e0060becd"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExtractor.useDataGridExtractor.extractorCellValue (cyclomatic 21): useDataGridExtractor.useDataGridExtractor.extractorCellValue has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"418a192a337d06847c266b4aed7d0cae56250e2fd65f03ec4939c608781cce2a"}},{"ruleId":"D1","level":"warning","message":{"text":"useSidebarDatabaseSpecificMutationRuntime.useSidebarDatabaseSpecificMutationRuntime.confirmEditMongoIndex (cyclomatic 21): useSidebarDatabaseSpecificMutationRuntime.useSidebarDatabaseSpecificMutationRuntime.confirmEditMongoIndex has cyclomatic complexity 21 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0b09151a684aa8451ef025f53397976147f051d893aa309597452f1e577c23"}},{"ruleId":"D1","level":"warning","message":{"text":"scheduledDatabaseBackup.normalizeDatabaseBackupSchedule (cyclomatic 21): scheduledDatabaseBackup.normalizeDatabaseBackupSchedule 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":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bb0c7f927beaf7e7b924345331edd60b8894fa7a4844c17375d2a072d92b07"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionConfigTransfer.prepareConnectionConfigImport (cyclomatic 21): connectionConfigTransfer.prepareConnectionConfigImport has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionConfigTransfer.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0559ed0be5470927426e23082fa1d9f2835f0abf97fdbc01a5de0daba0b2134"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridColumnWidthState.saveDataGridColumnWidthState (cyclomatic 21): dataGridColumnWidthState.saveDataGridColumnWidthState has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2938d66b327f70710354c299a969102bc0718d6f7172e4538da0e21092b5bfc8"}},{"ruleId":"D1","level":"warning","message":{"text":"largeValueSnapshot.readLargeValueSnapshot (cyclomatic 21): largeValueSnapshot.readLargeValueSnapshot has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/largeValueSnapshot.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"141f9eef9af80e146257d75703a073b9c4da67f41b301fe4116a11a65e75ff1e"}},{"ruleId":"D1","level":"warning","message":{"text":"regexGenerate.gen (cyclomatic 21): regexGenerate.gen has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"673f6e637b0d4fe1c74e323ac55cbfab076833c70a8c22ffb348181e0b6361f8"}},{"ruleId":"D1","level":"warning","message":{"text":"databaseAuthorizationPlan.databaseAuthorizationsFromTableGrants (cyclomatic 21): databaseAuthorizationPlan.databaseAuthorizationsFromTableGrants has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db55fb650945542acb39770de76769a2253a0a3c1c31c58b35d16a4c18a6b0e"}},{"ruleId":"D1","level":"warning","message":{"text":"databaseAuthorizationPlan.postgresDatabaseAuthorizationSteps (cyclomatic 21): databaseAuthorizationPlan.postgresDatabaseAuthorizationSteps has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"efed812172938e7ebdbd809b2d0c69263df83059e27f3f482a95d2c4ebf16db1"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeJobs.damengChildChanges (cyclomatic 21): nativeJobs.damengChildChanges has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca3984248c61e4d3cb6ea6a15d365cd2f80ad3f2f1db70827ac7ae820067a87"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleConstraints.validateChange (cyclomatic 21): oracleConstraints.validateChange has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecacaa57becfe86c0dfda18f3e0d9b91a9e44b9d5f2880d85732aa068fe231c"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleForeignKeys.validateOracleForeignKeyReference (cyclomatic 21): oracleForeignKeys.validateOracleForeignKeyReference has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdb71aef980af4fd52bc99f2d7fbcf71281e89bc9588bcd27f6c47f90339668"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleIndexes.loadedColumnType (cyclomatic 21): oracleIndexes.loadedColumnType has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1f212c2ef647b7f4bdedc5bb7f905da7d1b3ea2e00bd093fa74018f3af0b95"}},{"ruleId":"D1","level":"warning","message":{"text":"xuguExplainPlan.parseXuguExplainText (cyclomatic 21): xuguExplainPlan.parseXuguExplainText has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/xuguExplainPlan.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84de482f387d1dcee6923099d00fe33dca2af77f64d70cbc0c868ebea8a793d"}},{"ruleId":"D1","level":"warning","message":{"text":"explainPlan.parseOracleExplainText (cyclomatic 21): explainPlan.parseOracleExplainText has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bae062b759b36a4d64749e97353b9937d91836952f29f56a1525a439251a8e"}},{"ruleId":"D1","level":"warning","message":{"text":"explainPlan.parseDamengPlanLine (cyclomatic 21): explainPlan.parseDamengPlanLine has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2078994c37a5c7989b77b1641ef2b7710d0111a89bd81213758f661ff58a24e3"}},{"ruleId":"D1","level":"warning","message":{"text":"explainPlan.buildDamengTree (cyclomatic 21): explainPlan.buildDamengTree has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51a4d00d27971c1b64e6e4452258f2eb479d440f8ecdf555c0f44c6f9ec8af3"}},{"ruleId":"D1","level":"warning","message":{"text":"hoverTableSql.parseColumnLine (cyclomatic 21): hoverTableSql.parseColumnLine has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"216b33c7ac1479dfca9ee58f6853bf743f5133c21a3d0ac1c2fd4762a403095b"}},{"ruleId":"D1","level":"warning","message":{"text":"modifierDoubleTapShortcut.createModifierDoubleTapShortcutController.handleKeydown (cyclomatic 21): modifierDoubleTapShortcut.createModifierDoubleTapShortcutController.handleKeydown has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/modifierDoubleTapShortcut.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"507db369e09212558873b3b199d18603385177b90de6b7c0a5abd9009ae0f002"}},{"ruleId":"D1","level":"warning","message":{"text":"modifierDoubleTapShortcut.createModifierDoubleTapShortcutController.handleKeyup (cyclomatic 21): modifierDoubleTapShortcut.createModifierDoubleTapShortcutController.handleKeyup has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/modifierDoubleTapShortcut.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e355848a521c331228c33701d2cc77b89b209d57ae256b5257187a3fed845438"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaTreeCache.decodeTableSearchIndexManifest (cyclomatic 21): schemaTreeCache.decodeTableSearchIndexManifest has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 54, 62). 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":"apps/desktop/src/lib/metadata/schemaTreeCache.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"228bd96564fc6e66cef20586232faab7fa27c257673e561fe086babfd0b457ef"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaTreeCache.decodeTableSearchIndex (cyclomatic 21): schemaTreeCache.decodeTableSearchIndex has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 95). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/schemaTreeCache.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eef87f9d56942b8d130a435a4f6db5f6a853a608b4ce403ca1a2a049077d247"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.collectScopeVariables (cyclomatic 21): mongoCompletion.collectScopeVariables has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"97adf1ed88587ab94e8e900cadc6199f64be6a6cccddd04939d2b1d30b1a854e"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoConnectionOptions.mongodbAuthFailureHint (cyclomatic 21): mongoConnectionOptions.mongodbAuthFailureHint 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":"apps/desktop/src/lib/mongo/mongoConnectionOptions.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b4e42cd9c529264bc21521a96dbc86f924ddc84d1c79a124d9f92f0fd9d19c"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginShortcuts.collectPluginShortcuts (cyclomatic 21): pluginShortcuts.collectPluginShortcuts has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginShortcuts.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1a4cb2da7230a9d70db8de8cf33a45c7a8767445bd6eabbb4402a2baece691"}},{"ruleId":"D1","level":"warning","message":{"text":"javaSerialized.normalizeJavaSerializedValue (cyclomatic 21): javaSerialized.normalizeJavaSerializedValue 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":"apps/desktop/src/lib/redis/codec/javaSerialized.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc962d746e303a7c7c756a088c4e4efd47f67632fa8f693bc20de9161401f85"}},{"ruleId":"D1","level":"warning","message":{"text":"redisCommandTokenizer.tokenizeRedisLine (cyclomatic 21): redisCommandTokenizer.tokenizeRedisLine has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandTokenizer.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7966a9dfe55a25136eda4a3195a10eeb04b3768d6d0596ca885cd9f6d3192fbd"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineDeploy.executeOracleRoutineDeployment (cyclomatic 21): oracleRoutineDeploy.executeOracleRoutineDeployment has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 679). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: oracleRoutineDeploy.oraclePackageTransferPendingReady (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b15d73c3b15cdc07f306c23df842aff4a394e573477d9e627d92aa1980b45df"}},{"ruleId":"D1","level":"warning","message":{"text":"settingsTransfer.isSqlShortcutActionItem (cyclomatic 21): settingsTransfer.isSqlShortcutActionItem 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":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"087c06957790484a9bb90be64be11c1d3cd36ef5964a0109309dc9456f2ef691"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarMenuLayout.sidebarMenuActionGroup (cyclomatic 21): sidebarMenuLayout.sidebarMenuActionGroup has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarMenuLayout.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"41738bc010dd5b0c7a673152678c2d7dabd4ac0174077a897c02c27bfbe998ba"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarSearchTree.isUnloadedTypeFilterContainer (cyclomatic 21): sidebarSearchTree.isUnloadedTypeFilterContainer has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e44c75296b9bc9f0ad8aa881a5d4dd52d981264305c1609a7b312ce947347c6"}},{"ruleId":"D1","level":"warning","message":{"text":"treeNodeClick.copyDisplayPathForTreeNode (cyclomatic 21): treeNodeClick.copyDisplayPathForTreeNode 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":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"de19656fb05fa5b47d42c96978aaea816d485d3e479f2b5b5996deabc4c8fa25"}},{"ruleId":"D1","level":"warning","message":{"text":"identifierSearch.identifierMatchScore (cyclomatic 21): identifierSearch.identifierMatchScore has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/identifierSearch.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f1e89f6f1316fd96292553bcc72a31ebcaa38061f7ef8ea34f0bc9d71f09d2"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlServerQueryWrapping.topLevelSqlTokens (cyclomatic 21): sqlServerQueryWrapping.topLevelSqlTokens has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlServerQueryWrapping.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6705bbc2b6f1e2ef23c9909a604b4d0b53271bb6ccb100fe6d144b8f0d26495f"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlSourcePaste.unescapeLiteralContent (cyclomatic 21): sqlSourcePaste.unescapeLiteralContent has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlSourcePaste.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"580d28d4e8b5310e54efabf15ce7ac650c225819b3ec122345555c2867202fa0"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlSourcePaste.readStringLiteral (cyclomatic 21): sqlSourcePaste.readStringLiteral has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlSourcePaste.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6d695cd0a3cc427d33dc96509fba7e5b2dae799b4dd84333d96cc375c02931"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.reloadConnectionDatabaseChildren (cyclomatic 21): connectionStore.useConnectionStore.reloadConnectionDatabaseChildren 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5417}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fccdec3b20436e1679ccd9940a1235a5887d952726d25a98948d381b553611"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.normalizeGroups (cyclomatic 21): queryStore.useQueryStore.normalizeGroups has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2874aba3ef297320f03b23fb08f678537482f7eed34df85177bd74798de6e0"}},{"ruleId":"D1","level":"warning","message":{"text":"settingsStore.inferAiProviderFromConfig (cyclomatic 21): settingsStore.inferAiProviderFromConfig has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a786580954e8f6b0279418e53460d2cf027aea413709c11bc1d819fb8f89450"}},{"ruleId":"D1","level":"warning","message":{"text":"start (cyclomatic 21): start has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 111, 157, 144, \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":"plugins/sdk/dev-host/sidecar.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc42cafbf0c0a1866b36039c4271732e514a390ed4d707f1a210ead065ae6073"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_ai_provider::ai_cli_agent::run_cli_jsonl_agent (cyclomatic 20): dbx_ai_provider::ai_cli_agent::run_cli_jsonl_agent has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1c9531de6caa5e167c59c8078e9d5dff207750153ee3ca4bfc254320f96f01"}},{"ruleId":"D1","level":"warning","message":{"text":"Nb3Archive::restore_steps (cyclomatic 20): Nb3Archive::restore_steps has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"384c8669a617f1322ed655b175ca202c7b893da379614175486e73a910b0a051"}},{"ruleId":"D1","level":"warning","message":{"text":"RetainedResults::manifest (cyclomatic 20): RetainedResults::manifest has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/results.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"949b3e0c36c77a387f0a9baf466093ad413ff38892bd25a2e74eb9acc957a16a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::ai::agent_kv::parse_etcd_prometheus_metrics (cyclomatic 20): dbx_core::ai::agent_kv::parse_etcd_prometheus_metrics has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"3495a76b701494e48464a61445128d23923350cb6acff6c6ff5d8fb6c30f22ea"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::ai::agent_tools::execute_get_columns (cyclomatic 20): dbx_core::ai::agent_tools::execute_get_columns has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2c41c52a2bb605b6bd339c9d96ecb9a7c3de4c462b9d5a4bc7dca3241963ac"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::restore_mongodb_database (cyclomatic 20): dbx_core::data::mongodb_dump::restore_mongodb_database has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"708f9d67aef771c175768ce362b2a0642dee69452bc6d7ccf3fa6e962ed5604a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::sql_import_leading_keyword (cyclomatic 20): dbx_core::data::table_import::sql_import_leading_keyword has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cf8d50021747473f1dd544616d22544cd3d05eaaf17c64c099c08121998c77"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::normalize_thousands_numeric_literal (cyclomatic 20): dbx_core::data::transfer::normalize_thousands_numeric_literal has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1da1782c67060a17ff551af8077a19b0e83fe93862468ef767d96f9a5569cd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::generate_upsert_typed_for_transfer (cyclomatic 20): dbx_core::data::transfer::generate_upsert_typed_for_transfer has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5823}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cddb41c23b28a4e5f936e7b2fd8eabcb44e5f0d2e2c38b14e5a7c45eb0df9c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::persistence::storage::migration_error_code (cyclomatic 20): dbx_core::persistence::storage::migration_error_code has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d884894cd52c1fb350b6388c7d4071efb3dff351783d9ed4980a1fcc62fa9d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::scheduler::verify_initial (cyclomatic 20): dbx_core::schema::native_jobs::operations::scheduler::verify_initial has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b505da459c98ea4e82fa984e324416831a297af091c4bcb33596a2f3aecdf66"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_triggers::list_objects (cyclomatic 20): dbx_core::schema::oracle_triggers::list_objects has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_triggers.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d192cbeb38ebe8b80e2acda3463d88fedf4c949e9b6604b11a86d9a5ee17cb"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_type_evolution::type_state (cyclomatic 20): dbx_core::schema::oracle_type_evolution::type_state has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_evolution.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78174e830bc095ede0255b9ebc1badb79822b2d75db107365d6ec0a07cb6d4e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_agent::agent_connection::agent_connect_params_with_role (cyclomatic 20): dbx_driver_agent::agent_connection::agent_connect_params_with_role has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_connection.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bbfa2b9e0af8d33db438a7448e644bf24225ba45dbe6f21f4ca30a6d24ee6a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_elasticsearch::normalize_elasticsearch_rest_path (cyclomatic 20): dbx_driver_elasticsearch::normalize_elasticsearch_rest_path has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"348ab8072f4c1e7912b4207ad4f9c3bf0178e639491aabf18ecd499b36e3963a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_postgres::postgres::pg_temporal_array_text_to_json (cyclomatic 20): dbx_driver_postgres::postgres::pg_temporal_array_text_to_json has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to 4 function items inside it that branch (parse_array, parse_quoted, normalize_array_value, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3db6ad0158d0af4dd70c999fb13f0b8f6825f2de64a974cf9de6c132d49c49a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::sqlserver_completion_assistant_sql (cyclomatic 20): dbx_driver_sqlserver::sqlserver::sqlserver_completion_assistant_sql has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d235769847c4859fd177015220401314dbbd1b45f2c4cff2a145819f9e0992"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_support::ssh_config::apply_host_entry (cyclomatic 20): dbx_driver_support::ssh_config::apply_host_entry has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/ssh_config.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3928b613c6a44b8981da27e9212fa172ee3e407f868068549a1fdfafb2867c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionCompiler::field_condition (cyclomatic 20): ExpressionCompiler::field_condition has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93c13bf0a0f2b86da662526989b48fedb96691b424406f5006417895e32f336"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::sqlite::strip_sql_comments (cyclomatic 20): dbx_drivers::db::sqlite::strip_sql_comments has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fc26648ffe3dfa745e189b9aeef75823eae380c922ffabbb05822e4b1ea668"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarType::read (cyclomatic 20): ScalarType::read has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2381a28a268a27dc7182261297cd5189c135e89d181b2c37d3cc05b2ed36c0bb"}},{"ruleId":"D1","level":"warning","message":{"text":"OraclePlSqlBlockWalk::step (cyclomatic 20): OraclePlSqlBlockWalk::step has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4231}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b595aa7191054589ae7083a70c0f8833e58571786cf22698eff2d6c1d30e55"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::leading_executable_sql_with_options (cyclomatic 20): dbx_sql_core::sql::leading_executable_sql_with_options has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3686}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fef380aca672ec8ccd55abbc189cc2f78fd18e33a1688e26b3bcd45ce5cc77"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::sqlserver_control_flow_batch_boundary (cyclomatic 20): dbx_sql_core::sql::sqlserver_control_flow_batch_boundary has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3901}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5b2bc75d26121188d628e11e47ceac7813acb634fd0399540aedb1f161f1fd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::consume_postgres_cast_group (cyclomatic 20): dbx_sql_schema::schema_diff::consume_postgres_cast_group has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5188}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e98f6cc95d3c715f928392e3633af96ca365d889f2cae9478994b2003092a4"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::transwarp::validate_create_options (cyclomatic 20): dbx_sql_schema::table_structure_sql::transwarp::validate_create_options has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/transwarp.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9dc50bf9a5a9d4475f39e37f3016ee6b1d611e0000a1f8ff9c8089861946a1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::triggers::build_exact_trigger_operations (cyclomatic 20): dbx_sql_schema::table_structure_sql::triggers::build_exact_trigger_operations has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5394765978566da8713aede6e0bc1806fb1a867ef49256ff8e5d4d05272b9f1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_types::models::connection::normalize_mysql_url_params (cyclomatic 20): dbx_types::models::connection::normalize_mysql_url_params has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf85d24baf9b7757a905978b4a9eccf6b1df33f1eed94c9a843e5bfaf72efd28"}},{"ruleId":"D1","level":"warning","message":{"text":"DamengAgent.getExplainInfo (cyclomatic 20): DamengAgent.getExplainInfo has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: DamengAgent.resultValue (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3559}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d489a7c025d686fdbbdf85de0656960481442ee2622a4175e6671fc098cad4"}},{"ruleId":"D1","level":"warning","message":{"text":"MongoAgent.parseDropIndexesValue (cyclomatic 20): MongoAgent.parseDropIndexesValue has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: MongoAgent.dispatch (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"512b2a0cbdd1a8de7d17defbf317816dbad1eb29787da99c9e1abcdc31787c89"}},{"ruleId":"D1","level":"warning","message":{"text":"OceanBaseLobValues.preview (cyclomatic 20): OceanBaseLobValues.preview has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseLobValues.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f07b35931bed83b5cd3a61073cae4a3f5064aa5e4abf3a59bfd39394e84ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"OceanBaseOracleAgent.getColumnsInContext (cyclomatic 20): OceanBaseOracleAgent.getColumnsInContext has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43d55862c6b49d45c39ed63bd2e4e50c6999f4483948ddc7e2d3dbf1b7a26c4"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugNative.stackResult (cyclomatic 20): PlDebugNative.stackResult has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugNative.java"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"1625da46b3205df233a85b070956181f1ec3e9b4fce4375ccf9a88ece398cb2d"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugSession.start (cyclomatic 20): PlDebugSession.start has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c469e0dc0a16636a81d8077beb9c9a0994ebedb3fa9559d0b43147d121a80bc"}},{"ruleId":"D1","level":"warning","message":{"text":"main.legacyMaterializedViewOptions (cyclomatic 20): main.legacyMaterializedViewOptions has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/materialized_view.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9d1d0a4e55d63c7310785e0eb430624cb90680c80466b1cc5464890e165f80"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseKingbasePartitionBound (cyclomatic 20): main.parseKingbasePartitionBound has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0a088623437a4a418414b30fba7f59b1b7851f71a42633087e3b2df229a8cf"}},{"ruleId":"D1","level":"warning","message":{"text":"main.splitNativeDSNFields (cyclomatic 20): main.splitNativeDSNFields has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"023ab1b5a49c8459fb55539058c68345daab85846a900056b7afd3501f5581eb"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatch (cyclomatic 20): runtimeServer.dispatch has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/main.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4a861ad0899ea0514e84d0434441dfbbb1a3d25a4e1a7571792264a72798b5"}},{"ruleId":"D1","level":"warning","message":{"text":"server.completionAssistantSearch (cyclomatic 20): server.completionAssistantSearch has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/metadata.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5fec1c50c8f16fedfcee53a2fa33ef0779e42d912c89d3e24111f1adca9dd1"}},{"ruleId":"D1","level":"warning","message":{"text":"main.oracleLegacyOptions (cyclomatic 20): main.oracleLegacyOptions has cyclomatic complexity 20 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 7 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":"agents/drivers/oracle-go/legacy_charset.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03205c755a6a66d2aa4fa7f6aa360cad834ad8dec6cda8d2cba103598b0f4c1"}},{"ruleId":"D1","level":"warning","message":{"text":"main.oracleColumnTypeDDL (cyclomatic 20): main.oracleColumnTypeDDL has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4352}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fe6c4034bdc005d2e6180b2144721fa5fcd247b12c95e14bc66797c21d120d"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugSubprogramRange (cyclomatic 20): main.plDebugSubprogramRange has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":5063}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fea6196d5c364926b30545fa41f3fb1ce6b877fc9d4b6a4f251dbc76488342"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugLegacyDerivedType (cyclomatic 20): main.plDebugLegacyDerivedType has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_type_graph.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad46fa1da64799c4e57353ce29f66ae2dc5898d5858fa16ea2f0d7d18357a838"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugLoadNativeSourceBounded (cyclomatic 20): main.plDebugLoadNativeSourceBounded has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 69). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_source.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd66bd879d063e4ea5219607ce513b13f05e35bfdab260899d79a10ac2b50af"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugValidateTypedUnicode (cyclomatic 20): main.plDebugValidateTypedUnicode has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_unicode.go"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"675fb71617e55d4252d3338c6379ca341ff1e0da89ba0c0ebf63e79e0278e9ce"}},{"ruleId":"D1","level":"warning","message":{"text":"server.queryRowsWithOracleValueRewriteIfNeeded (cyclomatic 20): server.queryRowsWithOracleValueRewriteIfNeeded has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5217}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb037f9c7255390976cd8b79c79ab40a62d148f1f1cb7734a72a527578ff3e6"}},{"ruleId":"D1","level":"warning","message":{"text":"server.pendingNativeCompletion (cyclomatic 20): server.pendingNativeCompletion has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_drain.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1718f4790a8bb73ac810b64bebfe0f79620221ba017cb27726eb42b22275cb0"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.originalPhysicalReleaseConfirmed (cyclomatic 20): plDebugNativeEntry.originalPhysicalReleaseConfirmed has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbfff4471c078fb0dc630a14e6db483adfa292d5cd31efc9914bd88ba75725e"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeEntry.readNativeMappedStack (cyclomatic 20): plDebugNativeEntry.readNativeMappedStack 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":"agents/drivers/oracle-go/pldebug_stack.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"50333b206a39d331a77cbf5d8119d17c110d3c200cb8c5413f8f1d2fdd0d2fc3"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativePlan.boundInputs (cyclomatic 20): plDebugNativePlan.boundInputs has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2583d9aaf4938b6f7bc8defdc825add1107e159ea6ce4ec114b3f983a433bc16"}},{"ruleId":"D1","level":"warning","message":{"text":"proxyMessagingClient.Send (cyclomatic 20): proxyMessagingClient.Send has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/proxy.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6ac7c1e4bbb7aa81041a979e215c83b09e7fc95bce7dc222bfc01577862ac4"}},{"ruleId":"D1","level":"warning","message":{"text":"main.splitNativeDSNFields (cyclomatic 20): main.splitNativeDSNFields has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: server.dispatch (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"64325b5c5da03f39ce002ddaa81f360471a7b364013191dd95ddf192b9f596fb"}},{"ruleId":"D1","level":"warning","message":{"text":"server.getColumns (cyclomatic 20): server.getColumns has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10fbc0e886ea985bb86899a6da5fa9a1d6ad648239b8e94ba1b7504ec5f5730"}},{"ruleId":"D1","level":"warning","message":{"text":"IoTDBRpcDataSet.getStringByTsBlockColumnIndexAndDataType (cyclomatic 20): IoTDBRpcDataSet.getStringByTsBlockColumnIndexAndDataType has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc0dc63e9f591b295f6c9abfe06a00a71bb57deb650907a415ded5f08e36406"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorBatchSelection.useQueryEditorBatchSelection.applyBatchColumnSelection (cyclomatic 20): useQueryEditorBatchSelection.useQueryEditorBatchSelection.applyBatchColumnSelection has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"41460eee5a84796145369321168956b25047a3fe716aaa0a0e81fce11d9b590c"}},{"ruleId":"D1","level":"warning","message":{"text":"queryEditorSqlExtensions.configureQueryEditorSqlExtensions.createViewDecorations.currentStatementFrameExtension (cyclomatic 20): queryEditorSqlExtensions.configureQueryEditorSqlExtensions.createViewDecorations.currentStatementFrameExtension has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c36825e3120423e44c85083096df7763625b1363ebe42c16bf245a54bba485"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.clearPersistedPendingChangesForSave (cyclomatic 20): useDataGridEditor.useDataGridEditor.clearPersistedPendingChangesForSave has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f21d1a6932951ab852ec92f8c9c787479edf275483d27531bd11858ea15482"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.executeConditionalUpdate (cyclomatic 20): useDataGridEditor.useDataGridEditor.executeConditionalUpdate has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"db81b451484cc01c7a2b288cbe983c59f7fa5bd62cb13bba251429a3a0266806"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.captureSqlInsertExportData (cyclomatic 20): useDataGridExport.useDataGridExport.captureSqlInsertExportData has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"2860304060592a91f6369d30270b1d4665e527a6d1f6d268514608c447c102d8"}},{"ruleId":"D1","level":"warning","message":{"text":"aiPluginConversation.createPluginAiConversation (cyclomatic 20): aiPluginConversation.createPluginAiConversation has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiPluginConversation.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e8ed65c1d5619794938f22659596d25482ba6d9d68ee5e56879313ee3b610f"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionDeepLink.parseConnectionDeepLink (cyclomatic 20): connectionDeepLink.parseConnectionDeepLink has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"be14711621ce0ec6001076663ea67942db38bc16543a80d8917173655e7e7c08"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionUrl.parseZooKeeperUrl (cyclomatic 20): connectionUrl.parseZooKeeperUrl has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"49013d88ea62ca3313f17c6a3ba150b612b989881d6e0fc18f3ebf052fa4d01b"}},{"ruleId":"D1","level":"warning","message":{"text":"columnFormatter.formatNumber (cyclomatic 20): columnFormatter.formatNumber has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0cf9c6e85714998a200a5d216f4903d8c22ae635513ce2d5494638e2ce41be"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridColumnHighlight.computeColumnHighlightMatchKeys (cyclomatic 20): dataGridColumnHighlight.computeColumnHighlightMatchKeys has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb47efee13c4c1a73dff93c879ac7f59c872f4503a3ff5d0a30da557883ecf8"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridColumnVisibility.areCellValuesEqual (cyclomatic 20): dataGridColumnVisibility.areCellValuesEqual has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnVisibility.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"475bc0b50a5901015bec98df202bb9c47ef5dd96faed3fbe63cd8656f43429a8"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridSort.compareDataGridValues (cyclomatic 20): dataGridSort.compareDataGridValues has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSort.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d88f4c7a4a901fa528e1df8714713032f0013a44d8b284128d3ffecf0b3852f"}},{"ruleId":"D1","level":"warning","message":{"text":"geometryPreview.drawGroups (cyclomatic 20): geometryPreview.drawGroups has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c20eeded3d3b70037f78360b5b4427bc65a3df9bbff2db87c8165381ac8efd"}},{"ruleId":"D1","level":"warning","message":{"text":"gridClientFilter.matchesResultClientFilter (cyclomatic 20): gridClientFilter.matchesResultClientFilter has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/gridClientFilter.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4930abd8c09c918bf8c2bfd89ec46164711d720b0794543be79b70e9557669e4"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTriggerPlan.executeTriggerSequence::run (cyclomatic 20): oracleTriggerPlan.executeTriggerSequence::run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"756939ff8d571c704b0fa745f924b9bb6ba8bd9ac986d726cdeef17f84f2e77c"}},{"ruleId":"D1","level":"warning","message":{"text":"erDiagram.buildDiagramJoinSql (cyclomatic 20): erDiagram.buildDiagramJoinSql has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/erDiagram.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"357794dc7b32e588d48fb98e776f1ac7dd5d1176495c1540839f7ff0c38732c9"}},{"ruleId":"D1","level":"warning","message":{"text":"databaseExportOptions.loadSavedDatabaseExportOptions (cyclomatic 20): databaseExportOptions.loadSavedDatabaseExportOptions has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExportOptions.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d51ab4ccbd552d1849170906b4f706b9d7e6ad7a34355acf188803486a2509"}},{"ruleId":"D1","level":"warning","message":{"text":"diagramSvgExport.buildTableDiagramSvg (cyclomatic 20): diagramSvgExport.buildTableDiagramSvg has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/diagramSvgExport.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f697ddc9af06f695a6b28ba292974cfc155f01aa62b772649a1863eef374636"}},{"ruleId":"D1","level":"warning","message":{"text":"datagripImport.mergeFragments (cyclomatic 20): datagripImport.mergeFragments has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"583df1217e89c494c45237dff8d36a99c23b1765de3cd461ad0e2e13c5fe2634"}},{"ruleId":"D1","level":"warning","message":{"text":"objectMetadataCache.loadObjectMetadataFacetInternal (cyclomatic 20): objectMetadataCache.loadObjectMetadataFacetInternal has cyclomatic complexity 20 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/objectMetadataCache.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1300056253fbf080ff859d120fbd7574870705de5533f9761a3d7844bdb2588f"}},{"ruleId":"D1","level":"warning","message":{"text":"tableMetadataCache.loadTableColumns (cyclomatic 20): tableMetadataCache.loadTableColumns 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4233d12d5dd1f18946f49410de32d319394735236781540a358a3d7e3695f645"}},{"ruleId":"D1","level":"warning","message":{"text":"neo4jNodeResult.projectNeo4jNodeResult (cyclomatic 20): neo4jNodeResult.projectNeo4jNodeResult has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/neo4j/neo4jNodeResult.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ccea62f57c309306dc91c0f3cd0147063e460d19c92fbf9b506faa301b1c71"}},{"ruleId":"D1","level":"warning","message":{"text":"dynamicContextMenu.parseEntry (cyclomatic 20): dynamicContextMenu.parseEntry has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/dynamicContextMenu.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0910de14a524b838f77c57ef163e1bbe8249e5ee1445b07ca06ef9e8298d257b"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginUiHtmlCache.inlineLocalUiAssets (cyclomatic 20): pluginUiHtmlCache.inlineLocalUiAssets has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 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":"apps/desktop/src/lib/plugins/pluginUiHtmlCache.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1402f787fcbcac9ea193b5c8f12f958a6715e840c9be04f7db2a6534ed97142"}},{"ruleId":"D1","level":"warning","message":{"text":"batchQueryPagination.prepareBatchQueryPagination (cyclomatic 20): batchQueryPagination.prepareBatchQueryPagination has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 9 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 28, 58). 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":"apps/desktop/src/lib/query/batchQueryPagination.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7f7422a4bb6fd47fe30b85604367a0829c0fa99efddc4b716d4a01afbe5841"}},{"ruleId":"D1","level":"warning","message":{"text":"redisSyntaxDiagnostics.buildRedisSyntaxDiagnostics (cyclomatic 20): redisSyntaxDiagnostics.buildRedisSyntaxDiagnostics has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisSyntaxDiagnostics.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b381bcafa51d494828bd7a8320f1896ca2d4938159b0ddd417d5f3dbc87740fb"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlAnalysis.parseTableSourceAt (cyclomatic 20): sqlAnalysis.parseTableSourceAt has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5e2cb78d4813b09b2c81e1f7f6fc43f399c9d6cae06f92a37eba036eb812b9"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlAnalysis.stripSqlComments (cyclomatic 20): sqlAnalysis.stripSqlComments has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"9619596e45eb6343d60e53f88d4437661e6781059a7b69f6b2f7b0f72e79949c"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.maskSqlForStructureScan (cyclomatic 20): sqlCompletion.maskSqlForStructureScan has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed71331be5069ca04cff5554ce46ca66dbfd6aca0e5a84928576d2fc5e846391"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.extractSelectColumnNames (cyclomatic 20): sqlCompletion.extractSelectColumnNames has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4583}}}],"partialFingerprints":{"codehealthFindingId/v1":"c573118747cd3b5f1ae6ea7845259730bea4e02cd1346d3aff24a85a290c46a8"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.buildCompositeHeuristicJoinConditionItems (cyclomatic 20): sqlCompletion.buildCompositeHeuristicJoinConditionItems has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6611}}}],"partialFingerprints":{"codehealthFindingId/v1":"760267a9e27f89f193fa2dba8a2a7aee6d649a8fae16302d91b77ca555723d50"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectSqlServerModuleBatchRanges (cyclomatic 20): sqlParameters.collectSqlServerModuleBatchRanges has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40489c2bd84d81fc26729fc3efd828d36d16cb3269101cd4f8bb6f8e22a345e"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlNavigation.matchSqlObject (cyclomatic 20): sqlNavigation.matchSqlObject has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to 6 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7dbb73870bc42cc9574188c82c8bed9de146787ab7512062a643b2b81ec8eb"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlVariables.collectDeclarations (cyclomatic 20): sqlVariables.collectDeclarations has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a5d62b74e9558652ee101b3414347421f1e4b102e6a505ac50130177116fc4"}},{"ruleId":"D1","level":"warning","message":{"text":"columnDefaultPresets.starRocksDefaultPresets (cyclomatic 20): columnDefaultPresets.starRocksDefaultPresets has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/columnDefaultPresets.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f503e459ed2cf70cbef012e4efb8b526cbec786fe2dde9a0e3ce967315da233"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTableRename.maskTriggerCommentsAndStrings (cyclomatic 20): oracleTableRename.maskTriggerCommentsAndStrings has cyclomatic complexity 20 (threshold 15). Of this number, 17 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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d163c7e5e8bc930170edf0a1d81cb65268d1b3a9ca4f521f08fb9072f5a5047c"}},{"ruleId":"D1","level":"warning","message":{"text":"routineParameters.parseXuguRoutineParameter (cyclomatic 20): routineParameters.parseXuguRoutineParameter has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4b5725bda7d0a5c3b37b6c454a7c7b01f3b3fc4b27dba5ec35d79e7f09ffc7"}},{"ruleId":"D1","level":"warning","message":{"text":"tableVGroup.resolveTableVGroupScopeFromNode (cyclomatic 20): tableVGroup.resolveTableVGroupScopeFromNode has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcc1048770536eb80c6c9da68fca37d44e0237c85e64fd563f02be178f71edf"}},{"ruleId":"D1","level":"warning","message":{"text":"tabPresentation.resultRunSourceLabel (cyclomatic 20): tabPresentation.resultRunSourceLabel has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb039517bb641428f3b5f9724965d4afc8ff4ae557acc603d595652bcfc4e158"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.updateConnectionDatabaseInfo (cyclomatic 20): connectionStore.useConnectionStore.updateConnectionDatabaseInfo has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5065}}}],"partialFingerprints":{"codehealthFindingId/v1":"c947d71aafea8267773a82a7947cc5b937c9ac1d4c2af5955a2b9fe4061c2588"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.refreshSidebarObjectPagination::refreshNodes (cyclomatic 20): connectionStore.useConnectionStore.refreshSidebarObjectPagination::refreshNodes has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11464}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b575cfe80d2ba6c108354d24fc5a1de2a887fb2aeff70674b4045ef261ad515"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.setBreakpointEnabled (cyclomatic 20): plDebugStore.usePlDebugStore.setBreakpointEnabled has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"131f15fa3038bd435a5e5454c0d9e19fd76645dc236c6f16645dea75fe53b38d"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.annotateQueryResultSources (cyclomatic 20): queryStore.annotateQueryResultSources has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f989d8faa6d36d00d3c8134f485a2bc70af1a0535c6af6969487e6a78f85da"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.openPluginWorkbench (cyclomatic 20): queryStore.useQueryStore.openPluginWorkbench has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4561}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ec612f910b9b95bbdcbf357c4ee212b7857669ef4c89c19a46f84802d2a9e2"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.executeTabSql::bindLargeValueContext (cyclomatic 20): queryStore.useQueryStore.executeTabSql::bindLargeValueContext has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (queryStore.useQueryStore.executeTabSql, queryStore.useQueryStore.executeTabSql::executeWithoutManualTransaction) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8210fcb85eebc39b1c57dcef37668acd0e8454db4f004b9e030ef01bf57beb2"}},{"ruleId":"D1","level":"warning","message":{"text":"savedSqlStore.useSavedSqlStore.reorderFolders (cyclomatic 20): savedSqlStore.useSavedSqlStore.reorderFolders has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 9 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1026, 1022, 1008). 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6445cf85e630952c0f3100e1f42264e06af0ff7728c2ac1975b50b4c279ae58"}},{"ruleId":"D1","level":"warning","message":{"text":"savedSqlStore.useSavedSqlStore.moveFolderToFolder (cyclomatic 20): savedSqlStore.useSavedSqlStore.moveFolderToFolder has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1060, 1054, 1055). 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5858cf46d45b69499ef5891604b455d5c243b81e47f99a8056c6d40458ddca"}},{"ruleId":"D1","level":"warning","message":{"text":"transferTaskStore.useTransferTaskStore.moveFolderToFolder (cyclomatic 20): transferTaskStore.useTransferTaskStore.moveFolderToFolder has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 418, 409, 413). 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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3e9c0767cb5d8e191234123dd337cd36c5c0c4afeb6ecda1020a0a0bc474a4"}},{"ruleId":"D1","level":"warning","message":{"text":"transferTaskStore.useTransferTaskStore.reorderFolders (cyclomatic 20): transferTaskStore.useTransferTaskStore.reorderFolders has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 9 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 445, 441, 431). 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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dac78443d38627fd87871abc34ead674b7431f9db106665aa882b1c36ead875"}},{"ruleId":"D1","level":"warning","message":{"text":"RouteProgress.RouteProgress (cyclomatic 20): RouteProgress.RouteProgress has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 74, 65, 17, \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":"docs/components/RouteProgress.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a43ee79329aa48f4201f5fb68c956b7a2c6cbf7a7f966f664d20b2a935f56a"}},{"ruleId":"D1","level":"warning","message":{"text":"ContributorsExperience.ContributorsExperience (cyclomatic 20): ContributorsExperience.ContributorsExperience has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/contributors/ContributorsExperience.tsx"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b1e00aac7c21d24449176e67f1a6207f7accaafd45c92229a02c6c323e2c1e"}},{"ruleId":"D1","level":"warning","message":{"text":"json.hasUnclosedMongoDelimiters (cyclomatic 20): json.hasUnclosedMongoDelimiters has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ae2fa89e994eb656be4c2df8629230504f1697aa52f6b8354d84f8257c289c"}},{"ruleId":"D1","level":"warning","message":{"text":"DuckDbWorkerRuntime::handle_request (cyclomatic 19): DuckDbWorkerRuntime::handle_request has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/runtime.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"283773093689c8559f7dc6d849f99cfb20086f3b53d7c68bfc9b78b6ca6fdd98"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_openai (cyclomatic 19): dbx_ai_provider::ai::stream_openai has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: AiProvider::as_str (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b4973fe21eb60a1b0b280228920def0f22f854c9b7b83530aca8df95ac0884"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_responses_with_tools (cyclomatic 19): dbx_ai_provider::ai::stream_responses_with_tools has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: AiProvider::as_str (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4842}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1040a157cfa7dadb150d164a0bf9ae4f026dd8c471527d2dcf64341a3acc88"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::dameng_dump::run_dameng_dump_task (cyclomatic 19): dbx_core::data::dameng_dump::run_dameng_dump_task has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/dameng_dump.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"913481cb3f0f890eb97747500f5d058e2b75c7b3e0032bf8f843dc15b417d582"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::directory::inspect (cyclomatic 19): dbx_core::data::mongodb_dump::directory::inspect has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/directory.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"02faca90e34ada0fd356414e99c0ccdfa223797ec61c4ac7601c1b952e58ae48"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::export_mongodb_query_inner (cyclomatic 19): dbx_core::data::mongodb_import_export::export_mongodb_query_inner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2d8930b03257b7f8a05ba2f3216b674a12c3885e90056d18dfda689567313c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::script_generator::wrap_if_not_exists (cyclomatic 19): dbx_core::data::script_generator::wrap_if_not_exists has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6621da9a2c0b5932c43379afdd2a6eaf7e743940f368b32295ad21117e4dcf2"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::read_xlsx_shared_strings (cyclomatic 19): dbx_core::data::table_import::read_xlsx_shared_strings has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3329}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d937587b628f8da059b86dbcdd5c6a31ff67796d7376e6a9cfc4e721db0fcc8"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::exec_tx_sqlite_inner (cyclomatic 19): dbx_core::query::exec_tx_sqlite_inner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":6254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec40d0d80778eccc635e9bfbe4a982665f3136189d3e4ba417925556bc39179c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::document_ops::find_documents_core_with_total (cyclomatic 19): dbx_core::query::document_ops::find_documents_core_with_total has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a1edfbd39322937a1859b0095f361243db9706eb0a2c96a47c706e8da2e769"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::pl_debug::results::read (cyclomatic 19): dbx_core::query::pl_debug::results::read has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/results.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3340acc818d9fd5513b19d4c013f21acf5cd6258ee672d19628ef66fab2e48"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::sqlserver_manual_transaction::finish (cyclomatic 19): dbx_core::query::sqlserver_manual_transaction::finish has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/sqlserver_manual_transaction.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be14777f49eb2c523777a788fadf80fe9532373c446a26af163e7d48b67efa0"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::list_object_statistics_once (cyclomatic 19): dbx_core::schema::list_object_statistics_once has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d9de9595ff42337f0820d195df0b4704378e5c75ca93c04e52fc0b444834f8"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::list_completion_objects_once (cyclomatic 19): dbx_core::schema::list_completion_objects_once has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":9269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4323ce23d78a32bf379680c74d00ae71ebdf09d39581de71f518818bd961267"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::postgres_object_source (cyclomatic 19): dbx_core::schema::postgres_object_source has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":14696}}}],"partialFingerprints":{"codehealthFindingId/v1":"9187ba99f4d467d77a7f433aa38535749aee85d40175d0909b3d1825eea82865"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_agent::backend_error::consume_sensitive_value (cyclomatic 19): dbx_driver_agent::backend_error::consume_sensitive_value has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/backend_error.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00f9c45dc6fd8c92ad4fa4a6a8eff0601512243dff46c66db461ad20ed222fe"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_elasticsearch::adapt_elasticsearch_sql_query (cyclomatic 19): dbx_driver_elasticsearch::adapt_elasticsearch_sql_query has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2892}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22b1693cfbac7dee23e9467fd87fdcbf5f30bc1d141a32a1c414cc69894b0d9"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::mongo_pure_field_predicate (cyclomatic 19): dbx_driver_mongodb::mongo_shell::mongo_pure_field_predicate has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9566813669274bd4fdcbd8f43b7875ba3a83cd2d26585a5465d05ceb52f6783"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_value_to_json_with_data_charset (cyclomatic 19): dbx_driver_mysql::mysql::mysql_value_to_json_with_data_charset has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2c47bdcf78d79274a2ff44f7f3624d643994d7c48a6d9c77f71771bfa3b7a7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_postgres::postgres::pg_array_to_json_value (cyclomatic 19): dbx_driver_postgres::postgres::pg_array_to_json_value has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e96d18e512d9cd9d7907b122ff5db0ac1eb8eeff7aa93f067d9c9af8edfafdf"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::sqlserver_cell_to_json (cyclomatic 19): dbx_driver_sqlserver::sqlserver::sqlserver_cell_to_json has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ecb29fdef6dda2b4a31acb96b1b04ca565e8493c63498250063408ef4a5ef1"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::proxy_tunnel::test_proxy_endpoint (cyclomatic 19): dbx_drivers::db::proxy_tunnel::test_proxy_endpoint has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/proxy_tunnel.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e051c0e5d9bd22f3373912a25364af1dd26116a88b7ec2a51240f0092ff7eff"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::call_plugin_tool_dispatch (cyclomatic 19): DbxMcpServer::call_plugin_tool_dispatch has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5502}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34d843fdf2cddbb887a8a3d73bfa15ce6ce0ab69a3434521ed78644299268e9"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_plugin_runtime::plugins::marketplace::validate_and_resolve_catalog (cyclomatic 19): dbx_plugin_runtime::plugins::marketplace::validate_and_resolve_catalog has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/marketplace.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eca009e754f41983393ae911e2fdf029c8cb6b48a55e98f0e748762b3d0afc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::oracle_type_migration_sql::oceanbase_table_read_only_from_ddl (cyclomatic 19): dbx_sql_core::oracle_type_migration_sql::oceanbase_table_read_only_from_ddl has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc410a8393ebfcffef94fa6a41ef62b86d7d828f3a79f870413f4b4c7297ee16"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::query_execution_sql::build_explain_sql_with_strategy (cyclomatic 19): dbx_sql_core::query_execution_sql::build_explain_sql_with_strategy has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de8c28a49db75e7cd79970ca3eee8cb683e1581c1082aace32daa44d8b29673"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::first_sql_tokens (cyclomatic 19): dbx_sql_core::sql::first_sql_tokens has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"0850c5ecf8dba2bbf6236896bd24ea3b903deee6554be4b31fdcd0d33f0c4f2f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql_editability::contains_top_level_aggregate (cyclomatic 19): dbx_sql_core::sql_editability::contains_top_level_aggregate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc1dbd4af79f9814b5ec9bd31cac71aa6ec7127d6dd5f05df5560012530a9de"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_arguments::scalars::date_value (cyclomatic 19): dbx_sql_schema::native_job_arguments::scalars::date_value has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_arguments/scalars.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"139c0702c620249c057a43a63144bd355aecd60302331be7a1af8ae2e73f4571"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::parts::step_definition (cyclomatic 19): dbx_sql_schema::native_job_changes::dameng::parts::step_definition has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng/parts.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c12c140c44ebcba91317a1eebdab2ec37d3e4d1edacebb37674e66cad278b7d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::resolve_schema_diff_table_names (cyclomatic 19): dbx_sql_schema::schema_diff::resolve_schema_diff_table_names has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4488e1c1f6946e937bed4f92ea1890005e787af098096c69fe35879492e93a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_web::routes::mcp_policy::mongo_pure_field_predicate (cyclomatic 19): dbx_web::routes::mcp_policy::mongo_pure_field_predicate has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mcp_policy.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b071ea0c17b9af909e3ce80f9dfa39a27c5d571f21236e61ae856ec15c5b6ef"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::commands::global_search::search_root (cyclomatic 19): dbx::commands::global_search::search_root 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-tauri/src/commands/global_search.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a2f0b73c17116101d02b5c57fbd5a5eaa07f8ee1091d059eb26fd88054e8f7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::commands::mcp_bridge::mongo_pure_field_predicate (cyclomatic 19): dbx::commands::mcp_bridge::mongo_pure_field_predicate has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"04610bdb1480654a9736e0629bf57880adaefa2ca0218c66a2037d5f6843dafc"}},{"ruleId":"D1","level":"warning","message":{"text":"BlobBoundStatement.validate (cyclomatic 19): BlobBoundStatement.validate 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":"agents/common/src/main/java/com/dbx/agent/BlobBoundStatement.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b2f0113f7fc47bb90b9234fa269c4297b9f3611c1b9b5c74a1dba78e91cfb3"}},{"ruleId":"D1","level":"warning","message":{"text":"EwkbWktDecoder.tryParseHex (cyclomatic 19): EwkbWktDecoder.tryParseHex has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e9940bcd7b303f90d0f5fa5619e370688e5bfa0e9b3ccd37d4795dc90bc01b"}},{"ruleId":"D1","level":"warning","message":{"text":"StandardJdbcMetadata.getColumns (cyclomatic 19): StandardJdbcMetadata.getColumns 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":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ded0eb687d34709826f312d481511e5725acbfa8e32e7a8321d15dc0a17ca46"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.registerDrivers (cyclomatic 19): DbxJdbcPlugin.registerDrivers 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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3a4a948d6c2cfe18214b1d9bb3ed55cbf18e068d583531e54c9b8cfd4b703f"}},{"ruleId":"D1","level":"warning","message":{"text":"MongoAgent.bulkWriteModel (cyclomatic 19): MongoAgent.bulkWriteModel has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: MongoAgent.dispatch (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ba86ac04fa125b4e6370fd96b1b64655502acc29963a000d346b884b2eb9e2"}},{"ruleId":"D1","level":"warning","message":{"text":"OceanBaseOracleAgent.listConstraints (cyclomatic 19): OceanBaseOracleAgent.listConstraints 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd8beed1ce1e4c42fb7df04ca881202106b970ea4cb355001e98cd63897e4a9"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleForeignKeyDefinition.read (cyclomatic 19): OracleForeignKeyDefinition.read has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OracleForeignKeyDefinition.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8335a474c5aff8bf62e82e032724442e2168c8dfc63888865193cb6a6519616"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugCompositeInput.objectValue (cyclomatic 19): PlDebugCompositeInput.objectValue 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b697fa0d2d107f58c50e1240a5239a238b84866bd0443e0f0783946d340d63"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugCompositeInput.requireInputAdapter (cyclomatic 19): PlDebugCompositeInput.requireInputAdapter 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b535104c034537bc1a98360ccfeb3005d218a5090b79e694881307fe3f8f47"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer.child (cyclomatic 19): Writer.child 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86a8646ee698a338b858d75d1f114618ee08980e0f4ced6c81cd2d209afca20"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugManager.mutate (cyclomatic 19): PlDebugManager.mutate 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae04d862a0fe222f326c6ca67d69fa84bff957285cd8bd2669b60807f4e50ce"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugObjectConstructors.select (cyclomatic 19): PlDebugObjectConstructors.select has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugObjectConstructors.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f706b03a9b0d8db03f4c619c4b7b6be5ab9fb03f0677b36515531ae38f773a2"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugSession.evaluateBreakpointRules (cyclomatic 19): PlDebugSession.evaluateBreakpointRules 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"34576643acec4cabf5aa5531f1444c2ac2a421516924f995b38f54819f95b84f"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTarget.rawInput (cyclomatic 19): PlDebugTarget.rawInput has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: PlDebugTarget.declare (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"4357e4ff06c719672eb312f3df7ec6be502167c1d4156f89f9857ba27e4b6007"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTypeMetadata.resolveObjectOwner (cyclomatic 19): PlDebugTypeMetadata.resolveObjectOwner 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTypeMetadata.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"160aa9c60ceea03a09ee540c198cf391dd33260f67155eae16bf06d46134eb9b"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatch (cyclomatic 19): runtimeServer.dispatch has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: server.dispatch (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dab113957e586abc864259a7d997f43af2c907cebbe5355073cb01ec18612d2"}},{"ruleId":"D1","level":"warning","message":{"text":"etcdSession.status (cyclomatic 19): etcdSession.status 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":"agents/drivers/etcd-go/status.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2503c7bc2702ed33b134425f331e56b34eace4197d34ba1e13c51c93493c4726"}},{"ruleId":"D1","level":"warning","message":{"text":"etcd2Session.rename (cyclomatic 19): etcd2Session.rename has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/kv.go"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9852dee66851408c2ad358b864f697de45ab3b79f219a0febe2e18452dab1b"}},{"ruleId":"D1","level":"warning","message":{"text":"main.splitTopLevelCommas (cyclomatic 19): main.splitTopLevelCommas has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f23af1c2fa77ab3f792700048839dc7d7810ffed491ab14811f2cc025935af"}},{"ruleId":"D1","level":"warning","message":{"text":"server.getRoutineSource (cyclomatic 19): server.getRoutineSource has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/routine_metadata.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37d1bfa9a2dcbef95f354c97b13043a522c1c46b17a3103ca1007cbbe1c3b91"}},{"ruleId":"D1","level":"warning","message":{"text":"main.appendGraphValue (cyclomatic 19): main.appendGraphValue has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/query.go"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a816997e6c445995f65884e582691c540be816b7df9e46eb5503c0d80b5a73"}},{"ruleId":"D1","level":"warning","message":{"text":"server.closeNativeAllocations (cyclomatic 19): server.closeNativeAllocations 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":"agents/drivers/oracle-go/pldebug_connections.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bc612956d1b687bd5c527bbcdb2fb8d61abeebd010993e67140d31c6aa438f"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeCapture.page (cyclomatic 19): plDebugNativeCapture.page has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_output.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a470656051c7479c74ebf9753f1febddc25383773ecad801ed8bc83e3e886515"}},{"ruleId":"D1","level":"warning","message":{"text":"server.peekMessages (cyclomatic 19): server.peekMessages 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":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"724bd4bd5b9a92f367e799be62887bacb9ca0c5a6b33bdadf1de5e5ed3e549f3"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseConnection (cyclomatic 19): main.parseConnection 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":"agents/drivers/rocketmq/connection.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"180bf582c0f9f12156198821ac5302f662f8d80742ebd1bc039aedbce805b7a3"}},{"ruleId":"D1","level":"warning","message":{"text":"rocketMQAgent.listACLs (cyclomatic 19): rocketMQAgent.listACLs 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":"agents/drivers/rocketmq/acl.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8894b9b921197f34d2b7c08027abee422cb31081ea3971a68aeed0cca29490a5"}},{"ruleId":"D1","level":"warning","message":{"text":"rocketMQAgent.listProducers (cyclomatic 19): rocketMQAgent.listProducers 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":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c118339bd1bfb683a3312fcb13dc1d22e35262f66f4ef3bd6e3fd1dc68072808"}},{"ruleId":"D1","level":"warning","message":{"text":"rocketMQAgent.listTopics (cyclomatic 19): rocketMQAgent.listTopics 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":"agents/drivers/rocketmq/topics.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5134c474267642ce1628b8e977c6e93d91fb3b1f01cec43ef2bf660a2d6a57b6"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatch (cyclomatic 19): runtimeServer.dispatch has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: server.dispatch (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c171cd45bd1cc5ba16545f38654846e50a001845f9cb91f62849da41b19794"}},{"ruleId":"D1","level":"warning","message":{"text":"wkbGeometry.wkt (cyclomatic 19): wkbGeometry.wkt 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":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dccc310af078f44e0fde03b30a1d2b2090c31f25d08b13a45022853b18757a3"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseXuguObjectTypeMethod (cyclomatic 19): main.parseXuguObjectTypeMethod 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":"agents/drivers/xugu/type_members.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d65d7d55c621f9f8ae390028d4e660c06703b293cdbb62d8177b0b39516f3e6"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-partition-ddl.main (cyclomatic 19): verify-partition-ddl.main has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 belong to 5 function literals inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/scripts/verify-partition-ddl.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38915eced8eb75072734167cbe0003943df8f45c0e3c5a46fd518a7ea2afc5b"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.provideMongoCompletions (cyclomatic 19): useQueryEditorCompletion.useQueryEditorCompletion.provideMongoCompletions has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f19ca6205da35f3fb32a6958b33ab0e3bb21ad67a3beb9c16e877c0e45bc37"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.shouldStartSqlCompletionAfterInput (cyclomatic 19): useQueryEditorCompletion.useQueryEditorCompletion.shouldStartSqlCompletionAfterInput 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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d572f32d59f31a8afb080b042e63979d51494c5911f65615a4a49764b194dd9"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataCompareConfig.sanitizeConfig (cyclomatic 19): useDataCompareConfig.sanitizeConfig has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataCompareConfig.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe2a8856dd57bbe73631adae1fdba87bbc12c90d5c046e83638778b62a061b2"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.stageCellReplacements (cyclomatic 19): useDataGridEditor.useDataGridEditor.stageCellReplacements has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b618657cb3cc12d9579815df9ec8f2bd0ead2cc59831f15d4a8c9f2d7f8d8da6"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridLargeValues.useDataGridLargeValues.preparePreviewSaveBaseline (cyclomatic 19): useDataGridLargeValues.useDataGridLargeValues.preparePreviewSaveBaseline has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0a2ff9926e9d958d7e263b448cf4c4d50be2fa5b91792541a2c61d7d2894b9"}},{"ruleId":"D1","level":"warning","message":{"text":"useQuickOpen.useQuickOpen.remoteSearchContexts (cyclomatic 19): useQuickOpen.useQuickOpen.remoteSearchContexts has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a0fedee21550b78859aad1b1374cf53e354fc14d7bec7ca13e7a2f31183f1a"}},{"ruleId":"D1","level":"warning","message":{"text":"decodeText.decodeImportFileText (cyclomatic 19): decodeText.decodeImportFileText 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":"apps/desktop/src/lib/common/decodeText.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8909150980cde2d001e4d717a40e43d3169b1bbb9329625660cc255c021f9bdc"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionParameterCatalog.connectionParameterCatalog (cyclomatic 19): connectionParameterCatalog.connectionParameterCatalog has cyclomatic complexity 19 (threshold 15). Of this number, 11 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":"apps/desktop/src/lib/connection/connectionParameterCatalog.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f53449afe0a1931d33a17b3bc3b40b2c37a6fca4c5db79a561114e159f7f58"}},{"ruleId":"D1","level":"warning","message":{"text":"columnFormatter.normalizeForeignKeyDisplayFilter (cyclomatic 19): columnFormatter.normalizeForeignKeyDisplayFilter has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2e90186010b34788990f876079107140ed3baee86bf4d49a472bf52df0ad7f"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridColumnFilter.unwrapOuterParentheses (cyclomatic 19): dataGridColumnFilter.unwrapOuterParentheses 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":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecadf5bf510aab0b54a3b7a0d0037d6624d9007831710ac81f27e5d0bd71ced7"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridColumnWidthState.loadPersistentDataGridColumnWidthState (cyclomatic 19): dataGridColumnWidthState.loadPersistentDataGridColumnWidthState 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":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedd5859c13bc1e3c61f88814609b6f4a129a2a58cb0e24b9331fc1fd0ecc15d"}},{"ruleId":"D1","level":"warning","message":{"text":"regexGenerate.parseClass (cyclomatic 19): regexGenerate.parseClass has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b30c2fca424df660cc9ee3f76fcc32eba4b5149519423c80d5b3158c59a8fbd"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleSessionDiagnostics.collectOracleSessionDiagnostics (cyclomatic 19): oracleSessionDiagnostics.collectOracleSessionDiagnostics 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":"apps/desktop/src/lib/database/oracleSessionDiagnostics.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf582ee189d16ddab55231abe6c9ba768520e95cc07bd8d82ebf8b1e0501309"}},{"ruleId":"D1","level":"warning","message":{"text":"codemirrorSqlDialect.codeMirrorBaseDialect (cyclomatic 19): codemirrorSqlDialect.codeMirrorBaseDialect 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":"apps/desktop/src/lib/editor/codemirrorSqlDialect.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57d9c9111fbae6fe2f484a0742d147d512853697a483d4b02eb482393016f72"}},{"ruleId":"D1","level":"warning","message":{"text":"anotherRedisImport.parseAnotherRedisImport (cyclomatic 19): anotherRedisImport.parseAnotherRedisImport has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/anotherRedisImport.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"144f247cf12b10d5f7ea6eb7646131c27055ec610e0c7bd47807e5ec4b53b422"}},{"ruleId":"D1","level":"warning","message":{"text":"datagripImport.extractUserName (cyclomatic 19): datagripImport.extractUserName 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":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"df76e941eb0a465459b0cb6b22c1ed2f9ce4d7a4b944ec2fdba8dd559c72ea97"}},{"ruleId":"D1","level":"warning","message":{"text":"datagripImport.parseDbForestGroupPaths (cyclomatic 19): datagripImport.parseDbForestGroupPaths has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d385e2800100a2aabd4b71656c198b6c1cedf18dec8efbd294af0523ab0c25"}},{"ruleId":"D1","level":"warning","message":{"text":"datagripImport.buildConnection (cyclomatic 19): datagripImport.buildConnection has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce14ea32f1018fc65d4ead11184a2bdd7a3119aa0f3086b0172a4752b4934ff"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.classifyJsonSchema (cyclomatic 19): mongoCompletion.classifyJsonSchema has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7853b724e872f028d7f0028cbadf22f9e414fdd79496b923c03aa85ebab8dde"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.classifyUpdate (cyclomatic 19): mongoCompletion.classifyUpdate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f267e273b524ff44397a1bcc93068865df80d3f5100f8cd2b48cf55861b399a"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoSql.comparisonToFilter (cyclomatic 19): mongoSql.comparisonToFilter 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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb3eb73959538c6b399991d385b2bc4febfb90b3752c1191b06d48423764c2c"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginClipboardImage.requirePluginClipboardImage (cyclomatic 19): pluginClipboardImage.requirePluginClipboardImage has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginClipboardImage.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31dae28ca3d919c6adb4e4a0b48b6b4b9e3ada53344221044258bbe4ca4b60e"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginHostBridge.postInit (cyclomatic 19): PluginHostBridge.postInit has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b602553dd904fe8805d106fc8ffe4aefa56a7e6dde47267a4bd5a8218f95d2f"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginShortcuts.normalizePluginShortcutSettings (cyclomatic 19): pluginShortcuts.normalizePluginShortcutSettings has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, 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":"apps/desktop/src/lib/plugins/pluginShortcuts.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e904c88c06f083cc15f6f796c1751dc69d2c143390914256d7a72df1d2118125"}},{"ruleId":"D1","level":"warning","message":{"text":"RedisCollectionSearchController.scan (cyclomatic 19): RedisCollectionSearchController.scan has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCollectionSearchController.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45c7fb10cc277c41c796f1fb466c9c2ae4bab60e72b27b9f6b848c72a23e7b2"}},{"ruleId":"D1","level":"warning","message":{"text":"redisCommandDocs.commandKeySpecs (cyclomatic 19): redisCommandDocs.commandKeySpecs 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":"apps/desktop/src/lib/redis/redisCommandDocs.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e3d82251d353c42164c8198ecc8b76de6e0bdfc0f7715c18d1dbe70707eea0"}},{"ruleId":"D1","level":"warning","message":{"text":"redisCommandPreview.redisDeleteKeysPreview (cyclomatic 19): redisCommandPreview.redisDeleteKeysPreview has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3efe2f9241e132ae304d1b75fbfd3532ee380be65ec0db6ca978267f5897adf"}},{"ruleId":"D1","level":"warning","message":{"text":"redisCompletion.argumentTokenItems (cyclomatic 19): redisCompletion.argumentTokenItems has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b21efb75dd9f7d6f8c29e8b7bee058b14523ca7040aa28f8a8889ad474f825d"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineDeploy.editOraclePackageOptions (cyclomatic 19): oracleRoutineDeploy.editOraclePackageOptions has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: oracleRoutineDeploy.oraclePackageTransferPendingReady (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e466593a78d28da84fdbacc3989231f443dbee234308703a96739700e3b2eae6"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCollectionMutation.buildMongoCreateIndexRequest (cyclomatic 19): mongoCollectionMutation.buildMongoCreateIndexRequest has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/mongoCollectionMutation.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be434f574688f6f1a18ce4955e47d709c65b37e5b2b347ddd87da44ac25faf4"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarGlobalSearchIndex.collectSidebarGlobalSearchIndexes::visit (cyclomatic 19): sidebarGlobalSearchIndex.collectSidebarGlobalSearchIndexes::visit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarGlobalSearchIndex.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6047ab9a7ac8669f431993f976f8bcda2ae0063aba9adfdb014e5ba5ded9f7f0"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarLayout.restoreSidebarLayoutDeletion.restore (cyclomatic 19): sidebarLayout.restoreSidebarLayoutDeletion.restore 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":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8aa5066381e3975db3b0b2fa5768f04d9854024b51d162f79ae113d2eabb73"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarTableSearchControl.resolveLocalTableSearchParent (cyclomatic 19): sidebarTableSearchControl.resolveLocalTableSearchParent 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":"apps/desktop/src/lib/sidebar/sidebarTableSearchControl.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a67f772a1ad4b0cc959cc8da704ad245a04c4b94167f67afc803eea89c4136"}},{"ruleId":"D1","level":"warning","message":{"text":"cypherFormatter.compressCypherText (cyclomatic 19): cypherFormatter.compressCypherText 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":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf59c66ff82d45dc40c29e23422a0c9e99156197ff904dab972b07480105885"}},{"ruleId":"D1","level":"warning","message":{"text":"ddlDisplay.applyDdlDatabaseQualifier (cyclomatic 19): ddlDisplay.applyDdlDatabaseQualifier 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":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"057149c5a2dbce9b181f17bb541e3b11e2ee28db4c6e6848372f599134d696b2"}},{"ruleId":"D1","level":"warning","message":{"text":"ddl.createTableLayout (cyclomatic 19): ddl.createTableLayout has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 111, 100, 106). 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":"apps/desktop/src/lib/sql/layout/ddl.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59043e29511a9f481fae3147bb5056ebf03ae6fd98fcf84403d4531fcfd0513"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printStatement (cyclomatic 19): printer.printStatement has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e0d09913816d9ae04beaa7aa89dba6f939bd272a22a42d461119583c529ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"mysqlRoutineSyntaxDiagnostics.tokenizeMysqlRoutineSql (cyclomatic 19): mysqlRoutineSyntaxDiagnostics.tokenizeMysqlRoutineSql 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":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bdf9e3b7140caccb4432915180f03d991568c01bfb5df8f5d0cc298dd8dc82"}},{"ruleId":"D1","level":"warning","message":{"text":"cteNavigation.findCteColumnResolution (cyclomatic 19): cteNavigation.findCteColumnResolution 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":"apps/desktop/src/lib/sql/semantic/cteNavigation.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6af36d4a03cf2ad3dfd3e61ab5193fe521826f9099075a81a787e8b19af9826"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlAnalysis.findTopLevelKeyword (cyclomatic 19): sqlAnalysis.findTopLevelKeyword 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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fb466b101020aa3cc7051aca961006a62fd51a8029f1613e84b32851ceff3c"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.shouldAutoOpenSqlCompletion (cyclomatic 19): sqlCompletion.shouldAutoOpenSqlCompletion has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d3376adcac2aa6d927c992547a7c6275c708b81843c1c3a5639ad9ce050502"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.splitQualifiedNameRawParts (cyclomatic 19): sqlCompletion.splitQualifiedNameRawParts 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce27d98874308866dab6ebd8f7be9aef48c6de9b04d6fa0d0bf47226f25833b6"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectSetStatementVariables (cyclomatic 19): sqlParameters.collectSetStatementVariables has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (sqlParameters.collectExecNamedArgumentStarts) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"717e37cf1b180b546af545451e12815f22e0c7708bf21783a2c0390c0e30bc7b"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectExecNamedArgumentStarts (cyclomatic 19): sqlParameters.collectExecNamedArgumentStarts has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (sqlParameters.collectSetStatementVariables) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b068d4fa18799c4f43f8ef92a71906b8d42f660e10bdf9bca7429a6d2d359d99"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlDiagnosticKeywordRecovery.analyzeSqlDiagnosticReferences (cyclomatic 19): sqlDiagnosticKeywordRecovery.analyzeSqlDiagnosticReferences has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDiagnosticKeywordRecovery.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"76283bf6e9874168d76bd6a257814562a1459c4f4890c058f52f579674b91e32"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineRename.prepareOracleRoutineRename::walk (cyclomatic 19): oracleRoutineRename.prepareOracleRoutineRename::walk has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (oracleRoutineRename.prepareOracleRoutineRename) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1be8143581e97fb61a4236537c6ab71c06df1236939fa2d21f60e80ccfb9c41"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTableRename.verifyFinalSnapshots (cyclomatic 19): oracleTableRename.verifyFinalSnapshots 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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1c7f6287053db65893191a39836ef669f6ba015b2afdff764b9e6fab5b195c"}},{"ruleId":"D1","level":"warning","message":{"text":"tableImport.suggestDataTypeForGenerator (cyclomatic 19): tableImport.suggestDataTypeForGenerator has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableImport.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bd08bfa81bf76d19c92b8119b081bed73f6ea206ec7dd2ac99a4409bab8313"}},{"ruleId":"D1","level":"warning","message":{"text":"tableVGroup.reorderTableVGroupEntry (cyclomatic 19): tableVGroup.reorderTableVGroupEntry has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (insertNear, removeEntry, entryId). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: tableVGroup.tableVGroupKindOfContainerNode (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"65526ceb122e5761cf1bd8d8de072f85d40a9fb9f4f1a57a25af09395eee5422"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadPagedTableGroupChildren (cyclomatic 19): connectionStore.useConnectionStore.loadPagedTableGroupChildren has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b1544a1e6e4a87372a298ad979651af5f0b8468f4e7b5ceed8515184df672b"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.sidebarTableSearchIndexManifestEntry (cyclomatic 19): connectionStore.useConnectionStore.sidebarTableSearchIndexManifestEntry has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 3886, findPath). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3861}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2818d976b66fba43a1cb072e5430767f179923d3b489e300142aaf76a070fa"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.parseConnectionsImport (cyclomatic 19): connectionStore.useConnectionStore.parseConnectionsImport 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11750}}}],"partialFingerprints":{"codehealthFindingId/v1":"00952df69cb809fa45e047a2358bfcbf5a6d334a724298ac833ba803b52a9f69"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.loadObjectSourceIntoTab (cyclomatic 19): queryStore.useQueryStore.loadObjectSourceIntoTab has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e35f5c54002bf9d2d5a80212103cd1e50a370692d8df55614b2df44139c578"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.captureQueryResultExportRequest (cyclomatic 19): queryStore.useQueryStore.captureQueryResultExportRequest has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (assertSourceAvailable). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11818}}}],"partialFingerprints":{"codehealthFindingId/v1":"9378bf81bbcd723b06cf4c729b024757b52ab6a2c496dc8cde28a96add1f46ec"}},{"ruleId":"D1","level":"warning","message":{"text":"savedSqlStore.useSavedSqlStore.reorderFiles (cyclomatic 19): savedSqlStore.useSavedSqlStore.reorderFiles has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1155, 1153, 1136). 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d8bc7f383e5c6f0dce334d5a3a1d638d263c88d5a639ab622f6351ec173055"}},{"ruleId":"D1","level":"warning","message":{"text":"transferTaskStore.useTransferTaskStore.reorderTasks (cyclomatic 19): transferTaskStore.useTransferTaskStore.reorderTasks has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 467, 465, 455). 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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"de85a52faa2ab5f7be664c08b172ed3f6f0f2eff9c5a42268253c2808eca8dde"}},{"ruleId":"D1","level":"warning","message":{"text":"worker.handleInstallBeacon (cyclomatic 19): worker.handleInstallBeacon has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f78b0114cc973d0a9217e8011698b85e79cd848e7e5810c6312c061d00b3ba"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallTabs.InstallTabs (cyclomatic 19): InstallTabs.InstallTabs has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 325, 242, 251, \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":"docs/components/landing/InstallTabs.tsx"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed79fa5b181017a076a08a1a77774846fd32a244f28b4ea1e83ac57b38fe9c8"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics.redact::visit (cyclomatic 19): diagnostics.redact::visit has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/diagnostics.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd26f7a6e15b06968eeea4b12f49dab57a61ee1cb7f508f672134731c248fef3"}},{"ruleId":"D1","level":"warning","message":{"text":"outline::walk (cyclomatic 19): outline::walk has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b97887c2b818760616edc275c8a1d014139e742bed2498c30556d571487f24"}},{"ruleId":"D1","level":"warning","message":{"text":"bringIntoView (cyclomatic 19): bringIntoView has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 401, 434). 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":".github/ui-preview/record.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"52759008ced23436bfc88e91fa90bf50b057a2894b9ed3db83f22ff7b24e2d14"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_ai_provider::ai::classify_error (cyclomatic 18): dbx_ai_provider::ai::classify_error has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: AiProvider::as_str (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94597aec43f53cb88830baaf171d0e5baf4c59b472c7d2a0855c8a6115d81e4"}},{"ruleId":"D1","level":"warning","message":{"text":"Plan::after_tables (cyclomatic 18): Plan::after_tables has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8a763e2fe4946a686446b2485a4757c0e699c5c3ff7d267ba80fd0675bffac"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugRegistry::register (cyclomatic 18): PlDebugRegistry::register has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"639fe38888a9a3121fa88a7c385a3c08905e3f3df271af4a779b5f56da7c3065"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::ai::plugin_tools::sanitize_schema (cyclomatic 18): dbx_core::ai::plugin_tools::sanitize_schema has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_tools.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"f651ad73eb248690c6d988e1514818d18005da6544c7bda114005bc6d0b81d91"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::archive::stream (cyclomatic 18): dbx_core::data::mongodb_dump::archive::stream has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/archive.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"46946de0ce31b4922fafdb217642bdbba63434126311b93c2c4d060330adce77"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::import_mongodb_file_core (cyclomatic 18): dbx_core::data::mongodb_import_export::import_mongodb_file_core has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"2073cac8de04380528723bc7325b284b6dfd4e670a9063f7366a0bdc49646cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::navicat_nb3::classify_statement (cyclomatic 18): dbx_core::data::navicat_nb3::classify_statement has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4a072f4456b4483a2bb050575997f2b3e8a32072598d68fe51a25e68a0b25f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::sql_import_expr_value (cyclomatic 18): dbx_core::data::table_import::sql_import_expr_value has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"6467c8596b2d35e44420462f0c15b0adb9a8dcab012877a31d92941ee7bb4348"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::oracle_export_date_parts (cyclomatic 18): dbx_core::data::transfer::oracle_export_date_parts has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":4486}}}],"partialFingerprints":{"codehealthFindingId/v1":"5095e7906f9a09da9a0fcb3100e5baf55ce8e151c5b48957efad284e1f8b4722"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::strip_dameng_storage_clauses (cyclomatic 18): dbx_core::data::transfer::strip_dameng_storage_clauses has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6126}}}],"partialFingerprints":{"codehealthFindingId/v1":"43adaea8c1cc0067a634bc41fbe62fff3568c219ec1def0fe3644b0dfd6e22bc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_cross_family_schema_objects (cyclomatic 18): dbx_core::data::transfer::transfer_cross_family_schema_objects has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10657}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd30373822491676ceaa39aa70c989be8c6e61607791c4fbf5c50fa9907e05ba"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::break_backup_foreign_key_graph (cyclomatic 18): dbx_core::data::transfer::break_backup_foreign_key_graph has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4467ef4f350f597ac67fc35ace60f822bf8950ed439af40472852fbeb9820927"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::oracle_table_contract::character_lengths (cyclomatic 18): dbx_core::data::transfer::oracle_table_contract::character_lengths has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c860a9cacf1e037baad59b2fa6f60a5a3e7d7acf07977ba0a352146b3fcc398"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::oracle_table_contract::check_physical_options (cyclomatic 18): dbx_core::data::transfer::oracle_table_contract::check_physical_options has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5da10b1e1667405291cbbff8b7235572969b9a28233c44968ac1a4ee03f782"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::overwrite_clear::clear_foreign_key_linked_overwrite_targets (cyclomatic 18): dbx_core::data::transfer::overwrite_clear::clear_foreign_key_linked_overwrite_targets has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/overwrite_clear.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3c831ef16a3f824c3c967e2421b2f685ca4a558e409b2a11f0a360831a9624"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::pl_debug::finish_operation (cyclomatic 18): dbx_core::query::pl_debug::finish_operation has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fd9967657d2bdf6e2485bda46326c2881706ef2731fcb158d1159624cedd4a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::completion_assistant_search_core (cyclomatic 18): dbx_core::schema::completion_assistant_search_core has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8387}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b2df676bcd41185f3f2d24fef98b9324aef2fcb6b535eb981fa62c9938981e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::list_indexes_core_for_session (cyclomatic 18): dbx_core::schema::list_indexes_core_for_session has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10347}}}],"partialFingerprints":{"codehealthFindingId/v1":"07583d81b18b8a360616cde4f889b1e156691bd805c8452e68728ccdb8654474"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::list_triggers_core_with_options (cyclomatic 18): dbx_core::schema::list_triggers_core_with_options has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10543}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09ff93167cae32f9b5c724d87d2d720d9a5b0f69b2e5bde15878fda6ae0c3f5"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::scheduler::transition::checked_rows (cyclomatic 18): dbx_core::schema::native_jobs::operations::scheduler::transition::checked_rows has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"137a5f56064ccefc1ee458e6f6d171b59499cb576dd57936a8d01f6654e543f7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_elasticsearch::translate_field_operator_filter (cyclomatic 18): dbx_driver_elasticsearch::translate_field_operator_filter has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"c021700458f2abcfc94143c7c5ef69b9cf74876959aa3601bc93c024e72af1ba"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_group_concat_setup_fallback_mode (cyclomatic 18): dbx_driver_mysql::mysql::mysql_group_concat_setup_fallback_mode has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c52265bafb19ee3576666c10b1a64a635ff87ca7593124fbe16cc9a75a1ccc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_mcp::server::validate_transaction_sql_shape (cyclomatic 18): dbx_mcp::server::validate_transaction_sql_shape has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":6777}}}],"partialFingerprints":{"codehealthFindingId/v1":"f601978e9c476c77b676e10cb3eb24e783299979f2a514dd2190ddef049a374e"}},{"ruleId":"D1","level":"warning","message":{"text":"Analysis::package_reference (cyclomatic 18): Analysis::package_reference has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"73da16888221d5cf313e9159497ac822b172e2932c9ae20ed93170268577ed9a"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::visit_select (cyclomatic 18): Analyzer::visit_select has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe4dbc159484d32009575a4f1da91f3e373691d2f5a63fcf86a482ceec274ea"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::finish_group_by_check (cyclomatic 18): Analyzer::finish_group_by_check has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6c1744f5eb32511617c6b03499979e02bc0825baf0b28bbfc3d71fcaeb8f99"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::dml_preview_sql::build_update_preview (cyclomatic 18): dbx_sql_core::dml_preview_sql::build_update_preview has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/dml_preview_sql.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbaca9602e01d15b318b301f27a3c9dfdac40589925a0bf68054e8d4a77597f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_trigger::prepare_oracle_trigger_sql (cyclomatic 18): dbx_sql_core::object_source_sql::oracle_trigger::prepare_oracle_trigger_sql has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_trigger.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"58760ddedfbc7f78054e115dbf2edd3caa51a3aed4a22fa2e89bf7ee11b04b79"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::oracle_type_migration_sql::build_type_evolution_sql (cyclomatic 18): dbx_sql_core::oracle_type_migration_sql::build_type_evolution_sql has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9fcbe3e1be5239ef2b8d58d611ffec614f6074f4c6f208b15eea281f874398"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::build_data_grid_column_distinct_values_sql (cyclomatic 18): dbx_sql_data::data_grid_sql::build_data_grid_column_distinct_values_sql has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: dbx_sql_data::data_grid_sql::build_data_grid_context_filter_condition (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f583359e40869d0500b710b579683a8bb3a3e661da13a2f74027a89a4add3bea"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::build_paginated_query_sql (cyclomatic 18): dbx_sql_data::query_result_sql::build_paginated_query_sql has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c43d65397e04de40d10dc751b40e48ad9c27309f19b5f9244d26b44241bb644"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::build_count_query_sql (cyclomatic 18): dbx_sql_data::query_result_sql::build_count_query_sql has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dac19dfd5715443d76745176f84aa9caf708bb10b0595132b7b56f921c6579f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::db_admin_sql::build_duplicate_table_structure_sql (cyclomatic 18): dbx_sql_schema::db_admin_sql::build_duplicate_table_structure_sql has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/db_admin_sql.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dce4c444430a90062cba182d87ed1d82783613382b01977f5f6c511cc167a0"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_jobs::native_job_list_queries (cyclomatic 18): dbx_sql_schema::native_jobs::native_job_list_queries has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_jobs.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef554e25303adbb3fa1791083793d0862a76574f76d353089e40e8974261e23"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::strip_postgres_default_casts (cyclomatic 18): dbx_sql_schema::schema_diff::strip_postgres_default_casts has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f3e0baaa12812a5be9118f1f1d1567773d6ceec3b4fa02bbcb416f9f366709"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::mysql_charset::table_defaults (cyclomatic 18): dbx_sql_schema::schema_diff::mysql_charset::table_defaults has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/mysql_charset.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"31980b967c5735d3f8192f014cd7b9f181deb20dc33ecc0ee49865e035e70d6c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::postgres_foreign_table::create_clause (cyclomatic 18): dbx_sql_schema::table_structure_sql::postgres_foreign_table::create_clause has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/postgres_foreign_table.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc03e3998a7c5cc7ed7873bb9a69808616c389a5a2ca7e8b09398a710f04165a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_web::routes::table_import::preview_import (cyclomatic 18): dbx_web::routes::table_import::preview_import has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/table_import.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"be942ce5d71753e387727cccec8338c8b33e353439dc1763174d400da775c285"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonRpcServer.legacyJob (cyclomatic 18): JsonRpcServer.legacyJob 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":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1467a7a21122543f4205bc372b539efd54913a4412a047bc07ca7b075e760f"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeLegacyJobSession.prepare (cyclomatic 18): NativeLegacyJobSession.prepare 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":"agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c527bbe029ee14e32fb0e28e6e872990473666429d073c79e04dabe7a36cb109"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.listSchemas (cyclomatic 18): DbxJdbcPlugin.listSchemas has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3081}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59633b7e976506c24d6c5592fbee8bf16fb8aaa42e4a2172022f25034399a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"DamengAgent.queryConstrainedObjectsWithoutValidity (cyclomatic 18): DamengAgent.queryConstrainedObjectsWithoutValidity has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: DamengAgent.resultValue (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07e20daa1b5eb56883579e19ad3e22f13cd8220642c40150c5cf7e6dc49744d"}},{"ruleId":"D1","level":"warning","message":{"text":"H2DriverVersion.select (cyclomatic 18): H2DriverVersion.select 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":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2DriverVersion.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"264278db7e39379a82de43c39def0be835fc6439846ed8c25b5e6556cdc5ecc0"}},{"ruleId":"D1","level":"warning","message":{"text":"KafkaAgent.getConsumerGroupSnapshot (cyclomatic 18): KafkaAgent.getConsumerGroupSnapshot has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: KafkaAgent.dispatch (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce4106f44aa8e2154d886520750fbc5b6cdd061e917694f1e7ef2d1d3d8ba2d"}},{"ruleId":"D1","level":"warning","message":{"text":"KafkaAgent.listConsumerGroups (cyclomatic 18): KafkaAgent.listConsumerGroups has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: KafkaAgent.dispatch (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"30733a5431cc4b6a3fbabdcb6564e7c2842d502a6ea2bb2670764e42c3db5ac0"}},{"ruleId":"D1","level":"warning","message":{"text":"MongoAgent.collationOrNull (cyclomatic 18): MongoAgent.collationOrNull has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: MongoAgent.dispatch (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7cb62576014df1b3b59984fc3fcb0c911cd4a46bcf6f9cc2397adda75f1c83"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugManager.start (cyclomatic 18): PlDebugManager.start 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a13baedc1e1d12152e521fe8c9dd574ade08e49a9a1d1c1a8ca7637f721c921"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugObjectConstructors.callables (cyclomatic 18): PlDebugObjectConstructors.callables 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugObjectConstructors.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2981cee3d8274b44abfed758f412ce9836518b7bd920476fbbe0c704ed25c8b"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugSession.recoverOutput (cyclomatic 18): PlDebugSession.recoverOutput 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6d9c31202265699233e2a81b9e10e23fee1704edb31dbd79aa469d0bd8d153"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTarget.zonedInput (cyclomatic 18): PlDebugTarget.zonedInput has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: PlDebugTarget.declare (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a1e4f14c5f0853ade72e5fdaae2c54dfae096b3f3213a0483b9e21835f6c05"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseHiveConnectionString (cyclomatic 18): main.parseHiveConnectionString 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"15062bcbcaab4e8d2e06f759e9a4e55445551ccb97dc2c70bf4671cba2a605fb"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatch (cyclomatic 18): runtimeServer.dispatch has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: server.dispatch (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e4e8c9e2f51bfd2908891cd2feda063190ac9220062561e442d966ac1df876"}},{"ruleId":"D1","level":"warning","message":{"text":"main.materializedViewDDLFromCatalog (cyclomatic 18): main.materializedViewDDLFromCatalog has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/materialized_view.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca7607288ee344f16ba2ce911eb398d122ed8f969b9a6dfaaa2c9ac989b494f"}},{"ruleId":"D1","level":"warning","message":{"text":"server.completionAssistantSearch (cyclomatic 18): server.completionAssistantSearch 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":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a4172de557f95004fbfa26a2ecb06dac1f33bde6d5f15f433056e710875dfb"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseHiveConnectionString (cyclomatic 18): main.parseHiveConnectionString 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":"agents/drivers/hive-go/config.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1b3fc185e8b9ab2b0185e1da13db24b55ea3f79bd9e9d0de80b92c72fa8f65"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatch (cyclomatic 18): runtimeServer.dispatch has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: server.dispatch (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/main.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d16f42ef18f218db8961aebe7ab49fe018ee31a4f7f925ccc8b5d992b7a866"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatch (cyclomatic 18): runtimeServer.dispatch has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: server.dispatch (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/main.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c162371ace47da1321d6fb363a9913226e94e2286a6bd575803cd43694afa965"}},{"ruleId":"D1","level":"warning","message":{"text":"main.takeParenGroup (cyclomatic 18): main.takeParenGroup has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0b6da2072be27e2b424972a9a12edef40a782a2f442cac6fcea5ed9de515d8"}},{"ruleId":"D1","level":"warning","message":{"text":"server.completionAssistantSearch (cyclomatic 18): server.completionAssistantSearch 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0986cea2494822dd769525d495ce280d05d6411d9d8cb7c6c16692c366679b9"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatch (cyclomatic 18): runtimeServer.dispatch has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: server.dispatch (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/main.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7c7523ae19f912a93639437d87b697a275f4d2c07cc24b8fc36e138b38687e"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeResultField (cyclomatic 18): main.plDebugNativeResultField 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":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2b860b98da3a72c3200216c17321d1a173ef617fc5cc4dfd5fe6261e953f01"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listObjects (cyclomatic 18): server.listObjects 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"29002639f2c29cec610c86027b31c8514c4b064f0b5c3843dc0cbccd60e80a02"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionConfig.equal (cyclomatic 18): connectionConfig.equal has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/connection.go"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c91659e96b84f48820024c18afad3a9db742e8f9c2db4e165cd8f733d56e23"}},{"ruleId":"D1","level":"warning","message":{"text":"server.completionAssistantSearch (cyclomatic 18): server.completionAssistantSearch 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":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff611251fd4b8d92d8d6d097331d0ce45ace902a8f2d82eee054f3a1553f321"}},{"ruleId":"D1","level":"warning","message":{"text":"server.getObjectSource (cyclomatic 18): server.getObjectSource 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":"agents/drivers/xugu/main.go"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fb007abcf37ce43732fec16934baece74b8f826e006fe5bf43a0fb9c49afb5"}},{"ruleId":"D1","level":"warning","message":{"text":"client.NewIoTDBRpcDataSet (cyclomatic 18): client.NewIoTDBRpcDataSet 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":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b0809abf1775083e3a1cd549a99e61f38bc741ffb0a9ac3fddc9b585298ba5"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferValues.binaryLiteral (cyclomatic 18): queryResultTransferValues.binaryLiteral 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":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a2ae816bffdce183b1dde8a279c9035ad0036775ce35702ea30f1ff1c5030e"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGenerateSession.runDataGenerateSession (cyclomatic 18): useDataGenerateSession.runDataGenerateSession has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGenerateSession.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7664115a2cb0f4cf951f0990814eb3188aa1a821d03224593227bee6fac87a23"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridConditionEditor.useDataGridConditionEditor.handleKeydown (cyclomatic 18): useDataGridConditionEditor.useDataGridConditionEditor.handleKeydown 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":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"af70c6b6011a5571fcf1800eeceaa24f17cc53b0fcee22b641bcf45b8bf23f28"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.applyDeleteRows (cyclomatic 18): useDataGridEditor.useDataGridEditor.applyDeleteRows has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"d231d4bc835ba8ca8289c432085ae41f84a03374cab412264754dbbd1b3a6b04"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.savePendingSnapshot (cyclomatic 18): useDataGridEditor.useDataGridEditor.savePendingSnapshot has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f91206feb6f482f63c18f6ccee152d63482f4fa90f81c1f389fa4456ec09ef"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportAllResultsMergedXlsxResult (cyclomatic 18): useDataGridExport.useDataGridExport.exportAllResultsMergedXlsxResult has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 2314, 2365, 2335, \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"35859b55e791af51c20d8f337117593da669b0745e49f692ec9488c82bc99723"}},{"ruleId":"D1","level":"warning","message":{"text":"useNativeJobExecution.useNativeJobExecution.prepare (cyclomatic 18): useNativeJobExecution.useNativeJobExecution.prepare has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNativeJobExecution.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea45e8873cb2d9573d927e48cfb77091359dc91d8392cda964978ae0f3c5aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"useQuickOpen.useQuickOpen.runRemoteSearch (cyclomatic 18): useQuickOpen.useQuickOpen.runRemoteSearch has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 931, 915, 935). 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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"2903c311803bfdb76daf25223b2c591f58fac919f31343b57448a443ef589f7a"}},{"ruleId":"D1","level":"warning","message":{"text":"useSidebarTableMutationRuntime.useSidebarTableMutationRuntime.runDangerOperation (cyclomatic 18): useSidebarTableMutationRuntime.useSidebarTableMutationRuntime.runDangerOperation has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTableMutationRuntime.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ec8209d280a93e9dc63c9b869a6698d6624d9136661f88fd347aaa598d3e09"}},{"ruleId":"D1","level":"warning","message":{"text":"useSnippetAutoUpload.useSnippetAutoUpload.runSnippetAutoUpload (cyclomatic 18): useSnippetAutoUpload.useSnippetAutoUpload.runSnippetAutoUpload has cyclomatic complexity 18 (threshold 15). Of this number, 10 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":"apps/desktop/src/composables/useSnippetAutoUpload.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb65cd463f4b864f81ffdc87d7624265abd3851284557152ae11fafb1d0ec9a0"}},{"ruleId":"D1","level":"warning","message":{"text":"scheduledDatabaseBackup.normalizeDatabaseBackupRun (cyclomatic 18): scheduledDatabaseBackup.normalizeDatabaseBackupRun has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"219598bc4f6e7c2ad5d2dcd30fce7fcbf7e0b9cb19f4ae4e1e7b41b3b13f5e45"}},{"ruleId":"D1","level":"warning","message":{"text":"safeJsonFormat.decodeJsonSource (cyclomatic 18): safeJsonFormat.decodeJsonSource has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b704126556358a20afb68315c22cd11c399c874d98251b1004fcea53b9a8b5b2"}},{"ruleId":"D1","level":"warning","message":{"text":"agentDriverInstallHint.agentDriverInstallKey (cyclomatic 18): agentDriverInstallHint.agentDriverInstallKey has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/agentDriverInstallHint.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf821864c373581963559a44ce3340efe45ccc4a4ed7b3936aab137796bc6a1"}},{"ruleId":"D1","level":"warning","message":{"text":"jdbcDialect.connectionObjectTreeNodeSchema (cyclomatic 18): jdbcDialect.connectionObjectTreeNodeSchema has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/jdbcDialect.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da7a476375dd27a94332a7b369e1fa49bc862b33df934e0ebaf08911d815bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTriggerStructurePlan.reconcileOracleTriggerStructureDraft.rebase (cyclomatic 18): oracleTriggerStructurePlan.reconcileOracleTriggerStructureDraft.rebase has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerStructurePlan.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd35305eee83fc88a5613ae59e7c4326768d5e084905f319d7648cbf2d0347ae"}},{"ruleId":"D1","level":"warning","message":{"text":"xuguUserPermissions.decodeXuguAuthority (cyclomatic 18): xuguUserPermissions.decodeXuguAuthority 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":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99340c50562be85f6220ed2c432c9fb0fd258ae5661301ba07e2d7540ae67fe"}},{"ruleId":"D1","level":"warning","message":{"text":"ltr-auto-layout.orderTablesByConnectivity (cyclomatic 18): ltr-auto-layout.orderTablesByConnectivity has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/ltr-auto-layout.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54c34b873f4b16ad9175ab3d28332d7038b71587368d01181077a26499b1a8c"}},{"ruleId":"D1","level":"warning","message":{"text":"databaseExport.runDatabaseExportUntilTerminal (cyclomatic 18): databaseExport.runDatabaseExportUntilTerminal has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExport.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"154429290e47aed89292c0bef906c824234cc8b583c506635c58db0c39f8c169"}},{"ruleId":"D1","level":"warning","message":{"text":"graphCompletionScope.projections (cyclomatic 18): graphCompletionScope.projections has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (add, a function literal at line 24). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletionScope.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ade40e58429408effa9e2b00809899fa279d1ceec191cc279a6a23066a419d"}},{"ruleId":"D1","level":"warning","message":{"text":"historyRestoreTarget.canReuseTabForHistoryRestore (cyclomatic 18): historyRestoreTarget.canReuseTabForHistoryRestore has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/history/historyRestoreTarget.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c6dcab0bedeb497376d5eb4211ea2dc548baab81b169acd4bcb5c9a638be24"}},{"ruleId":"D1","level":"warning","message":{"text":"redisDesktopManagerImport.connection (cyclomatic 18): redisDesktopManagerImport.connection 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":"apps/desktop/src/lib/imports/redisDesktopManagerImport.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c760cbd1f47585dfead2b3fb387cb906236ea856a0890acc6f2af32fa108b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"kvValueFormat.detectKvValueFormat (cyclomatic 18): kvValueFormat.detectKvValueFormat has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/kvValueFormat.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9cd85efdc14798562da805c24ef37a951df8a579739c55a884025bfdea9c97"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.mongoCommentAwareBodyEnd (cyclomatic 18): mongoShellCommand.mongoCommentAwareBodyEnd 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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02c2b7a8219978520aa30c07cd97729ee9a90dfb1f9722b6d358055d0e3cef4"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoSyntaxDiagnostics.describeMongoWriteRisk (cyclomatic 18): mongoSyntaxDiagnostics.describeMongoWriteRisk 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":"apps/desktop/src/lib/mongo/mongoSyntaxDiagnostics.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c024cd909de4c073eeb9b2ae8ad321fa08dd6c2ca1646a7de0912ce178957b"}},{"ruleId":"D1","level":"warning","message":{"text":"nacosConfigValidation.closeImplicitHtmlTags (cyclomatic 18): nacosConfigValidation.closeImplicitHtmlTags has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosConfigValidation.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2bb16653781bc0b22b8206b49bcd37968617791dbc1191204c07130f6da880"}},{"ruleId":"D1","level":"warning","message":{"text":"redisCommandDocs.mapEntries (cyclomatic 18): redisCommandDocs.mapEntries has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandDocs.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf1b8cadff72da69dae20b6813bba293da8c6755c622f45894c7de312ce36da"}},{"ruleId":"D1","level":"warning","message":{"text":"redisCommandDocs.commandArguments (cyclomatic 18): redisCommandDocs.commandArguments has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandDocs.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba68e1ef51012c1ad93188115bb1338e72b3089baed285167ed5d79a7238b3aa"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaDiffTableMapping.reconcileSchemaDiffTableMappings (cyclomatic 18): schemaDiffTableMapping.reconcileSchemaDiffTableMappings has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffTableMapping.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c9c3cb9a3203bfc067c3c758ec57f9d1c7d1e6ce24ce04ced11697cd328708"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarLayoutMonitor.createSidebarLayoutMonitor.captureSample (cyclomatic 18): sidebarLayoutMonitor.createSidebarLayoutMonitor.captureSample has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"e822e9a948ed9de5d75d578b901d5b34f825e6a0704bf32a405749b6f5978811"}},{"ruleId":"D1","level":"warning","message":{"text":"ddlDisplay.findColumnAttributePositions (cyclomatic 18): ddlDisplay.findColumnAttributePositions has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"378ee862af1ccfeff831c68628fee49e15d20d1169eb08a45c25f024826ab2b8"}},{"ruleId":"D1","level":"warning","message":{"text":"errorPosition.resolveSqlErrorOffset (cyclomatic 18): errorPosition.resolveSqlErrorOffset has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/errorPosition.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ee9960a5d81bf9bb20d883cbaf235601c5ecf4cd3bb814bb99f9cb378215d6"}},{"ruleId":"D1","level":"warning","message":{"text":"executableStatementRangeCache.executableStartAfterLeadingComments (cyclomatic 18): executableStatementRangeCache.executableStartAfterLeadingComments 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":"apps/desktop/src/lib/sql/executableStatementRangeCache.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"379b31a94337ff37a85fbb61b090999138094b630516d01787e2b81eb6b5b58f"}},{"ruleId":"D1","level":"warning","message":{"text":"model.isTableListContinuation (cyclomatic 18): model.isTableListContinuation has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b10960a39eeeb26b209804f2f97fd4f62ba335e76475a9a5559ab2bf404c0f5"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.isStandaloneSelectWildcard (cyclomatic 18): sqlCompletion.isStandaloneSelectWildcard has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"0477d81e392bf25aabf083e9d9ea1abbd02fadf005dcb625d53f0b3e305653e7"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.splitRoutineSignatureParameters (cyclomatic 18): sqlCompletion.splitRoutineSignatureParameters 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9fa237841f303fc8028319c9d99846c4aae8ac0e00c658e6f31ed5d145dd77"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.findMatchingXmlTagClose (cyclomatic 18): sqlParameters.findMatchingXmlTagClose 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95781f58cc76e8e34323f923ba91e2805a09d305110fd53542d3d113f914f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectDeclareStatementVariables (cyclomatic 18): sqlParameters.collectDeclareStatementVariables 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"750a7f80505aa6a4a17a405a3e17d4bf06b9880b9e650952afbbb0bbeb29f0ea"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectRoutineDefinitionVariables (cyclomatic 18): sqlParameters.collectRoutineDefinitionVariables 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c2bfceb57e89fa0a50b84ca0c36877d414a2e5e538aa912beefc1a0f545273"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlFormatter.formatLeadingCommas (cyclomatic 18): sqlFormatter.formatLeadingCommas has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: sqlFormatter.sqlFormatDialectForDbType (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf0f13a801e1322882c010af0a7d936a7f42e95749c513ab449369e6194d3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlVariableSyntax.normalizeSqlVariableSyntaxOverrides (cyclomatic 18): sqlVariableSyntax.normalizeSqlVariableSyntaxOverrides 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":"apps/desktop/src/lib/sql/sqlVariableSyntax.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ce17ba5d356339dc456d3957c75b8bb6d758514061ad54a11a561bd04369df"}},{"ruleId":"D1","level":"warning","message":{"text":"objectBrowserRows.buildObjectBrowserRows.rows (cyclomatic 18): objectBrowserRows.buildObjectBrowserRows.rows has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33382c49390d4c12c83b288a5cb164edd60ccaba05a63b3194dfce41cb8689f"}},{"ruleId":"D1","level":"warning","message":{"text":"objectBrowserRows.groupObjectBrowserRows (cyclomatic 18): objectBrowserRows.groupObjectBrowserRows has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (appendPartitions, a function literal at line 336, a function literal at line 350). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"30867c45bb92b83990c2b68e7d298a0e5e7947e4515f4e31cc410eefea848c32"}},{"ruleId":"D1","level":"warning","message":{"text":"objectSourceLoad.inspectExactOracleTriggerSource (cyclomatic 18): objectSourceLoad.inspectExactOracleTriggerSource has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectSourceLoad.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19016bcfd091e4418d34d5434c8332eebefcfce5e677dc51b70eef6630d430b"}},{"ruleId":"D1","level":"warning","message":{"text":"pgPartitionPresentation.splitPgPartitionBoundValues (cyclomatic 18): pgPartitionPresentation.splitPgPartitionBoundValues 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":"apps/desktop/src/lib/table/pgPartitionPresentation.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fb6fe0e5379e6e89fe4568e38de80289084edb9ccbc9446417d3b3c519bfbc"}},{"ruleId":"D1","level":"warning","message":{"text":"postgresDataTypeHelp.gaussdbMTypeDisplayName (cyclomatic 18): postgresDataTypeHelp.gaussdbMTypeDisplayName has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/postgresDataTypeHelp.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"165b2a61eeac6e276de1f55a553bd86bd97e35acb647c9a5897c258669891452"}},{"ruleId":"D1","level":"warning","message":{"text":"routineParameters.sqlServerParameterDeclarationType (cyclomatic 18): routineParameters.sqlServerParameterDeclarationType has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"c750253b9d691dcae36efc09654cca6430c0f1a61a33c6b9efd663c3aa8fa60c"}},{"ruleId":"D1","level":"warning","message":{"text":"tableColumnDefinitionPaste.validateDefaultExpression::operand (cyclomatic 18): tableColumnDefinitionPaste.validateDefaultExpression::operand 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":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d97e2f76d84b9e95eca17e15eeaa1a0c7ecd6220ceb1f536af5eb8f13375542"}},{"ruleId":"D1","level":"warning","message":{"text":"tableStructureEditorState.isWrappedByOuterParens (cyclomatic 18): tableStructureEditorState.isWrappedByOuterParens has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: tableStructureEditorState.isTemporalPrecisionType (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"95daeb16372674a9e22f00d9d18588a824e7f31a3df9b44201bdf37a06cd8eb7"}},{"ruleId":"D1","level":"warning","message":{"text":"tableTree.coalesceXuguPackageObjects (cyclomatic 18): tableTree.coalesceXuguPackageObjects has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eae30ed28ae470c8c4a39225478427573bf5176221fc3ce9cf95732495b51f7"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.manifestTableSearchScopeMatchesTreeRefresh (cyclomatic 18): connectionStore.useConnectionStore.manifestTableSearchScopeMatchesTreeRefresh has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3971}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9404e69c26121a84aad2f7b79ebe930e5d270e68f1560c9bfa52a36b19b281"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.persistConnectionDeletion (cyclomatic 18): connectionStore.useConnectionStore.persistConnectionDeletion has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10901}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f275943b65128c172e84613674738f5bf3d07ce9234934762556eb1515802b"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.initFromDisk (cyclomatic 18): connectionStore.useConnectionStore.initFromDisk has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11895}}}],"partialFingerprints":{"codehealthFindingId/v1":"0558093c33a3d04ad6dce0e72efd0a015ff9aa3a4b3a9933378f8a62d7ea0d25"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.executeInDebuggee (cyclomatic 18): plDebugStore.usePlDebugStore.executeInDebuggee has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c2cb9ffa4f2e246d808d535c5a46489c32368ae8180ea2a2de157a427418c1"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.findMatchingObjectSourceTab (cyclomatic 18): queryStore.useQueryStore.findMatchingObjectSourceTab has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to one function literal inside it that branches (line 3313). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a31dd6eaca77acbe3f3c98ccfea01f0d63b213d0c151c9f6ad412e4f7aa49c"}},{"ruleId":"D1","level":"warning","message":{"text":"transferTaskStore.useTransferTaskStore.moveTaskToFolder (cyclomatic 18): transferTaskStore.useTransferTaskStore.moveTaskToFolder has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 396, 390, 391). 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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc7379dfa83ab85e951c1607ef3f79b6da92fbd92b3c6ab55ce2d670ce041ed"}},{"ruleId":"D1","level":"warning","message":{"text":"json.readMongoRegexLiteral (cyclomatic 18): json.readMongoRegexLiteral 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":"packages/mongo-shell/src/json.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f11f313758566f0bf69164950c3cd802b6fef39020a7f48b17458b39407bde"}},{"ruleId":"D1","level":"warning","message":{"text":"json.splitTopLevel (cyclomatic 18): json.splitTopLevel 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":"packages/mongo-shell/src/json.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c241f85c5a16124809135676724aec716f91391efe61dfc36094f93635cd6679"}},{"ruleId":"D1","level":"warning","message":{"text":"Diagnostics.query (cyclomatic 18): Diagnostics.query has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, 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":"plugins/sdk/dev-host/diagnostics.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42486d046d9fe4d0a9a9b776839f7691645ea3b8e7024638a4703833f249814"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_duckdb_driver::sql::first_executable_sql_token (cyclomatic 17): dbx_duckdb_driver::sql::first_executable_sql_token has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ba34c33c99f2be008fedb50758b46d146a2a2f0f96a40023a3bd8c1a32e41c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_ai_provider::ai::build_gemini_contents (cyclomatic 17): dbx_ai_provider::ai::build_gemini_contents has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: AiProvider::as_str (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":5001}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe63be6cc997f044eae7c90a1623f5f616e80beee2c78d734fb4e25702d05c09"}},{"ruleId":"D1","level":"warning","message":{"text":"TupleScanner::next (cyclomatic 17): TupleScanner::next has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7cea7fbe7e99e55d3299f3620169c5d93439a412b591a6e0173860b2400b39"}},{"ruleId":"D1","level":"warning","message":{"text":"Storage::load_connections (cyclomatic 17): Storage::load_connections has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8131}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bbecd15ccc30f3d76dc89d13945e33978e9a8368a77b5f18cd509de03d283b"}},{"ruleId":"D1","level":"warning","message":{"text":"McpGlobalPolicy::normalized (cyclomatic 17): McpGlobalPolicy::normalized has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d13a625fc28a9106d324f3fed57593253b9ab77fae7cacdffab7d1aed42db5"}},{"ruleId":"D1","level":"warning","message":{"text":"BackupConfig::validate (cyclomatic 17): BackupConfig::validate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/models.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db37dd7e803a8ce29123be8e135b12022f69bafcfa1b2c475c257ce77c0cb69"}},{"ruleId":"D1","level":"warning","message":{"text":"BackupService::command (cyclomatic 17): BackupService::command has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/service.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d8e699cda1791b53b01b07f5c5c70dcb753a4457ecf238a211d4553f5347ca"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::admin::nacos::access_control::validate_replayed_commands (cyclomatic 17): dbx_core::admin::nacos::access_control::validate_replayed_commands has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbe8e0e9e21ee8eef265e0075d88a93e76fe9a142de279c2071e88c8ca89864"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::directory::collect (cyclomatic 17): dbx_core::data::mongodb_dump::directory::collect has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/directory.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c0206984eac88872bc45db976815fc68942db4bf33b8d043f71afb017e0af8"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::export_bson (cyclomatic 17): dbx_core::data::mongodb_import_export::export_bson has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":3080}}}],"partialFingerprints":{"codehealthFindingId/v1":"1728c0d75d4e6de18b4a8d36f1893912f748df268045d2fc557b9308bdd466a8"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::script_generator::generate_joint_script (cyclomatic 17): dbx_core::data::script_generator::generate_joint_script has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d19fb7b7a0d1c5ff200cb49898ff93e98d492cc832f801c27d608bddad0d112"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::xlsx_temporal_kind_from_format_code (cyclomatic 17): dbx_core::data::table_import::xlsx_temporal_kind_from_format_code has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"8570e41865c391bca32c861c98a68ab78d59fff9a38afaeaec6eeb7c5f98930b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::execute_import_rows_batch (cyclomatic 17): dbx_core::data::table_import::execute_import_rows_batch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":6580}}}],"partialFingerprints":{"codehealthFindingId/v1":"528e0b69dc5dec002060561f6c3961a70fc89474973b1dd4d32d9ea6fb2e791f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::execute_transfer_write_statement (cyclomatic 17): dbx_core::data::transfer::execute_transfer_write_statement has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"354f2640c18c584f933c6780039163f3ddc4243738d5b96b1ff9dbafa5ee8846"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::mysql_xugu::default_sql (cyclomatic 17): dbx_core::data::transfer::mysql_xugu::default_sql has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da253ddb0fbee61b51e1b4dc207cc7ec2b009910454462c1ab901452e274067"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::xugu_objects::add_definition_dependencies (cyclomatic 17): dbx_core::data::transfer::xugu_objects::add_definition_dependencies has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccacec10a68932f92d59c2add947f7edfdcc07817b7a1419022e0cca1047a88a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::query::extract_server_large_value_markers_with_charset (cyclomatic 17): dbx_core::query::extract_server_large_value_markers_with_charset has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"139db0bcbdece4fbed09cbd5ef0b4b1117ef05b6c1b53c7ff31e2a0ca1a74128"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::safety::production_safety::mongo_pipeline_targets_production_database (cyclomatic 17): dbx_core::safety::production_safety::mongo_pipeline_targets_production_database has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"52392142b03360c590b21fd6859c1bf7628fe6078f4e1ed2e9cc48e6eaa17d32"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::details::read_native_job_details_with (cyclomatic 17): dbx_core::schema::native_jobs::details::read_native_job_details_with has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/details.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ac4f44cfa551659a79bb7f739739c48179e2eb738f97970c99be41d715b6b3"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::native_job_prepare_with_references (cyclomatic 17): dbx_core::schema::native_jobs::operations::native_job_prepare_with_references has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fbd4c9719c3dbaabee3441bbad9ecfa3bb934cd6616a07bdfdc0b2c22540ce"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::check_source (cyclomatic 17): dbx_core::schema::oracle_routines::check_source has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f94e74c19e3f88afefdfd70047419d96e727089da268ac051e303000a7d048"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::plan::package::normalize_input (cyclomatic 17): dbx_core::schema::oracle_routines::plan::package::normalize_input has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan/package.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aa7f0ce033f34b0898bb422011fbb48a0ff8cff83b6542ad8125e6165921eb"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_type_data::validate_insert_target (cyclomatic 17): dbx_core::schema::oracle_type_data::validate_insert_target has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbd652578eed7de26fef94efc03747800bdbab9acbf82d7e7f136ef32bd195a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_type_management::dependencies (cyclomatic 17): dbx_core::schema::oracle_type_management::dependencies has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_management.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0232daaa5cd434b268ded79fd8bd42b81e8a63f06e92c365c646640865a578"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::state_calibrator::classify_reconciliation (cyclomatic 17): dbx_core::schema::state_calibrator::classify_reconciliation has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/state_calibrator.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"2147b984081cd53c9b5a18f31e921fb22851d38c212519ba48999579c1d94c5e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_elasticsearch::parse_aggregations (cyclomatic 17): dbx_driver_elasticsearch::parse_aggregations has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":3200}}}],"partialFingerprints":{"codehealthFindingId/v1":"15650d9084d3c08cd3cca61ed04b07da246cfb8c9d7fa657a7995a66092529cb"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::shell_constructor_to_extended_json (cyclomatic 17): dbx_driver_mongodb::mongo_shell::shell_constructor_to_extended_json has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"2086f961b46c701150ecfdf8e5d59691d453e4b706e69cba8b87ffd11ce9c9ea"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::ssl_fallback_url (cyclomatic 17): dbx_driver_mysql::mysql::ssl_fallback_url has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfeb9781ebab7e72839545bf0bcd674edbe7379e36e2c88231904351a91cc52"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::completion_assistant_search (cyclomatic 17): dbx_driver_mysql::mysql::completion_assistant_search has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3869}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae8f898f0d2a88b51c8e02eef0117c2e35d7cf44a7ad924a6ab62f3083fa94b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::list_objects (cyclomatic 17): dbx_driver_mysql::mysql::list_objects has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":4897}}}],"partialFingerprints":{"codehealthFindingId/v1":"3319c8f71f3e985dcdaa2a8a64e6af85e88027c288efd410f8f2f0b80f6abca5"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::execute_non_result_batch_on_conn (cyclomatic 17): dbx_driver_mysql::mysql::execute_non_result_batch_on_conn has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7552}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4f8856f61cb00c9752ac379417a58b91ea1217471ba41423ef573891dc66e7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_redis::attach_hash_field_ttls (cyclomatic 17): dbx_driver_redis::attach_hash_field_ttls has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_redis::redis_command_raw_to_json (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5641}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b0181ab35cdff6156ad853637ff5aecbbd8db5aa2be09400723f1fe6241a6c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::sqlserver_column_metadata_from_row (cyclomatic 17): dbx_driver_sqlserver::sqlserver::sqlserver_column_metadata_from_row has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":3300}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a32eb01389d210b87280f76def9400a435d98f8f56412b5a4a8f438d114373"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::first_sql_tokens (cyclomatic 17): dbx_driver_sqlserver::sqlserver::first_sql_tokens has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":4607}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e69e602921790d92dea12a3df569e79a8057163775b8c47361669ac6f6c6770"}},{"ruleId":"D1","level":"warning","message":{"text":"DuckDbWorkerClient::execute_typed_with_options (cyclomatic 17): DuckDbWorkerClient::execute_typed_with_options has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_worker_process.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2450c64fe9d5df48ae130b568541c2e708589b932bda3754d9b123fd21a663b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::couchdb_driver::couchdb_docs_to_table (cyclomatic 17): dbx_drivers::db::couchdb_driver::couchdb_docs_to_table has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc369a52d1e0152cc86dc50fce56421f7a259e1c186c513144eea4ddbfa622c7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::dynamodb_driver::validate_number (cyclomatic 17): dbx_drivers::db::dynamodb_driver::validate_number has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"790b68a4bb27e2658313c598d387ef429e87ae8b9b7f01d028dad03178401f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::salesforce_driver::apply_fields_function_limit (cyclomatic 17): dbx_drivers::db::salesforce_driver::apply_fields_function_limit has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/salesforce_driver.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"279469b2da15b9f93a389bfc7d111ae28587262dc5e74e68145649f4dc5e672a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::solr_driver::solr_docs_to_table (cyclomatic 17): dbx_drivers::db::solr_driver::solr_docs_to_table has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/solr_driver.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc15f79d49019bea6cdb03a4363cd31bb8a8966bd766f0ed4ceda43517d9558b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::sqlite::extract_create_table_body (cyclomatic 17): dbx_drivers::db::sqlite::extract_create_table_body has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"719538ee11e61681e7ef29b57a331b05e698eaee76bd7849a6ccd1e91f331d55"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::sqlite::parse_table_level_primary_key (cyclomatic 17): dbx_drivers::db::sqlite::parse_table_level_primary_key has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"726fb02e10179721b855e829c825375252ffd223bcd45c7ded926eccedd77498"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::transport_layer_tunnel::start_transport_layers_internal (cyclomatic 17): dbx_drivers::db::transport_layer_tunnel::start_transport_layers_internal has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/transport_layer_tunnel.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"292bf36a3dd87cb3573efdcb70c54512643efe93594ffae4a763255062fe5eae"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::plugin_tools (cyclomatic 17): DbxMcpServer::plugin_tools has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06567eff4091b1743264d3c52604bbd49d100aaa89a3d00336c9349a7b6812e"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::execute_and_show (cyclomatic 17): DbxMcpServer::execute_and_show has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4474825edaf9c6e894ba75ef0a4638b81c287919ee6c8376edb7a97b84d17b7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::build_oracle_type_management_source (cyclomatic 17): dbx_sql_core::object_source_sql::build_oracle_type_management_source has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"1391e36f1f68c53d20101270125f8b549057ab39858ecffd7ec08360f551daf7"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::oracle_view_rename::rewrite_query (cyclomatic 17): dbx_sql_core::oracle_view_rename::rewrite_query has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"7914c4eddbcf083606d28f6551e48ab9fa2a598c25809db7f29692ded624c3b8"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::parse_insert_values_tail (cyclomatic 17): dbx_sql_core::sql::parse_insert_values_tail has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"74138ceee28fac0404ca3cb1efb7a403b28b1b4441e610a1633bbe55b533cdba"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::leading_mysql_executable_comment_start (cyclomatic 17): dbx_sql_core::sql::leading_mysql_executable_comment_start has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3591}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1cbefd8cb02f0b2923c6836824fe5f292227ac7dd1aa20b53f20e9bb9b8a59"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::has_executable_sql_with_options (cyclomatic 17): dbx_sql_core::sql::has_executable_sql_with_options has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4834}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f2776b779f4b8654f1ed5f1c9f2b36a824d0d70091be4697e29da03b3588a4"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql_analysis::is_postgres_create_procedure_parser_gap (cyclomatic 17): dbx_sql_core::sql_analysis::is_postgres_create_procedure_parser_gap has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ac242f0bd5a2577212923c1768a84852734e259c443ee3c163145ef49a83ec"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql_editability::strip_sql_server_top_clause (cyclomatic 17): dbx_sql_core::sql_editability::strip_sql_server_top_clause has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5125410542c0afa0d46944041b170151b21e2cc291ef0a0f6b77b5ff8359cdb"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::rename_changes (cyclomatic 17): dbx_sql_schema::native_job_changes::dameng::rename_changes has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"44adc9975f1b872248d352635b76b3929922d3e680f6588b4a25ecb1c652a6f2"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::generate_permission_sync_sql (cyclomatic 17): dbx_sql_schema::schema_diff::generate_permission_sync_sql has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d745e84b8edfda6b2f11b5afad10bb7fb70e95cdada178146a5b9ec06414664"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::oracle_routines::oracle_routine_diff_sql (cyclomatic 17): dbx_sql_schema::schema_diff::oracle_routines::oracle_routine_diff_sql has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/oracle_routines.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17a87433132ed5f153f6f626468070285047f15afe5a5d4c5f08779469cdc6c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_alter::has_column_extra_change (cyclomatic 17): dbx_sql_schema::table_structure_sql::column_alter::has_column_extra_change has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cbf907afa7835f4464d89b2f01fd3f715a60893366d8f76223ca64434cf0cd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_alter::build_sqlserver_existing_column_sql (cyclomatic 17): dbx_sql_schema::table_structure_sql::column_alter::build_sqlserver_existing_column_sql has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69f71eeb8507823e67186c75d75c881ffa79fc0bd6e7dc0b36bcbd1dadedf47"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_format::column_extra_clause (cyclomatic 17): dbx_sql_schema::table_structure_sql::column_format::column_extra_clause has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fe8e83c1c4a1ce2827c652182da4c056e5817120599ce74830599e9974a672"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_format::normalize_column_data_type (cyclomatic 17): dbx_sql_schema::table_structure_sql::column_format::normalize_column_data_type has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"664c4d387c32112f6cfc28751a2c87194e1603a71842c49b941d9dc2a87b87c0"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::commands::mcp_cleanup::sweep (cyclomatic 17): dbx::commands::mcp_cleanup::sweep has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_cleanup.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c36b00652252d75d6b7ddb7578865d314e36dd4abaeb400dbe55bd864ffda50"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::commands::plugin_file::drop::open_dropped_plugin_files (cyclomatic 17): dbx::commands::plugin_file::drop::open_dropped_plugin_files has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/plugin_file/drop.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a38af706d44e54e41c133187bad98a4149ca7f1c153b27b2399410fa1b06705"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractJdbcAgent.finishPooledRequest (cyclomatic 17): AbstractJdbcAgent.finishPooledRequest 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":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b23f4a2a6dfdc3b8b93578e27438954aa304f65ad1fc141d170bb14d8a8e857"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentRpcError.classify (cyclomatic 17): AgentRpcError.classify has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AgentRpcError.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d9ea43dba086efd62b0f8b39c1c77cdcf660418101bd4222cf31b1439f62e5"}},{"ruleId":"D1","level":"warning","message":{"text":"JdbcConnectionParameters.describe (cyclomatic 17): JdbcConnectionParameters.describe has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efd7907d3f851bea05870449f3373e44ac613e64a022601195274e1e2505cc8"}},{"ruleId":"D1","level":"warning","message":{"text":"PoolEntry.borrow (cyclomatic 17): PoolEntry.borrow has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaee0c026a3f3f1d9fe65f307377bdfc34a088bbeb7d89064a961f26d630369"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.appendInceptorRoutinesFromSystemTables (cyclomatic 17): DbxJdbcPlugin.appendInceptorRoutinesFromSystemTables has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d94ee3f4e8ac6fe736febb20538c2bc7bf853d1865065917946b924a2f9cf95"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.handleLogicalSession (cyclomatic 17): DbxJdbcPlugin.handleLogicalSession has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e635126a8d969fd569e2de4444c37e295dbf61b8ad90853bb76ee9c00c06a8"}},{"ruleId":"D1","level":"warning","message":{"text":"JdbcConnectionParameters.describe (cyclomatic 17): JdbcConnectionParameters.describe has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/JdbcConnectionParameters.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e69cf2cd66bf0daad638261d7f1432fed4eb373fe4082fdf9cf838739f38385"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleTriggerMetadataReader.listObjects (cyclomatic 17): OracleTriggerMetadataReader.listObjects has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f766a44a731b937f3a64a67858536bcc9196a2b0ddd06632fab0119ba9542ea7"}},{"ruleId":"D1","level":"warning","message":{"text":"DamengAgent.buildCatalogObjectSource (cyclomatic 17): DamengAgent.buildCatalogObjectSource has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: DamengAgent.resultValue (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4133dea8ca7acb730b65590fccccff2affa66cebd9af421e84a4da629a5147"}},{"ruleId":"D1","level":"warning","message":{"text":"FirebirdObjectSource.triggerSource (cyclomatic 17): FirebirdObjectSource.triggerSource 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":"agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdObjectSource.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"be752d6512705ebde80880da552b00d3b66f1b1bf90f3bf19ad206a9a1ec14b5"}},{"ruleId":"D1","level":"warning","message":{"text":"MongoAgent.applyAggregateOptions (cyclomatic 17): MongoAgent.applyAggregateOptions has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: MongoAgent.dispatch (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6449221ec48d765a688853087f1611902222b6da1b46575132a51ac2666fc57"}},{"ruleId":"D1","level":"warning","message":{"text":"OceanBaseLobValues.mark (cyclomatic 17): OceanBaseLobValues.mark has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseLobValues.java"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3ef0ff8ba478f94815ce5ff1d0dc9913ff7ff8e65d7c72e507fc840fa2a075"}},{"ruleId":"D1","level":"warning","message":{"text":"2.read (cyclomatic 17): 2.read has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfee864e7664d17e6175ca8eb5b728e2f6f27a9fe68f85c808396c978dabafa"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugBreakpointRegistry.set (cyclomatic 17): PlDebugBreakpointRegistry.set has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugBreakpointRegistry.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82709f2f425c1a76dfe1bfe0ab5f9cfc2d12dbcaf4f9f291c7b30f8b46c575d"}},{"ruleId":"D1","level":"warning","message":{"text":"Execution.run (cyclomatic 17): Execution.run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompile.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"522f1c6af081a624dd0a4677ad0af88fa9a6e506dde58d2f4589652df17a4a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugCompositeInput.payloadBytes (cyclomatic 17): PlDebugCompositeInput.payloadBytes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Writer.childDeclaration (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d205cee9cf4811f55045ded236f7556d913a73344d1a89868b5baa36665e1c1"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugCompositeOutput.helperDeclarations (cyclomatic 17): PlDebugCompositeOutput.helperDeclarations has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeOutput.java"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ea19d0531fc96e1396581343a1e0b86a493243429c0a4c672ba23ee8f35399"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugCompositeOutput.\u003Cinit\u003E (cyclomatic 17): PlDebugCompositeOutput.\u003Cinit\u003E has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeOutput.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"966b5d9589b6fb77b6835e78d0483caad9045adb835e43a0f1113812d1d030a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Plan.bindComposite (cyclomatic 17): Plan.bindComposite has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: PlDebugTarget.declare (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b79fbca1823aff904014590851597457d7b7c6a70dc49fe3bb2733f69ed615"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlServerLegacyAgent.shouldFallbackToJtds (cyclomatic 17): SqlServerLegacyAgent.shouldFallbackToJtds has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafdb9eb5283fecc3dabebdffe362771851ccec7fa1028b820ac336e0e21bd9b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_tunnel.run_worker (cyclomatic 17): dbx_tunnel.run_worker has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/dbx_tunnel.php"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca6a03fda6c31c539a0312d54815a507ae6b7e84a217261d6ad43bddec2f408"}},{"ruleId":"D1","level":"warning","message":{"text":"main.loadTrustStore (cyclomatic 17): main.loadTrustStore has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"822ae41a071bc605c555451a83053e36dd499617aa57231a70ba18e02091a609"}},{"ruleId":"D1","level":"warning","message":{"text":"etcdSession.readableKeyRanges (cyclomatic 17): etcdSession.readableKeyRanges has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca939aa59ec34f2000dff7ec93c4aa2312c77b8efbc29977e92e9d3a5b8fdcc0"}},{"ruleId":"D1","level":"warning","message":{"text":"main.loadTrustStore (cyclomatic 17): main.loadTrustStore has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/zookeeper_tls.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"79309bd9f68250e3a40f04adeb5c61b3bb1b18232f0a48729ac171004bbc2eeb"}},{"ruleId":"D1","level":"warning","message":{"text":"server.getTableDialectDDL (cyclomatic 17): server.getTableDialectDDL has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/metadata.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"548fac9d99f7389239a08fe427e173beff7a9e21dcab32f183a2602e83fecf0a"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listForeignKeysFromCatalog (cyclomatic 17): server.listForeignKeysFromCatalog has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"819069e87fece8501d0385dc241b75afc10843907f535d8abbae5e4132bacbff"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listTriggerDefinitionsFor (cyclomatic 17): server.listTriggerDefinitionsFor has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfde66449dabdfc10d0d28cb2bac854ad4497f8f0c2c9fb8f2dfe26531c69290"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatch (cyclomatic 17): runtimeServer.dispatch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d333d9c5465981602c5f4c2c020b7372c99fcf0bd80846fa559518797209a1ba"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runOracleAgent (cyclomatic 17): main.runOracleAgent has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"a910d03a4f2024871d23b89ae0df49485719f970763d3a35d855cf66edc00b2d"}},{"ruleId":"D1","level":"warning","message":{"text":"main.oracleFullPassthroughInnerSelectRange (cyclomatic 17): main.oracleFullPassthroughInnerSelectRange 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f46764523081f54d364f6b8cbe4c03fb320b2545113182a46ba10d60116eacd"}},{"ruleId":"D1","level":"warning","message":{"text":"main.oracleRequestedMetadataListQuery (cyclomatic 17): main.oracleRequestedMetadataListQuery has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/metadata_queries.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2234bbc29aa9d436efc940b801d2301b66a62a887834a380d81b2bd85aa722"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeCaptureRender (cyclomatic 17): main.plDebugNativeCaptureRender 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":"agents/drivers/oracle-go/pldebug_output.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96ce82e5b67197e06ccaca3f218d2cdce806f6c4be0dabff08ee4d3bdeab999"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeTypedTransport (cyclomatic 17): main.plDebugNativeTypedTransport has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_transport_preflight.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c78e54843874b09a8d66627b615afdf5418e02a2de17cd005b0400d6497d4a"}},{"ruleId":"D1","level":"warning","message":{"text":"server.getTableDDLWithIdentity (cyclomatic 17): server.getTableDDLWithIdentity has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3886}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a00d9065e61567b0fd38d61fa5ef08e2286bf447ba1798f26cf6dd7b912f3b9"}},{"ruleId":"D1","level":"warning","message":{"text":"server.openNativeDebuggee (cyclomatic 17): server.openNativeDebuggee 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":"agents/drivers/oracle-go/pldebug_connections.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abe7742c210e8faff1bc87379b60abc8e0428cdcce4dfec64490bc530b5c7b0"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugRecordDecoder.collection (cyclomatic 17): plDebugRecordDecoder.collection has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_collection_input.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce6965b2a4f0d0e364822cda0c26bc9553f0812b14956338be1244fd8a1df7d"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugResultCache.retainWithState (cyclomatic 17): plDebugResultCache.retainWithState 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":"agents/drivers/oracle-go/pldebug_results.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4203c4a974b05ebeb0da1699daaaed060afb4ad7ed88d9167e3beb313a560579"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeRoutineScan.ownerAtLine (cyclomatic 17): plDebugNativeRoutineScan.ownerAtLine has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"c167d97a22586ce92fead5b0f7cfa3eb05287761077ee34b0aab6b56a62f303d"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeTypeLoader.query (cyclomatic 17): plDebugNativeTypeLoader.query has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_type_graph.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0916b4b219c1ffcaa8b5471064f367f0ddc0a5a314b62212580cf482d5901feb"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugNativeTypeLoader.containerVersion (cyclomatic 17): plDebugNativeTypeLoader.containerVersion has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_type_graph.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb41a349e0769c467b7a3fe5a1be6e3af900ed2c43ab450f05ad6033b70ec33c"}},{"ruleId":"D1","level":"warning","message":{"text":"main.paginateManagementArray (cyclomatic 17): main.paginateManagementArray has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/management.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c680faa092949ce8e95032c053ea020371cf5996771568d31e9fd803fa1858d4"}},{"ruleId":"D1","level":"warning","message":{"text":"rocketMQAgent.viewMessage (cyclomatic 17): rocketMQAgent.viewMessage has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7889ffc0e118661e680c6b44de8ac5b8e960b40a7082e32df3419f10865fd268"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listTablespaces (cyclomatic 17): server.listTablespaces has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: main.normalizeValueWithType (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aa562cd5a6507b0f35d9845889622348d17df118b4d7ea9b746113b7768529"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.dispatch (cyclomatic 17): runtimeServer.dispatch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: main.normalizeValueWithType (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"812b9c9d94452c93b80a8725516eeb95d66b048e38ddeb7cd4bd690bca16aaed"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listPrefix (cyclomatic 17): server.listPrefix 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":"agents/drivers/zookeeper/operations.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8916fd79b9af1bdd0946d5c6109fbf4cdddebf276ce28120f8a2d2232d70f404"}},{"ruleId":"D1","level":"warning","message":{"text":"gosasl.parseChallenge (cyclomatic 17): gosasl.parseChallenge has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/gosasl/sasl.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"874960ad127e2947c8883f6e0db22c693ed6e17bba1882f4ce1a4ac2eec7b44b"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.sapHanaScriptBlockIsComplete (cyclomatic 17): sqlStatementRanges.sapHanaScriptBlockIsComplete has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"c566cd9817797cfa354f8cae3d848a1c3f4d3703edf82e1d1f60fce9165211b6"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorLayout.useQueryEditorLayout (cyclomatic 17): useQueryEditorLayout.useQueryEditorLayout has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 6 function items inside it that branch (editorBoxTrackStep, a function literal at line 72, editorAvailableSize, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorLayout.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb92f418e05ab08f7ea428186c2f67cd4e800f8f21b268ba656a41dbbad68ff8"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferDdl.columnDefinitions (cyclomatic 17): queryResultTransferDdl.columnDefinitions has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"03479de4eb9f9076ffe94f94947d8a765a5c03903535d2104ecb5b37743f3972"}},{"ruleId":"D1","level":"warning","message":{"text":"useAppUpdater.compareParsedUpdateVersions (cyclomatic 17): useAppUpdater.compareParsedUpdateVersions has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b73efc4a82b196b64f74da91a939ae9d531b1eac943d49c5bb937c2dae67cc"}},{"ruleId":"D1","level":"warning","message":{"text":"useAppUpdater.useAppUpdater.downloadUpdateInBackground::run (cyclomatic 17): useAppUpdater.useAppUpdater.downloadUpdateInBackground::run 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":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35798b8296c764516d936dc2a9e5b5f303b96c060ad0610996e5a1bf60567f3"}},{"ruleId":"D1","level":"warning","message":{"text":"useCellDetailEditor.useCellDetailEditor (cyclomatic 17): useCellDetailEditor.useCellDetailEditor has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 194, 212, 223, \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":"apps/desktop/src/composables/useCellDetailEditor.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec85f6262aae8f667b755b8b8e0550251fafa84be4e3ed2cdbcd203dd83fc2b8"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridConditionEditor.useDataGridConditionEditor.columnSuggestions (cyclomatic 17): useDataGridConditionEditor.useDataGridConditionEditor.columnSuggestions has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da52d17b019890596bc97ee4d42414811716656796dbbf6a8c16edcf7d18384"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.sqlExportChoices (cyclomatic 17): useDataGridExport.useDataGridExport.sqlExportChoices has cyclomatic complexity 17 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2831}}}],"partialFingerprints":{"codehealthFindingId/v1":"7021f5820224834326705b3360f6a951c2b6fe1891cfba8684f14e7986c81e51"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridSearch.useDataGridSearch.matchState (cyclomatic 17): useDataGridSearch.useDataGridSearch.matchState has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 80, includes, a function literal at line 75). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSearch.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b271e7acfad418d49673a25ef62e2a7e9fec78b2b1458fb35d67a01fd25803"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridSelection.useDataGridSelection.reconcileSelectionAfterColumnReorder (cyclomatic 17): useDataGridSelection.useDataGridSelection.reconcileSelectionAfterColumnReorder has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4161acd6d9b0a4f52850e5d0cb3ac2b9f245e0cc8eb742e7caa82c001421d14"}},{"ruleId":"D1","level":"warning","message":{"text":"useSidebarTreeToolRuntime.useSidebarTreeToolRuntime.openStructureEditor (cyclomatic 17): useSidebarTreeToolRuntime.useSidebarTreeToolRuntime.openStructureEditor has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeToolRuntime.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96b3baccfc02ec1d5e4dacdd5a0755e60785253f55b68b7297ac966111c3944"}},{"ruleId":"D1","level":"warning","message":{"text":"useSqlExecution.useSqlExecution.continueExecute (cyclomatic 17): useSqlExecution.useSqlExecution.continueExecute has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40fa5bf9bfbf476fdb2d282a9995c3f43978bcd7e971362ae0175bbf205d99b"}},{"ruleId":"D1","level":"warning","message":{"text":"aiSqlTargetTab.resolveAiSqlTargetTabId (cyclomatic 17): aiSqlTargetTab.resolveAiSqlTargetTabId has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiSqlTargetTab.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac5d7164fa645fd029bd2a451451b7889d4686f0fb8ff8f57d1a88c47a4a07f"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonSourceScanner.readNumberToken (cyclomatic 17): JsonSourceScanner.readNumberToken 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":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0bf8e3e57e1dd66e227ad419c7774b786ff906b84cf51ce04463b1502e9b89"}},{"ruleId":"D1","level":"warning","message":{"text":"looseJsonFormat.formatLooseJsonText (cyclomatic 17): looseJsonFormat.formatLooseJsonText has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/looseJsonFormat.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab67fa96b2886d2fc91c04ee0c17185ae2d6b73a1e2958943ffccc254125b189"}},{"ruleId":"D1","level":"warning","message":{"text":"sessionModel.normalizeConsulSession (cyclomatic 17): sessionModel.normalizeConsulSession has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/consul/sessionModel.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"914bc39942dccae1f060ade05a715a76672400a927c596754e2ac2a84fc7f9c8"}},{"ruleId":"D1","level":"warning","message":{"text":"cellValueGeneration.generateCellValues (cyclomatic 17): cellValueGeneration.generateCellValues has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 57). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellValueGeneration.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8044c1135d41cc9c175484924d8ff77e68aec18869bc72098783df2e187ce5a"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGenerate.generateByType (cyclomatic 17): dataGenerate.generateByType 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":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"5402e3b1af406469a5b7d1793d78575db3d7c65b9f5ac1d68e0d85f8c7df071b"}},{"ruleId":"D1","level":"warning","message":{"text":"databaseObjectCapabilities.normalizeSidebarObjectKind (cyclomatic 17): databaseObjectCapabilities.normalizeSidebarObjectKind 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":"apps/desktop/src/lib/database/databaseObjectCapabilities.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a99f6ff71a8017291b6db09692d4b599dafe725559b7e46ff6669131c7e78a"}},{"ruleId":"D1","level":"warning","message":{"text":"oceanbaseSessionDiagnostics.captureOceanbaseDiagnosticTarget (cyclomatic 17): oceanbaseSessionDiagnostics.captureOceanbaseDiagnosticTarget 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":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb9e4db1b62b1f5811c3b6b90ee2ea401b265d1e7c826c068d4ca1ddfcbf6d5"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleConstraints.expressionTokens (cyclomatic 17): oracleConstraints.expressionTokens has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"828dd4d0f8fb276dec249219e51c8a1ce3b5d9c2f2cc1e628545d24350177a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTriggerPlan.candidateBinding (cyclomatic 17): oracleTriggerPlan.candidateBinding has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f26f0699fe996b2d1b80e05325179ae6e00ff57ab781c2f6eee794cd0a4fde"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleUserAdmin.oraclePrivilegeSql (cyclomatic 17): oracleUserAdmin.oraclePrivilegeSql 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":"apps/desktop/src/lib/database/oracleUserAdmin.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ee8535412553d6cc142bcff987426ee56e4d6620478063b8687fbe83430203"}},{"ruleId":"D1","level":"warning","message":{"text":"xuguUserPermissions.parseXuguAclRows (cyclomatic 17): xuguUserPermissions.parseXuguAclRows has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 426, field). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad2b5fb8489e1c83304a84e568c425d52c87beaad2935fb10995240fc02ea99"}},{"ruleId":"D1","level":"warning","message":{"text":"elk-layout.extractHierarchicalLayoutResult (cyclomatic 17): elk-layout.extractHierarchicalLayoutResult has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/elk-layout.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a255e5d407150d2eb8eb96610ad66d7a7862444f788e2508ef4300d56006ef3"}},{"ruleId":"D1","level":"warning","message":{"text":"codemirrorSqlBlockFolding.computeBlockFoldRanges (cyclomatic 17): codemirrorSqlBlockFolding.computeBlockFoldRanges has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorSqlBlockFolding.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dda59e7ee0abd0ca616f8b4edce2811602ec3e5e3fdfb42f90a3afd694848b"}},{"ruleId":"D1","level":"warning","message":{"text":"editorThemes.resolveEditorTheme (cyclomatic 17): editorThemes.resolveEditorTheme has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: editorThemes.loadEditorTheme (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/editorThemes.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"b125cfebb9db1f9ec95c1ef502be4ca7e446c8e2ee3d003067eb3183719d67c9"}},{"ruleId":"D1","level":"warning","message":{"text":"keyboardShortcuts.matchesShortcutKey (cyclomatic 17): keyboardShortcuts.matchesShortcutKey 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":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9fa0960c0c84c977b25dc5987bc826d051b5ecc623070ef83fb1c53e0ca0f8"}},{"ruleId":"D1","level":"warning","message":{"text":"elasticsearchJsonResponse.elasticsearchJsonResponseForResult (cyclomatic 17): elasticsearchJsonResponse.elasticsearchJsonResponseForResult 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":"apps/desktop/src/lib/elasticsearch/elasticsearchJsonResponse.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0646b9b43b12025ed5dd3ce9d08d44c063551c3e29f73e44a55d5225028ec2e1"}},{"ruleId":"D1","level":"warning","message":{"text":"xlsxExport.cellXml (cyclomatic 17): xlsxExport.cellXml 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":"apps/desktop/src/lib/export/xlsxExport.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5521417f1f4e517b54f0773c1d62b9c2bacba6762ffdbfac9a3a0680ca8bc4"}},{"ruleId":"D1","level":"warning","message":{"text":"neo4jGraph.applyNeo4jGraphPropertyToResult (cyclomatic 17): neo4jGraph.applyNeo4jGraphPropertyToResult has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 76, a function literal at line 97, propertiesDisplay, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/neo4jGraph.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c382c450b531ff264f62d97696fed66147078b489cf9685fa72b694a0a2b712"}},{"ruleId":"D1","level":"warning","message":{"text":"dbeaverImport.parseJdbcUrl (cyclomatic 17): dbeaverImport.parseJdbcUrl 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":"apps/desktop/src/lib/imports/dbeaverImport.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"51378913c596261cf21a0892403fd253f48f81030bce34a2312e1578cab6cb69"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginData.unwrapVueProxies (cyclomatic 17): pluginData.unwrapVueProxies 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":"apps/desktop/src/lib/plugins/pluginData.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb6726f06ed7fbc6b0512044bdd6e18fdb2751dc8a26a44db46a04de962f95c"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginHostBridge.requirePluginDataQueryRequest (cyclomatic 17): pluginHostBridge.requirePluginDataQueryRequest has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"828704bcfbf918bf28726f7ee08096c5fa66a4eaf3ccb2da9de81816edfb628a"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginFloatingWindow.startFloatingWindowReaper (cyclomatic 17): pluginFloatingWindow.startFloatingWindowReaper has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 787, 803, 774, \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":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bee8f66fe690e1a9f6a97098a567133cacfa01e124fdc2e43403477b0cfad3"}},{"ruleId":"D1","level":"warning","message":{"text":"redisContentSearch.worker.onmessage (cyclomatic 17): redisContentSearch.worker.onmessage has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisContentSearch.worker.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05201fe4b9fef6a37249b67c338012afabb00144aa9f9e853e18880d9d01864"}},{"ruleId":"D1","level":"warning","message":{"text":"savedSqlDatabaseTree.withDatabaseSavedSqlRoot (cyclomatic 17): savedSqlDatabaseTree.withDatabaseSavedSqlRoot has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 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":"apps/desktop/src/lib/savedSql/savedSqlDatabaseTree.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"68312f70809115abc21eea5f8a7282c1126447fe7bc4145869c997e4d8a8d84d"}},{"ruleId":"D1","level":"warning","message":{"text":"savedSqlTreeRows.compareSiblingItems (cyclomatic 17): savedSqlTreeRows.compareSiblingItems 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":"apps/desktop/src/lib/savedSql/savedSqlTreeRows.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a3e273c5cf9542957d49d61ad35a9dc4df262fc7fe0d372d87da93b4fe9a76"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleRoutineDeploy.acceptOracleRoutineDeploymentOperation (cyclomatic 17): oracleRoutineDeploy.acceptOracleRoutineDeploymentOperation has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: oracleRoutineDeploy.oraclePackageTransferPendingReady (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"800d44eb7dbb13800d02ff9ae27e976cff5ac646eb7104befc94be33716e293f"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarDatabaseStorage.applySidebarTableStorage (cyclomatic 17): sidebarDatabaseStorage.applySidebarTableStorage has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (visit, a function literal at line 55). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarDatabaseStorage.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b242bdd09086432aae52f5221653fb89c2b8540d2f00a7ec081d45f7b44b8ac"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarSearchTree.filterLocallySearchedTableNodes (cyclomatic 17): sidebarSearchTree.filterLocallySearchedTableNodes has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 114, 135, 126, \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":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0870ea55d45945faef435386bc1e74a82bc978cbc86c8b2549af12c0fecb28d3"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarTreeArrowNavigation.sidebarTreeArrowAction (cyclomatic 17): sidebarTreeArrowNavigation.sidebarTreeArrowAction has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTreeArrowNavigation.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d26d24cdc07aa17fa657096aa78faff3803c6f46fd5dc8e89df789779911cad"}},{"ruleId":"D1","level":"warning","message":{"text":"xuguTypeMembers.buildXuguTypeMemberNodes (cyclomatic 17): xuguTypeMembers.buildXuguTypeMemberNodes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/xuguTypeMembers.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bce99294a170f1c58f6099cc46014151ec7685169b7d873631d73bcfc7fbc1"}},{"ruleId":"D1","level":"warning","message":{"text":"soqlCompletion.fieldItems (cyclomatic 17): soqlCompletion.fieldItems has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/soql/soqlCompletion.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e9d30cfc911c351c4d8657d8b1ff508539593438155ce1f621dbb3e50a645c"}},{"ruleId":"D1","level":"warning","message":{"text":"soqlCompletion.valueItems (cyclomatic 17): soqlCompletion.valueItems has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/soql/soqlCompletion.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe60e22ea20659eca8df0c288290cf0c8557d51f6ec0a29efc6b838cf4e9b2c3"}},{"ruleId":"D1","level":"warning","message":{"text":"executableStatementRangeCache.executableStatementRangeAtCursor (cyclomatic 17): executableStatementRangeCache.executableStatementRangeAtCursor has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/executableStatementRangeCache.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd1a7a60eab25f44affb9dd45fe5b7f0c3d499321fa0db0e22696c63fd0ad37"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics.leadingUnquotedSqlKeywords (cyclomatic 17): diagnostics.leadingUnquotedSqlKeywords has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae3efca2f607e6c3a4dbbc3d0139ea670bc2f6e76d79271628b083a200e4a42"}},{"ruleId":"D1","level":"warning","message":{"text":"model.trailingIdentifier (cyclomatic 17): model.trailingIdentifier has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"42103e7bac482623490690ee4df253674f5bec4c9b59a4c3ff17e8bc579dbffc"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlAnalysis.parseSelectColumns (cyclomatic 17): sqlAnalysis.parseSelectColumns has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7b8a0ca71989d9e7fa35e0e73c047b06e500c98b1daaa8b4d96a6245290220"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.decodeMyBatisXmlComparisonEntities (cyclomatic 17): sqlParameters.decodeMyBatisXmlComparisonEntities has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1f999e2e0dbc33d5188f58768d3671b1e0e44d899d8cd56d854d609279dfeb"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.tryReadQuotedSubstitutionPlaceholder (cyclomatic 17): sqlParameters.tryReadQuotedSubstitutionPlaceholder 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd02c00c1839394f96975228211513502cef54a9d0210d2a400d57b9d7734a0"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlFileTreeFilter.filterAndSortSqlFileEntries (cyclomatic 17): sqlFileTreeFilter.filterAndSortSqlFileEntries has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (filterEntries, countNodes). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFileTreeFilter.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c9ddc17267b8092f94a00f508707e9edfdf0c4f907c416c901c7ae274d0181"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlNavigation.resolveSqlObjectNavigationIdentity (cyclomatic 17): sqlNavigation.resolveSqlObjectNavigationIdentity 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":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56c809711513c26021d9299f40a2ec1ff4971cf707a962270833e7b0283f3d1"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlSelectionCase.convertSqlSelectionCase (cyclomatic 17): sqlSelectionCase.convertSqlSelectionCase has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlSelectionCase.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e8e0a4eefd59977a5ec705f0347b11c25a7f3eee876744d6e8c4f1723d933f"}},{"ruleId":"D1","level":"warning","message":{"text":"batchTableDrop.runBatchTableDrop (cyclomatic 17): batchTableDrop.runBatchTableDrop has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/batchTableDrop.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2006ed2d7710c09ab0ef8bca817ab53ce95363e3bcce4849138e7d47ebee2ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleTableRename.validateDraftRelations (cyclomatic 17): oracleTableRename.validateDraftRelations has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 6 function items inside it that branch (normalize, a function literal at line 415, a function literal at line 354, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"701843dfd08bf2fa31b49a6f9595f8e1f0909775977bf26d4fe7c5a2802470ef"}},{"ruleId":"D1","level":"warning","message":{"text":"routineParameters.routineParametersQuery (cyclomatic 17): routineParameters.routineParametersQuery 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":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf33f731512d9bae54ff16f352a70ce28b2c9f4dacb73ecd301279c7e65780fd"}},{"ruleId":"D1","level":"warning","message":{"text":"routineParameters.xuguFunctionReturnType (cyclomatic 17): routineParameters.xuguFunctionReturnType has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde860540d1bbd0bb2f0f6a45eb05eb917ba759bc444e43712c8db0782cb846"}},{"ruleId":"D1","level":"warning","message":{"text":"tableStructureEditorState.getDefaultLengthForType (cyclomatic 17): tableStructureEditorState.getDefaultLengthForType has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: tableStructureEditorState.isTemporalPrecisionType (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c2d2b5bf59144fbea1a5fcbabbd1829c413e7e35f3a0b4cf98272d1543ea6a"}},{"ruleId":"D1","level":"warning","message":{"text":"tableTree.mergeTableInfosIntoObjects (cyclomatic 17): tableTree.mergeTableInfosIntoObjects has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1128953a0faaeb13d208b4f12d4fc97a596262a474cdb707b67a750eea2059a8"}},{"ruleId":"D1","level":"warning","message":{"text":"editorToolbarLayout.resolveNextEditorToolbarTier (cyclomatic 17): editorToolbarLayout.resolveNextEditorToolbarTier 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":"apps/desktop/src/lib/tabs/editorToolbarLayout.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9b7c93294b48313db2318a00e1cc86680b69b98b0a2af20fcc5f263d7a56d2"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.updateConnection (cyclomatic 17): connectionStore.useConnectionStore.updateConnection 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4986}}}],"partialFingerprints":{"codehealthFindingId/v1":"54db0f2ad3d2b59ad4e11d73098ee1e6a8d3af57933ccb89d0d42b0fd754ffaa"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadXuguTypeMembers (cyclomatic 17): connectionStore.useConnectionStore.loadXuguTypeMembers has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9502}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b94dad2facc2239e31d4ff018209ca2c4aa8a49ced24d8adbb0c5a3967d5b5"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.closeResultSession (cyclomatic 17): queryStore.useQueryStore.closeResultSession 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eff49d7fadc3b47cfebe3071dbd82c8cfd24e924e9f5eb571059a24142a9d7c"}},{"ruleId":"D1","level":"warning","message":{"text":"savedSqlStore.useSavedSqlStore.moveFileToFolder (cyclomatic 17): savedSqlStore.useSavedSqlStore.moveFileToFolder has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1089, 1072, 1071). 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b9ef5433fb5b8d871f9b6051f26b2801171020b04cf04a64b6894de3ba0cd6"}},{"ruleId":"D1","level":"warning","message":{"text":"settingsStore.normalizeSqlShortcuts (cyclomatic 17): settingsStore.normalizeSqlShortcuts has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf349713dc52147a2f1022154c658bb20e7b890518e5ad42416220f046601d3"}},{"ruleId":"D1","level":"warning","message":{"text":"tableCopyTaskStore.useTableCopyTaskStore.syncBackgroundTask (cyclomatic 17): tableCopyTaskStore.useTableCopyTaskStore.syncBackgroundTask has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/tableCopyTaskStore.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c640895038708d5f4b089a634344f737be389159e5db49ecb02dc0da9f364c"}},{"ruleId":"D1","level":"warning","message":{"text":"agentBundle.extractDriverPackage (cyclomatic 17): agentBundle.extractDriverPackage has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/lib/agentBundle.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b641ef3532b62b85047de19155aa8603a77e692277d845db81d0ced5230bb645"}},{"ruleId":"D1","level":"warning","message":{"text":"i18n.localizeManifest (cyclomatic 17): i18n.localizeManifest has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/ui/i18n.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02310d431a0658248ae6c1baac2e9b40d1e595ee5c56007c77390d8a78aa7ab"}},{"ruleId":"D1","level":"warning","message":{"text":"NacosOpenApiAdmin::test_connection (cyclomatic 16): NacosOpenApiAdmin::test_connection has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"68322bd18085438537b44180fe893d54c709581f48163d746442d25b06f2d6d7"}},{"ruleId":"D1","level":"warning","message":{"text":"DegradationChain::decide (cyclomatic 16): DegradationChain::decide has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f88f6d8e71fe839ffe0a3c5e2c6c48444c01eb661e3e439f25f7d512c913ede"}},{"ruleId":"D1","level":"warning","message":{"text":"Nb3ExportWriter::handle_statement (cyclomatic 16): Nb3ExportWriter::handle_statement has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6794e381b34e90b78d585e33e2ac1d73aba5e893a47998ff969000a5ff8523"}},{"ruleId":"D1","level":"warning","message":{"text":"Expansion::file (cyclomatic 16): Expansion::file has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import/includes.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e7f9adb8e57101294ce077dfe9388302c70bb34c2830b51c50ebec73f7d7df"}},{"ruleId":"D1","level":"warning","message":{"text":"Storage::cleanup_migration_backups (cyclomatic 16): Storage::cleanup_migration_backups has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"42beaf830d6e77c7e724d2bf6115156226cd50fd15f4b0ca74ca74ec193b0a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"BackupService::tick (cyclomatic 16): BackupService::tick has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/engine.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cddb2ce5634d7f0b3d8b18c4849da5d82c2ef9d967df84e7270a7dd23b6f09"}},{"ruleId":"D1","level":"warning","message":{"text":"OwnedPoolSession::legacy_call (cyclomatic 16): OwnedPoolSession::legacy_call has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe0c7c54d3352bbb7052ae2cc0f25dc7de3e5f399a2139c989b2370a4c7d9be"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyReader::summaries (cyclomatic 16): LegacyReader::summaries has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_triggers.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"656ec5cb8942d6648f7ce6c5efeea28267e8a5b4548fbb0fd8a05bba35eae95e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::admin::consul::operator::validate_snapshot_archive (cyclomatic 16): dbx_core::admin::consul::operator::validate_snapshot_archive has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/operator.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd8b1631cb59fbf1a9c44ad662aff22296652004f8906d82fb9eeb94ec45da6"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::ai::agent_kv::call_agent_kv (cyclomatic 16): dbx_core::ai::agent_kv::call_agent_kv has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d138f1b7d5c519b5215f5984b2e6b1fd8f828146ff8f5e0a0680d19d49a9263"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::connection::jdbc::install_jdbc_plugin_zip (cyclomatic 16): dbx_core::connection::jdbc::install_jdbc_plugin_zip has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f06643a148670e3f2c5cdd0d115b880f314bc84871a7a710fe79a3e662347c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::correction::append_table_schema_step (cyclomatic 16): dbx_core::data::correction::append_table_schema_step has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/correction.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"12975d8eb9328c649d3880f5bcb4079879a399af949a227d169e6144a658fa1d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::database_export::parse_export_local_temporal_parts (cyclomatic 16): dbx_core::data::database_export::parse_export_local_temporal_parts has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1813e9564aeb957d2bd844d977476b9c39d5ebc94cdd71eff5d02b1334079f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::database_export::parse_export_rfc3339_parts (cyclomatic 16): dbx_core::data::database_export::parse_export_rfc3339_parts has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7af61575811ec66cc815b280ac23fd28cb9b0a14a0fe2d6f38058f27a5a02b8"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::docs::collector::collect_snapshot_with_concurrency (cyclomatic 16): dbx_core::data::docs::collector::collect_snapshot_with_concurrency has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/docs/collector.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8a3d8d2f1bbbb9c8d9a82f965048f0e21c8ddda2fc6951dcdd2966c03e7c50"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::export_agent_find_pages (cyclomatic 16): dbx_core::data::mongodb_import_export::export_agent_find_pages has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d82b9ab0aa8f63691f72ca177c8dfdf680e4b22f2ba9bd2fb37c83e79d130f0"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::script_generator::extract_object_identifier (cyclomatic 16): dbx_core::data::script_generator::extract_object_identifier has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe04ef28e45bb2818e416103f6007bb1df5c78a6b26f7aea85b84be6e599e57"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::table_import::parse_json_bytes_with_options (cyclomatic 16): dbx_core::data::table_import::parse_json_bytes_with_options has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01827000865e6ae3dde9a96c44ecf36152168ef91d53e739433366013dc8b2f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::data::transfer::xugu_objects::cte_bindings (cyclomatic 16): dbx_core::data::transfer::xugu_objects::cte_bindings has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"20868c7ffa10b55dd8762bfed1ea9ab07e6a1108582215c5e8e35df336ba9cac"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::safety::production_safety::referenced_databases (cyclomatic 16): dbx_core::safety::production_safety::referenced_databases has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"150c09c92638d8e29a51d6c7d36467b05fface6ce397afeb6ee203d5edba1d02"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_columns_via_metadata_query (cyclomatic 16): dbx_core::schema::oracle_columns_via_metadata_query has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1d98fb0e71be48e0c9d7ef7767dd520ebf12c3ec414970b31bf3e380c888d6"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::postgres_object_source_sql_inner (cyclomatic 16): dbx_core::schema::postgres_object_source_sql_inner has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12702}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e74670bacbcf54d7a85c9207a6b221921f0a9d356ed4875a835cdda6e4ec0db"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::details::parse_argument_layout (cyclomatic 16): dbx_core::schema::native_jobs::details::parse_argument_layout has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/details.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"020c1aff9b33d72a6205a9b369c6a15cfc4ff4eac21660d8013c762877a38005"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::native_jobs::references::read_references_with (cyclomatic 16): dbx_core::schema::native_jobs::references::read_references_with has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/references.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c122428606033164ce6d60447391baa26cf8c0142db442a3b5b3ab7094fbff"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::readback::readback_single (cyclomatic 16): dbx_core::schema::oracle_routines::readback::readback_single has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/readback.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eb70df499fcddb5d8ddfd7172508f9052c797beced47940183b27ef779e6dd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::transfer::packages::prepare_pending_tables (cyclomatic 16): dbx_core::schema::oracle_routines::transfer::packages::prepare_pending_tables has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd5a553c0ca7cbb50fa11dc65841877a7d567a676e2ae0b19d3ca8d868bec85"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_core::schema::state_calibrator::build_rebase_plan (cyclomatic 16): dbx_core::schema::state_calibrator::build_rebase_plan has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/state_calibrator.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"25478df76af600a389b982da80a5921df8452af221cb40a75f1f2857a1702f2c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_agent::agent_service::install_agent_driver_from_registry (cyclomatic 16): dbx_driver_agent::agent_service::install_agent_driver_from_registry has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"98669825b2309d213d5315f7926f37893713e609d0b7c209c340d591bcc114f4"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_agent::agent_service::open_agent_download_response (cyclomatic 16): dbx_driver_agent::agent_service::open_agent_download_response has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":2419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45655de71bbe5151c4ef1047db3fba539eed0d8adb4a3bc2cd0d4055982abfa"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_driver::bulk_write (cyclomatic 16): dbx_driver_mongodb::mongo_driver::bulk_write has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fca2e9d945b2e9b98623d6d93078a4269a58e9c7ef3370d2c496fbdc4928ae6"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::read_shell_regex_literal (cyclomatic 16): dbx_driver_mongodb::mongo_shell::read_shell_regex_literal has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"179de5ce169b932ae447e19751259471e58b7dc31b8d26618a84683886fe1e5e"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::split_top_level (cyclomatic 16): dbx_driver_mongodb::mongo_shell::split_top_level has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"708ee29a68c23b4154fc7bdfeb8f89378d4cc859b2a67907ca08c3e719caaad5"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_bounded_value_preview (cyclomatic 16): dbx_driver_mysql::mysql::mysql_bounded_value_preview has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddedacdc5787e4409353a73292698b6d391866bb6ac07628dd02afffeb0bd60"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::verify_pool_connection_with_setup_fallback (cyclomatic 16): dbx_driver_mysql::mysql::verify_pool_connection_with_setup_fallback has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c14290532241a0905c168f4b597debd316406b2b09fd06546cf6392f168fb3a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql::skip_sql_whitespace_and_comments (cyclomatic 16): dbx_driver_mysql::mysql::skip_sql_whitespace_and_comments has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: dbx_driver_mysql::mysql::fix_potential_double_encoding (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7900}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b20e8d15ed5e62a5ecde71daac51a3ce51f541a3640dd92c3472653a775b64d"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::mysql_data_charset::data_charset_from_params (cyclomatic 16): dbx_driver_mysql::mysql_data_charset::data_charset_from_params has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql_data_charset.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a3289610584b9a75e154fc64e8031b7d8db393143cc12dd0ea0d44bb09430a"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_driver_mysql::ob_oracle::get_object_source (cyclomatic 16): dbx_driver_mysql::ob_oracle::get_object_source has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/ob_oracle.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b8fefc5511c34cf84a93bb5ff539a02d5d7db98ce71196bab5dc1902dc69cd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::dynamodb_driver::json_to_attribute_value (cyclomatic 16): dbx_drivers::db::dynamodb_driver::json_to_attribute_value has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f082b2bba1c7b1cd4095af9962cecdf81d2494c24b09894e9e6b198c794b42c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_drivers::db::ssh_proxy_command::parse_proxy_command_argv (cyclomatic 16): dbx_drivers::db::ssh_proxy_command::parse_proxy_command_argv has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_proxy_command.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5101153535636989155a16172da625fe8b23409da3f7925864e9dbc0a015e26"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::get_schema_context (cyclomatic 16): DbxMcpServer::get_schema_context has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4036}}}],"partialFingerprints":{"codehealthFindingId/v1":"4654e7e9df678dc6310d2f2dbff6ee65be2e1e6ef42499ef09a6cc2c6c9f847f"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::visible_scoped_tools (cyclomatic 16): DbxMcpServer::visible_scoped_tools has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ed50b76b31aec79e53201f17836a1f2fef0fb19b4233cc99c4c72bda59d66e"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxMcpServer::resolve_connection (cyclomatic 16): DbxMcpServer::resolve_connection has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b507293e296566faf6c19db057fd3682bf1b09db94fbc336b8de6311db796240"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::build_editable_object_source (cyclomatic 16): dbx_sql_core::object_source_sql::build_editable_object_source has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9f4e2f1ea1f11168b076ecca40648382e22de0dcc22882c0932a7dcbf5e816"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::parse_object_source_kind (cyclomatic 16): dbx_sql_core::object_source_sql::parse_object_source_kind has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":2408}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddae5dbf8ae65ef7328960a47e04b445ce95ffa3da5c9e6fbb19f223032035c3"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::retained_index_create_is_redundant (cyclomatic 16): dbx_sql_core::object_source_sql::oracle_indexes::retained_index_create_is_redundant has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e4292803c797c695878c1cf72e74fe79b1384086663b1cfecb71e437cd1c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::oracle_view_rename::add_binding (cyclomatic 16): dbx_sql_core::oracle_view_rename::add_binding has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"02266d53b14022b8d326b2c8e8111694e6d52fdefe0fb70e16e3ff2d916cf9d5"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::query_execution_sql::is_write_sql_statement (cyclomatic 16): dbx_sql_core::query_execution_sql::is_write_sql_statement has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"1248554e6d8f360b1042608900b470aeff46e6bac7507fbb2b82014c1d2b47cd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql::normalize_mysql_sql_file_charset (cyclomatic 16): dbx_sql_core::sql::normalize_mysql_sql_file_charset has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2787}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2296315770adf2fe0d0a63c9b48fc38f8d5e0ce64f89e7773a682f67a44bc3"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_core::sql_diagnostics::redact_sensitive_assignments (cyclomatic 16): dbx_sql_core::sql_diagnostics::redact_sensitive_assignments has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_diagnostics.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"326f9502d6e99e12a194396bab9cf75cbafc3692ec44c8f84ec063e55ce6f096"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::is_simple_sqlserver_order_projection (cyclomatic 16): dbx_sql_data::query_result_sql::is_simple_sqlserver_order_projection has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0088826a6ba6fecb221a25cb6a68c3f4c61b340862760b16b1d47fed20a9d4a"}},{"ruleId":"D1","level":"warning","message":{"text":"OracleSchemaSyncTableDdl::render_triggers (cyclomatic 16): OracleSchemaSyncTableDdl::render_triggers has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/oracle_indexes.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d75ddc0673caea03b4a031d644893cbcb7c74f96fa77676c3d863ba5be95ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::native_job_arguments::scalars::normalize (cyclomatic 16): dbx_sql_schema::native_job_arguments::scalars::normalize has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_arguments/scalars.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee55babb38c5d2acaecfc06156d4d4fe6f7e4a517ffe6af6b741532217828f5b"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::diff_indexes_with_options (cyclomatic 16): dbx_sql_schema::schema_diff::diff_indexes_with_options has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":3780}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ece61fd1f0603a140952a22d4cc022c75791f05fad99008792fb6333d8c6292"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::alter_dialect::validate_sort_columns (cyclomatic 16): dbx_sql_schema::table_structure_sql::alter_dialect::validate_sort_columns has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/alter_dialect.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5d6952c838161beffb821d1932a5e3488ee496f8392913d6578287382f121c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_web::routes::connection::run_prepared_temporary_connection_test (cyclomatic 16): dbx_web::routes::connection::run_prepared_temporary_connection_test has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef957496fe40083ead40257ecf1c6f6dd10607b4ced3ebff3ed4722889b89fb"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_web::routes::connection::plan_connection_config_sync (cyclomatic 16): dbx_web::routes::connection::plan_connection_config_sync has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b961061929b86c0728eb60abc23aa19f4533a18ff9f0b8611338699fa0559edc"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx_web::routes::mongodb_import_export::preview_import (cyclomatic 16): dbx_web::routes::mongodb_import_export::preview_import has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5a938616b1b43ea3af4866b7a23217455e866f5678ddad68eae69e96f6445f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::locale_family (cyclomatic 16): dbx::locale_family 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":"src-tauri/src/lib.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9540906142fea20b4ee0476dfecb512fbc020ed0040678951afa6e538ec5e00"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::background_backup::run_if_requested (cyclomatic 16): dbx::background_backup::run_if_requested has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/background_backup.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8966378a13b61bee8197bb662236decda8db9bb849d625737371a6b3e3145f"}},{"ruleId":"D1","level":"warning","message":{"text":"dbx::commands::connection::sync_connection_configs (cyclomatic 16): dbx::commands::connection::sync_connection_configs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/connection.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"162778dd73dcbc025e7e4348304abdb1a81be74899e378cc344010086bbd9f78"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionFactoryDataSource.getConnection (cyclomatic 16): ConnectionFactoryDataSource.getConnection has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"481d82a46e5792eea4718f2461d64012169f936242b82a02439e60a8120330f8"}},{"ruleId":"D1","level":"warning","message":{"text":"JdbcExecutor.executePage (cyclomatic 16): JdbcExecutor.executePage has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: JdbcExecutor.defaultResultValue (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"35469464b70724d59ba93f713b8e4d3d25537be17282da0aa834327f9868fcf0"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonRpcServer.ensureLiveConnection (cyclomatic 16): JsonRpcServer.ensureLiveConnection 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":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"6840a8d58b6cee2ea470c53406fb8d84cffbf0911c2b614dd1e327e4ddb97b75"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiSessionJsonRpcServer.handleRequest (cyclomatic 16): MultiSessionJsonRpcServer.handleRequest 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":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5ef5bf9d235c494ad71eac0eaf331551e95f5fd7f7af3903f348d1d512e4dd"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.executeQueryOnConnection (cyclomatic 16): DbxJdbcPlugin.executeQueryOnConnection has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be30368012926f7620c984cfb5f3725fe301f0595b8e93dcf874b79e63e7237"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.openConnection (cyclomatic 16): DbxJdbcPlugin.openConnection 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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e83d8f08744e734fc366e7865c3c504ebda47942085fd11810096d4747a30d3"}},{"ruleId":"D1","level":"warning","message":{"text":"DbxJdbcPlugin.oracleListObjects (cyclomatic 16): DbxJdbcPlugin.oracleListObjects has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3969adba0b2a853884d60e63219e665fd98cfb72b332d7ac58689a83542edf65"}},{"ruleId":"D1","level":"warning","message":{"text":"DamengAgent.splitTableDdlDefinitions (cyclomatic 16): DamengAgent.splitTableDdlDefinitions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: DamengAgent.resultValue (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea3a32363a9e48c276f6ff16b967afc207ff4e91ee6e144b6834c488893ec67"}},{"ruleId":"D1","level":"warning","message":{"text":"Entry.snapshot (cyclomatic 16): Entry.snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"610ae453e1a87e8812842e13bcf4cd43015712060a6e6e9c3aa10ad78722f852"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugSource.reference (cyclomatic 16): PlDebugSource.reference has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSource.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"da68ddbca6a0da4387fc535ae0c8eebae0cad936c0b44744b6ce5496306763c9"}},{"ruleId":"D1","level":"warning","message":{"text":"PlDebugTarget.inputPayloadBytes (cyclomatic 16): PlDebugTarget.inputPayloadBytes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: PlDebugTarget.declare (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f8bb8ecca6d306cf245a10f21a4fe0b7ffa7f389c9f5b39c58ba1adcc7fc73"}},{"ruleId":"D1","level":"warning","message":{"text":"SpannerAgent.completionAssistantSearch (cyclomatic 16): SpannerAgent.completionAssistantSearch has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a030e5bf9e17b69c823a37557209545a650595ccfe54fbdc819c36b2f95283"}},{"ruleId":"D1","level":"warning","message":{"text":"configure-docker-mirror.configure (cyclomatic 16): configure-docker-mirror.configure 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":".github/scripts/configure-docker-mirror.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1162a11a8f42212653945c1e88f29703cd968fa25c7499df54d3569fd3c046e9"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parseCassandraConfig (cyclomatic 16): main.parseCassandraConfig 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":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"132143bb5b2e591058cdce0be9290faa50ca1f0f461185b9d2444a2469c8939b"}},{"ruleId":"D1","level":"warning","message":{"text":"main.applyNativeHOCON (cyclomatic 16): main.applyNativeHOCON 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":"agents/drivers/cassandra-go/config_file.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47584e194543a84aab1b4ac5ed8367fd2c90b64d061e9a40164b480587785a0"}},{"ruleId":"D1","level":"warning","message":{"text":"etcdSession.listReadableRanges (cyclomatic 16): etcdSession.listReadableRanges has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfd1de9206851bbeabbc0a40ad99be82d85c32d51869918e6f0b2641466429a"}},{"ruleId":"D1","level":"warning","message":{"text":"main.rewriteNativeConnectionStringSSLMode (cyclomatic 16): main.rewriteNativeConnectionStringSSLMode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cec6a93e51b3a52c4a80abcf0f9b6b0b7a505378a10776da73b9cfd75c35d4"}},{"ruleId":"D1","level":"warning","message":{"text":"main.withTerminalKeyword (cyclomatic 16): main.withTerminalKeyword has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da4497cdf77e0502667b9c9762d9b07446ca1f0daa8fd48959b282ac4edfb6d"}},{"ruleId":"D1","level":"warning","message":{"text":"server.queryInformationSchemaColumns (cyclomatic 16): server.queryInformationSchemaColumns has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5cb2fe165a12b29dbd3ddb69cf780101c7cad1fe73d113dbd0d7ad2e12b4bd"}},{"ruleId":"D1","level":"warning","message":{"text":"main.newAgentSession (cyclomatic 16): main.newAgentSession 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":"agents/drivers/nebula-go/main.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1714c62293f06be96dc3e3bafab40aba6ed500fe502d8e3d2771503a896fb5ea"}},{"ruleId":"D1","level":"warning","message":{"text":"main.normalizeNestedValue (cyclomatic 16): main.normalizeNestedValue has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: main.neo4jTypeName (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/query.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b9933ddde660d66355fc468c7b34d1b3e77cbd5d630e5b60d9909b699b944c"}},{"ruleId":"D1","level":"warning","message":{"text":"main.oracleExplainPlanBindParams (cyclomatic 16): main.oracleExplainPlanBindParams has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4556}}}],"partialFingerprints":{"codehealthFindingId/v1":"51342da6186b4349779bb6089e053be4e390b5bbf2410700901c5ca70914ed76"}},{"ruleId":"D1","level":"warning","message":{"text":"main.rewriteNestedOracleSelects (cyclomatic 16): main.rewriteNestedOracleSelects has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5461}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea38dd2df324644f272041cf2e7aab34c31a499d4dfb5bbd8661025ddfa6420"}},{"ruleId":"D1","level":"warning","message":{"text":"main.splitTopLevelSQLList (cyclomatic 16): main.splitTopLevelSQLList has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6006}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9575158b9294c5a3756be72f6537714cf27dd1b746cee2dbd16ccb54c0e245c"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugPreviewNativeCompile (cyclomatic 16): main.plDebugPreviewNativeCompile 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":"agents/drivers/oracle-go/pldebug_compile.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a443657402ecd1dd251bf1ac9c1049a912110b045770c3cf10174e0a6b133aa"}},{"ruleId":"D1","level":"warning","message":{"text":"main.plDebugNativeTemporal (cyclomatic 16): main.plDebugNativeTemporal has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_temporal.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b03c4d12899fa5e146e222e2a1eccac9fe139004521074a7b607beb6f44ffc"}},{"ruleId":"D1","level":"warning","message":{"text":"server.queryRowsWithTimeout (cyclomatic 16): server.queryRowsWithTimeout has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6326}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ec82cb4d1745a7ca722523c22c23bf704735975e173ea4d4bfc9f651a397a5"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.awaitNativeDrain (cyclomatic 16): runtimeServer.awaitNativeDrain has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_drain.go"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbcafe378af819737274f884508235d5002010f9bedd7e95d86b4da2e45b263"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeServer.startNativeDebug (cyclomatic 16): runtimeServer.startNativeDebug 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":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d39ce34ad1f6364af3376000e5a45503a54382676ea28a8a6e882fb43cf9ba"}},{"ruleId":"D1","level":"warning","message":{"text":"main.sanitizeSessionStateSQL (cyclomatic 16): main.sanitizeSessionStateSQL has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/connection_state.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"08eca1a2e05ab7a0be543bf9c40b2f31e0c7fbc839a270cd514f2c9931822f27"}},{"ruleId":"D1","level":"warning","message":{"text":"server.listObjects (cyclomatic 16): server.listObjects has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b3f482b8c5db7c4150ff30a386da5e8d5860a0f79fdc8da3e59c3fc8e8c7e7"}},{"ruleId":"D1","level":"warning","message":{"text":"server.put (cyclomatic 16): server.put has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/operations.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e120cbd94776a5c951bb9b5fd6891f916883a7961da29b23e605b3f0271dff6c"}},{"ruleId":"D1","level":"warning","message":{"text":"semver.recursivePreReleaseCompare (cyclomatic 16): semver.recursivePreReleaseCompare 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":"agents/go-common/go-semver/semver.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"713964cea7d0c3df78759d65837361d2f4d671239594cfca1371e4a9f605c2d9"}},{"ruleId":"D1","level":"warning","message":{"text":"dbxpluginsdk.validProtocolName (cyclomatic 16): dbxpluginsdk.validProtocolName has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/go/dbx-plugin-sdk/sdk.go"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"37135ed6469931f1aa9a3470e897bc5332071ffa5c077f71c8dd179567e01e4b"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.nextSqlWordToken (cyclomatic 16): sqlStatementRanges.nextSqlWordToken has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"071b6ea4508778757b58ed8888b8c6e303a18422e035cc1ab3ff0f072a3a8a6d"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.advanceMysqlRoutineBlockCompleteness (cyclomatic 16): sqlStatementRanges.advanceMysqlRoutineBlockCompleteness has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed74c02fe539289abab6c6897263d3c83acfedf45b86df4d1fbd76a66223527"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlStatementRanges.startsWithFirebirdRoutineBlock (cyclomatic 16): sqlStatementRanges.startsWithFirebirdRoutineBlock 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f6e188ccbf6ed0ba1e6ed43e9b5b69315e12e140e7da3e0b30813b5da84a91"}},{"ruleId":"D1","level":"warning","message":{"text":"build_offline_jdbc_payload.validateAndCopyBundle (cyclomatic 16): build_offline_jdbc_payload.validateAndCopyBundle 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":"agents/scripts/build_offline_jdbc_payload.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9b03e1947ef56d620762ecfe091255b152dbafadc3a7b42963abe24215dbc6"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.shouldBypassCompletionFilter (cyclomatic 16): useQueryEditorCompletion.useQueryEditorCompletion.shouldBypassCompletionFilter has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"750faaaa42511dcb63cf624711a57278701b8c335c776867696021119c0f26cc"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.shouldTriggerSqlCompletionForPosition (cyclomatic 16): useQueryEditorCompletion.useQueryEditorCompletion.shouldTriggerSqlCompletionForPosition has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f757997e3d80e291626c8ca5929be4137d9f24e8d490e3bcd384bfe116d5d0"}},{"ruleId":"D1","level":"warning","message":{"text":"useQueryEditorExecution.useQueryEditorExecution.requestExecuteFromView (cyclomatic 16): useQueryEditorExecution.useQueryEditorExecution.requestExecuteFromView 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":"apps/desktop/src/components/editor/useQueryEditorExecution.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"54acdb8ba801f1922f42c90741382ceb786600362dbf7f0eced574e86289b358"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferDdl.transactionalMysqlTableDdl (cyclomatic 16): queryResultTransferDdl.transactionalMysqlTableDdl has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"300207b9e5c348f2cc69a7409c7770373af5eb7c203fbcc04e9702512472e13b"}},{"ruleId":"D1","level":"warning","message":{"text":"queryResultTransferValues.temporalFractionalPrecision (cyclomatic 16): queryResultTransferValues.temporalFractionalPrecision 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":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2710c6ca1bd66311a34894e941925c588985e3adbed63aabd2193533732f1b0"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridDistinctValueLoader.useDataGridDistinctValueLoader.performLoad (cyclomatic 16): useDataGridDistinctValueLoader.useDataGridDistinctValueLoader.performLoad 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":"apps/desktop/src/composables/useDataGridDistinctValueLoader.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d46b489e5c70215c660f81e21a547a763d97aec70875c51a55020e06f4a427"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.restoreCellValue (cyclomatic 16): useDataGridEditor.useDataGridEditor.restoreCellValue 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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3f069885c33a2fb4665448e66724ff2ad77c15f1ecdd534ed9fb22b86a5eaf"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.prepareAddedRows (cyclomatic 16): useDataGridEditor.useDataGridEditor.prepareAddedRows has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c6d5811419fe0ecdf8496dbc594f18c67109bd40e26c829853ab015885f270"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.syncCurrentSave (cyclomatic 16): useDataGridEditor.useDataGridEditor.syncCurrentSave 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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c491d7c31ee5b27b12c793e24d71c25dc6cc25f67bb139c3e02fd8a170ca26a"}},{"ruleId":"D1","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.captureFullResultProjection.\u003Creturned closure\u003E (cyclomatic 16): useDataGridExport.useDataGridExport.captureFullResultProjection.\u003Creturned closure\u003E has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28162b56f085353a78392d68d11e7c5bd1217e7edea72da89b9c6d57a10e1f5"}},{"ruleId":"D1","level":"warning","message":{"text":"useScheduledDatabaseBackups.useScheduledDatabaseBackups.update (cyclomatic 16): useScheduledDatabaseBackups.useScheduledDatabaseBackups.update has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useScheduledDatabaseBackups.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cfe0481dddc5e964b4733b88da455c4ee3969aa5fe3715d9314dc45a896868"}},{"ruleId":"D1","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportData (cyclomatic 16): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportData has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d8791b987b4f6df27acea32dd63b6ef2c5858dc29aff53ba975cc921369e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"useSqlExecution.useSqlExecution.tryExecute (cyclomatic 16): useSqlExecution.useSqlExecution.tryExecute 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":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dda612d0391a8e49f6fc6c6fd45a62b6271bc32b2cdeed2f4f20728c78381cc"}},{"ruleId":"D1","level":"warning","message":{"text":"ai.buildBasePromptLines (cyclomatic 16): ai.buildBasePromptLines 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":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"99752a16331776adccfa8470a96499c857e0641edafe372f34e189cdfe3adfbe"}},{"ruleId":"D1","level":"warning","message":{"text":"ai.formatSchema (cyclomatic 16): ai.formatSchema has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 804). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"954a04632773331d4d8a18d6ce2cfe27e8a0c372901d524acd7aa2f81112821d"}},{"ruleId":"D1","level":"warning","message":{"text":"aiAgentStepPresentation.upsertAgentStep (cyclomatic 16): aiAgentStepPresentation.upsertAgentStep 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":"apps/desktop/src/lib/ai/aiAgentStepPresentation.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b8934eefe558223d526010975426b118d055cb5b3e286ece6120ccf8f0cb80"}},{"ruleId":"D1","level":"warning","message":{"text":"aiSqlActionFeedback.aiSqlActionFeedback (cyclomatic 16): aiSqlActionFeedback.aiSqlActionFeedback 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":"apps/desktop/src/lib/ai/aiSqlActionFeedback.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5ac9dbf677d43a34eba5911854a1b5b5c68e696197edbedb64c1e189ecb12d"}},{"ruleId":"D1","level":"warning","message":{"text":"documentStoreProvider.buildElasticsearchRuleQuery (cyclomatic 16): documentStoreProvider.buildElasticsearchRuleQuery 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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3fad8f01f17cb2b834b424e5da9bd3704d52b36c578d3482271b8f216d12c1"}},{"ruleId":"D1","level":"warning","message":{"text":"tauri.startTableExport (cyclomatic 16): tauri.startTableExport has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (tauri.startQueryResultExport) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":6903}}}],"partialFingerprints":{"codehealthFindingId/v1":"0816f2b6c39076fd80edf94557cd47c99dc94e8532bd56f28a3f8b1ca0c7f2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"tauri.startQueryResultExport (cyclomatic 16): tauri.startQueryResultExport has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (tauri.startTableExport) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":6955}}}],"partialFingerprints":{"codehealthFindingId/v1":"224c479bd863c2a94ae84e84d4859918b741894205f8107f16a2936d1b6397cb"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionUrl.parseJdbcSqlServerUrl (cyclomatic 16): connectionUrl.parseJdbcSqlServerUrl 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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"faca9822ee6e5aa6d2b979afedc042ba66e082730d796d00c480605f49c93b33"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionUrlBuilder.standardUrlQuery (cyclomatic 16): connectionUrlBuilder.standardUrlQuery has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a597c1fe8eb79223252c2b131d81679ebb139e46d7b6f67eb9ade86b63f0e24"}},{"ruleId":"D1","level":"warning","message":{"text":"binaryCellDownload.binaryCellDisplayText (cyclomatic 16): binaryCellDownload.binaryCellDisplayText 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":"apps/desktop/src/lib/dataGrid/binaryCellDownload.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c43a8b33dd2908df0b9e5b0eff420300bdced65ea8f5e7ea6dd3a126ffeefad"}},{"ruleId":"D1","level":"warning","message":{"text":"columnFormatter.parseIoTDBTimestampEditorValue (cyclomatic 16): columnFormatter.parseIoTDBTimestampEditorValue 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":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9a9a986b383ba5f00d8f435583761a3efff79f13f3b1a54b462b4a0e770247"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGenerate.generatePhone (cyclomatic 16): dataGenerate.generatePhone 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":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df0ec22ba71a5cb063b06072010c96e1d1fb1390a7fc8274b6ce73a9ee34ed7"}},{"ruleId":"D1","level":"warning","message":{"text":"dataGridColumnFilter.splitTopLevelAnd (cyclomatic 16): dataGridColumnFilter.splitTopLevelAnd has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc89d664a9e261a6931f74767466e12f42d367500c20455b926ce38b6ec10fa6"}},{"ruleId":"D1","level":"warning","message":{"text":"geometryPreview.tokenize (cyclomatic 16): geometryPreview.tokenize has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadf5119a734e2ce7690a5f070f0beb7d642ea92aa323d170cb5264b8a62293f"}},{"ruleId":"D1","level":"warning","message":{"text":"joinedRowChanges.joinedRowChanges (cyclomatic 16): joinedRowChanges.joinedRowChanges has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/joinedRowChanges.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f29058a4450987d88b109a313cd4370390402b156f77ff0fd2613e98f8db12f"}},{"ruleId":"D1","level":"warning","message":{"text":"legacyLargeValueExport.resolveCapturedLegacyLargeValueCells (cyclomatic 16): legacyLargeValueExport.resolveCapturedLegacyLargeValueCells has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/legacyLargeValueExport.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37494cd38eb4c4d5a32c8f2a7df058bfeb6a01b50639437bca61f76465e0704"}},{"ruleId":"D1","level":"warning","message":{"text":"databaseStructureSearch.mapStructureSearchRows (cyclomatic 16): databaseStructureSearch.mapStructureSearchRows has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseStructureSearch.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f28835f537465d65fe368099db2e20d49041c01eb8578a8259964a787f09a1"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleForeignKeys.parseOracleCanonicalType (cyclomatic 16): oracleForeignKeys.parseOracleCanonicalType 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":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55099a671192fce2cc10dd5fcad7e2f87907ade96630fce83a4a7fb21289d3e"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleIndexes.expectedCreatedIndex (cyclomatic 16): oracleIndexes.expectedCreatedIndex has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: oracleIndexes.sameExpectedIndexes (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9190a20b0a8d9821f59751f7eaed2fb443ed26b258a67f8eb707ff5bc3d292"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleInvalidObjects.buildOracleCompileSql (cyclomatic 16): oracleInvalidObjects.buildOracleCompileSql has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleInvalidObjects.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af5f7ed742dc840b530f9077c4d23873adacd0fa803c289c9f5768347d370d7"}},{"ruleId":"D1","level":"warning","message":{"text":"oracleSessionDiagnostics.captureOracleDiagnosticTarget (cyclomatic 16): oracleSessionDiagnostics.captureOracleDiagnosticTarget 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":"apps/desktop/src/lib/database/oracleSessionDiagnostics.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"97220a285cdd2fb22398842f148f47153fa9d358042bec0dcbbac87adaa37a7e"}},{"ruleId":"D1","level":"warning","message":{"text":"productionSafety.referencedDatabases (cyclomatic 16): productionSafety.referencedDatabases has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d39b55fee87dad04e1c1c19ea4c6713955285839030d402f0024d34f48e761a"}},{"ruleId":"D1","level":"warning","message":{"text":"plDebugAnonymousBlock.stripPlSqlComments (cyclomatic 16): plDebugAnonymousBlock.stripPlSqlComments has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/plDebugAnonymousBlock.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad412d0d99d0e06f7c8a6e6bab4d7e1a5f99c29d5cd7539b0518cf846c557153"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlIntentionActions.buildBatchQualifyActions (cyclomatic 16): sqlIntentionActions.buildBatchQualifyActions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbc8659bb1d37a7d57ded72402c900c9562d616b3e29145c1fb575256634423"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlIntentionActions.resolveNavigationTarget (cyclomatic 16): sqlIntentionActions.resolveNavigationTarget has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2ae0d7b5c9a12c36529c6505e0adff443bbe7fb0e5ef1646ba42f52e2e884b"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlSemanticSelectionRanges.stringContentRange (cyclomatic 16): sqlSemanticSelectionRanges.stringContentRange has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84ccf33ecb55ed8fdea80d1b15fbbd1814a396f7e74f12df9a36d2cf2e9c977"}},{"ruleId":"D1","level":"warning","message":{"text":"elasticsearchCompletion.flattenElasticsearchMappingFields (cyclomatic 16): elasticsearchCompletion.flattenElasticsearchMappingFields has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc67c7ca1f909fb0c3e6fc0f91fbca931a3087e68eba5c671b7a837526f42830"}},{"ruleId":"D1","level":"warning","message":{"text":"datagripImport.inferProfile (cyclomatic 16): datagripImport.inferProfile 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":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ea47c3a84702663d89aa953ba62a3eccf64067fd2df95084944d0644cd35ee"}},{"ruleId":"D1","level":"warning","message":{"text":"influxDbV1Delete.validRfc3339Timestamp (cyclomatic 16): influxDbV1Delete.validRfc3339Timestamp has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/influxdb/influxDbV1Delete.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a4d5eb81f6799e2224b4505611a0806d096e79a6521d7c81cffc50650be058"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoCompletion.skipMongoStringOrComment (cyclomatic 16): mongoCompletion.skipMongoStringOrComment has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: mongoCompletion.buildMongoCompletionItemsFromContext (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"23261af9868022683502674d462c1d935e5b0fe5a92f27f2b86a70f57c21bfbc"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoDocumentValues.mongoTypedNumberInputValue (cyclomatic 16): mongoDocumentValues.mongoTypedNumberInputValue has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"241208bfc7f37dfe91b218688744fa8a5c66b3dfc06a3420b4178cf6b9f21d97"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.mongoFilterContainsOpaqueLogic (cyclomatic 16): mongoShellCommand.mongoFilterContainsOpaqueLogic has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 2007). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc487e210ca1934122c962297a40499667606c306c3295952eb0ac067664cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.mongoPureFieldPredicate (cyclomatic 16): mongoShellCommand.mongoPureFieldPredicate has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eac98ef66f4db5e1658b38faf280f403caf3de4a99ce2b9f59efe051154e5b4"}},{"ruleId":"D1","level":"warning","message":{"text":"mongoShellCommand.mongoFilterObjectIsUnbounded (cyclomatic 16): mongoShellCommand.mongoFilterObjectIsUnbounded has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 2125). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e884837c462dcedc9312f92dd821e7284692f1dd1e5ca7705f024bcf6ce972b2"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginData.snapshotValue (cyclomatic 16): pluginData.snapshotValue 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":"apps/desktop/src/lib/plugins/pluginData.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"054687021e523785bcbcdbe8cef5b7cd011339542e5bd1b205b3b209d81294b7"}},{"ruleId":"D1","level":"warning","message":{"text":"frontendPlugin.pluginConnectionFormValues (cyclomatic 16): frontendPlugin.pluginConnectionFormValues has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7858d6e63639b1ec558b6b06f65ff353567ec7335a892b9fda3611b347ba6eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginHostBridge.requirePluginAiRecommendationUpdate.items (cyclomatic 16): pluginHostBridge.requirePluginAiRecommendationUpdate.items has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"661665af3b90ba7b8e4d372abc83d0a9abd436a8fe6fc56d0bd392160fd2324d"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginMarketplace.comparePrerelease (cyclomatic 16): pluginMarketplace.comparePrerelease has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginMarketplace.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced6313d13c33c62a1016fbe30fb49ad29fee8db5968eb772ff66ecf4dd4e170"}},{"ruleId":"D1","level":"warning","message":{"text":"redisCommandTable.firstRedisArgvUpper (cyclomatic 16): redisCommandTable.firstRedisArgvUpper has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandTable.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"1205e242da9f16dbffa20866b31301a11a7d3b63170abb562f63d7d6ac50a701"}},{"ruleId":"D1","level":"warning","message":{"text":"redisCompletion.argumentGrammar (cyclomatic 16): redisCompletion.argumentGrammar has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (compileContent, compileArgument, a function literal at line 334, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d199bd7d4d729bfff4ec16577a833314c59e996e4a9dfc886fe4310d4eec52"}},{"ruleId":"D1","level":"warning","message":{"text":"redisKeyGrouping.compileRedisGroupGlob (cyclomatic 16): redisKeyGrouping.compileRedisGroupGlob has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyGrouping.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"557df1f4ca9781e100335079426b182e75793f5095f7946e0312c96d436a7cd0"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaDiffTableFilter.compileExcludePatterns (cyclomatic 16): schemaDiffTableFilter.compileExcludePatterns has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffTableFilter.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e820f6bd9fdb2da37574409e1e4f5bc190787c88aaf40ee6e4a77f8694df5132"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarLayout.reorderEntry (cyclomatic 16): sidebarLayout.reorderEntry has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c8611ada76a03bd57f7063a2dfd261f1af908cda41787e3c5befd6d4a451da"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebarUserAdminVisibility.sidebarUserAdminVisibility::filterNodes (cyclomatic 16): sidebarUserAdminVisibility.sidebarUserAdminVisibility::filterNodes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarUserAdminVisibility.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab25f68b6da350df724b6a14f16388d5e142cf78d41cc0ffecd62e3c678933bb"}},{"ruleId":"D1","level":"warning","message":{"text":"aggregateCombinators.buildCombinatorSequences (cyclomatic 16): aggregateCombinators.buildCombinatorSequences has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/clickhouse/aggregateCombinators.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cfb81a9d4de871e40eccbdccbf2ff7a37d0bd372d1b3579ff0becc614a7438"}},{"ruleId":"D1","level":"warning","message":{"text":"cypherFormatter.formatCypherText (cyclomatic 16): cypherFormatter.formatCypherText has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44a93ca66bfcce2d9e7b4c9c8c26f1d0cc315226b231c1a59db634a87e5c29c"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlAnalysis.hasTopLevelSemicolon (cyclomatic 16): sqlAnalysis.hasTopLevelSemicolon has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf947940f92b33bcf7da02c14f8d739f9172851263df4168f4c93b7a36c827a"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.buildSelectAllColumnItems (cyclomatic 16): sqlCompletion.buildSelectAllColumnItems has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5667}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5f4f3950843b043bd3d7c6e28ee6aacf27b9d689a904482a77685707c28edc"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlCompletion.completionColumnPrefixCandidates (cyclomatic 16): sqlCompletion.completionColumnPrefixCandidates has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6077}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8396bd6e7275c5bf059c9eac758130d206703806de1f1b82949c4242122ea8"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.collectComplexTypeFieldSeparators (cyclomatic 16): sqlParameters.collectComplexTypeFieldSeparators has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3db51f56f8a725107c34a9b7625a8714a29e8d689386e1eed12a611e76b8a4"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlParameters.readSubstitutionParameterOccurrence (cyclomatic 16): sqlParameters.readSubstitutionParameterOccurrence 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bd32f0804bcf74d8e5ad3c2dc249e99bc8b47ef83a593c9bb3dd4f2a4c8a82"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlDiagnostics.sqlErrorDecorationRange (cyclomatic 16): sqlDiagnostics.sqlErrorDecorationRange has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDiagnostics.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a9dfc584ede5cb93a01b9958726e0d7770667fc1e4d1907f9b7863e5d361bc"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlServerActivityTraceRuntime.pollEvents (cyclomatic 16): sqlServerActivityTraceRuntime.pollEvents has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 240, 249, 256). 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":"apps/desktop/src/lib/sqlserver/sqlServerActivityTraceRuntime.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d792aed2e57c7f846732783e7c1dd2324e72f469c7019529b7a45363837395"}},{"ruleId":"D1","level":"warning","message":{"text":"objectBrowserRowAction.doubleClickRowAction (cyclomatic 16): objectBrowserRowAction.doubleClickRowAction has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRowAction.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"885c4cb009919175c8762b4d5ae3d48567f6fc139783cb9e8da487cb58c6a2ea"}},{"ruleId":"D1","level":"warning","message":{"text":"oraclePackageSaveAs.verifyCreatedPackage (cyclomatic 16): oraclePackageSaveAs.verifyCreatedPackage has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c50e3b5e9b1b52d392e9fc900be2699e2b3fc3ac2cb19ae73e9372bc114949"}},{"ruleId":"D1","level":"warning","message":{"text":"starrocksPhysicalOptions.buildStarRocksDialectOptions (cyclomatic 16): starrocksPhysicalOptions.buildStarRocksDialectOptions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksPhysicalOptions.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4cceaf1f7c342898efba7e866aab020ba8c0544059c486cf660d4afe1a614b"}},{"ruleId":"D1","level":"warning","message":{"text":"tableDataExport.fetchTableDataForExport (cyclomatic 16): tableDataExport.fetchTableDataForExport has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableDataExport.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a446148d35405c02845f7dbf39d27a53a359ec9d65b390cb9d7529b999648c05"}},{"ruleId":"D1","level":"warning","message":{"text":"tableStructureEditorState.specialIndexColumnIssue (cyclomatic 16): tableStructureEditorState.specialIndexColumnIssue has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: tableStructureEditorState.isTemporalPrecisionType (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0731dd89768a7defb64477a33db6615d828561da72f7c227f96b68de21875b53"}},{"ruleId":"D1","level":"warning","message":{"text":"tableTree.simpleObjectNodeType (cyclomatic 16): tableTree.simpleObjectNodeType 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":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48eb429df1bfd3e10b97d6ec486e81ee154b8499cd1c49799cad407d4b6256f"}},{"ruleId":"D1","level":"warning","message":{"text":"tableVGroup.normalizeTableVGroupLayout::normalizeEntries (cyclomatic 16): tableVGroup.normalizeTableVGroupLayout::normalizeEntries has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: tableVGroup.tableVGroupKindOfContainerNode (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"639687489ba84daf482a9a72e2092a393e5d1da7a9535422a6c196c73caca648"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadCachedMetadataListPage (cyclomatic 16): connectionStore.useConnectionStore.loadCachedMetadataListPage has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cdd8bb4a47b8327bee0820b3f995b0110dfda28a98de37b692dd6c95d04ede"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.syncOracleTriggerNodeState (cyclomatic 16): connectionStore.useConnectionStore.syncOracleTriggerNodeState has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2885}}}],"partialFingerprints":{"codehealthFindingId/v1":"4864b8c88b4f702cdbd17a2ec1109892d81b94002e01388e2556a01492657f06"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadPersistedTreeChildren (cyclomatic 16): connectionStore.useConnectionStore.loadPersistedTreeChildren has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3622}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1153eda855529f4e06cc528fc0b39f38e115c438daaaa65508ddc2b39f30ba"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionStore.useConnectionStore.removeConnectionGroups (cyclomatic 16): connectionStore.useConnectionStore.removeConnectionGroups has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11380}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bcb06ac6e42887fea6c3ebbe20875084c498222a5492fe2d2ff45cc6521bb1"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.bindColumnsForSource.columns (cyclomatic 16): queryStore.bindColumnsForSource.columns has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc9e8daa8eae263d27c222e36fa58fb55d3712fdb63e72db74a4367e443e587"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.recoverDetachedTabsToMain (cyclomatic 16): queryStore.useQueryStore.recoverDetachedTabsToMain has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0a57e986fb560ea5caed70b19753ec26303c359f6b8f2618f53ed20bacb472"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.adoptDetachedTab (cyclomatic 16): queryStore.useQueryStore.adoptDetachedTab 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff81f5e6a7cefe8e6b01f28ee5e31fd85b59d970fb432a817e60a89ad34e7fd4"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.closeTabsWhere (cyclomatic 16): queryStore.useQueryStore.closeTabsWhere has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5805}}}],"partialFingerprints":{"codehealthFindingId/v1":"707bd8cf03debe6476533f05ed51598cd6d7b6522786e0c748e4fd186bbd3677"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.commitTransaction (cyclomatic 16): queryStore.useQueryStore.commitTransaction has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6432}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bf8f514061151b11e939747fd306c15362159e4e05f6a2a4986b24fba450a1"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.openSavedSql (cyclomatic 16): queryStore.useQueryStore.openSavedSql 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6737}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab0ae39c8c3cc5041f59f2fb73cfd1768fa78f45f4390ef6355a8c6f0201550"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.restoreCachedResultPayload (cyclomatic 16): queryStore.useQueryStore.restoreCachedResultPayload 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11158}}}],"partialFingerprints":{"codehealthFindingId/v1":"657a78854baac69580f4bd0586fb54080170a50f0c6964dd3a2347f2d84bedd7"}},{"ruleId":"D1","level":"warning","message":{"text":"queryStore.useQueryStore.captureTabResultForExport (cyclomatic 16): queryStore.useQueryStore.captureTabResultForExport has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11311}}}],"partialFingerprints":{"codehealthFindingId/v1":"1754a9b4c8641de7821f71c0c6191a5d1812c5f82d1a23cffb811d26d3e88570"}},{"ruleId":"D1","level":"warning","message":{"text":"savedSqlStore.useSavedSqlStore.updateFileExecutionTarget (cyclomatic 16): savedSqlStore.useSavedSqlStore.updateFileExecutionTarget has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b8ff315ed6d3b6c35cdd991875725814e88b304411c3ae69950d3569ff5988"}},{"ruleId":"D1","level":"warning","message":{"text":"settingsStore.normalizeTabGroupCustomizations (cyclomatic 16): settingsStore.normalizeTabGroupCustomizations has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8621b9593f4b236dfe2fa850418339392ccdbc1b13d214361b0473b7d62d17c"}},{"ruleId":"D1","level":"warning","message":{"text":"platformDetection.detectPlatformId (cyclomatic 16): platformDetection.detectPlatformId has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/lib/platformDetection.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b6c56039d69679aabfe6800527c78e1c0fcd179368e5be0f279001c6d9f899"}},{"ruleId":"D1","level":"warning","message":{"text":"seedApi (cyclomatic 16): seedApi has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to 8 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/seed.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daec6d139f6b492e7d03177245accc5029bed571218fa9dd718b92c5cbbedc5"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.executeTabSql (cognitive 713): queryStore.useQueryStore.executeTabSql has cognitive complexity 713 (threshold 15). Drivers by points: if/else 212 (421 pts), boolean chains 184, ternaries 76 (170 pts), error handling 7 (17 pts), loops 7 (13 pts), match/switch 1 (3 pts) (nesting depth added 321). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 2 other methods here (queryStore.useQueryStore.executeTabSql::bindLargeValueContext, queryStore.useQueryStore.executeTabSql::executeWithoutManualTransaction) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a878344d0da70e0d66db92c99271c6f9ead1300d667ab74e57d5e712db9a45"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::generate_schema_sync_sql_inner_with_oracle_ddl (cognitive 623): dbx_sql_schema::schema_diff::generate_schema_sync_sql_inner_with_oracle_ddl has cognitive complexity 623 (threshold 15). Drivers by points: if/else 135 (507 pts), match/switch 10 (48 pts), loops 13 (39 pts), boolean chains 29 (nesting depth added 436). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6688}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fba635cdd4b467289156e6a1e5655024cd5f830b2eb3eba18f80cf3fa999d5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::export_database_sql_core_inner_with_phases (cognitive 359): dbx_core::data::database_export::export_database_sql_core_inner_with_phases has cognitive complexity 359 (threshold 15). Drivers by points: if/else 100 (248 pts), match/switch 19 (49 pts), loops 19 (34 pts), boolean chains 28 (nesting depth added 193). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d739600301e0555b39c00958ea2cb0466d524f9c64ff5a8fbd8347513ae25fe"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugSelectNativeTarget (cognitive 333): main.plDebugSelectNativeTarget has cognitive complexity 333 (threshold 15). Drivers by points: if/else 113 (287 pts), boolean chains 37, loops 5, match/switch 1 (4 pts) (nesting depth added 177). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a814b7b5c380fb43d9ebe1ce5051c5c3de43ff11c5e65c1f63071e3a89e6dd"}},{"ruleId":"D2","level":"warning","message":{"text":"settingsStore.useSettingsStore.applyEditorSettingsPatch (cognitive 279): settingsStore.useSettingsStore.applyEditorSettingsPatch has cognitive complexity 279 (threshold 15). Drivers by points: if/else 264 (265 pts), boolean chains 14 (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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f61c5f6f354061aad1ba70d9b4d0a0c8b3c5ef3c6f82950c298a7d5e3ad83c"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.fetchCapturedTabResultForExport (cognitive 272): queryStore.useQueryStore.fetchCapturedTabResultForExport has cognitive complexity 272 (threshold 15). Drivers by points: if/else 66 (134 pts), boolean chains 63, ternaries 31 (60 pts), error handling 6 (10 pts), loops 3 (5 pts) (nesting depth added 103). Of this number, 226 points are the body\u0027s own statements and 46 belong to 11 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11358}}}],"partialFingerprints":{"codehealthFindingId/v1":"365dee9fe2a25d88d8f4b8c1e57c7659c6e9c1580167c57d77616edce8e69574"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginHostBridge.dispatch (cognitive 267): PluginHostBridge.dispatch has cognitive complexity 267 (threshold 15). Drivers by points: if/else 123 (199 pts), ternaries 21 (42 pts), boolean chains 20, loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 100). Of this number, 265 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b282a0c8412ca36734cfafe1d717104a16f4326d6b6f5e31ada577e6d10cb3e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::transitions::native_job_scheduler_edit_plan (cognitive 257): dbx_sql_schema::native_job_changes::transitions::native_job_scheduler_edit_plan has cognitive complexity 257 (threshold 15). Drivers by points: if/else 85 (168 pts), boolean chains 37, loops 14 (36 pts), match/switch 6 (16 pts) (nesting depth added 115). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/transitions.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b645626d96f0b96bf65538ffb6fd0db3bf4f461f4ad1f4fba655ff1167e2309"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::oracle_constraints::build_changes (cognitive 234): dbx_sql_schema::table_structure_sql::oracle_constraints::build_changes has cognitive complexity 234 (threshold 15). Drivers by points: if/else 60 (180 pts), match/switch 9 (32 pts), boolean chains 14, loops 5 (8 pts) (nesting depth added 146). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d56228a18bce89b4ea47a8e360cf70770f8772a154427544f9f4a790723471"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlStatementSplitter::push_chunk_with_control (cognitive 226): SqlStatementSplitter::push_chunk_with_control has cognitive complexity 226 (threshold 15). Drivers by points: if/else 57 (173 pts), boolean chains 30, loops 5 (21 pts), match/switch 1 (2 pts) (nesting depth added 133). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6ced165b7f68f7302c8754fa2ede039edd6dba7389ebeb40662f2f8502930d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::parse (cognitive 222): dbx_driver_mongodb::mongo_shell::parse has cognitive complexity 222 (threshold 15). Drivers by points: if/else 93 (172 pts), boolean chains 33, loops 10 (12 pts), match/switch 2 (5 pts) (nesting depth added 84). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f894a076a14eb282a5dd6a318f025b5054274a5e23c0bca8004445f8b25c1227"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan.read (cognitive 220): Plan.read has cognitive complexity 220 (threshold 15). Drivers by points: if/else 40 (119 pts), ternaries 14 (50 pts), error handling 8 (32 pts), boolean chains 18, loops 1 (nesting depth added 139). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d7573fc8185f13588de6a809b1101435e9cb8b63214c1829d826eceea7984b"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativePlan.render (cognitive 212): plDebugNativePlan.render has cognitive complexity 212 (threshold 15). Drivers by points: if/else 75 (156 pts), boolean chains 32, loops 14 (24 pts) (nesting depth added 91). Of this number, 182 points are the body\u0027s own statements and 30 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0006cb251b8b9269d0917fc14f071eb71121d93808e85b13481260c29ba29a83"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::split_sql_statement_ranges_with_options (cognitive 208): dbx_sql_core::sql::split_sql_statement_ranges_with_options has cognitive complexity 208 (threshold 15). Drivers by points: if/else 54 (166 pts), boolean chains 28, loops 3 (12 pts), match/switch 1 (2 pts) (nesting depth added 122). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"6261c899ebd581cc93f07018a4787947b919622f09c3dedf84220405721d38c3"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTypeManagement.prepareOracleTypeManagement (cognitive 208): oracleTypeManagement.prepareOracleTypeManagement has cognitive complexity 208 (threshold 15). Drivers by points: if/else 53 (105 pts), boolean chains 49, loops 12 (23 pts), ternaries 9 (23 pts), error handling 4 (8 pts) (nesting depth added 81). Of this number, 196 points are the body\u0027s own statements and 12 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac154257f6b393ea83594ebd1946dca428cb883c34950ff1a6bfa3d9c0d1937"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugLoadNativeTypeGraphOnLoader (cognitive 200): main.plDebugLoadNativeTypeGraphOnLoader has cognitive complexity 200 (threshold 15). Drivers by points: if/else 46 (145 pts), loops 14 (34 pts), boolean chains 21 (nesting depth added 119). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_type_graph.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8411832552624cb2205902836fe71087026a4dce0dd0b830b9d44c229b8b70"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_export::export_table_data_core_inner (cognitive 199): dbx_core::data::table_export::export_table_data_core_inner has cognitive complexity 199 (threshold 15). Drivers by points: if/else 72 (171 pts), loops 8 (18 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 112). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f3853f6a232824a0e4d0b92f1954ebec90e5b102589f8169904618a4b43e27"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::import_table_file_core (cognitive 196): dbx_core::data::table_import::import_table_file_core has cognitive complexity 196 (threshold 15). Drivers by points: if/else 58 (108 pts), match/switch 31 (64 pts), boolean chains 15, loops 5 (9 pts) (nesting depth added 87). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":7844}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b10177fe8b5783951a5d4fc89e966036aacc62f067c0975996276e19e213511"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_runtime::plugins::manifest::validate_contributions (cognitive 193): dbx_plugin_runtime::plugins::manifest::validate_contributions has cognitive complexity 193 (threshold 15). Drivers by points: if/else 52 (154 pts), loops 12 (24 pts), boolean chains 10, match/switch 2 (5 pts) (nesting depth added 117). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"322ecee186760f4d6a03c67a485819d0faa088c3ee3ce351d7f066f94e64f4f2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::create_table::build_create_table_sql_impl (cognitive 193): dbx_sql_schema::table_structure_sql::create_table::build_create_table_sql_impl has cognitive complexity 193 (threshold 15). Drivers by points: if/else 77 (144 pts), boolean chains 29, loops 7 (12 pts), match/switch 6 (8 pts) (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/create_table.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb0fdd319f214f629f93baa4e10120d36ba32f21d7fc110675f922b7d7134c9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_table_inner (cognitive 191): dbx_core::data::transfer::transfer_table_inner has cognitive complexity 191 (threshold 15). Drivers by points: if/else 85 (120 pts), boolean chains 34, match/switch 12 (25 pts), loops 6 (12 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":13155}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c77f594b6b3267f57143f2f30116a38c2921b35b3e4d8452f4c9ec286892bb"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.splitSqlStatementRanges (cognitive 190): sqlStatementRanges.splitSqlStatementRanges has cognitive complexity 190 (threshold 15). Drivers by points: if/else 57 (146 pts), boolean chains 30, loops 3 (9 pts), ternaries 2 (5 pts) (nesting depth added 98). Of this number, 173 points are the body\u0027s own statements and 17 belong to 4 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fd7573ea94060efe5614a9786287ef9956add63f6c12a59ab71a51cf44fd97"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferDdl.rewriteCreateTableName (cognitive 188): queryResultTransferDdl.rewriteCreateTableName has cognitive complexity 188 (threshold 15). Drivers by points: if/else 43 (112 pts), ternaries 10 (35 pts), boolean chains 29, loops 5 (12 pts) (nesting depth added 101). Of this number, 179 points are the body\u0027s own statements and 9 belong to 7 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbd099f3a4afb1b63347a3d3b07151f878fcbdccbee75116e9c6faf7282896a"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorObjectNavigation.useQueryEditorObjectNavigation.onEditorMouseDown (cognitive 185): useQueryEditorObjectNavigation.useQueryEditorObjectNavigation.onEditorMouseDown has cognitive complexity 185 (threshold 15). Drivers by points: if/else 56 (124 pts), boolean chains 34, ternaries 13 (18 pts), error handling 3 (6 pts), loops 2 (3 pts) (nesting depth added 77). Most of this is not in the body itself: 15 of the 185 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 136, 224, 223, \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":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2b0cbd8b3455c2f123b050b97ca9bc7ed8cbe5db2ae1fdb74ad2ae7755c902"}},{"ruleId":"D2","level":"warning","message":{"text":"tableColumnDefinitionPaste.parseColumn (cognitive 183): tableColumnDefinitionPaste.parseColumn has cognitive complexity 183 (threshold 15). Drivers by points: if/else 66 (140 pts), boolean chains 29, ternaries 3 (9 pts), loops 3 (5 pts) (nesting depth added 82). Of this number, 168 points are the body\u0027s own statements and 15 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e554e3742ba55f57bf51ed53f463a816efe6bc65d74420661d1359cb63b7d0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_mysql_schema_objects (cognitive 176): dbx_core::data::transfer::transfer_mysql_schema_objects has cognitive complexity 176 (threshold 15). Drivers by points: if/else 26 (104 pts), match/switch 8 (43 pts), loops 5 (23 pts), boolean chains 6 (nesting depth added 131). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10183}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bdef63498438038f02bfaf678f749386849341b7b92b0c345030f55efa7db5"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.explainTabSql (cognitive 174): queryStore.useQueryStore.explainTabSql has cognitive complexity 174 (threshold 15). Drivers by points: if/else 58 (112 pts), ternaries 11 (25 pts), error handling 11 (23 pts), boolean chains 14 (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10386}}}],"partialFingerprints":{"codehealthFindingId/v1":"008b784d5be3dcc948a1bc56141a90fa3621de693d6bc32e7e77f3435245c423"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.mutateNativeBreakpoint (cognitive 169): plDebugNativeEntry.mutateNativeBreakpoint has cognitive complexity 169 (threshold 15). Drivers by points: if/else 63 (116 pts), boolean chains 33, loops 9 (20 pts) (nesting depth added 64). Of this number, 154 points are the body\u0027s own statements and 15 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint_write.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e8719bd7b195138a846ff029faad1fd92556191749497331c913a6141e0fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::get_or_create_pool_for_session_inner_with_receipt (cognitive 166): AppState::get_or_create_pool_for_session_inner_with_receipt has cognitive complexity 166 (threshold 15). Drivers by points: if/else 54 (113 pts), match/switch 9 (29 pts), loops 5 (18 pts), boolean chains 6 (nesting depth added 92). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"d085a359a77f2bb17ad2c54e5f6b95e593e55d0016b72065eb16a133b8a6ce74"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferValues.queryResultTransferTargetType (cognitive 166): queryResultTransferValues.queryResultTransferTargetType has cognitive complexity 166 (threshold 15). Drivers by points: if/else 61 (115 pts), ternaries 10 (28 pts), boolean chains 23 (nesting depth added 72). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c473ef7203f4547b6b099f36a48a333ca4662d63cc793b5a3bde2e10f9af3668"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRpcServer.dispatch (cognitive 165): JsonRpcServer.dispatch has cognitive complexity 165 (threshold 15). Drivers by points: if/else 79 (113 pts), ternaries 9 (22 pts), boolean chains 15, error handling 5 (11 pts), loops 2 (4 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b70a9be90cc83f9ea64d98b2048b562c3c0420185d01f5ccd7a462341fd137"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.performAsyncCompletionWithResult (cognitive 165): useQueryEditorCompletion.useQueryEditorCompletion.performAsyncCompletionWithResult has cognitive complexity 165 (threshold 15). Drivers by points: if/else 52 (90 pts), boolean chains 36, ternaries 14 (27 pts), error handling 3 (7 pts), loops 3 (5 pts) (nesting depth added 57). Of this number, 133 points are the body\u0027s own statements and 32 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"185b6aed23af2ce95bdf9cd70a00ce6086cf91f79cf2b7a7eda60ed6568df16f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::columns::build_column_sql (cognitive 164): dbx_sql_schema::table_structure_sql::columns::build_column_sql has cognitive complexity 164 (threshold 15). Drivers by points: if/else 62 (123 pts), boolean chains 29, match/switch 2 (7 pts), loops 3 (5 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/columns.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3323b6f6a5e0a30ef1a53e109369cc1751ccabbe8152d631767cec97de55e9bf"}},{"ruleId":"D2","level":"warning","message":{"text":"settingsStore.normalizeEditorSettings (cognitive 164): settingsStore.normalizeEditorSettings has cognitive complexity 164 (threshold 15). Drivers by points: ternaries 119 (129 pts), boolean chains 32, if/else 3 (nesting depth added 10). Of this number, 153 points are the body\u0027s own statements and 11 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6728aeef0292981c1d9fd8f3d18ec6b86f52d9904fdf573b3aca44b504bac7"}},{"ruleId":"D2","level":"warning","message":{"text":"createMockHost (cognitive 160): createMockHost has cognitive complexity 160 (threshold 15). Drivers by points: if/else 40 (68 pts), boolean chains 35, ternaries 16 (30 pts), error handling 10 (15 pts), loops 6 (10 pts), other 2 (nesting depth added 51). Of this number, 22 points are the body\u0027s own statements and 138 belong to 28 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efb47ff98c9edab5591eee455f5ee5ef5ec64142fba7d24037957b9e76c5812"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::plan::build_plan_with_tables (cognitive 155): dbx_core::schema::oracle_routines::plan::build_plan_with_tables has cognitive complexity 155 (threshold 15). Drivers by points: if/else 45 (103 pts), match/switch 7 (21 pts), boolean chains 19, loops 7 (12 pts) (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae44f50a4a053d1618cbfc92ca089e58cdc85dc2dfee92d25410ae606b8146c"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlFormatter.compressSqlText (cognitive 154): sqlFormatter.compressSqlText has cognitive complexity 154 (threshold 15). Drivers by points: if/else 35 (90 pts), boolean chains 29, loops 10 (22 pts), ternaries 4 (13 pts) (nesting depth added 76). Of this number, 133 points are the body\u0027s own statements and 21 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f15b1ed10f00b9836b7e713b876d6038f7bf4b055fcd7abca5d7c652ebfbe8d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugParseNativeConstructors (cognitive 147): main.plDebugParseNativeConstructors has cognitive complexity 147 (threshold 15). Drivers by points: if/else 48 (111 pts), boolean chains 22, loops 8 (14 pts) (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_object_constructors.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c420eedba4794147b253c7a3d4d33b9f7573327d9d1e26ae4f76dba120d36a44"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::query_result_export::export_query_result_core_inner (cognitive 146): dbx_core::data::query_result_export::export_query_result_core_inner has cognitive complexity 146 (threshold 15). Drivers by points: if/else 71 (121 pts), boolean chains 14, loops 3 (8 pts), match/switch 2 (3 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d2f895e765c5d13ef117d244e8ee1e16eb26f5025b16d20fe2452dfa135df9"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeNamedCall.result (cognitive 145): plDebugNativeNamedCall.result has cognitive complexity 145 (threshold 15). Drivers by points: if/else 51 (126 pts), boolean chains 13, loops 2 (6 pts) (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a593782fdc4fdde3dbf0e2a2db58128007a9c59d4d87e727fbac6f1d68301eff"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugObjectConstructors.parse (cognitive 139): PlDebugObjectConstructors.parse has cognitive complexity 139 (threshold 15). Drivers by points: if/else 42 (102 pts), boolean chains 20, loops 7 (13 pts), ternaries 2 (4 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugObjectConstructors.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fbf62893e3e2b419b1aef15fb30aa8d52abc4d9467185331bbf3310f292b47"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeDeclarations (cognitive 134): main.plDebugNativeDeclarations has cognitive complexity 134 (threshold 15). Drivers by points: if/else 32 (80 pts), loops 13 (33 pts), boolean chains 21 (nesting depth added 68). Of this number, 129 points are the body\u0027s own statements and 5 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":"agents/drivers/oracle-go/pldebug_variables.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c982dd7ec8b808bcfcae3ff2e2d4b0c7fd387cf71c3927bed9addf309b28aca0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::list_tables_once (cognitive 133): dbx_core::schema::list_tables_once has cognitive complexity 133 (threshold 15). Drivers by points: if/else 61 (111 pts), boolean chains 15, match/switch 3 (7 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"1938a6bb8a4e198b549f3da41ef864987b18bb5c1d154a13060c9d224fcaa9a0"}},{"ruleId":"D2","level":"warning","message":{"text":"canvasDataGridRenderer.drawCanvasDataGrid (cognitive 133): canvasDataGridRenderer.drawCanvasDataGrid has cognitive complexity 133 (threshold 15). Drivers by points: ternaries 32 (118 pts), if/else 37 (73 pts), boolean chains 39, loops 5 (9 pts) (nesting depth added 126). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (canvasDataGridRenderer.drawCanvasDataGrid::drawCell) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5cb67694e5c5a0d0524841675ed1a39c3a87d61b77a1c968b54b627ecc01d4"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugScanNativeRoutinesMode (cognitive 132): main.plDebugScanNativeRoutinesMode has cognitive complexity 132 (threshold 15). Drivers by points: if/else 47 (105 pts), boolean chains 23, loops 3 (4 pts) (nesting depth added 59). Of this number, 24 points are the body\u0027s own statements and 108 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"417c279e8f7cbae6895b819fe2a69ada4b7173e5bb73b6d0116d6dc10a70d933"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_ddl_indexes::prepare_schema_sync_oracle_ddl_core (cognitive 130): dbx_core::schema::oracle_ddl_indexes::prepare_schema_sync_oracle_ddl_core has cognitive complexity 130 (threshold 15). Drivers by points: if/else 28 (91 pts), loops 5 (18 pts), match/switch 5 (17 pts), boolean chains 4 (nesting depth added 88). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"6575b3d6f03c60b65faa9efa9de1300fd162bedd9825b45af54e016c59a29e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.saveChanges (cognitive 130): useDataGridEditor.useDataGridEditor.saveChanges has cognitive complexity 130 (threshold 15). Drivers by points: if/else 52 (81 pts), error handling 12 (22 pts), boolean chains 20, ternaries 4 (5 pts), loops 1 (2 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"7272c5bf124237e0efb8c8ee057dc8eb3f95afc4cfd4c11d296c29d82c5ddc8f"}},{"ruleId":"D2","level":"warning","message":{"text":"useSqlExecution.useSqlExecution.executeTargetSql (cognitive 130): useSqlExecution.useSqlExecution.executeTargetSql has cognitive complexity 130 (threshold 15). Drivers by points: if/else 45 (67 pts), ternaries 18 (34 pts), boolean chains 18, error handling 5 (7 pts), loops 2 (4 pts) (nesting depth added 42). Of this number, 112 points are the body\u0027s own statements and 18 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66b1d053d5a82bee42b1778266cca767a84c56fc06f85487b66016da73cc921"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_claude_with_tools (cognitive 128): dbx_ai_provider::ai::stream_claude_with_tools has cognitive complexity 128 (threshold 15). Drivers by points: if/else 25 (105 pts), match/switch 3 (13 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 95). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4433}}}],"partialFingerprints":{"codehealthFindingId/v1":"caca14079a6c708d353eefd586c3806a270d2bb5c45e4c0e1e13b3ef38c26107"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportLocalSnapshot (cognitive 127): useDataGridExport.useDataGridExport.exportLocalSnapshot has cognitive complexity 127 (threshold 15). Drivers by points: if/else 38 (47 pts), boolean chains 37, ternaries 25 (29 pts), error handling 5 (9 pts), loops 2 (5 pts) (nesting depth added 20). Of this number, 46 points are the body\u0027s own statements and 81 belong to 13 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfdd1fec75426b0c96c628fef9525527eebdd64e7ad75706a146345cd18f92e"}},{"ruleId":"D2","level":"warning","message":{"text":"useSidebarDataOpenRuntime.useSidebarDataOpenRuntime.openData (cognitive 126): useSidebarDataOpenRuntime.useSidebarDataOpenRuntime.openData has cognitive complexity 126 (threshold 15). Drivers by points: if/else 49 (66 pts), boolean chains 33, ternaries 16 (22 pts), error handling 4 (5 pts) (nesting depth added 24). Of this number, 105 points are the body\u0027s own statements and 21 belong to 9 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDataOpenRuntime.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc242f0d3beef0896cb1b9e64a7b49b8e15bdb61e692537a7f3357fdd53337c4"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlFormatter.maskStringAndCommentSpans (cognitive 126): sqlFormatter.maskStringAndCommentSpans has cognitive complexity 126 (threshold 15). Drivers by points: if/else 29 (78 pts), boolean chains 26, loops 8 (20 pts), ternaries 2 (nesting depth added 61). Of this number, 116 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d77352b22cee96a28062964122dddb7b0b84ff4047001053bceca8364d0ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.findSqlParameterOccurrences (cognitive 125): sqlParameters.findSqlParameterOccurrences has cognitive complexity 125 (threshold 15). Drivers by points: if/else 36 (90 pts), boolean chains 25, ternaries 6, loops 2 (4 pts) (nesting depth added 56). Of this number, 123 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeee679d8d54a3f7b41bb9409fa3d2ece54610736e0799541da903f1038f4132"}},{"ruleId":"D2","level":"warning","message":{"text":"MysqlDumpBinaryLiteralNormalizer::normalize (cognitive 123): MysqlDumpBinaryLiteralNormalizer::normalize has cognitive complexity 123 (threshold 15). Drivers by points: if/else 36 (91 pts), boolean chains 13, match/switch 4 (13 pts), loops 2 (6 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d31bd1be4af85ec994239daa9b6049e2b853283f419018e6d0a5e2b6a9506c"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraph::build_with_functions_and_options (cognitive 121): DependencyGraph::build_with_functions_and_options has cognitive complexity 121 (threshold 15). Drivers by points: if/else 23 (100 pts), loops 9 (21 pts) (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c21c091d77f3afb7119d9908a2aced074f3e1e82f55f70eef643aa02c791f7"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDiff.convertToSchemaDiffObjects (cognitive 121): schemaDiff.convertToSchemaDiffObjects has cognitive complexity 121 (threshold 15). Drivers by points: ternaries 34 (87 pts), if/else 4 (13 pts), boolean chains 11, loops 7 (10 pts) (nesting depth added 65). Of this number, 90 points are the body\u0027s own statements and 31 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"0757474a8833761fcdf3bcccce21aa9a715da96ec7c74f70975fbac614a68eca"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineRename.executeOracleRoutineRename (cognitive 120): oracleRoutineRename.executeOracleRoutineRename has cognitive complexity 120 (threshold 15). Drivers by points: if/else 34 (79 pts), boolean chains 22, ternaries 3 (11 pts), error handling 3 (7 pts), loops 1 (nesting depth added 57). Of this number, 118 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8aa3731a55f476d5ab72baef3ee373385723de1a5c0c642a73acc645552ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"tableTree.buildGroupedObjectTreeNodes (cognitive 120): tableTree.buildGroupedObjectTreeNodes has cognitive complexity 120 (threshold 15). Drivers by points: ternaries 27 (83 pts), boolean chains 19, if/else 7 (16 pts), loops 2 (nesting depth added 65). Of this number, 35 points are the body\u0027s own statements and 85 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":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"07272faf0c72e0933bf04fd1865ce613192e4c1e02801a0e76bc67aa5a2cc87e"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridActions.useDataGridActions.onReloadData (cognitive 119): useDataGridActions.useDataGridActions.onReloadData has cognitive complexity 119 (threshold 15). Drivers by points: if/else 28 (58 pts), boolean chains 26, ternaries 11 (23 pts), error handling 4 (12 pts) (nesting depth added 50). Of this number, 108 points are the body\u0027s own statements and 11 belong to 6 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a8ce7d11fb80e0c44053f0e7018f14f899c118a9b84bea0f322bc329f1c6d2"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 119): main has cognitive complexity 119 (threshold 15). Drivers by points: error handling 13 (46 pts), if/else 11 (36 pts), loops 6 (19 pts), boolean chains 11, ternaries 5 (7 pts) (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47fad9266ad8d4d57054cf78ab5873c16d0128f5b2b0c3cc783cf0431b3efef"}},{"ruleId":"D2","level":"warning","message":{"text":"doltVersionControl.layoutDoltCommitGraph (cognitive 117): doltVersionControl.layoutDoltCommitGraph has cognitive complexity 117 (threshold 15). Drivers by points: if/else 27 (68 pts), loops 10 (19 pts), boolean chains 16, ternaries 6 (14 pts) (nesting depth added 58). Of this number, 64 points are the body\u0027s own statements and 53 belong to 7 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dolt/doltVersionControl.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2ab5856818fe625def3f242c389e24cd1db3d001fa57594d6d2b32f6770b30"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadDatabases (cognitive 116): connectionStore.useConnectionStore.loadDatabases has cognitive complexity 116 (threshold 15). Drivers by points: if/else 41 (92 pts), boolean chains 14, ternaries 4 (9 pts), error handling 1 (nesting depth added 56). Most of this is not in the body itself: 5 of the 116 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 6399, 6541). 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6373}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaf6e68351e8974ab7b766deb55a0b7436642e0a23a4365e81a4e635f3be40b"}},{"ruleId":"D2","level":"warning","message":{"text":"oceanbasePrimaryKey.executeOceanbasePrimaryKeyPlan (cognitive 115): oceanbasePrimaryKey.executeOceanbasePrimaryKeyPlan has cognitive complexity 115 (threshold 15). Drivers by points: if/else 29 (60 pts), ternaries 10 (26 pts), boolean chains 20, error handling 3 (6 pts), loops 2 (3 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbasePrimaryKey.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0295bc048df2056d014857ceaff3af88fd36a1a49c172563d9fe41166296e7bf"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.parseMongoWriteCommand (cognitive 115): mongoShellCommand.parseMongoWriteCommand has cognitive complexity 115 (threshold 15). Drivers by points: if/else 38 (67 pts), ternaries 13 (27 pts), boolean chains 19, loops 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffd50ab1ecc7d253258be10ba8c62f7efe8c6e03c7fa1b1be9b43c3593dc654"}},{"ruleId":"D2","level":"warning","message":{"text":"Loader.load (cognitive 114): Loader.load has cognitive complexity 114 (threshold 15). Drivers by points: if/else 24 (68 pts), loops 13 (29 pts), boolean chains 12, ternaries 2 (5 pts) (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTypeGraph.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"973ce488b0833c05463c5e1cd329eefb16ddf8aacae9db8e6e3599738bea649c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::dameng::run_steps (cognitive 113): dbx_core::schema::native_jobs::operations::dameng::run_steps has cognitive complexity 113 (threshold 15). Drivers by points: if/else 51 (93 pts), boolean chains 18, loops 1, match/switch 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce8249068802db231352c632dbf57c081217616e07ee1f416b3c52b763350d6"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeJobAdmin.buildNativeJobDefinitionEdit (cognitive 113): nativeJobAdmin.buildNativeJobDefinitionEdit has cognitive complexity 113 (threshold 15). Drivers by points: if/else 29 (42 pts), ternaries 16 (42 pts), boolean chains 24, loops 3 (5 pts) (nesting depth added 41). Of this number, 103 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddaa4824bf95afab1495df6c90bbf2b99ebf4e93da8c75ed4f8f7ce680b0565"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleConstraints.executeOracleConstraintPlan (cognitive 113): oracleConstraints.executeOracleConstraintPlan has cognitive complexity 113 (threshold 15). Drivers by points: if/else 35 (63 pts), boolean chains 22, ternaries 7 (15 pts), error handling 5 (12 pts), loops 1 (nesting depth added 43). Of this number, 111 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d89a4776b9f3d8317a320bff6f1e8aac82ed470cdf8395ce88ee9ce00b3f35d"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupService::export_job (cognitive 111): BackupService::export_job has cognitive complexity 111 (threshold 15). Drivers by points: if/else 37 (90 pts), loops 5 (11 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/engine.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf881fe1098925525cd095a3adc2d3d307bc6e4618969e33247e8b8df16cca5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::split_oracle_table_ddl_with_retained (cognitive 111): dbx_sql_core::object_source_sql::oracle_indexes::split_oracle_table_ddl_with_retained has cognitive complexity 111 (threshold 15). Drivers by points: if/else 32 (71 pts), boolean chains 18, loops 9 (13 pts), match/switch 3 (9 pts) (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42467888a44d7cf913e629b3d5020ab8bbc94f0e3130bc5d9cbf31363f48016"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.provideSqlCompletions (cognitive 111): useQueryEditorCompletion.useQueryEditorCompletion.provideSqlCompletions has cognitive complexity 111 (threshold 15). Drivers by points: if/else 47 (74 pts), boolean chains 24, error handling 4 (8 pts), ternaries 3 (5 pts) (nesting depth added 33). Of this number, 106 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"d500fede3108da4e209652090ea4b1a1b82deaba9877c709796a27c8e6883a98"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGenerate.buildDefaultGeneratorParams (cognitive 111): dataGenerate.buildDefaultGeneratorParams has cognitive complexity 111 (threshold 15). Drivers by points: if/else 73 (95 pts), boolean chains 16 (nesting depth added 22). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12e12559dbb09bd8e8b8815cbbcdb31c354d95dc63ddb68384c911b0ab16301"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTableRename.prepareOracleTableRename (cognitive 111): oracleTableRename.prepareOracleTableRename has cognitive complexity 111 (threshold 15). Drivers by points: if/else 27 (59 pts), ternaries 7 (22 pts), boolean chains 17, error handling 4 (7 pts), loops 4 (6 pts) (nesting depth added 52). Of this number, 100 points are the body\u0027s own statements and 11 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f63b9cc91e884e28e41a6337fe478a2f37a317314887dea7a6368ff53138d9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_openai_with_tools (cognitive 110): dbx_ai_provider::ai::stream_openai_with_tools has cognitive complexity 110 (threshold 15). Drivers by points: if/else 22 (94 pts), loops 3 (10 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4658}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac38dd7a5049033a0570e32c5d7258e26cbf2786b9f41aae7d9efac10c2cdca"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::render_postgres_table_ddl_with_constraints_and_partition_info (cognitive 110): dbx_core::schema::render_postgres_table_ddl_with_constraints_and_partition_info has cognitive complexity 110 (threshold 15). Drivers by points: if/else 46 (81 pts), loops 10 (14 pts), boolean chains 13, match/switch 1 (2 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":18743}}}],"partialFingerprints":{"codehealthFindingId/v1":"7777a3104a5748a8df8ce4d3037ec874ffd12c76b92c8000ad6efcc95b98c5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::run_claimed (cognitive 110): dbx_core::schema::native_jobs::operations::run_claimed has cognitive complexity 110 (threshold 15). Drivers by points: if/else 48 (85 pts), match/switch 5 (14 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"1458fdd22a6d613136aa0ad8b5d8b490d1743f27103f0f515d8ebed37a8da844"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeRoutineHeaderMode (cognitive 109): main.plDebugNativeRoutineHeaderMode has cognitive complexity 109 (threshold 15). Drivers by points: if/else 30 (82 pts), boolean chains 18, loops 4 (9 pts) (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d39ac6df22f50e12538876a191bc2272ab5f9ebef1191b6dceafd0faeb8f664"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorHover.useQueryEditorHover.resolveSqlHoverTooltip (cognitive 108): useQueryEditorHover.useQueryEditorHover.resolveSqlHoverTooltip has cognitive complexity 108 (threshold 15). Drivers by points: if/else 25 (45 pts), ternaries 19 (28 pts), boolean chains 22, error handling 5 (12 pts), loops 1 (nesting depth added 36). Of this number, 89 points are the body\u0027s own statements and 19 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"27178fdc4ffc54c79e6508c1a2f6aa11c2195da197b6fb3ec7ac1771b4c1a71f"}},{"ruleId":"D2","level":"warning","message":{"text":"mysqlRoutineVariables.collectMysqlRoutineVariables (cognitive 108): mysqlRoutineVariables.collectMysqlRoutineVariables has cognitive complexity 108 (threshold 15). Drivers by points: if/else 27 (74 pts), boolean chains 21, loops 5 (11 pts), ternaries 1 (2 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/mysqlRoutineVariables.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c614367b297bff364f70b2b2af59a1b35417fc75d84b30831106e03cdb906b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::run (cognitive 107): dbx::run has cognitive complexity 107 (threshold 15). Drivers by points: if/else 54 (97 pts), match/switch 4 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lib.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"0239e049b3f84bb1c8d32c124b7ec2b5b52f11701ec0b1d138c7475478474310"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer_runner::run_transfer (cognitive 105): dbx_core::data::transfer_runner::run_transfer has cognitive complexity 105 (threshold 15). Drivers by points: if/else 53 (83 pts), match/switch 10 (17 pts), boolean chains 3, loops 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be9219926136071a88595fe90c49dea9946fc8d227d2f96e6f9d3b27bf5b4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::scheduler::transition::run (cognitive 104): dbx_core::schema::native_jobs::operations::scheduler::transition::run has cognitive complexity 104 (threshold 15). Drivers by points: if/else 47 (86 pts), boolean chains 12, match/switch 2 (5 pts), loops 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"944a731827cfb941d304e0b9d2128ea1d1ee63c0378e5e5992276cd3d6b03ca5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::query_execution_sql::strip_sql_comments_and_literals_with_metadata (cognitive 104): dbx_sql_core::query_execution_sql::strip_sql_comments_and_literals_with_metadata has cognitive complexity 104 (threshold 15). Drivers by points: if/else 30 (74 pts), loops 5 (18 pts), boolean chains 7, match/switch 1 (5 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"af674f03318705159fb411dc40620a7f4f0a62cfc56701c47c082d21729b04cf"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTableRename.executeOracleTableRename (cognitive 104): oracleTableRename.executeOracleTableRename has cognitive complexity 104 (threshold 15). Drivers by points: if/else 33 (71 pts), boolean chains 15, ternaries 5 (14 pts), error handling 2 (3 pts), loops 1 (nesting depth added 48). Of this number, 102 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd9b15fcea116e406eccf980ef1bac81cc1692199646bd12975cbc829b9c097"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::refresh_connections (cognitive 103): AppState::refresh_connections has cognitive complexity 103 (threshold 15). Drivers by points: match/switch 24 (72 pts), if/else 12 (23 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 60). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":7165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41c00836a4fdd95c2e9db1adce0c5bc2468582e7a0e149d0f3066d561fe02a3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::snapshot_export::write_snapshot_export_with_fetch (cognitive 102): dbx_core::query::snapshot_export::write_snapshot_export_with_fetch has cognitive complexity 102 (threshold 15). Drivers by points: if/else 31 (83 pts), loops 6 (14 pts), boolean chains 5 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/snapshot_export.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb630706dc0b6e3c3fc25a3147c20aef6f523ced3b7ef8fcec0bf55bfa61827"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::agent_loop::run_agent_loop_inner (cognitive 101): dbx_core::ai::agent_loop::run_agent_loop_inner has cognitive complexity 101 (threshold 15). Drivers by points: if/else 33 (57 pts), match/switch 9 (23 pts), loops 9 (19 pts), boolean chains 2 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_loop.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e27d3cf594bbaa30194e2a40214a60c3bc482bd815b45baa5ad50bbd1756e1"}},{"ruleId":"D2","level":"warning","message":{"text":"redisKeyTree.buildRedisKeySnapshotCooperatively (cognitive 101): redisKeyTree.buildRedisKeySnapshotCooperatively has cognitive complexity 101 (threshold 15). Drivers by points: if/else 23 (64 pts), loops 9 (20 pts), boolean chains 15, ternaries 2 (nesting depth added 52). Of this number, 99 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyTree.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34faa87bba9fad79846c81ecb7293bb88517cce861cf6dfea1e91da3100056d"}},{"ruleId":"D2","level":"warning","message":{"text":"routineBlockLayout.indentRoutineBlocks (cognitive 101): routineBlockLayout.indentRoutineBlocks has cognitive complexity 101 (threshold 15). Drivers by points: boolean chains 45, if/else 29 (45 pts), ternaries 5 (10 pts), loops 1 (nesting depth added 21). Of this number, 99 points are the body\u0027s own statements and 2 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/routineBlockLayout.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d1d7c95805e70be1fd46833b73eee609c8c34002e7e3a871f8cbd8be984664"}},{"ruleId":"D2","level":"warning","message":{"text":"tokens.tokenizeSqlSemantic (cognitive 101): tokens.tokenizeSqlSemantic has cognitive complexity 101 (threshold 15). Drivers by points: if/else 20 (47 pts), boolean chains 26, loops 7 (19 pts), ternaries 4 (9 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/tokens.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6418688d36a7ba9d444b7e376588b792e685221c1ba9b2c5ce3443c86a8d34c7"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.resolve (cognitive 100): PlDebugTarget.resolve has cognitive complexity 100 (threshold 15). Drivers by points: if/else 30 (63 pts), boolean chains 17, ternaries 9 (15 pts), loops 4 (5 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"58983d11da7e585973705901c9b2cc62c23fda13327e895fc4b6a20097a00643"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.executeOracleForeignKeyPlan (cognitive 100): oracleForeignKeys.executeOracleForeignKeyPlan has cognitive complexity 100 (threshold 15). Drivers by points: if/else 31 (61 pts), boolean chains 25, ternaries 5 (9 pts), error handling 2 (3 pts), loops 2 (nesting depth added 35). Of this number, 98 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bf2d196c8d4503caf64dc1bf80c8aa5600772a15c689c2074330ced1929968"}},{"ruleId":"D2","level":"warning","message":{"text":"oraclePackageSource.rewriteOraclePackageSource (cognitive 100): oraclePackageSource.rewriteOraclePackageSource has cognitive complexity 100 (threshold 15). Drivers by points: if/else 29 (61 pts), boolean chains 20, loops 8 (16 pts), ternaries 2 (3 pts) (nesting depth added 41). Of this number, 93 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSource.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f45f3c3d3d776f3707cc51ae34d7ea6c5d8fd3f49df276888d68af757aae71"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.topLevelSoftStatementLineStarts (cognitive 99): sqlStatementRanges.topLevelSoftStatementLineStarts has cognitive complexity 99 (threshold 15). Drivers by points: if/else 34 (87 pts), boolean chains 10, loops 1, ternaries 1 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"23757adee7076c4a176b20cd13dd25f68600301798296bb8a962975e7f587a60"}},{"ruleId":"D2","level":"warning","message":{"text":"starrocksAlterOptions.starRocksAlterOptionsFromDdl (cognitive 98): starrocksAlterOptions.starRocksAlterOptionsFromDdl has cognitive complexity 98 (threshold 15). Drivers by points: if/else 24 (48 pts), boolean chains 34, ternaries 5 (9 pts), loops 4 (7 pts) (nesting depth added 31). Of this number, 80 points are the body\u0027s own statements and 18 belong to 14 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksAlterOptions.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"41248eb45881f89160df01bf70200f87ad440d069a206bc572f62c271673821e"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.tabDisplayTitle (cognitive 98): tabPresentation.tabDisplayTitle has cognitive complexity 98 (threshold 15). Drivers by points: if/else 48 (74 pts), boolean chains 12, ternaries 6 (12 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe47c4a4d20f21d79178d3769c5b12b53ae659713ddf0e594d93cc7bf7ab3d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::generate_create_table_sql (cognitive 97): dbx_sql_schema::schema_diff::generate_create_table_sql has cognitive complexity 97 (threshold 15). Drivers by points: if/else 38 (84 pts), loops 5 (6 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5877}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5de9ea1e66b5538a1d2f09dc1913db3edbd5d8f267177da6a28623cae6d24c9"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.topLevelWordsInRange (cognitive 97): sqlStatementRanges.topLevelWordsInRange has cognitive complexity 97 (threshold 15). Drivers by points: if/else 34 (89 pts), boolean chains 7, loops 1 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c8ad6c574162370064696d537c0a296ad04653858381cb40e16d0169352266"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_mongodb_table (cognitive 96): dbx_core::data::transfer::transfer_mongodb_table has cognitive complexity 96 (threshold 15). Drivers by points: if/else 30 (74 pts), loops 3 (11 pts), match/switch 2 (9 pts), boolean chains 2 (nesting depth added 59). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":11933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18f546b4ed0add2cccb9bb2549f9ea8d567611542ef6d91635640a5b5201ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::format_grid_sql_literal_with_spatial (cognitive 96): dbx_sql_data::data_grid_sql::format_grid_sql_literal_with_spatial has cognitive complexity 96 (threshold 15). Drivers by points: if/else 55 (84 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2899}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bd057e7eed0e78e38fb8e5addc366cd4c4b490ff9ca4cebe3535ebb9f8bee5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::connection::test_connection_with_info_impl (cognitive 96): dbx::commands::connection::test_connection_with_info_impl has cognitive complexity 96 (threshold 15). Drivers by points: match/switch 19 (51 pts), if/else 21 (37 pts), boolean chains 8 (nesting depth added 48). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/connection.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"5610fac7fbe48867c246f725185f622117f35746de6b7b46da7a478f789ec1cd"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativePlan.bind (cognitive 96): plDebugNativePlan.bind has cognitive complexity 96 (threshold 15). Drivers by points: if/else 37 (86 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63baa067e01657783606afdfc08ca3340bfa815ddee686eb376e1f6f02fef59"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.scanMongoCallArguments (cognitive 96): mongoCompletion.scanMongoCallArguments has cognitive complexity 96 (threshold 15). Drivers by points: if/else 22 (64 pts), boolean chains 16, ternaries 6 (15 pts), loops 1 (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"03890889e01d1a6fee86f882feb3204147253f4c1645b5e7d24a8544940337ac"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printRuleElement (cognitive 96): printer.printRuleElement has cognitive complexity 96 (threshold 15). Drivers by points: if/else 31 (59 pts), ternaries 7 (24 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d9d6243998604ee5d47446bfadfda762e49b5651140063cf60c683ad61e8cc"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::generate_create_table_ddl_with_source_profile (cognitive 95): dbx_core::data::transfer::generate_create_table_ddl_with_source_profile has cognitive complexity 95 (threshold 15). Drivers by points: if/else 27 (73 pts), boolean chains 11, match/switch 5 (8 pts), loops 2 (3 pts) (nesting depth added 50). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5104}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d8abcf7aebab8c104b7d343b82001886f99f74652cd5efc0a27b6aeff70478"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::do_execute_typed (cognitive 95): dbx_core::query::do_execute_typed has cognitive complexity 95 (threshold 15). Drivers by points: if/else 41 (73 pts), match/switch 9 (19 pts), boolean chains 3 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be4de871fb703605fef51c450b840a87ecafd674c0e1370ee3cfdb56599b996"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::list_objects_once (cognitive 95): dbx_core::schema::list_objects_once has cognitive complexity 95 (threshold 15). Drivers by points: if/else 43 (73 pts), boolean chains 12, match/switch 4 (10 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8934}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3490a90e82be4fdbc8523c9c7d0f710ef6d190d29b503af3d0f5bbb33a2c669"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportMemoryResultSheetsXlsx (cognitive 95): useDataGridExport.useDataGridExport.exportMemoryResultSheetsXlsx has cognitive complexity 95 (threshold 15). Drivers by points: if/else 24 (41 pts), boolean chains 25, ternaries 12 (16 pts), error handling 4 (7 pts), loops 3 (6 pts) (nesting depth added 27). Of this number, 18 points are the body\u0027s own statements and 77 belong to 16 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cadecdc1afa23468e675beb0df292958a05332b2bc9e473c03d1c9e4c5ba89"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::rebase_oracle_table_ddl (cognitive 94): dbx_sql_core::object_source_sql::oracle_indexes::rebase_oracle_table_ddl has cognitive complexity 94 (threshold 15). Drivers by points: if/else 33 (62 pts), boolean chains 18, loops 5 (8 pts), match/switch 2 (6 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee88805489893cf71e11cfcc5d29a7de343fa7f9bfe5c1b5dd8124d0aa2d8c1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_trigger::analyze (cognitive 94): dbx_sql_core::object_source_sql::oracle_trigger::analyze has cognitive complexity 94 (threshold 15). Drivers by points: if/else 42 (56 pts), boolean chains 31, loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_trigger.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f231462160497aea1ccc2165e78cbaf859a3cc90925178af06b7708529deb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan.render (cognitive 94): Plan.render has cognitive complexity 94 (threshold 15). Drivers by points: if/else 38 (63 pts), loops 13 (18 pts), ternaries 4 (9 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2905509189ac38c7d4fbc5cc41d9ae5c804029941555f126ca175febd4b447cc"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginDetailClient.PluginDetailClient (cognitive 94): PluginDetailClient.PluginDetailClient has cognitive complexity 94 (threshold 15). Drivers by points: ternaries 25 (78 pts), if/else 11, boolean chains 5 (nesting depth added 53). Of this number, 56 points are the body\u0027s own statements and 38 belong to 10 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/plugins/[id]/PluginDetailClient.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc59c8c03acf9144a79ad1b3544aa95ae44ac027aedd0667e68dd23e39421e7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::oracle_default_sequence_owner_edits (cognitive 93): dbx_sql_core::object_source_sql::oracle_indexes::oracle_default_sequence_owner_edits has cognitive complexity 93 (threshold 15). Drivers by points: if/else 17 (62 pts), boolean chains 16, match/switch 2 (8 pts), loops 3 (7 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efbd712a7e11370afe042baccc5f1221c00ac3432a2ea00769f15b3fad33a86"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.oraclePlSqlBlockEnd (cognitive 92): sqlStatementRanges.oraclePlSqlBlockEnd has cognitive complexity 92 (threshold 15). Drivers by points: if/else 26 (64 pts), boolean chains 14, ternaries 5 (13 pts), loops 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a15fab94f8407de528197fa133b55ce8fb20dde8d1ea7a2da69009f308ed385"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDiff.injectColumnRenameSql (cognitive 92): schemaDiff.injectColumnRenameSql has cognitive complexity 92 (threshold 15). Drivers by points: if/else 16 (47 pts), loops 9 (22 pts), boolean chains 15, ternaries 2 (8 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e4d15278bc3d8bcbc1a696b84402ce5fae1df745855a03c4ca42527bc83d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlCompletionProvider.build (cognitive 92): SqlCompletionProvider.build has cognitive complexity 92 (threshold 15). Drivers by points: if/else 33 (50 pts), boolean chains 33, ternaries 3 (7 pts), loops 1 (2 pts) (nesting depth added 22). Of this number, 88 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5679c42052339f509305f291e0ab477cf347e6d37c4dbc61398de04ae03ae37"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::execute_query (cognitive 90): DbxMcpServer::execute_query has cognitive complexity 90 (threshold 15). Drivers by points: if/else 32 (51 pts), match/switch 16 (32 pts), boolean chains 7 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"d207c80ba474fdf1cf530448d7b3b3fa303fdb73883d345cb2cfd7222224b2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDiff.setSchemaDiffObjectSelectedWithDependencies::apply (cognitive 90): schemaDiff.setSchemaDiffObjectSelectedWithDependencies::apply has cognitive complexity 90 (threshold 15). Drivers by points: if/else 20 (54 pts), loops 7 (19 pts), boolean chains 11, ternaries 3 (6 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"057b7ee57e240324e6778cbb78f6cedd02d9866176e31b7d6f3f78ee9ae99c7b"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.classifyStageOptions (cognitive 88): mongoCompletion.classifyStageOptions has cognitive complexity 88 (threshold 15). Drivers by points: if/else 27 (68 pts), ternaries 5 (14 pts), boolean chains 6 (nesting depth added 50). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"0586349cf859030201452c4fde409bcc40a5bfb1db63b632f1a90d539e35cd87"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_ddl_indexes::capture_table_ddl_indexes (cognitive 87): dbx_core::schema::oracle_ddl_indexes::capture_table_ddl_indexes has cognitive complexity 87 (threshold 15). Drivers by points: if/else 26 (50 pts), boolean chains 30, match/switch 3 (5 pts), loops 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"4905bd321de56577795f6db96fd775dc3bbec4630a033e66c5b77d3aae6c6251"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::plan::recovery::package_recovery::prepare_package_recovery (cognitive 87): dbx_core::schema::oracle_routines::plan::recovery::package_recovery::prepare_package_recovery has cognitive complexity 87 (threshold 15). Drivers by points: if/else 28 (54 pts), match/switch 5 (16 pts), boolean chains 11, loops 4 (6 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan/recovery/package_recovery.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7745c29742b5ddde071243d61f3ed9eb7291a6aac811d7abaec112de699a0283"}},{"ruleId":"D2","level":"warning","message":{"text":"graphCompletion.getGraphCompletionContext (cognitive 87): graphCompletion.getGraphCompletionContext has cognitive complexity 87 (threshold 15). Drivers by points: if/else 31 (59 pts), boolean chains 19, loops 5 (9 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletion.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"af45e1888d17601816a536cf40abec8653f51bbb7439a127dbabc814a470f121"}},{"ruleId":"D2","level":"warning","message":{"text":"codeContext (cognitive 87): codeContext has cognitive complexity 87 (threshold 15). Drivers by points: if/else 14 (47 pts), loops 9 (24 pts), boolean chains 6, ternaries 3 (5 pts), error handling 2 (4 pts), other 1 (nesting depth added 52). Of this number, 73 points are the body\u0027s own statements and 14 belong to 12 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb82529eadadf9c4a68e9da81119d3d138b378a725c592dc54be44bf30c69754"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.scalarInput (cognitive 86): PlDebugTarget.scalarInput has cognitive complexity 86 (threshold 15). Drivers by points: if/else 31 (51 pts), ternaries 6 (20 pts), boolean chains 13, error handling 1 (2 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5e2ffa14b6e1aadb1e99d59d8a49ab6740f3c9712e9698ecc72a314fb5b362"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrlBuilder.buildSpecialJdbcUrl (cognitive 86): connectionUrlBuilder.buildSpecialJdbcUrl has cognitive complexity 86 (threshold 15). Drivers by points: ternaries 23 (47 pts), if/else 11 (23 pts), boolean chains 15, match/switch 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9149cc4b0f165fe3a6cffe13d876f497bb88e4ba22c49c6d30ef99435857f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"aliasHighlights.sqlAliasHighlightGroups (cognitive 86): aliasHighlights.sqlAliasHighlightGroups has cognitive complexity 86 (threshold 15). Drivers by points: if/else 22 (54 pts), loops 10 (16 pts), boolean chains 15, ternaries 1 (nesting depth added 38). Of this number, 83 points are the body\u0027s own statements and 3 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/aliasHighlights.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc35ef1fabac4263f501abbc7e5ccaa1eb6a0c023753af500fb5b23b1fb0bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::oracle_foreign_keys::build_changes (cognitive 85): dbx_sql_schema::table_structure_sql::oracle_foreign_keys::build_changes has cognitive complexity 85 (threshold 15). Drivers by points: if/else 26 (69 pts), boolean chains 9, loops 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_foreign_keys.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0cd429f8da654a75171c2f98c4dc604cae4c1bbcde88b3c04acfce43be6641"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::starrocks_layout::build (cognitive 85): dbx_sql_schema::table_structure_sql::starrocks_layout::build has cognitive complexity 85 (threshold 15). Drivers by points: if/else 24 (57 pts), boolean chains 14, match/switch 4 (10 pts), loops 2 (4 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/starrocks_layout.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c9106d2a97196f11cd8739b01c67bac9ac80f49dfbd95a8a1b5e9f252ed95b"}},{"ruleId":"D2","level":"warning","message":{"text":"graphCompletionScope.graphCompletionScope (cognitive 85): graphCompletionScope.graphCompletionScope has cognitive complexity 85 (threshold 15). Drivers by points: if/else 18 (54 pts), boolean chains 13, ternaries 4 (13 pts), loops 2 (5 pts) (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletionScope.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5eaa90ea8527665516bc0481ae6ad9979c66172602dbd9b0e26d7bbd85a813"}},{"ruleId":"D2","level":"warning","message":{"text":"tableTree.buildSimpleObjectTreeNodes (cognitive 85): tableTree.buildSimpleObjectTreeNodes has cognitive complexity 85 (threshold 15). Drivers by points: ternaries 18 (55 pts), boolean chains 15, if/else 7 (14 pts), loops 1 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9a698ca611799708c1fa075e309fbfb06d02d87b3f63fd0f94e0fd44dcc781"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadMoreObjectGroupChildren (cognitive 85): connectionStore.useConnectionStore.loadMoreObjectGroupChildren has cognitive complexity 85 (threshold 15). Drivers by points: if/else 27 (40 pts), boolean chains 34, ternaries 6 (10 pts), error handling 1 (nesting depth added 17). Most of this is not in the body itself: 11 of the 85 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 8031, searchIsCurrent, a function literal at line 8065, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7988}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4053188cf9ca3fdf8f1e6bc3f8ca7c6b9cfe1d1bc8385280fe36b2a162245d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::map_column_type (cognitive 84): dbx_core::data::transfer::map_column_type has cognitive complexity 84 (threshold 15). Drivers by points: match/switch 24 (47 pts), if/else 22 (33 pts), boolean chains 4 (nesting depth added 34). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":4743}}}],"partialFingerprints":{"codehealthFindingId/v1":"90af50dd8f63a275f7d1d01da107d30afb734a7acb4e421a0d6b90f204ec2461"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::oracle_view_rename::rewrite_hints (cognitive 84): dbx_sql_core::oracle_view_rename::rewrite_hints has cognitive complexity 84 (threshold 15). Drivers by points: if/else 23 (64 pts), boolean chains 10, loops 4 (8 pts), match/switch 1 (2 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"747999fe151f61a2a060fa25210d03709145d4acdec3d75f235189437f1f2da8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::creation::native_job_scheduler_create_plan (cognitive 84): dbx_sql_schema::native_job_changes::creation::native_job_scheduler_create_plan has cognitive complexity 84 (threshold 15). Drivers by points: if/else 35 (70 pts), boolean chains 8, loops 3, match/switch 1 (3 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/creation.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f623b491870d939f674c21b52f2c5c862d81a213ec53289f44d6e5862ed750"}},{"ruleId":"D2","level":"warning","message":{"text":"useQuickOpen.useQuickOpen.processDatabaseTreeNodes (cognitive 84): useQuickOpen.useQuickOpen.processDatabaseTreeNodes has cognitive complexity 84 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 29, ternaries 8 (24 pts), loops 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bf620607aa5fe250887b82a279d83e2be7eef09473542d5d1cfc2e63f0c6e1"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGenerate.generateValue (cognitive 84): dataGenerate.generateValue has cognitive complexity 84 (threshold 15). Drivers by points: if/else 35 (52 pts), ternaries 9 (19 pts), boolean chains 7, loops 2 (6 pts) (nesting depth added 31). Of this number, 82 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"64262d563c0ac09b734135361a004cf732757903e3f9ebeb8f137d7c50081df7"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.listCompletionObjects (cognitive 84): connectionStore.useConnectionStore.listCompletionObjects has cognitive complexity 84 (threshold 15). Drivers by points: if/else 18 (40 pts), ternaries 9 (24 pts), boolean chains 13, error handling 2 (7 pts) (nesting depth added 42). Most of this is not in the body itself: 15 of the 84 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 10541, 10582). 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1320a7a4c68cbf09f942b865ec58f9ba27f90de122945791f647f578b84103"}},{"ruleId":"D2","level":"warning","message":{"text":"useSqlExecution.useSqlExecution.doExecute (cognitive 83): useSqlExecution.useSqlExecution.doExecute has cognitive complexity 83 (threshold 15). Drivers by points: if/else 27 (42 pts), ternaries 16 (24 pts), boolean chains 17 (nesting depth added 23). Of this number, 78 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"802399a6751d0a74bcb03c437dea470b572b9dd7ba15961a14a821e25b83dc57"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.getFunctionDescriptions (cognitive 83): sqlCompletion.getFunctionDescriptions has cognitive complexity 83 (threshold 15). Drivers by points: boolean chains 83. 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5184ab8993c44d6523f647779f0826b26633ae45119b391e68813799aff2e1eb"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadTables (cognitive 83): connectionStore.useConnectionStore.loadTables has cognitive complexity 83 (threshold 15). Drivers by points: if/else 26 (35 pts), boolean chains 25, ternaries 17 (22 pts), error handling 1 (nesting depth added 14). Of this number, 18 points are the body\u0027s own statements and 65 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7588}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c24aaa57dfd1a73767649dcc0826cf729a5e8c75a6deee920d5bfea3217c27d"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadTreeNodeChildren (cognitive 83): connectionStore.useConnectionStore.loadTreeNodeChildren has cognitive complexity 83 (threshold 15). Drivers by points: if/else 47 (51 pts), boolean chains 32 (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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8971}}}],"partialFingerprints":{"codehealthFindingId/v1":"d150203057ee2e16b8ab4bea44f314379c617a1799c0b661c3993a1d36da2c99"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::oracle_table_source_statement_ranges (cognitive 82): dbx_sql_core::object_source_sql::oracle_indexes::oracle_table_source_statement_ranges has cognitive complexity 82 (threshold 15). Drivers by points: if/else 24 (65 pts), boolean chains 11, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"536b838ffe8e976b4ec9b8866cc8c0307eeee8332ccfb8b4779f862742c31260"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::triggers::build_trigger_sql_with_operations (cognitive 82): dbx_sql_schema::table_structure_sql::triggers::build_trigger_sql_with_operations has cognitive complexity 82 (threshold 15). Drivers by points: if/else 28 (70 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 47). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed6146025f8387610147ef44bf9f9ad51cca3c4ed6541a981792ef57492f8bc"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugLoadNativeTargets (cognitive 82): main.plDebugLoadNativeTargets has cognitive complexity 82 (threshold 15). Drivers by points: if/else 30 (66 pts), boolean chains 10, loops 3 (6 pts) (nesting depth added 39). Of this number, 38 points are the body\u0027s own statements and 44 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8836bbb714151ec25c8ef2e40a32b798199e39a6b4ee94694775eb22e8998095"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.trimRangeEndBeforeNextBoundary (cognitive 82): sqlStatementRanges.trimRangeEndBeforeNextBoundary has cognitive complexity 82 (threshold 15). Drivers by points: if/else 29 (75 pts), boolean chains 6, loops 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"39eb30591c73f7ae7ba2c4c4a26e3c19167039b5b8b2696ed9845016939d91b5"}},{"ruleId":"D2","level":"warning","message":{"text":"openTabsPersistence.serializeOpenTabs (cognitive 82): openTabsPersistence.serializeOpenTabs has cognitive complexity 82 (threshold 15). Drivers by points: ternaries 62 (72 pts), boolean chains 10 (nesting depth added 10). None of this is in the body itself: all 82 points belong to 2 function literals inside it that branch (lines 218, 284). 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":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde355ee8a3bc18320a397e3a7be90f8f491732c3f9098a94fb356352459e76c"}},{"ruleId":"D2","level":"warning","message":{"text":"useSchemaDiffSession.runSchemaDiffSession (cognitive 81): useSchemaDiffSession.runSchemaDiffSession has cognitive complexity 81 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 27, ternaries 12 (13 pts), loops 3 (6 pts), error handling 1 (nesting depth added 19). Of this number, 79 points are the body\u0027s own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSchemaDiffSession.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"160a08f86e74f57bcdb7617bbd5d027f20b6ce95cdcaad28c5adb880c8647c78"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugComposite.compositeInputComplete (cognitive 81): plDebugComposite.compositeInputComplete has cognitive complexity 81 (threshold 15). Drivers by points: if/else 33 (57 pts), boolean chains 22, ternaries 1 (2 pts) (nesting depth added 25). Of this number, 59 points are the body\u0027s own statements and 22 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/plDebugComposite.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"27094755c713df4c7978b3bf51d68d3a327d1941889c8d8dbb6093e29072e1a1"}},{"ruleId":"D2","level":"warning","message":{"text":"main.applyCassandraURLParams (cognitive 80): main.applyCassandraURLParams has cognitive complexity 80 (threshold 15). Drivers by points: if/else 24 (71 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc96b32a229455fc7b0d0756d9aade2d7e163fa1bad19c1508850598134d6824"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.buildLocalSqlCompletionResult (cognitive 80): useQueryEditorCompletion.useQueryEditorCompletion.buildLocalSqlCompletionResult has cognitive complexity 80 (threshold 15). Drivers by points: ternaries 17 (37 pts), if/else 14 (24 pts), boolean chains 18, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43a8ba63711752cdae2fed5576130a52d246a5ea99db4c3628cc555194cc78f"}},{"ruleId":"D2","level":"warning","message":{"text":"oceanbasePrimaryKey.readOceanbasePrimaryKeySnapshot (cognitive 80): oceanbasePrimaryKey.readOceanbasePrimaryKeySnapshot has cognitive complexity 80 (threshold 15). Drivers by points: if/else 28 (43 pts), boolean chains 28, ternaries 6, 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":"apps/desktop/src/lib/database/oceanbasePrimaryKey.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab221b7958ea8bd856b92b9aff4ceab32ce5e86ad7674c7eb22a9961d1ac0a7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::rewrite_oracle_routine_references (cognitive 79): dbx_sql_core::object_source_sql::rewrite_oracle_routine_references has cognitive complexity 79 (threshold 15). Drivers by points: if/else 23 (52 pts), boolean chains 12, loops 5 (10 pts), match/switch 1 (5 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8a327efd881bb184415d49fb980eae8f01061a4edce83f3b5e3a5c5b2b1ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSession.mutateBreakpoint (cognitive 79): PlDebugSession.mutateBreakpoint has cognitive complexity 79 (threshold 15). Drivers by points: if/else 27 (53 pts), boolean chains 15, ternaries 4 (7 pts), loops 1 (3 pts), error handling 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa43a7c05a6ce85a2184739db054f7e796119762d7f4bbbfe79be75c1d83f8e4"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSession.runDebuggeeTarget (cognitive 79): PlDebugSession.runDebuggeeTarget has cognitive complexity 79 (threshold 15). Drivers by points: ternaries 17 (39 pts), if/else 20 (31 pts), error handling 4 (6 pts), boolean chains 3 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61292a03435cb6485add618a8311337698afc25a79a714bc4230f89f6603f36"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportMemoryDataFile (cognitive 79): useDataGridExport.useDataGridExport.exportMemoryDataFile has cognitive complexity 79 (threshold 15). Drivers by points: ternaries 20 (29 pts), if/else 21 (26 pts), boolean chains 22, error handling 1 (2 pts) (nesting depth added 15). Of this number, 34 points are the body\u0027s own statements and 45 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"062a2ba9a26184f9237db3e784bcc550769e5dad357bb2cbec2858bef6c29f90"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoFormatter.formatMongoShellText (cognitive 79): mongoFormatter.formatMongoShellText has cognitive complexity 79 (threshold 15). Drivers by points: if/else 27 (64 pts), boolean chains 13, loops 1, ternaries 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoFormatter.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e043dd28e7b760c4d96458a53d98401560144a5baf78cc8649655b65951a367"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarMenuLayout.buildSidebarMenuLayout (cognitive 79): sidebarMenuLayout.buildSidebarMenuLayout has cognitive complexity 79 (threshold 15). Drivers by points: ternaries 13 (47 pts), if/else 11 (17 pts), boolean chains 13, loops 2 (nesting depth added 40). Of this number, 78 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarMenuLayout.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"580158eed5225cbe99f8b532dfe416a42b2646ee3fe313bd9f8059219f00770c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_service::download_with_progress (cognitive 78): dbx_driver_agent::agent_service::download_with_progress has cognitive complexity 78 (threshold 15). Drivers by points: if/else 26 (53 pts), match/switch 5 (15 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8b59d7d714952245914b0c908c72e01a26949fddde01772353b385af1b4e72"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::mysql_statement_references_session_variable (cognitive 78): dbx_sql_data::query_result_sql::mysql_statement_references_session_variable has cognitive complexity 78 (threshold 15). Drivers by points: if/else 17 (51 pts), loops 6 (20 pts), boolean chains 7 (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f3861350eff6ccfebe4c822d065b2dfe0e27685a8deb5b69938618429b6f48"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorDiagnostics.useQueryEditorDiagnostics.refreshSemanticDiagnostics (cognitive 78): useQueryEditorDiagnostics.useQueryEditorDiagnostics.refreshSemanticDiagnostics has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (42 pts), ternaries 9 (17 pts), boolean chains 13, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 25). Of this number, 76 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9713bfe310c5da8a75467b3bcd5baa155987f342d6d6169cef147ab07585aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoSql.tokenize (cognitive 78): mongoSql.tokenize has cognitive complexity 78 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 8 (23 pts), boolean chains 16, ternaries 1 (3 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b19c92935f276442c184a6ea9368f8daa5c75b77621b98111562267e07112e9"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisKeyGroupIndex.project (cognitive 78): RedisKeyGroupIndex.project has cognitive complexity 78 (threshold 15). Drivers by points: if/else 22 (46 pts), loops 7 (14 pts), ternaries 8 (10 pts), boolean chains 8 (nesting depth added 33). Of this number, 55 points are the body\u0027s own statements and 23 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyGroupIndex.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a2ba6105dc7b903e3a99c0171127b30d2641a3a00d59ea7c5a6f16bb674c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.invalidateCompletionCache (cognitive 78): connectionStore.useConnectionStore.invalidateCompletionCache has cognitive complexity 78 (threshold 15). Drivers by points: if/else 22 (42 pts), loops 20, boolean chains 14, ternaries 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4817}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c423cc21c0f123b7522248dc652b0ba7df4f1f13d19042ac363b9296bea75b"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferValues.queryResultTransferSqlLiteral (cognitive 77): queryResultTransferValues.queryResultTransferSqlLiteral has cognitive complexity 77 (threshold 15). Drivers by points: if/else 24 (37 pts), boolean chains 23, ternaries 9 (17 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a49bda0ff1cc46e98175c1ac87283a8a4df4beeeeb64fb9f58af0c747da7cf"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferSource.loadQueryResultTransferSourceDdl (cognitive 77): queryResultTransferSource.loadQueryResultTransferSourceDdl has cognitive complexity 77 (threshold 15). Drivers by points: if/else 26 (45 pts), boolean chains 24, ternaries 4 (5 pts), loops 1 (2 pts), error handling 1 (nesting depth added 21). Of this number, 68 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferSource.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef54071d9785ab45651595bc7de3567a2fd0cfc2ace18fa99f0e37c06267e794"}},{"ruleId":"D2","level":"warning","message":{"text":"tableColumnDefinitionPaste.parseTableColumnDefinitions (cognitive 77): tableColumnDefinitionPaste.parseTableColumnDefinitions has cognitive complexity 77 (threshold 15). Drivers by points: if/else 25 (59 pts), boolean chains 15, loops 2, error handling 1 (nesting depth added 34). Of this number, 63 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e045931209b3a44b581385bb5e24aa989b3aedd4d1123f33b02a61777040506"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::persistence::cloud_sync::apply_sync_snapshot_with_selection (cognitive 76): dbx_core::persistence::cloud_sync::apply_sync_snapshot_with_selection has cognitive complexity 76 (threshold 15). Drivers by points: if/else 34 (52 pts), boolean chains 16, loops 4 (6 pts), match/switch 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e7c79967ad552ad6ef9873c33e1880e9f23ecffa3d1e024f1a18fd52bb2cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::parts::plan_entries (cognitive 76): dbx_sql_schema::native_job_changes::dameng::parts::plan_entries has cognitive complexity 76 (threshold 15). Drivers by points: if/else 16 (45 pts), loops 9 (20 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng/parts.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cc9d540d14116cfac8096fc970c3abdc2673e899fa94672e5621ca30bdb56d"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridActions.useDataGridActions.onPaginate (cognitive 76): useDataGridActions.useDataGridActions.onPaginate has cognitive complexity 76 (threshold 15). Drivers by points: if/else 16 (40 pts), ternaries 13 (23 pts), boolean chains 10, loops 1 (3 pts) (nesting depth added 36). Of this number, 67 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd2a01f0a46f540cb49adb50769a86235237b8dda60e0e2935c185e5d20dee7"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.diagnoseMongoCommand (cognitive 76): mongoShellCommand.diagnoseMongoCommand has cognitive complexity 76 (threshold 15). Drivers by points: if/else 26 (40 pts), ternaries 11 (22 pts), boolean chains 13, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafe11aa7a14b2243282a827364124b5463fb8d8bad50662dd268057060574c9"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineDeploy.validateOracleRoutineDeployment (cognitive 76): oracleRoutineDeploy.validateOracleRoutineDeployment has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (35 pts), ternaries 9 (20 pts), boolean chains 17, error handling 2, loops 2 (nesting depth added 26). Of this number, 73 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aa2521e3ca1012788df7e566f0b1bbede12d90367d2c2010c0883de570c33c"}},{"ruleId":"D2","level":"warning","message":{"text":"settingsTransfer.parseSettingsTransferFile (cognitive 76): settingsTransfer.parseSettingsTransferFile has cognitive complexity 76 (threshold 15). Drivers by points: if/else 29 (44 pts), boolean chains 14, ternaries 9 (10 pts), loops 5 (7 pts), error handling 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab624828f9d704dbf849bee80003b6c39cc36b6c045b4373e1b977d60cb46e6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::execute_in_manual_transaction_with_options (cognitive 75): dbx_core::query::execute_in_manual_transaction_with_options has cognitive complexity 75 (threshold 15). Drivers by points: if/else 35 (60 pts), match/switch 3 (8 pts), boolean chains 6, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":7085}}}],"partialFingerprints":{"codehealthFindingId/v1":"934caa5c2364d31348b4154c86b274ecffb40af9539165f1523ec2dd906942aa"}},{"ruleId":"D2","level":"warning","message":{"text":"StarRocksAlter::build (cognitive 75): StarRocksAlter::build has cognitive complexity 75 (threshold 15). Drivers by points: if/else 28 (54 pts), boolean chains 19, loops 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/alter_dialect.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f237b007b44d7ecd4132364ddd0256d1e143462fa94f32ca0921be9aa89cd3a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::native_job_mutation_plan (cognitive 75): dbx_sql_schema::native_job_changes::native_job_mutation_plan has cognitive complexity 75 (threshold 15). Drivers by points: if/else 32 (60 pts), match/switch 4 (9 pts), boolean chains 6 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3296460b0cd83975d580dfad3d5fb66d60e86e3022c3d97ac32df30149796d0"}},{"ruleId":"D2","level":"warning","message":{"text":"DdlBuilder.buildTableDdl (cognitive 75): DdlBuilder.buildTableDdl has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (36 pts), ternaries 8 (20 pts), loops 9 (13 pts), boolean chains 6 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7781237e3941f086a0a49fce7a860aa7eeddbe910cbe10ccace328372159266b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugBuildNativeTypedSignaturePrepared (cognitive 75): main.plDebugBuildNativeTypedSignaturePrepared has cognitive complexity 75 (threshold 15). Drivers by points: if/else 26 (57 pts), loops 6 (12 pts), boolean chains 6 (nesting depth added 37). Of this number, 57 points are the body\u0027s own statements and 18 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":"agents/drivers/oracle-go/pldebug_typed_signature.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96471f5384b0391a0bd86e5ada5a27e447037c76a6c8c5138b7cd8927b15452"}},{"ruleId":"D2","level":"warning","message":{"text":"mysqlGeneratePartitions.constrainMysqlGenerateColumns (cognitive 75): mysqlGeneratePartitions.constrainMysqlGenerateColumns has cognitive complexity 75 (threshold 15). Drivers by points: if/else 25 (45 pts), boolean chains 14, ternaries 5 (11 pts), loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 29). Of this number, 61 points are the body\u0027s own statements and 14 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/mysqlGeneratePartitions.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b720a4f649fb4c5c9318e79ab25a0956d5ceef62ff3bce825a7ef5297a676e15"}},{"ruleId":"D2","level":"warning","message":{"text":"MqttClient::spawn_v4_event_loop (cognitive 74): MqttClient::spawn_v4_event_loop has cognitive complexity 74 (threshold 15). Drivers by points: if/else 16 (64 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MqttClient::spawn_v5_event_loop) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"499b9739d312cd1ef028e08436b1a938b8e497272ae43bcbbb2b0b1fe222c6f4"}},{"ruleId":"D2","level":"warning","message":{"text":"MqttClient::spawn_v5_event_loop (cognitive 74): MqttClient::spawn_v5_event_loop has cognitive complexity 74 (threshold 15). Drivers by points: if/else 16 (64 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MqttClient::spawn_v4_event_loop) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"6718120c17e95a790df9538c21625471ea45f4bd829fa1f6c396f45d4de9fdc5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::scheduler::transition::prepare (cognitive 74): dbx_core::schema::native_jobs::operations::scheduler::transition::prepare has cognitive complexity 74 (threshold 15). Drivers by points: if/else 29 (55 pts), boolean chains 10, loops 5 (8 pts), match/switch 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf462964871965a06ce74c2daa5e8afe64d68b785ea7b4fcfc1e1caba074528"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugObjectConstructors.tokens (cognitive 74): PlDebugObjectConstructors.tokens has cognitive complexity 74 (threshold 15). Drivers by points: if/else 22 (48 pts), boolean chains 16, loops 3 (7 pts), ternaries 1 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugObjectConstructors.java"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"09671f42308e52adc4e5f9c673f2b3bf1ec661231fd46a396ff77f7345a20ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"hoverTableSql.normalizeAlignedSqlWhitespace (cognitive 74): hoverTableSql.normalizeAlignedSqlWhitespace has cognitive complexity 74 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 4 (10 pts), boolean chains 9 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bdf28295133059bd499da36d8e267b0dc0cece9d6f3ba01ef2d9da24e2a7b7"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadObjectGroupFirstPage (cognitive 74): connectionStore.useConnectionStore.loadObjectGroupFirstPage has cognitive complexity 74 (threshold 15). Drivers by points: if/else 31 (42 pts), boolean chains 25, ternaries 5 (6 pts), error handling 1 (nesting depth added 12). Of this number, 25 points are the body\u0027s own statements and 49 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7768}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65629e05ba74c30ae53c52867c4f849ef0d61747ec6863f9fb960c57a1ba357"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_service::import_offline_zip (cognitive 73): dbx_driver_agent::agent_service::import_offline_zip has cognitive complexity 73 (threshold 15). Drivers by points: if/else 24 (53 pts), match/switch 6 (12 pts), loops 6, boolean chains 2 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":3186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85dff85cf54ed79e77047b5385aa66202bd344f9a17e243fe392cf8a0dff64f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_diagnostics::redact_literals (cognitive 73): dbx_sql_core::sql_diagnostics::redact_literals has cognitive complexity 73 (threshold 15). Drivers by points: if/else 14 (43 pts), loops 7 (21 pts), boolean chains 9 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_diagnostics.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae75b9699a49d69111b5f9c18290c9d6e2fd771f15bbac3fe8b0eafec67220b"}},{"ruleId":"D2","level":"warning","message":{"text":"canvasDataGridRenderer.drawCanvasDataGrid::drawCell (cognitive 73): canvasDataGridRenderer.drawCanvasDataGrid::drawCell has cognitive complexity 73 (threshold 15). Drivers by points: ternaries 14 (31 pts), if/else 19 (22 pts), boolean chains 20 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (canvasDataGridRenderer.drawCanvasDataGrid) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb0da0603d7e5073de76216322e10a9e44e1efe4108b58e309e45ba41721f77"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::escape_value_typed (cognitive 72): dbx_core::data::transfer::escape_value_typed has cognitive complexity 72 (threshold 15). Drivers by points: if/else 33 (58 pts), match/switch 5 (9 pts), boolean chains 5 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":3956}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a86e16ad634c4a16640f5b71ef6d99f0a21c89ab3eb1c2fcc894c029bd7127"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_routines::analysis::package::body_pass (cognitive 72): dbx_sql_core::object_source_sql::oracle_routines::analysis::package::body_pass has cognitive complexity 72 (threshold 15). Drivers by points: if/else 28 (61 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8827cdfe7480f40fa31fa88096ae6900a4cd168736bd43fec1f0b35d456a749"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSession.setBreakpoints (cognitive 72): PlDebugSession.setBreakpoints has cognitive complexity 72 (threshold 15). Drivers by points: if/else 13 (31 pts), ternaries 11 (26 pts), boolean chains 11, loops 2 (4 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"756306ef81aed776348ad088d86e8774e5dfee4112e959674a95b1529dcfa7af"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugCompositeOutputTypes (cognitive 72): main.plDebugCompositeOutputTypes has cognitive complexity 72 (threshold 15). Drivers by points: if/else 17 (46 pts), boolean chains 14, loops 4 (8 pts), match/switch 1 (4 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_record_output.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec6e743c877546441b05dd5c5790e74f235ba76856fe10505caaa9d705e0280"}},{"ruleId":"D2","level":"warning","message":{"text":"main.renderXuguPartitionDDL (cognitive 72): main.renderXuguPartitionDDL has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (60 pts), loops 2 (8 pts), boolean chains 4 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":4984}}}],"partialFingerprints":{"codehealthFindingId/v1":"176047084732452aecd89c13889f23a1e9d5eb746390e9f44a8d1350a9db25af"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.preparePastedRows (cognitive 72): useDataGridEditor.useDataGridEditor.preparePastedRows has cognitive complexity 72 (threshold 15). Drivers by points: if/else 29 (44 pts), boolean chains 14, ternaries 6 (9 pts), loops 3 (5 pts) (nesting depth added 20). Of this number, 67 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4931d9d610c4ed42848aabc0f6d5532584afb13c6ada77a22e0fa7c90eb0437"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::sql_file_import::execute_sql_file_paths_inner (cognitive 71): dbx_core::data::sql_file_import::execute_sql_file_paths_inner has cognitive complexity 71 (threshold 15). Drivers by points: if/else 26 (54 pts), match/switch 5 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"7693589bfb44bdd14e768ab68cd1e8baad40dfb1f6599d12016c76d128cf2b21"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::mysql_routine_tokens (cognitive 71): dbx_sql_core::sql::mysql_routine_tokens has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (60 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"08172e3f6d77c09065667c2c5de4d9072e97a844803d54cb95b49acb2c458b4c"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionConfig::connection_url_with_host (cognitive 71): ConnectionConfig::connection_url_with_host has cognitive complexity 71 (threshold 15). Drivers by points: if/else 42 (65 pts), boolean chains 5, match/switch 1 (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"a499ec553727e5d9459dfdfe56e4eb2fdf6d43e4bfbf691d9e48b1e819645622"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.cleanup (cognitive 71): plDebugNativeEntry.cleanup has cognitive complexity 71 (threshold 15). Drivers by points: if/else 33 (58 pts), boolean chains 8, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf67bab554d05585018dd9a17c45083ba5f9e6c2fbef70d1291dc6eb16512eab"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.scheduleCompletionMetadataRefresh (cognitive 71): useQueryEditorCompletion.useQueryEditorCompletion.scheduleCompletionMetadataRefresh has cognitive complexity 71 (threshold 15). Drivers by points: if/else 25 (49 pts), boolean chains 15, ternaries 2 (3 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 27). Of this number, 49 points are the body\u0027s own statements and 22 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"14784c73acd6b3fff5896096f78a86f3c2b925794fc6d0e5d7bc014bf36caa94"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExtractor.useDataGridExtractor.buildRequest (cognitive 71): useDataGridExtractor.useDataGridExtractor.buildRequest has cognitive complexity 71 (threshold 15). Drivers by points: boolean chains 30, ternaries 17 (20 pts), if/else 13 (19 pts), loops 1 (2 pts) (nesting depth added 10). Of this number, 63 points are the body\u0027s own statements and 8 belong to 6 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"888d1442e139816bf8980c8162b76f63d0274a6bca12f0b3ad5ed949624718f4"}},{"ruleId":"D2","level":"warning","message":{"text":"useNavigationTargets.openTableTarget (cognitive 71): useNavigationTargets.openTableTarget has cognitive complexity 71 (threshold 15). Drivers by points: if/else 29 (41 pts), boolean chains 23, error handling 3 (4 pts), ternaries 2 (3 pts) (nesting depth added 14). Of this number, 69 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff96109e49697a1eeaf6643fe324c4cff04dff27e49dc5a9eb9a6be7a40ba7c"}},{"ruleId":"D2","level":"warning","message":{"text":"ai.buildModePromptLines (cognitive 71): ai.buildModePromptLines has cognitive complexity 71 (threshold 15). Drivers by points: ternaries 22 (61 pts), if/else 7 (10 pts) (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e0f0b5d430552b0c0c7087f3b8bd0084e9ffa63a44ce2942b0ead3d76eba58"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlIntentionActions.buildQualifierActions (cognitive 71): sqlIntentionActions.buildQualifierActions has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (40 pts), ternaries 5 (13 pts), loops 3 (10 pts), boolean chains 8 (nesting depth added 37). Of this number, 70 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbeb4ef76ab530b3519a4904dcbdd40139ec79f9dc7cf9392313343bb86afae"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::references::resolve_draft_with_tables (cognitive 70): dbx_core::schema::oracle_routines::references::resolve_draft_with_tables has cognitive complexity 70 (threshold 15). Drivers by points: if/else 21 (47 pts), match/switch 6 (15 pts), boolean chains 7, loops 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/references.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7fc0f6d43d0705a086892a6b055ed237ce5f572cdb4af1c5c49156af018c19"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::execute_batch_request (cognitive 70): DbxMcpServer::execute_batch_request has cognitive complexity 70 (threshold 15). Drivers by points: if/else 25 (37 pts), match/switch 12 (19 pts), boolean chains 8, loops 3 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"97abdeaa031fd270884b35086ae0e80efac38e32ada83d02554fa0b99623581f"}},{"ruleId":"D2","level":"warning","message":{"text":"EwkbWktDecoder.parseGeometry (cognitive 70): EwkbWktDecoder.parseGeometry has cognitive complexity 70 (threshold 15). Drivers by points: if/else 21 (45 pts), loops 8 (17 pts), ternaries 2 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"2641f72d769b5e9f0e91fc18ba39c1d33ef4b2756f5e5a502525573aab08ca24"}},{"ruleId":"D2","level":"warning","message":{"text":"server.readExactTriggerRows (cognitive 70): server.readExactTriggerRows has cognitive complexity 70 (threshold 15). Drivers by points: if/else 23 (52 pts), boolean chains 11, match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/trigger_metadata.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8eef33f73099dfc05594dd99968ceff520eb5ea01e3a78ad9aa258cd2f6359"}},{"ruleId":"D2","level":"warning","message":{"text":"oceanbaseTableClone.buildOceanbaseTableClone (cognitive 70): oceanbaseTableClone.buildOceanbaseTableClone has cognitive complexity 70 (threshold 15). Drivers by points: if/else 27 (37 pts), boolean chains 20, ternaries 6 (10 pts), loops 3 (nesting depth added 14). Of this number, 54 points are the body\u0027s own statements and 16 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseTableClone.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae34d468bd6ade51f6f86d454886f07a2be446bb11e6b6522edb9014cf24ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlDatabaseLinks.collectSqlDatabaseLinkStarts (cognitive 70): sqlDatabaseLinks.collectSqlDatabaseLinkStarts has cognitive complexity 70 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 25, loops 4 (9 pts), ternaries 2 (nesting depth added 25). Of this number, 64 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDatabaseLinks.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"076273a4db2af8b8b48de723412e3cc99bb943d7e7114a1b705317cdf3590e48"}},{"ruleId":"D2","level":"warning","message":{"text":"createMockHost.bridge (cognitive 70): createMockHost.bridge has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 21, ternaries 6 (13 pts), other 3, match/switch 1 (nesting depth added 22). Of this number, 58 points are the body\u0027s own statements and 12 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e205d02013a393c260b27af08d1b7b47f68d72fbb906b6d326ff278f3ebfc7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::plan::package::prepare_package_drafts (cognitive 69): dbx_core::schema::oracle_routines::plan::package::prepare_package_drafts has cognitive complexity 69 (threshold 15). Drivers by points: if/else 22 (57 pts), boolean chains 10, loops 2 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan/package.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"727e6313e2f5321477c4276e15254bade1253be6fe1c47feb729905027e39f26"}},{"ruleId":"D2","level":"warning","message":{"text":"DeferredLobValues.readAhead (cognitive 69): DeferredLobValues.readAhead has cognitive complexity 69 (threshold 15). Drivers by points: if/else 16 (36 pts), ternaries 7 (15 pts), boolean chains 6, error handling 2 (6 pts), loops 4 (6 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5677f81e35de2bb28301264e308d726d2263f44f43bb79a2e399c02956c1e75"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugCollectionInitializer.collection (cognitive 69): plDebugCollectionInitializer.collection has cognitive complexity 69 (threshold 15). Drivers by points: if/else 28 (55 pts), loops 5 (9 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_collection_initialize.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd4957f369267771fa43835a10e90a9e166b9e21e846560ef0ea747e72930b9"}},{"ruleId":"D2","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.submitTableExports (cognitive 69): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.submitTableExports has cognitive complexity 69 (threshold 15). Drivers by points: if/else 24 (44 pts), boolean chains 11, ternaries 4 (8 pts), error handling 2 (4 pts), loops 2 (nesting depth added 26). Most of this is not in the body itself: 6 of the 69 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 720, 744, 738, \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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e660e450da1351fca21c0694aa67e74c86a473ae75e4dca3545983515b07d46"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.getSqlCompletionContext (cognitive 69): sqlCompletion.getSqlCompletionContext has cognitive complexity 69 (threshold 15). Drivers by points: boolean chains 35, ternaries 16 (18 pts), if/else 5 (10 pts), loops 4 (6 pts) (nesting depth added 9). Of this number, 68 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3053}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9910e6e1dfe496cabf5177462b981384d7049515ac16b0ee5fb8179b1e71b07"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTypeManagement.executeOracleTypeManagement (cognitive 69): oracleTypeManagement.executeOracleTypeManagement has cognitive complexity 69 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 17, error handling 6 (12 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 24). Of this number, 67 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"e914f06458183770ae531d4e83caeaac992de07b5e533f243ea9c5739da35886"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_openai (cognitive 68): dbx_ai_provider::ai::stream_openai has cognitive complexity 68 (threshold 15). Drivers by points: if/else 13 (59 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25a960262b0fb0ee04f1fca5a206954fe1026b9244808802a0e1cd39fe79778"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::build_data_grid_save_statements (cognitive 68): dbx_sql_data::data_grid_sql::build_data_grid_save_statements has cognitive complexity 68 (threshold 15). Drivers by points: if/else 28 (48 pts), boolean chains 9, loops 4 (7 pts), match/switch 1 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"c164e403a7003aaa4f2e916c835db93ccc5036e12723f9cff89913feffcd6842"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::diff_columns_with_identifier_options (cognitive 68): dbx_sql_schema::schema_diff::diff_columns_with_identifier_options has cognitive complexity 68 (threshold 15). Drivers by points: if/else 20 (52 pts), loops 5 (10 pts), boolean chains 6 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e11e6e0981ec3e9584351622b7a8fb609f55eda14b52b765ac6b22c8ac6c916"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::indexes::build_index_sql (cognitive 68): dbx_sql_schema::table_structure_sql::indexes::build_index_sql has cognitive complexity 68 (threshold 15). Drivers by points: if/else 22 (62 pts), boolean chains 5, loops 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/indexes.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f006d63ec3cc16d2d0b7235f23d97fb7c5b571539bebc6b7bcaa3dfbc2972b3"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTemporalJson.temporal (cognitive 68): PlDebugTemporalJson.temporal has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 16, ternaries 7 (15 pts), loops 2 (3 pts), error handling 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTemporalJson.java"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f7c85eb867c256ced28155dee05fe632c24f587076678b68e9140517ec1a80"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridInsertPaste.splitTopLevelStatements (cognitive 68): dataGridInsertPaste.splitTopLevelStatements has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (45 pts), boolean chains 9, ternaries 3 (9 pts), loops 2 (5 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c914be03c03e883ec1ac28984bf16524a4844fc5cee29a74069ed67595fe99"}},{"ruleId":"D2","level":"warning","message":{"text":"McpAccessPolicy::to_v1 (cognitive 67): McpAccessPolicy::to_v1 has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (38 pts), boolean chains 15, match/switch 5 (11 pts), loops 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/mcp_access.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12faf2e9158674cc59b5bdab5c1b010e38a7f5114a8b90ec776dabcc5b32bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::collect_snapshot_with_options (cognitive 67): dbx_core::schema::oracle_routines::collect_snapshot_with_options has cognitive complexity 67 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 6 (14 pts), loops 5 (10 pts), boolean chains 7 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"243652bc1d6a8cf13c546b73dd6c4c5fc77e84fafeb6d1f2e814e4e459f58456"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeSourceTokens (cognitive 67): main.plDebugNativeSourceTokens has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (52 pts), boolean chains 7, loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b87fb717349a372fc58e71291c94f741f3c90cfe90a61756d1afd5bce879ace"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.getSqlLexicalContext (cognitive 67): sqlCompletion.getSqlLexicalContext has cognitive complexity 67 (threshold 15). Drivers by points: if/else 29 (54 pts), boolean chains 12, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c354eac919f6f92b533a18679de278eedb62cadf95c6d87ba61fd41cdc26df2"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.ensureConnected (cognitive 67): connectionStore.useConnectionStore.ensureConnected has cognitive complexity 67 (threshold 15). Drivers by points: if/else 31 (48 pts), boolean chains 15, error handling 3 (4 pts) (nesting depth added 18). Of this number, 48 points are the body\u0027s own statements and 19 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5992}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfc1a8983502f7f8d41f533bf9cb291d67251a00eba7f569516a60888f04982"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.listCompletionTables (cognitive 67): connectionStore.useConnectionStore.listCompletionTables has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (36 pts), error handling 5 (21 pts), ternaries 4 (6 pts), boolean chains 4 (nesting depth added 36). Most of this is not in the body itself: 5 of the 67 points are its own statements and the rest belongs to one function literal inside it that branches (line 10381). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ab6b13bbad5b79d198b6bb55e209351f6332febbe7afbd860b8c8f1ca49730"}},{"ruleId":"D2","level":"warning","message":{"text":"TableRestoreFilter::classify (cognitive 66): TableRestoreFilter::classify has cognitive complexity 66 (threshold 15). Drivers by points: if/else 30 (50 pts), boolean chains 11, loops 2 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import/table_restore.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed33c39188b4b0e4fa443fa1fa87854742d3d7c900fc585e009c11380c0a37c3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::ssh_tunnel::connect_and_authenticate (cognitive 66): dbx_drivers::db::ssh_tunnel::connect_and_authenticate has cognitive complexity 66 (threshold 15). Drivers by points: if/else 26 (44 pts), match/switch 6 (14 pts), boolean chains 7, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd01ab46bad2f809148b7a41b790cb1c4cb8410d3ed2d5db48a422cc77e548a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::prepare_schema_diff (cognitive 66): dbx_sql_schema::schema_diff::prepare_schema_diff has cognitive complexity 66 (threshold 15). Drivers by points: if/else 26 (47 pts), loops 5 (9 pts), boolean chains 8, match/switch 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f3a4e906d2c5abcac0d0cc57271aa715db3b05a0151635cd82e5ba50435280"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugLegacyArgumentTree (cognitive 66): main.plDebugLegacyArgumentTree has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 5 (9 pts), boolean chains 8 (nesting depth added 32). Of this number, 44 points are the body\u0027s own statements and 22 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_arguments.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb3ad33b341855ddf2ae938cf7ead16e0216a7a8906449a6a791976afdb036a"}},{"ruleId":"D2","level":"warning","message":{"text":"ai.buildAiContext (cognitive 66): ai.buildAiContext has cognitive complexity 66 (threshold 15). Drivers by points: if/else 13 (30 pts), ternaries 9 (16 pts), boolean chains 8, loops 4 (8 pts), error handling 2 (4 pts) (nesting depth added 30). Of this number, 61 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc77ee9e3e7d7d2be0ce4a4279b12286d037a0946516d41a26e9df8716f1600"}},{"ruleId":"D2","level":"warning","message":{"text":"ddlDisplay.collectDdlStatementNameTargets (cognitive 66): ddlDisplay.collectDdlStatementNameTargets has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (51 pts), boolean chains 7, loops 3 (5 pts), ternaries 1 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fea1fa82391911d994caa8b4a01a3ed71f1072b1bcd10d4e277606c623dc4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"tableImport.importDataTypeForDatabase (cognitive 66): tableImport.importDataTypeForDatabase has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (50 pts), boolean chains 15, match/switch 1 (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableImport.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc83a9409b6b6851eecc6e886a9f3e9d321adf3851b78432442ff61a5909038e"}},{"ruleId":"D2","level":"warning","message":{"text":"tableSelectSql.qualifiedTableName (cognitive 66): tableSelectSql.qualifiedTableName has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (34 pts), ternaries 8 (17 pts), boolean chains 15 (nesting depth added 23). Of this number, 64 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb8af27ed9ce4d7d1cd5b123d3dc2610830270deb30a1757457a33e291cd256"}},{"ruleId":"D2","level":"warning","message":{"text":"server.createMockHost.bridge (cognitive 66): server.createMockHost.bridge has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 19, ternaries 6 (14 pts), match/switch 1 (nesting depth added 23). Of this number, 54 points are the body\u0027s own statements and 12 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"443325bcc391299e0bfdaeb5a7675a921345bd826bdaa4954a5e57699986f3ae"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::get_columns_core_for_session_inner_with_pool (cognitive 65): dbx_core::schema::get_columns_core_for_session_inner_with_pool has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (40 pts), match/switch 7 (21 pts), boolean chains 4 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":9821}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35ba7130c872969e2b071fbed73a3b4fb1c2adcab975e47ed2cba5aa0c91837"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::scan_keys_batch_inner (cognitive 65): dbx_driver_redis::scan_keys_batch_inner has cognitive complexity 65 (threshold 15). Drivers by points: if/else 18 (35 pts), loops 5 (20 pts), match/switch 2 (7 pts), boolean chains 3 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacc005f3a4e6173743d6538ca73b43405fd82bafdf48f200b20ff31382df33a"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::run_product_tool (cognitive 65): DbxMcpServer::run_product_tool has cognitive complexity 65 (threshold 15). Drivers by points: if/else 29 (48 pts), match/switch 8 (11 pts), boolean chains 6 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"21070c939773ddfb6df6ad0fda32cde26a6d8a2dd2b28d6be7742e03bed12468"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::consume_postgres_cast_type (cognitive 65): dbx_sql_schema::schema_diff::consume_postgres_cast_type has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (55 pts), match/switch 2 (6 pts), boolean chains 2, loops 2 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dbd155e619141f56e4d569d328d6c0712013e3568fcaaa6f4ed5743153297d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_alter::build_postgres_like_existing_column_sql (cognitive 65): dbx_sql_schema::table_structure_sql::column_alter::build_postgres_like_existing_column_sql has cognitive complexity 65 (threshold 15). Drivers by points: if/else 29 (52 pts), match/switch 3 (8 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"751d1f6be5d1d3a268562c8401e37723f10afa61b7b232dc2c08e1bffcba200b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::routes::mongodb_dump::receive_source (cognitive 65): dbx_web::routes::mongodb_dump::receive_source has cognitive complexity 65 (threshold 15). Drivers by points: if/else 21 (51 pts), boolean chains 7, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_dump.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e46c0d56a13fe3d5c5c57db6665eceb5fa2b776eb4656115ff864ada5cedab"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.start (cognitive 65): plDebugNativeEntry.start has cognitive complexity 65 (threshold 15). Drivers by points: if/else 38 (55 pts), boolean chains 9, match/switch 1 (nesting depth added 17). Of this number, 61 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0342b801abe2c2861904ae5a936cd070dc5b1a8b40e6b3ff9500cae5b6cd52"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.mysqlRoutineTokens (cognitive 65): sqlStatementRanges.mysqlRoutineTokens has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (56 pts), boolean chains 8, loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"03504ac7c1ee562c7a11801699d5a6845cd7fd33c63af53f767a4e47d2053c45"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.applyCellValueToItem (cognitive 65): useDataGridEditor.useDataGridEditor.applyCellValueToItem has cognitive complexity 65 (threshold 15). Drivers by points: if/else 33 (58 pts), ternaries 3 (4 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b465bf6d093364d2dc13ab119b346087264ac36032f0994b821ff7426a67da00"}},{"ruleId":"D2","level":"warning","message":{"text":"cellValueTransform.transformCellValue (cognitive 65): cellValueTransform.transformCellValue has cognitive complexity 65 (threshold 15). Drivers by points: ternaries 13 (30 pts), if/else 12 (25 pts), boolean chains 6, error handling 2 (3 pts), match/switch 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellValueTransform.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e21484fa2cdd9358be883bdf54e8a819f77e9feffed169a0fcb6502e23df1c3"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTriggerStructurePlan.prepareOracleTriggerStructurePlan (cognitive 65): oracleTriggerStructurePlan.prepareOracleTriggerStructurePlan has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 16, ternaries 5 (11 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerStructurePlan.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa8258261a80669112f38178ef83d369c618fcfe36b92d0a44879b2099fb00d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::rename_tables_to_backup (cognitive 64): dbx_core::data::transfer::rename_tables_to_backup has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (46 pts), loops 7 (14 pts), match/switch 1 (4 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":12689}}}],"partialFingerprints":{"codehealthFindingId/v1":"67175c9ac06e3166270a34aa478d738b21ab036be82d01b242314a00430d4b78"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::completion_assistant_fallback_core (cognitive 64): dbx_core::schema::completion_assistant_fallback_core has cognitive complexity 64 (threshold 15). Drivers by points: if/else 23 (53 pts), loops 3 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e5d75778e81ae8abdb51171f6142f622016527a98652b6bad6159c43af0bea"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::normalize_sqlite_sql (cognitive 64): dbx_drivers::db::sqlite::normalize_sqlite_sql has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 6 (18 pts), boolean chains 9 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2780}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c36684698c8b8b1e5744a32b0ae6151b77679e75f1c0d6a11677a306d20a70"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseAuthorizationPlan.buildGrantAuthorizationPlan (cognitive 64): databaseAuthorizationPlan.buildGrantAuthorizationPlan has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 13 (38 pts), if/else 8 (19 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"916d7744cc8f4a6ddbe45b81a1cbb87202c9a9ee33f463ca66120bdbf4fdc59a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::build_export_insert_statements_excluding_with_dialect (cognitive 63): dbx_core::data::database_export::build_export_insert_statements_excluding_with_dialect has cognitive complexity 63 (threshold 15). Drivers by points: if/else 34 (49 pts), boolean chains 11, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a3df50b0b67eb9f67e749d7e00bff3b57fbf5d2851ece1c3200d006c5264a1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::observation::compare (cognitive 63): dbx_core::schema::native_jobs::operations::observation::compare has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 17, loops 5 (11 pts), match/switch 4 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/observation.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8570ac959de1aaee81ee1cbd0e0a5247287b14a6903d26fb427ebf9ff9a67900"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::extract_oracle_triggers_with_table_owner (cognitive 63): dbx_sql_core::object_source_sql::oracle_indexes::extract_oracle_triggers_with_table_owner has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (41 pts), boolean chains 11, loops 5 (11 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc7a87aefb33decd726775d179a70bb0940fd06ff33908e6626c259b7a5ee96"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_analysis::spark_datasource_clause_removals (cognitive 63): dbx_sql_core::sql_analysis::spark_datasource_clause_removals has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (57 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c010bfc3188d9dde3affc4e0856620702a7df680ee17a9b66db2b3e84219c0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::generate_permission_sync_sql (cognitive 63): dbx_sql_schema::schema_diff::generate_permission_sync_sql has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (60 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b5bf56e55bf18c7d513c762cefd42925d9d9bd8dfacdf2c057ab537f6a4b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"etcdSession.history (cognitive 63): etcdSession.history has cognitive complexity 63 (threshold 15). Drivers by points: if/else 29 (52 pts), boolean chains 5, loops 3 (4 pts), match/switch 2 (nesting depth added 24). Of this number, 27 points are the body\u0027s own statements and 36 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":"agents/drivers/etcd-go/history.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb63842c318f68b7e31bf74d9c345e7c0c5fba16e6760c6844db8a5d5265c56"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.applyNativeBreakpointRules (cognitive 63): plDebugNativeEntry.applyNativeBreakpointRules has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (53 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 33). Of this number, 58 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint_rules.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e50469bc63df0bef28ec31fa2e50803669304f0881a4042a4a0e03f9a7e993"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.parseExplainLikePrefixAt (cognitive 63): sqlStatementRanges.parseExplainLikePrefixAt has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (49 pts), boolean chains 7, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 30). Of this number, 54 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7387a8f5f07a79ca34f6149a5b84a4b4b57cb6d8e0c9360aabfe28b2099c741"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTriggerPlan.prepareOracleTriggerPlan (cognitive 63): oracleTriggerPlan.prepareOracleTriggerPlan has cognitive complexity 63 (threshold 15). Drivers by points: if/else 24 (41 pts), boolean chains 14, ternaries 3 (5 pts), error handling 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8753d61710f589ad2184795ad01f5772b0068de95c5df173e1acd843d7da20f6"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadAllObjectGroupChildren (cognitive 63): connectionStore.useConnectionStore.loadAllObjectGroupChildren has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 21, ternaries 2 (6 pts), error handling 1, loops 1 (nesting depth added 20). Of this number, 55 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8362}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf08e900f209fadbff63d8b84df0df5daf6902e1d8c82f4214d19c0c58db5f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::oracle_plsql_tokens_fallback (cognitive 62): dbx_sql_core::sql::oracle_plsql_tokens_fallback has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 6 (16 pts), boolean chains 5 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4695}}}],"partialFingerprints":{"codehealthFindingId/v1":"25721b11b054f31b520fc0fcfaac625ac89e8968fc895b6b95546f1ed32e75f2"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.splitStatementRangeAtSoftStarts (cognitive 62): sqlStatementRanges.splitStatementRangeAtSoftStarts has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 18, ternaries 2 (3 pts), loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5edcd4b2102584299a937604863aef223a0081daaceb55190d0e4932cdf413"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseTableEmpty.buildLayers (cognitive 62): databaseTableEmpty.buildLayers has cognitive complexity 62 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 9 (17 pts), ternaries 6 (13 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 31). Of this number, 54 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/databaseTableEmpty.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be1153edee3897fb48cac7897da0715e6d6419229d1e7a269ab74c48fab0c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"cypherFormatter.tokenizeCypher (cognitive 62): cypherFormatter.tokenizeCypher has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (40 pts), loops 4 (10 pts), boolean chains 9, ternaries 1 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"60876fd3622fe53f0351ad1a619fe06d89e74c6dc3ecec96cca75c33086e8ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::remove_stale_connection_pool (cognitive 61): AppState::remove_stale_connection_pool has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 25 (53 pts), if/else 6 (8 pts) (nesting depth added 30). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":5555}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95800467445a973d67ab7ac6850220fc085bdef1b080ca935e222fbbfa5b35b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::execute_result_sets_with_text_protocol_on_conn (cognitive 61): dbx_driver_mysql::mysql::execute_result_sets_with_text_protocol_on_conn has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (53 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1180a5e0cf4214748717cbf9240a5a167f844e7140891daf042bf46c031afb17"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::indexes::build_create_index_statements (cognitive 61): dbx_sql_schema::table_structure_sql::indexes::build_create_index_statements has cognitive complexity 61 (threshold 15). Drivers by points: if/else 41 (43 pts), boolean chains 14, match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/indexes.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c883557205fa168ada3cdc422b46f4dcbcf9ecaeb9f188b4ac10d2197f6ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"Db2ExplainPlan.singleQuery (cognitive 61): Db2ExplainPlan.singleQuery has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 4 (11 pts), boolean chains 9, ternaries 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4588ef061ebec27c5acc4718708ae892b843c3e4084725138dae6ad0646ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseWKBGeometry (cognitive 61): main.parseWKBGeometry has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (40 pts), loops 6 (12 pts), boolean chains 8, match/switch 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e1d34db94e57a649a586416aa6b1769e78945ffe8b01af418a284ae886345b"}},{"ruleId":"D2","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportTableData (cognitive 61): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportTableData has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 21, ternaries 7 (10 pts), error handling 1 (nesting depth added 12). Of this number, 40 points are the body\u0027s own statements and 21 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd8bc9c992c63226f93770aaf408a81184e246e0f1b97a392bc2a54dde7d97b"}},{"ruleId":"D2","level":"warning","message":{"text":"db2ExplainPlan.parseDb2ExplainText (cognitive 61): db2ExplainPlan.parseDb2ExplainText has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (30 pts), ternaries 7 (17 pts), loops 6 (7 pts), boolean chains 6, error handling 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/db2ExplainPlan.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc8e2c27e1c67544885e05bf337a3db9bd00a745fa6d574f0f3abca42882925"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.collectInnermostObjectKeys (cognitive 61): mongoCompletion.collectInnermostObjectKeys has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (46 pts), boolean chains 7, ternaries 2 (7 pts), loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"95943cc260831a14b91709a225e313d39971b5feda7be30c2e8d812d7d2f34c3"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.mongoTopLevelCommandLineStarts (cognitive 61): mongoShellCommand.mongoTopLevelCommandLineStarts has cognitive complexity 61 (threshold 15). Drivers by points: if/else 21 (43 pts), boolean chains 16, loops 1, ternaries 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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f77055aad605837f373160b10a0fb6ea938912985c20d40058aef01445b68f5"}},{"ruleId":"D2","level":"warning","message":{"text":"cypherReadOnly.isProvenReadOnlyCypher (cognitive 61): cypherReadOnly.isProvenReadOnlyCypher has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (36 pts), loops 5 (13 pts), boolean chains 12 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherReadOnly.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ce6be065961bc1109c0cc95889ecb4c96dfbbd87d5821399cb2b653078e1a8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::build_gemini_contents (cognitive 60): dbx_ai_provider::ai::build_gemini_contents has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (46 pts), loops 3 (11 pts), boolean chains 3 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":5001}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ad47ee9b55821717159f68825ad41df259446264b8ac3f319204fd0610b9b1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::tokenize_entry (cognitive 60): dbx_drivers::db::sqlite::tokenize_entry has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (43 pts), loops 5 (13 pts), boolean chains 4 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4e777108d55812e8485bde05a389dd845fcd420861d342bd72f2e24e834a85"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::rebase_oracle_trigger_ddl (cognitive 60): dbx_sql_core::object_source_sql::oracle_indexes::rebase_oracle_trigger_ddl has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 6 (15 pts), boolean chains 10 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d0dff5ae663c08c853921a45179d245d400b793e855fd9fc1759a6ea5fc57b"}},{"ruleId":"D2","level":"warning","message":{"text":"SPNEGORoundTripper.RoundTrip (cognitive 60): SPNEGORoundTripper.RoundTrip has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (55 pts), boolean chains 4, loops 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/gosasl/http_spnego.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"758c86293236d8c5dc5e4e77eb80a9bd9e58fd6b2e7d5cd06f7b9f461209961d"}},{"ruleId":"D2","level":"warning","message":{"text":"documentStoreProvider.rewriteUnsafeIntegerTokens (cognitive 60): documentStoreProvider.rewriteUnsafeIntegerTokens has cognitive complexity 60 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 5 (16 pts), boolean chains 4, error handling 1 (4 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"965af0b84bedc0eba9969fb25fd8d53eec4ace3f4dc4fee5f2570ffd31ec8d80"}},{"ruleId":"D2","level":"warning","message":{"text":"regexGenerate.parseEscape (cognitive 60): regexGenerate.parseEscape has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (29 pts), ternaries 13 (28 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4824e8a3c0f26ce3002cbce7a5d31d6978b1ee1c2025550fb68e0e9e84f5c0"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDiff.stripSqlCommentsAndStringLiterals (cognitive 60): schemaDiff.stripSqlCommentsAndStringLiterals has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (46 pts), ternaries 2 (7 pts), boolean chains 6, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcd71f109ea061968130d1fb2213f4e3555c34e822f27f5d3411fa636407387"}},{"ruleId":"D2","level":"warning","message":{"text":"aggregateCombinators.buildCombinatorSequences (cognitive 60): aggregateCombinators.buildCombinatorSequences has cognitive complexity 60 (threshold 15). Drivers by points: if/else 8 (42 pts), loops 7 (18 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/clickhouse/aggregateCombinators.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c72c4271214651d7e0905fb1ff5ee039424321326212c4252e68cbdcb2eaa8"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.refreshTreeNode (cognitive 60): connectionStore.useConnectionStore.refreshTreeNode has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 10, loops 2 (8 pts), ternaries 3 (6 pts), error handling 1 (nesting depth added 24). Of this number, 56 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9091}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79fd98eec395260df0b47f2e260a4b063ba45a914eb83dd22609f869b959f74"}},{"ruleId":"D2","level":"warning","message":{"text":"DriversClient.DriversClient (cognitive 60): DriversClient.DriversClient has cognitive complexity 60 (threshold 15). Drivers by points: ternaries 18 (51 pts), boolean chains 29, if/else 16 (25 pts), loops 5 (7 pts), error handling 2 (3 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (DriversClient.DriversClient::fetchBundlePackage) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d65a56cffa606fd341797bd59d3e07a1770c96a4a9fa73b581717f484102cd"}},{"ruleId":"D2","level":"warning","message":{"text":"installBridge (cognitive 60): installBridge has cognitive complexity 60 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 17, loops 7 (12 pts), error handling 2 (3 pts), ternaries 3 (nesting depth added 9). None of this is in the body itself: all 60 points belong to 53 function items inside it that branch (a function literal at line 171, stream::start::onEvent, applyTheme, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/browser-bridge.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd28cc875cc7ab9a939af4c43b67a714729b030aefb26b38a043eb314c40122b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::query_result_export::try_export_mysql_query_result_stream (cognitive 59): dbx_core::data::query_result_export::try_export_mysql_query_result_stream has cognitive complexity 59 (threshold 15). Drivers by points: if/else 36 (47 pts), match/switch 4 (6 pts), boolean chains 4, loops 2 (nesting depth added 13). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6e5d140c28b84767b29c75f393900dde81d581ea48991bb251cd19859e12ef"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::xugu_objects::prepare (cognitive 59): dbx_core::data::transfer::xugu_objects::prepare has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (48 pts), loops 4 (8 pts), boolean chains 2, match/switch 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b538e8161176b546e835bb69195e079b93fd10f04cb80d4d77eb39392b97d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_data::describe (cognitive 59): dbx_core::schema::oracle_type_data::describe has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (41 pts), boolean chains 12, loops 4 (6 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d47e7b3f922c43c79c4aa8401cf1e284a6c64e4714e6c873a278341a55b8c6"}},{"ruleId":"D2","level":"warning","message":{"text":"BlobBoundStatement.scanSql (cognitive 59): BlobBoundStatement.scanSql has cognitive complexity 59 (threshold 15). Drivers by points: ternaries 7 (26 pts), if/else 9 (19 pts), boolean chains 7, loops 3 (7 pts) (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/BlobBoundStatement.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa27ffe547f772d7521214c1ac9c09a17aac5b6b049eea126ea984f58fac36f"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.listObjects (cognitive 59): DbxJdbcPlugin.listObjects has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 13, error handling 3 (7 pts), ternaries 3 (7 pts), loops 3 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"592b2745f8fb0e49a101de024a8fbb39b1d488933ee3664cdefd32616cbcb779"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeCallMatches (cognitive 59): main.plDebugNativeCallMatches has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (36 pts), boolean chains 14, loops 6 (9 pts) (nesting depth added 20). Of this number, 58 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b2832335cce316fb0014a913f8a1eed362dd3a2e775928af81cf248ab4eeac"}},{"ruleId":"D2","level":"warning","message":{"text":"server.plDebugProbeOnConnection (cognitive 59): server.plDebugProbeOnConnection has cognitive complexity 59 (threshold 15). Drivers by points: if/else 27 (36 pts), boolean chains 12, loops 8 (11 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_probe.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfeda24e5cb8e3d5ede7e533668f77c702fb358f59f26bf070220ad1697e9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"jdbcProperties.parseJdbcProperties (cognitive 59): jdbcProperties.parseJdbcProperties has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 7 (16 pts), boolean chains 8, ternaries 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/jdbcProperties.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"429fd837c48d4d06766f73eef35d16965ed5c316965b607b7357d390703712ae"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::pl_debug_operate_submission_core (cognitive 58): dbx_core::query::pl_debug::pl_debug_operate_submission_core has cognitive complexity 58 (threshold 15). Drivers by points: if/else 28 (38 pts), boolean chains 18, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f14e4693569159e1be62afac8983abfb90f5963a8eee2685e433a16827083e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_offline_export::append_jre_tree_with_limits (cognitive 58): dbx_driver_agent::agent_offline_export::append_jre_tree_with_limits has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (45 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc33d4d694e2fdcdcf9cb3c1bb066048eaa819f39fa668ef306976ecedb7430a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_elasticsearch::parse_aggregations (cognitive 58): dbx_driver_elasticsearch::parse_aggregations has cognitive complexity 58 (threshold 15). Drivers by points: if/else 11 (36 pts), loops 5 (15 pts), match/switch 2 (7 pts) (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":3200}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d480856355d59c3130d18b27263c0b48e639ee5a6a3b37a6965e616b69edce"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::cypher_read_only::is_proven_read_only_cypher (cognitive 58): dbx_sql_core::cypher_read_only::is_proven_read_only_cypher has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 5 (13 pts), boolean chains 11, match/switch 1 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/cypher_read_only.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a43bdf60fe0de7bc7dff34ddbb3ac01a8e59dbcf3f010dd0c420066dce11a1d"}},{"ruleId":"D2","level":"warning","message":{"text":"server.buildCustomTypeDDL (cognitive 58): server.buildCustomTypeDDL has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 12, loops 4 (8 pts), match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f7775291e8eef635128a9a34e15630aedf1c11e08f8fd62f282b00e16ae61e"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.readNativeValues (cognitive 58): plDebugNativeEntry.readNativeValues has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27 (44 pts), boolean chains 13, loops 1 (nesting depth added 17). Of this number, 46 points are the body\u0027s own statements and 12 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":"agents/drivers/oracle-go/pldebug_frame_value.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2206aa41cd2ebafac75e50adfbaf48524dcea87cfd7bf4363febe5d20c592921"}},{"ruleId":"D2","level":"warning","message":{"text":"main.ordinaryProxyMessage (cognitive 58): main.ordinaryProxyMessage has cognitive complexity 58 (threshold 15). Drivers by points: if/else 26 (42 pts), boolean chains 9, loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 19). Of this number, 54 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/proxy.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed734ee29a3e6680550e0451183203e3151251c0de35c056a888395e4c9702ad"}},{"ruleId":"D2","level":"warning","message":{"text":"main.buildCustomTypeDDL (cognitive 58): main.buildCustomTypeDDL has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 12, loops 4 (8 pts), match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41c5cd8a01fecd1f9e774140ca8580eea1917cc3cf67520fc3a3a0d6b35c329"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridLargeValues.useDataGridLargeValues.hydrateVisibleLargeValuePreviews (cognitive 58): useDataGridLargeValues.useDataGridLargeValues.hydrateVisibleLargeValuePreviews has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 12, loops 5 (7 pts), ternaries 1 (2 pts) (nesting depth added 17). Of this number, 57 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e62ac0e86733db38e5280fac2b67746bc58dd0ea729d5b29b1a3295ca1d6f39"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridInsertPaste.readTableReferenceToken (cognitive 58): dataGridInsertPaste.readTableReferenceToken has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (43 pts), loops 4 (10 pts), boolean chains 5 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86024dd3d6bc94460d57daf525d8e4ce5ce86808a8af0082140896f50caefcb"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarActiveTabTarget.activeTabSidebarTarget (cognitive 58): sidebarActiveTabTarget.activeTabSidebarTarget has cognitive complexity 58 (threshold 15). Drivers by points: if/else 36 (46 pts), boolean chains 9, ternaries 2 (3 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9308a91dd958eb90379b1ef7c63504912e110f390757ab228f7c3b258a50b196"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_responses_with_tools (cognitive 57): dbx_ai_provider::ai::stream_responses_with_tools has cognitive complexity 57 (threshold 15). Drivers by points: if/else 11 (46 pts), match/switch 2 (7 pts), loops 2 (4 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4842}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad28822bb1964883360a7710b9ef328a39d3505a099b154a3c21c9a4c78abdd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::request_large_value_internal (cognitive 57): dbx_core::query::request_large_value_internal has cognitive complexity 57 (threshold 15). Drivers by points: if/else 23 (50 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":3540}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b18226b608b12036addc2169a54adfebe4e1cb21fa9db648346483d8ed24fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"Analysis::parse (cognitive 57): Analysis::parse has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (45 pts), boolean chains 7, loops 4 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400e10e509f506fafae0bbe4b891cfa42ad040c76b91a3b306f707e1edecfc0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::connection::connect_db_inner (cognitive 57): dbx::commands::connection::connect_db_inner has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (39 pts), match/switch 5 (12 pts), boolean chains 6 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/connection.rs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea07f444e8a02f93da7cb4baf94304d5e1f62e3ee3b7c04f0349caef699433c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.rewriteOracleSelectItems (cognitive 57): main.rewriteOracleSelectItems has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (46 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5681}}}],"partialFingerprints":{"codehealthFindingId/v1":"9190de9049a6c34f0850219d235b73345db1768aa0e99e2bf77e9c3cfc66b5b6"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionPickerTree.buildConnectionPickerRows (cognitive 57): connectionPickerTree.buildConnectionPickerRows has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (46 pts), loops 5 (7 pts), boolean chains 4 (nesting depth added 30). Most of this is not in the body itself: 14 of the 57 points are its own statements and the rest belongs to 3 function items inside it that branch (visitSearch, visitTree, subtreeHasConnection). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionPickerTree.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6cd8040c1318664d4f0a01d95c9f462ca1e86cc39377d35585e41c79aced51"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrl.parseConnectionUrl (cognitive 57): connectionUrl.parseConnectionUrl has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 20 (28 pts), if/else 16, boolean chains 12, error handling 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f015b95a67c5d6cb6f7634e15d20108fc26b1473851942e1076656f9dc30f2"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarActiveTabTarget.matchesTarget (cognitive 57): sidebarActiveTabTarget.matchesTarget has cognitive complexity 57 (threshold 15). Drivers by points: boolean chains 31, if/else 23 (26 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9050fe72544b1a04fededafa9d5940a63fa59bf7c6233492695224019d77d21e"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectComplexTypeFieldSeparatorsInDeclaration (cognitive 57): sqlParameters.collectComplexTypeFieldSeparatorsInDeclaration has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (48 pts), boolean chains 8, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f653273eee56243ffcc7c5da1aca32fe56a3af84656c777706ea5d1b6a888df3"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlFormatter.protectDuckDbPrefixAliasSeparators (cognitive 57): sqlFormatter.protectDuckDbPrefixAliasSeparators has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 11, loops 5 (11 pts), ternaries 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a28a68dbba88d9f4fe2a813abaa0cff1e29d6c71801821d971a4a4d732d1b71"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlVariables.readValueEnd (cognitive 57): sqlVariables.readValueEnd has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (42 pts), boolean chains 14, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"63171b53e8fdbc70a7a83df0a83e4c3a21479d98a36e0bc9d01744a5591389b1"}},{"ruleId":"D2","level":"warning","message":{"text":"oraclePackageSource.tokens (cognitive 57): oraclePackageSource.tokens has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 4 (10 pts), boolean chains 6 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSource.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb78887a6dd57eec9f915dcd8fe0899f38bef779439348307f878fee0da162f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::export_postgres_all_schemas_sql_core (cognitive 56): dbx_core::data::database_export::export_postgres_all_schemas_sql_core has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (41 pts), match/switch 3 (7 pts), boolean chains 4, loops 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":4870}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca0dcfa36df7de9caf76c61a393e46b4a3229bdb07221264b7b2b03ac1f785e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::completion_assistant_search_inner (cognitive 56): dbx_driver_postgres::postgres::completion_assistant_search_inner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (33 pts), loops 6 (13 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"807adfe2d5d6757f3365f23903214fb9132b1212f285ec15f43f42bf0eedf9ed"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::parse_command_argv (cognitive 56): dbx_driver_redis::parse_command_argv has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":2587}}}],"partialFingerprints":{"codehealthFindingId/v1":"7202c1eef7f1a507b480305c1ca1b5ee50cf2ca78737e97759448db48887d979"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugRecordDecoder.object (cognitive 56): plDebugRecordDecoder.object has cognitive complexity 56 (threshold 15). Drivers by points: if/else 30 (41 pts), boolean chains 10, loops 4 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_object_input.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b551eeb02b638a220963e9a54f900a52f41468821b3319b26f1036b1914c114"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.commitEdit (cognitive 56): useDataGridEditor.useDataGridEditor.commitEdit has cognitive complexity 56 (threshold 15). Drivers by points: if/else 27 (42 pts), ternaries 5 (8 pts), boolean chains 6 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b8abea175b74a43bd9ac4cad811ce8d3cdc97fe5870f84f56bf125e3475fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"useDatabaseTableEmpty.useDatabaseTableEmpty.requestDatabaseTables (cognitive 56): useDatabaseTableEmpty.useDatabaseTableEmpty.requestDatabaseTables has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 17 (22 pts), if/else 15 (20 pts), boolean chains 9, error handling 3, loops 1 (2 pts) (nesting depth added 11). Of this number, 47 points are the body\u0027s own statements and 9 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDatabaseTableEmpty.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a519990c90d364a1b94d4b099a27fef68125f65d11165bdd29d41573593f615"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridContextMenu.createDataGridColumnContextMenuItems (cognitive 56): dataGridContextMenu.createDataGridColumnContextMenuItems has cognitive complexity 56 (threshold 15). Drivers by points: if/else 24 (44 pts), boolean chains 12 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3b487097947bf4804c998fd1cb096cce6f0f07ef96e2e8d6cec5da7d8eb972"}},{"ruleId":"D2","level":"warning","message":{"text":"kvValueFormat.validateKvValue (cognitive 56): kvValueFormat.validateKvValue has cognitive complexity 56 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 10, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 21). Of this number, 45 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/kvValueFormat.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aa0699c9f4db637fee8e6b06b9064a3ae4f24e08ba32c9d5cd6470eac60ac0"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarSearchTree.filterSidebarTreeWithMatcher (cognitive 56): sidebarSearchTree.filterSidebarTreeWithMatcher has cognitive complexity 56 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 6 (18 pts), boolean chains 17, loops 1 (nesting depth added 22). Of this number, 46 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"448ab4cd4bf93a9e19289bad5c50bbfb2b24627de9b2c995b4f5fcb6e1c64ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarTableNameCopy.qualifiedNameForSidebarNode (cognitive 56): sidebarTableNameCopy.qualifiedNameForSidebarNode has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (34 pts), boolean chains 16, ternaries 4 (6 pts) (nesting depth added 13). Of this number, 51 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTableNameCopy.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2eac6c7c4251ed72a9b322c9ee74a12d1506a44f69970d03ad75bbe4d854ee"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.extractSelectList (cognitive 56): sqlCompletion.extractSelectList has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (40 pts), boolean chains 15, 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4438}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ebe67509c0837a1dbc4085e8356bb433270879e1056dc1f3be6808a561674a"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.buildQueryMetadataPatch (cognitive 56): queryStore.useQueryStore.buildQueryMetadataPatch has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (24 pts), ternaries 11 (19 pts), boolean chains 12, error handling 1 (nesting depth added 16). Of this number, 49 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7971}}}],"partialFingerprints":{"codehealthFindingId/v1":"793519b993cb71c75382ff488054563b121f0d2bd13b6a442f9258e66fc0e31c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_gemini_with_tools (cognitive 55): dbx_ai_provider::ai::stream_gemini_with_tools has cognitive complexity 55 (threshold 15). Drivers by points: if/else 9 (42 pts), loops 3 (11 pts), match/switch 1 (2 pts) (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":5106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bcff8139d5018d8efe5ff2fc2b875b545cb9aa9fda83e30e9bf817a8d787b3"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeJobRegistry::remember (cognitive 55): NativeJobRegistry::remember has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (36 pts), match/switch 5 (11 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/service.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5788309b45a2c1c3acb708d887fab435067d6c29f10c53fa0581824f14b38ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_details::read (cognitive 55): dbx_core::schema::oracle_type_details::read has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 13, loops 5 (10 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_details.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"15029a27bf82aadfcf1daa684683978c3abdc07d8a3d81c04076b712cf68b9cb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::build_sorted_query_sql (cognitive 55): dbx_sql_data::query_result_sql::build_sorted_query_sql has cognitive complexity 55 (threshold 15). Drivers by points: if/else 31 (41 pts), boolean chains 11, match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcf8496076fa159c918f35320bcbf38744e46fa6f2218e56e9be907509eebf2"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompositeInput.composite (cognitive 55): PlDebugCompositeInput.composite has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48986fe2d3842d9c97d4683c67405cc077944513b71cf02f16adf066a7cb04d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.applyHiveParameters (cognitive 55): main.applyHiveParameters has cognitive complexity 55 (threshold 15). Drivers by points: if/else 33 (43 pts), boolean chains 12 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7037dda11a7710d30a87a39f5364d6a039781e8023e5f1e615d06ed41b95ca28"}},{"ruleId":"D2","level":"warning","message":{"text":"main.applyHiveParameters (cognitive 55): main.applyHiveParameters has cognitive complexity 55 (threshold 15). Drivers by points: if/else 33 (43 pts), boolean chains 12 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"9386733dcb6e2293d051893695e11a0578c4f78b077f223f842f3fdf4f2521c0"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeRoutineParamMode (cognitive 55): main.plDebugNativeRoutineParamMode has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 13, loops 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dc3da54b6d6fa7c87178853a1786b5df14820f9e074a7cd90a52c1bab2c0ae"}},{"ruleId":"D2","level":"warning","message":{"text":"proxyManager.rewriteJSON (cognitive 55): proxyManager.rewriteJSON has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 6 (16 pts), boolean chains 4, match/switch 1 (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/routing.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5014cfbf340ca1e281b7c735265091834c6da064e2897e3eba6184b181cd61b0"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorDiagnostics.useQueryEditorDiagnostics.loadSqlUnknownObjectSpans (cognitive 55): useQueryEditorDiagnostics.useQueryEditorDiagnostics.loadSqlUnknownObjectSpans has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (35 pts), ternaries 4 (7 pts), loops 4 (6 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 21). Of this number, 54 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f35c8ea9af809e0cfb133fca5708312974156c6c9a89e5b22bc4f96c2706ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"useFileDrop.useFileDrop.setupFileDrop (cognitive 55): useFileDrop.useFileDrop.setupFileDrop has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (30 pts), error handling 3 (11 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 31). Most of this is not in the body itself: 2 of the 55 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 48, 125, 139). 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":"apps/desktop/src/composables/useFileDrop.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba872874d875e1dd6d1161ccfae294a43c3ce241f581c7af2e59fb682ff34c6"}},{"ruleId":"D2","level":"warning","message":{"text":"datagripImport.parseJdbcUrl (cognitive 55): datagripImport.parseJdbcUrl has cognitive complexity 55 (threshold 15). Drivers by points: if/else 26 (39 pts), boolean chains 8, loops 2 (4 pts), error handling 1 (2 pts), ternaries 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc1cfc191a2f9f7a738b9e4279c4b2993cae113fb70ac8a38588e880a031e85"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_driver::json_filter_value_to_bson (cognitive 54): dbx_driver_mongodb::mongo_driver::json_filter_value_to_bson has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (45 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15f34cec87c414092e83dae14d57b570ad514626a6978eca8d052484565413c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::ssh_tunnel::forward_loop (cognitive 54): dbx_drivers::db::ssh_tunnel::forward_loop has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (33 pts), match/switch 8 (20 pts), loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b58c1b3d17c97c2fdb38f336763f49ebca6aa1f5e4414cb364221fdd0f8581"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_dialect::sql_dialect::table_select::build_table_data_select_sql_with_database (cognitive 54): dbx_sql_dialect::sql_dialect::table_select::build_table_data_select_sql_with_database has cognitive complexity 54 (threshold 15). Drivers by points: if/else 38 (46 pts), boolean chains 7, match/switch 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde629d343aecc21e61fa65b02519fefb33d42861623d61c34d1380e7cc4a9b0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::order_diffs_for_execution (cognitive 54): dbx_sql_schema::schema_diff::order_diffs_for_execution has cognitive complexity 54 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 8 (15 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6557}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6c2afb446d1b594356293af10beb07075dc07451a13d5fcde21c18bedca058"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listConstraints (cognitive 54): server.listConstraints has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (40 pts), loops 5 (8 pts), boolean chains 6 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a178c7cd2011ae85e56833196261d6f636fab941e28793ceda6291905cd021"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.inspectNativeCurrentProgram (cognitive 54): plDebugNativeEntry.inspectNativeCurrentProgram has cognitive complexity 54 (threshold 15). Drivers by points: if/else 28 (39 pts), boolean chains 12, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_entry.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e14db9f59ee199b4b4cc20a4e3994d1e1bb7ec6c770dc588e18f36e2d9143f2"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTriggerPlan.verifyStep (cognitive 54): oracleTriggerPlan.verifyStep has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (29 pts), ternaries 7 (14 pts), boolean chains 11 (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":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"642789aef8802440217701a30ac3da3b39d111e4035c96bb703a690d74a0b400"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectDuckDbStructFieldSeparators (cognitive 54): sqlParameters.collectDuckDbStructFieldSeparators has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (36 pts), ternaries 2 (7 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ef225585539ac29b761e69b1c1cca7b9a36d3683fe5e0fb3683258d9318c39"}},{"ruleId":"D2","level":"warning","message":{"text":"seo.auditPages (cognitive 54): seo.auditPages has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 9, loops 4 (9 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/scripts/seo.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"55880b531722c9432817e711b94ca67c68ec6b49e045ce482b0872be8d053757"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_evolution::table_guard (cognitive 53): dbx_core::schema::oracle_type_evolution::table_guard has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 16, loops 9 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_evolution.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a983a7ce4cd2955e898d1a4b502804d363d9f0b16fe106512dbab1cc5fcbd5b"}},{"ruleId":"D2","level":"warning","message":{"text":"Projection::read (cognitive 53): Projection::read has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (41 pts), boolean chains 9, match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da9ffb46e3b6d795622f73461638bb4fc692a30214d52eee7f4546f137399ff"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_routines::analysis::package::statements (cognitive 53): dbx_sql_core::object_source_sql::oracle_routines::analysis::package::statements has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (46 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a020bfc5d29d5a0429dbf2b648aa74222ac925b59ed2f086371bf1cc45990520"}},{"ruleId":"D2","level":"warning","message":{"text":"StarRocksCreateTable::validate (cognitive 53): StarRocksCreateTable::validate has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (38 pts), match/switch 2 (6 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/create_dialect.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3654e115119a611674af7fe7a8448fdf47e4f7785c458e7c403ab46cabf8be68"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::existing_primary_key::build_existing_primary_key_change (cognitive 53): dbx_sql_schema::table_structure_sql::existing_primary_key::build_existing_primary_key_change has cognitive complexity 53 (threshold 15). Drivers by points: if/else 24 (35 pts), boolean chains 18 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/existing_primary_key.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa9162f651edfbe7e0914ee490c99eca4659bbdc551c20b99d143d7609fbb7b"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugSession.setBreakpoints (cognitive 53): plDebugSession.setBreakpoints has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (41 pts), boolean chains 8, match/switch 1 (3 pts), loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f17aa02e621590164c0c3328c63e509fc00ac5b0db67ae753ada0e6caa40563"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.resolveNativeNamedSources (cognitive 53): plDebugNativeEntry.resolveNativeNamedSources has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 14, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_source.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"423b1301eb9ce593a4c233724cf3c1a1d0c345824a540e5d09f815201fc1d5d5"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listConstraints (cognitive 53): server.listConstraints has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (41 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"267a68e50b3b5e8be1491276dbe8d7cbcb4336eaf27c66973a708087321849c3"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.skipBalancedParens (cognitive 53): sqlStatementRanges.skipBalancedParens has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (46 pts), boolean chains 6, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"540365118543ac70bca944c306dfc3b64897fe593fe2bb72b05afcbfcdde43a5"}},{"ruleId":"D2","level":"warning","message":{"text":"columnFormatter.normalizeColumnFormatter (cognitive 53): columnFormatter.normalizeColumnFormatter has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 15, ternaries 7 (14 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":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdf7f72598492e5493d411ce53d3613c9f1fac22175528ab25afdb8618819ef"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.parseOracleForeignKeyDdl (cognitive 53): oracleForeignKeys.parseOracleForeignKeyDdl has cognitive complexity 53 (threshold 15). Drivers by points: if/else 29 (43 pts), boolean chains 5, loops 5 (nesting depth added 14). Of this number, 35 points are the body\u0027s own statements and 18 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b8dfdd45daaaada6aa2f896f9d5e1520a4d2bb4bcabd597bbbb1c616da4fac"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::start_keepalive_task (cognitive 52): AppState::start_keepalive_task has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (41 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11b1b03c8b53e54d10f7ba52408768bbe204109b0fc05f0ce03ecbcbed97139"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::sqlserver_ddl_tokens (cognitive 52): dbx_core::data::transfer::sqlserver_ddl_tokens has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (33 pts), loops 5 (13 pts), boolean chains 6 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6658}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adb6abab29a051bd5f9917ebb7c00fadac7bf188832d97b1c47096ca7d2b951"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::find_column_constraint_start (cognitive 52): dbx_core::schema::table_structure_sql::sqlite_rebuild::find_column_constraint_start has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (37 pts), boolean chains 5, loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df684915b50e177828753a81d600b4950fba1f5e81af0af0ea1178c4c622d67"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::parse_oracle_table_ddl (cognitive 52): dbx_sql_core::object_source_sql::oracle_indexes::parse_oracle_table_ddl has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 7 (11 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cd1a82b7ad0fe0f036d8522537c1e41c0893536bdbf73394366c63ee02090d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::sqlserver_control_flow_batch_boundary (cognitive 52): dbx_sql_core::sql::sqlserver_control_flow_batch_boundary has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (45 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3901}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f83c6f37d8377afa0fa11f0a2baf8f0fad49e16eed4e0a1b86383e1eef25e9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::build_query_pagination_execution_plan (cognitive 52): dbx_sql_data::query_result_sql::build_query_pagination_execution_plan has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 13, match/switch 4 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d20d99b9417abb1e64c60f3df5f454e3f1e13057de3673370a4ecfc579cacfe"}},{"ruleId":"D2","level":"warning","message":{"text":"main.applyJavaDriverHOCON (cognitive 52): main.applyJavaDriverHOCON has cognitive complexity 52 (threshold 15). Drivers by points: if/else 42 (50 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config_file.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5ee7550fbe3d22421e648f290df7c8b3b200997a8495305ff8c45dd18b98c3"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseConnectionConfig (cognitive 52): main.parseConnectionConfig has cognitive complexity 52 (threshold 15). Drivers by points: if/else 28 (45 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/driver.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"026392636f9f6e9bb86f81ff5abcaea705f6862a5e19049a07806049e96efd3f"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listObjects (cognitive 52): server.listObjects has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 3 (10 pts), boolean chains 3 (nesting depth added 31). Of this number, 46 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4aad92f110fdd140151e9edc1df707fa99d908bb610dea74175a35c7134700"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridCellCoercion.parsePostgresArrayText (cognitive 52): dataGridCellCoercion.parsePostgresArrayText has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 6 (14 pts), boolean chains 6 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad1f068744dc30ed58e6588c3b29546a6a0e4b72caf4d3ece0e27e3b48e3301"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCommandPreview.quoteRedisBytes (cognitive 52): redisCommandPreview.quoteRedisBytes has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (36 pts), boolean chains 10, error handling 1 (4 pts), loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ef9f4083085b360f9ecba3bf701192429d882b3bb10a3cae025f1cdecd7d66"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleViewRename.prepareOracleViewRename (cognitive 52): oracleViewRename.prepareOracleViewRename has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 10, ternaries 4 (10 pts), error handling 4 (9 pts), loops 2 (nesting depth added 19). Of this number, 46 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleViewRename.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"102b5972c710246e8410d02edde1c3b31a18ef7ef3358328328f87f87236633d"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadSimpleSupplementalObjectChildren (cognitive 52): connectionStore.useConnectionStore.loadSimpleSupplementalObjectChildren has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (25 pts), ternaries 7 (13 pts), boolean chains 11, error handling 1 (2 pts), loops 1 (nesting depth added 21). Of this number, 45 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85118a765a561bea0935f8af03494c01be7b4db82f8ffc229eb4ac75d7c79f1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::is_dameng_auto_increment_ddl (cognitive 51): dbx_core::data::database_export::is_dameng_auto_increment_ddl has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (44 pts), boolean chains 6, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae4c3856c0cf78f1eb71f1ac306b280d3b20ab549ae15df64d9784aeb2c89c7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::oracle_table_contract::types::from_ast (cognitive 51): dbx_core::data::transfer::oracle_table_contract::types::from_ast has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 7 (16 pts), boolean chains 3 (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract/types.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61aba70afe0aee42bc4844f5fad14f5e7a3470e43481cee0b8db52a8dc16fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::find_sql_keyword_end (cognitive 51): dbx_core::schema::table_structure_sql::sqlite_rebuild::find_sql_keyword_end has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b783163aa290cd8d4c507781990c7606bec9d5c6f6124f58d4e8c02b671864be"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::find_if_not_exists_clause (cognitive 51): dbx_driver_mysql::mysql::find_if_not_exists_clause has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 5 (13 pts), boolean chains 11 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7735}}}],"partialFingerprints":{"codehealthFindingId/v1":"abac1a99cd654b54134f3c2f6541ec7453ea1a89ca4c30326a70ac4b9e6b25d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan.bind (cognitive 51): Plan.bind has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (27 pts), ternaries 6 (19 pts), loops 4, boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd53b4124e9d42369160d150f0144cbc3fe95f0944be5742b8c1240d9d800095"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTemporalJson.node (cognitive 51): PlDebugTemporalJson.node has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 9, ternaries 4 (9 pts), error handling 3 (7 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTemporalJson.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad601bdc92e0ccf306380175a621dfe8c26a6569f11f904a2d422e91f1d1735"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listConstraintsWithIdentity (cognitive 51): server.listConstraintsWithIdentity has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 10, loops 2 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3380}}}],"partialFingerprints":{"codehealthFindingId/v1":"469cfcb296c3d8f4d95201f36bbed0652b1ccc107310c6b4b9d52f355d78e7b3"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.executeStatement (cognitive 51): plDebugNativeEntry.executeStatement has cognitive complexity 51 (threshold 15). Drivers by points: if/else 29 (36 pts), boolean chains 11, loops 2 (4 pts) (nesting depth added 9). Of this number, 27 points are the body\u0027s own statements and 24 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_execute.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e908aa992684ca46ce5f4df3010a8938408d04acaa9a7c3fbf673daafa83540"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugRecordDecoder.record (cognitive 51): plDebugRecordDecoder.record has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (40 pts), boolean chains 9, loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_record_input.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44866654b634719d77468140d5d9f653dfe18cc5681e89972c0ed672b35d34f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.readThriftValue (cognitive 51): main.readThriftValue has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/thrift_binary.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6430354810ed4ab420776326a9b2c69c3d577362e0349fb50cb03c5e75a25c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExtractor.useDataGridExtractor.canCopyWithExtractor (cognitive 51): useDataGridExtractor.useDataGridExtractor.canCopyWithExtractor has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 19 (nesting depth added 10). Of this number, 47 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"44590ef964b6affae180b46a2db083576173030f7162eb3f2b12579508cfb2e8"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridCopyExtractor.normalizeDataGridExtractorOptions (cognitive 51): dataGridCopyExtractor.normalizeDataGridExtractorOptions has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 28 (29 pts), boolean chains 22 (nesting depth added 1). Of this number, 49 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a659e4f2d33e227d6faec3828b9c8e26f161b54b300c307d5e76f710432db4f"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.validateBulkWriteOperations (cognitive 51): mongoShellCommand.validateBulkWriteOperations has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (38 pts), boolean chains 5, ternaries 1 (4 pts), loops 2 (3 pts), error handling 1 (nesting depth added 25). Of this number, 50 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa50160468176784765723cc74f83b83a85d628cead50316e7e81a15e3b8c04"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarSearchTree.mergeSidebarRegexIndexScopes (cognitive 51): sidebarSearchTree.mergeSidebarRegexIndexScopes has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 8 (10 pts), ternaries 5 (9 pts), boolean chains 3 (nesting depth added 21). Of this number, 37 points are the body\u0027s own statements and 14 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4c946b5ee7bde52bef7034e1287bd1d65162b3280de290316fc11f241dc891"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::build_data_grid_rollback_statements (cognitive 50): dbx_sql_data::data_grid_sql::build_data_grid_rollback_statements has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (44 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b24c7ec89bb8d7f64de265a3fbc9dd78f466622c7735ab30d188223bb98af2"}},{"ruleId":"D2","level":"warning","message":{"text":"etcdSession.leaseList (cognitive 50): etcdSession.leaseList has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (38 pts), loops 4 (7 pts), boolean chains 4, jumps 1 (nesting depth added 19). Of this number, 44 points are the body\u0027s own statements and 6 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":"agents/drivers/etcd-go/lease.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62e33593b7b3ab4d4a41a00a4d8d731ca20ff22f9291ba57beb16b8f794c0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseAuthorizationPlan.buildCreateUserAuthorizationPlan (cognitive 50): databaseAuthorizationPlan.buildCreateUserAuthorizationPlan has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 6 (19 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5073f8e7363f2adcd2412632ae851c5311f84a854c2bec18dafcd23ef45a246d"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleConstraints.readOracleConstraintSnapshot (cognitive 50): oracleConstraints.readOracleConstraintSnapshot has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 20, if/else 15 (17 pts), ternaries 9, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 4). Of this number, 47 points are the body\u0027s own statements and 3 belong to 5 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9f9fc842ff63400bb9c2fdd1a0b84d38cbebc6a7a04a0e24f3a2c85ab7a65d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.currentLineBlockEnd (cognitive 50): sqlCompletion.currentLineBlockEnd has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 11, loops 4 (6 pts), ternaries 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b317cb6b87a6df382a1a91fdfc1dd56cc4f46f2a2022b5666100c8314cf4df8"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlFormatter.formatSqlText (cognitive 50): sqlFormatter.formatSqlText has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 16 (25 pts), if/else 10 (13 pts), error handling 4 (7 pts), boolean chains 5 (nesting depth added 15). Of this number, 34 points are the body\u0027s own statements and 16 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b4130b34fcebffc767430b0af94845b8cbc89113490f1010286bb0a6320f15"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTypeManagement.restoreOracleTypeManagementDraft (cognitive 50): oracleTypeManagement.restoreOracleTypeManagementDraft has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 35, if/else 11 (13 pts), loops 2 (nesting depth added 2). Of this number, 29 points are the body\u0027s own statements and 21 belong to 10 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1e43380f6f9f3ca014533b4916be47404a32dc2526d1a950571454ed39e63c"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleViewRename.executeOracleViewRename (cognitive 50): oracleViewRename.executeOracleViewRename has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 8, error handling 1, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleViewRename.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3d8782b695c4249ed28120e2854b2964d5ff8a4817386fbaf71d3a5d9c6a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.evaluateCondition (cognitive 50): plDebugStore.evaluateCondition has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 10 (28 pts), if/else 13 (17 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aa0b6efe0ea56dc3f3d18af5b5456f5c2bf84ae2618b31993c771903597b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.prepareEditableQueryExecution (cognitive 50): queryStore.useQueryStore.prepareEditableQueryExecution has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 18, ternaries 4 (5 pts), error handling 1 (nesting depth added 8). Of this number, 48 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f636bebb5e27404b78892e2ae36a5cb4eb0d6360f2d9d93ce534033f902ee977"}},{"ruleId":"D2","level":"warning","message":{"text":"server.createMockHost.server (cognitive 50): server.createMockHost.server has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 15, ternaries 5 (8 pts), loops 1 (2 pts), error handling 1 (nesting depth added 13). Of this number, 37 points are the body\u0027s own statements and 13 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"2170d123038a8063505b886ed248a2b8d1642b7dc26cf154c3086aa7fce19488"}},{"ruleId":"D2","level":"warning","message":{"text":"TdengineDriver::completion_assistant_search (cognitive 49): TdengineDriver::completion_assistant_search has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 4 (9 pts), boolean chains 5 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/tdengine/src/driver.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2f515fc21b5dd325476118815722605589637b1d09a349fdf4d7df1b610a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::inspect_data_migration_with_error_cache (cognitive 49): Storage::inspect_data_migration_with_error_cache has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 16, match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf8515db779df9b18b390289ebfc19b370eab87280f1a7432f0d0da55f819fc"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::break_backup_foreign_key_graph (cognitive 49): dbx_core::data::transfer::break_backup_foreign_key_graph has cognitive complexity 49 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 5 (14 pts), loops 4 (12 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2d9f5e2bcb5cb2f12fd669041db1e4d537f51f8a03ff9c02146e16ab2ab79d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::starrocks_partition::validate (cognitive 49): dbx_sql_schema::table_structure_sql::starrocks_partition::validate has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 7, loops 3 (7 pts), match/switch 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/starrocks_partition.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fccaec5d02606645d4c9d3b0ed31ccf2e986d2eccf5f5bf57d23e2608b6466"}},{"ruleId":"D2","level":"warning","message":{"text":"BlobBoundExecutor.execute (cognitive 49): BlobBoundExecutor.execute has cognitive complexity 49 (threshold 15). Drivers by points: error handling 9 (23 pts), if/else 13 (20 pts), boolean chains 5, ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/BlobBoundExecutor.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c4261c9a00a849ffa959b36c03904b12799e2666a09a484e850eb7d1f6a3e7"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.lobInput (cognitive 49): PlDebugTarget.lobInput has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (27 pts), ternaries 5 (13 pts), boolean chains 6, loops 1 (2 pts), error handling 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3e50e0739f2e4abca2f4a95804d7666f2e882210f94343a4194840bb10e7e0"}},{"ruleId":"D2","level":"warning","message":{"text":"main.sqlRequiresSessionAffinity (cognitive 49): main.sqlRequiresSessionAffinity has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (30 pts), boolean chains 10, loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/connection_state.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd31a8683fb3bc0301286b36a8d4c993ebddbf2b8005e90185aa4aa665204f9"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.exportQuerySqlDirect (cognitive 49): queryStore.useQueryStore.exportQuerySqlDirect has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 11, ternaries 6 (7 pts), error handling 3 (4 pts) (nesting depth added 14). Most of this is not in the body itself: 9 of the 49 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 11998, assertQueuedSourceAvailable, startExport, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11920}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a8f01428d92393011b05730cae40a3a45de8d1209440015606073a4f5f1384"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan::after_tables (cognitive 48): Plan::after_tables has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 4 (14 pts), boolean chains 2, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49f310ab396bcc6822e33e15ef4ad8b396bbaa1d5208844c64337c1477fc51d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::parse_xlsx_preview_file_with_options (cognitive 48): dbx_core::data::table_import::parse_xlsx_preview_file_with_options has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3631}}}],"partialFingerprints":{"codehealthFindingId/v1":"745a001d6491689171f554a80d94353b566d0bd99137099bd5ea429a2d058309"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::persistence::cloud_sync::build_sync_snapshot_with_selection (cognitive 48): dbx_core::persistence::cloud_sync::build_sync_snapshot_with_selection has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 4 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"168a15e82781845be1761fb1613b38bd3906037b9cf86b397d079d7a2ff81516"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::safety::production_safety::append_sql_target_safety_text (cognitive 48): dbx_core::safety::production_safety::append_sql_target_safety_text has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 5 (14 pts), boolean chains 9 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edef4154a84368907c15c0d302b134bdf3bbc9dc5b991ad59ee10ec0edf5c55"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::find_create_table_body_span (cognitive 48): dbx_core::schema::table_structure_sql::sqlite_rebuild::find_create_table_body_span has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (41 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ffe5c070030608cd8cc43a9ed580b13edd70be2629a0df156e7bc217ee2ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::parse_sqlite_autoincrement_pk_columns (cognitive 48): dbx_drivers::db::sqlite::parse_sqlite_autoincrement_pk_columns has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 4 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79cf1e6d61845cdc63bcdfd253d2d1086843fdce9ce3e0457905c72449bf892"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_runtime::plugins::manifest::validate_form_fields (cognitive 48): dbx_plugin_runtime::plugins::manifest::validate_form_fields has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 4 (9 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e630d7d551045d572b9fc81222b149207ab42838e515a3bca97ed1cb661a5a6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::next_executable_sql_token_with_options (cognitive 48): dbx_sql_core::sql::next_executable_sql_token_with_options has cognitive complexity 48 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 7 (16 pts), boolean chains 15 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3734}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c068632fd19d4f26db7b155a51eb925ce26d25ec61f572840a54940b51efe13"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_salesforce_sql::build_salesforce_data_grid_save_statements (cognitive 48): dbx_sql_data::data_grid_salesforce_sql::build_salesforce_data_grid_save_statements has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (40 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_salesforce_sql.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3442b6d7c76af375aebc8344dc71c385beb602c80c97da8e41791f3f05ce431"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_alter::build_single_column_alter_sql (cognitive 48): dbx_sql_schema::table_structure_sql::column_alter::build_single_column_alter_sql has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (33 pts), boolean chains 14, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f835301297a99402d490df4ca6acb2290339fe35b08cd5f2d1dbd2395c6ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.nativeVariableNames (cognitive 48): plDebugNativeEntry.nativeVariableNames has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 11, loops 3 (8 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_variables.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86fe7e7716f89131afcda1c629d00d64bedc5766380feb1fc7cc33cc252558e"}},{"ruleId":"D2","level":"warning","message":{"text":"server.dispatch (cognitive 48): server.dispatch has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (47 pts), match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d994c10e42ccd1641c3fad1155b1b1c1bf5f44bbd631c3d37dd9f15d9423d3"}},{"ruleId":"D2","level":"warning","message":{"text":"xuguWKBReader.geometry (cognitive 48): xuguWKBReader.geometry has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (40 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/spatial.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cbf2dda3ca4f88ea75940491675b5fc5a4ebb26cd0636286096692edae720b"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.oraclePlSqlTokens (cognitive 48): sqlStatementRanges.oraclePlSqlTokens has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8951c0269c09fe867c591c37362018865bbc069e8e8f5dfa6006cb592291cd"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionParameterDocument.parseConnectionParameters (cognitive 48): connectionParameterDocument.parseConnectionParameters has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (26 pts), ternaries 6 (11 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (nesting depth added 21). Of this number, 36 points are the body\u0027s own statements and 12 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionParameterDocument.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ade43d1c4df5ee3f1b1e796060ffa7420f2e717565d0c8c723842621ae7fa3f"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnHighlight.computeColumnHighlightMatchKeys (cognitive 48): dataGridColumnHighlight.computeColumnHighlightMatchKeys has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (35 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 30). Of this number, 47 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":"apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dca84a2d3ef1cd5de553d9f6a24d933189ddd041fbe6a340e64b4e4f6e1e80"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleSessionDiagnostics.parseOracleCachedPlan (cognitive 48): oracleSessionDiagnostics.parseOracleCachedPlan has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 11 (20 pts), boolean chains 12, if/else 7 (12 pts), loops 4 (nesting depth added 14). Of this number, 46 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionDiagnostics.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b8ca15f5aa1bbce3caf8e6fbbfa68ed427141de69186b53cb56c0c0291ca4d"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTriggerPlan.executePreparedTriggerPlan::run (cognitive 48): oracleTriggerPlan.executePreparedTriggerPlan::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 7 (17 pts), boolean chains 7, error handling 3 (6 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. This shape REPEATS in the file: one other method here (oracleTriggerPlan.executePreparedTriggerPlan) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef65f17edb0d358a35cc355af9db760d5ca01b533e86e5f5f6a92dbbfe0cc7ef"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoSql.compileSelect (cognitive 48): mongoSql.compileSelect has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (23 pts), ternaries 7 (14 pts), boolean chains 10, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d18d117ad677a0473d72c5364ceb885377ccdb5e143062af8bc52fe5b50d9e0"}},{"ruleId":"D2","level":"warning","message":{"text":"frontendPlugin.buildPluginConnectionConfig (cognitive 48): frontendPlugin.buildPluginConnectionConfig has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 24, if/else 14 (20 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed813790981f268607cc567b77659f7b3abe56c4c9bb84bdc7bc765466bcb2fd"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.scanCteDefinitions (cognitive 48): sqlCompletion.scanCteDefinitions has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 6 (15 pts), boolean chains 8 (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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4667}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d51c2c00b0d60c3bb873c0201fe48a455a6e308418b9a2df7f8ca6909cdb00d"}},{"ruleId":"D2","level":"warning","message":{"text":"tableCopyTaskStore.useTableCopyTaskStore.run (cognitive 48): tableCopyTaskStore.useTableCopyTaskStore.run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 7, loops 3 (6 pts), error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 19). Of this number, 33 points are the body\u0027s own statements and 15 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/tableCopyTaskStore.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"feff4eb7d8b07836c22acbaf958b1a6c0a9e4e6feb10afb6e9d544fbfbfec931"}},{"ruleId":"D2","level":"warning","message":{"text":"startDevelopment (cognitive 48): startDevelopment has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 10, error handling 3 (7 pts), ternaries 4, loops 1 (2 pts) (nesting depth added 11). Most of this is not in the body itself: 12 of the 48 points are its own statements and the rest belongs to 20 function items inside it that branch (a function literal at line 131, spawnCommand, run, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/runtime.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"38499907fa013429bc5fab927b0683d7e909b5868b46e9c1e70d6fd900818226"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::directory::inspect (cognitive 47): dbx_core::data::mongodb_dump::directory::inspect has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (42 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/directory.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc56a55ad96d011b5a44b3006549c4e5557f49f0a3ba7aaef6a7cded11b4c06"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_export::fetch_table_export_batch (cognitive 47): dbx_core::data::table_export::fetch_table_export_batch has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 5 (13 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30c2e74c17238f3395953f92b38f95fb353c069284946c904e602bc4bac506e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::recover_value_operations (cognitive 47): dbx_core::query::pl_debug::recover_value_operations has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 20, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda3c5f6349625cf41b0431e9b36cd5231572d9df2592123de9f9d6a12131af7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::sql_words_outside_comments_and_quotes (cognitive 47): dbx_core::schema::table_structure_sql::sqlite_rebuild::sql_words_outside_comments_and_quotes has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9851c2024d4fa865a377acc87c4c7bc456162c5c0df8fd691f718aa52d48d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionConfig::redacted_connection_url_with_host (cognitive 47): ConnectionConfig::redacted_connection_url_with_host has cognitive complexity 47 (threshold 15). Drivers by points: if/else 27 (44 pts), boolean chains 2, match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"de56d3ce7cdec5fa212a838ccc423b9307c8bdb6117ee06ef8b40313e809015d"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.getObjectSource (cognitive 47): DbxJdbcPlugin.getObjectSource has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (30 pts), ternaries 3 (8 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5664}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fd514c23e7b96f50774b4ed9fe44825e1831a4019598db385ea0fcd32aef0a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.readOracleTNSAliases (cognitive 47): main.readOracleTNSAliases has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 26). Of this number, 40 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/tns.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ccf767447479dcac9060c600ec7a85f045c8e27601dbecd58bf503028adba6"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getObjectSource (cognitive 47): server.getObjectSource has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (42 pts), boolean chains 4, loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bef93d8ec088c6e2ed4ae94d20259db6aaa5bfdcab0b3f6e0ec7a9f812afa0"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.snapshotLocked (cognitive 47): plDebugNativeEntry.snapshotLocked has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc550fdbf940ca53f6eb3337742b805c79550d6feb36b8c58ca369a94bed12a"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlSemanticSelectionRanges.collectSqlRanges (cognitive 47): sqlSemanticSelectionRanges.collectSqlRanges has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 9, ternaries 3 (9 pts), loops 4 (nesting depth added 20). Of this number, 43 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c5fe6b45897076f1290b01c3221dd09569b077058d305c831ceb2d35439ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"nacosConfigValidation.validateHtml (cognitive 47): nacosConfigValidation.validateHtml has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (37 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosConfigValidation.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d1552eac4048e40476a786fa0764e6d3301120d362e61af033ba43e3f2bb96"}},{"ruleId":"D2","level":"warning","message":{"text":"model.buildCursorIntent (cognitive 47): model.buildCursorIntent has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 8 (16 pts), boolean chains 14 (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":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"db64a68bee2f822befeda223f8942f6ffaa5c0fc88d89e8f6ecf41a8fb75d905"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.collectSqlServerRoutineParameters (cognitive 47): sqlCompletion.collectSqlServerRoutineParameters has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (32 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 24). Of this number, 46 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3cfb6feb8494ca6bcde7ddc9a05f90dc9d64deac9cb9b73a5262c71b7f55d0"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.extractSelectColumnNames (cognitive 47): sqlCompletion.extractSelectColumnNames has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 4 (9 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 27). Of this number, 35 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4583}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f19725a6afede14e67067e3207bb7d0a1ccc6a059edaba575333d7ae039906"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildColumnItems (cognitive 47): sqlCompletion.buildColumnItems has cognitive complexity 47 (threshold 15). Drivers by points: boolean chains 17, if/else 9 (15 pts), ternaries 10 (13 pts), loops 2 (nesting depth added 9). Of this number, 33 points are the body\u0027s own statements and 14 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d4dcf5147d50f6c24a14384ef048f43186392e785753148436d92d6aab5af4"}},{"ruleId":"D2","level":"warning","message":{"text":"tableStructureEditorState.parseExtraToColumnExtra (cognitive 47): tableStructureEditorState.parseExtraToColumnExtra has cognitive complexity 47 (threshold 15). Drivers by points: if/else 23 (43 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"71df61707495b4e791634ad95a63f6e228867a6b8d27fc1d3ea8e8d41fdedc80"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadTableForLocate (cognitive 47): connectionStore.useConnectionStore.loadTableForLocate has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 9, ternaries 4 (9 pts), loops 2 (3 pts) (nesting depth added 19). Most of this is not in the body itself: 2 of the 47 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 8234, 8312, 8269). 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80c42a5a3bcebd33383388b1f03b1d363940d04606a4aa06828529bb2985ace"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.countQueryTotalRowsInBackground (cognitive 47): queryStore.useQueryStore.countQueryTotalRowsInBackground has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (29 pts), ternaries 6 (9 pts), boolean chains 8, error handling 1 (nesting depth added 10). Most of this is not in the body itself: 7 of the 47 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 8290, clearPendingCount). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad23614af9da98caa5a62026f71d7eb7a5d9d5b9e61375a386a2de8c26660cf7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_export::try_export_native_table_stream (cognitive 46): dbx_core::data::table_export::try_export_native_table_stream has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (42 pts), boolean chains 2, match/switch 2 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"12332730a362f650f5f52bfa9e57f00a586865436b6c55c7702b702c81bc01c9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_postgres_schema_objects (cognitive 46): dbx_core::data::transfer::transfer_postgres_schema_objects has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (31 pts), loops 8 (10 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14830}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f43e232f0ee4b7cffe645d73d35f6ff165a5d3ffe642d05ed86c6807d2c391"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::scheduler::run_create (cognitive 46): dbx_core::schema::native_jobs::operations::scheduler::run_create has cognitive complexity 46 (threshold 15). Drivers by points: if/else 28 (41 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e48eda6de3b51fc032b41003da728904b5d46dcaf811c168a2e314163d6a357"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::build_change_plan (cognitive 46): dbx_core::schema::table_structure_sql::sqlite_rebuild::build_change_plan has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 6, loops 2, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c081063d18a5dc521e823481fa8996b05fc513f9ae3c72522708db5de1b326"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::sqlserver_top_level_tokens (cognitive 46): dbx_sql_core::sql::sqlserver_top_level_tokens has cognitive complexity 46 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 6 (16 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba97b546cc165717114fe16a6286fc66a37870c00f972eaee603141737a095ad"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeMapStack (cognitive 46): main.plDebugNativeMapStack has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 10, loops 2 (nesting depth added 18). Of this number, 45 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_stack.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71113710a2d753dbbac1a9ea5f137131baba7603e68132ca1ba2acb7da02813"}},{"ruleId":"D2","level":"warning","message":{"text":"main.renderXuguTableDDL (cognitive 46): main.renderXuguTableDDL has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 5, match/switch 2 (5 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f00d9482b51ce8013fc21c3692a9e5ec7b00f2c1195675135f8905566fff939"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferDdl.temporalColumnTypesFromDdl (cognitive 46): queryResultTransferDdl.temporalColumnTypesFromDdl has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 12, ternaries 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0d944a0846e2d2cedabef501f831cd962ac1eb2dbd798eebff80d40c49ab9c"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printRuleList (cognitive 46): printer.printRuleList has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 10 (18 pts), if/else 11 (17 pts), boolean chains 11 (nesting depth added 14). Most of this is not in the body itself: 14 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 189, 177). 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":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3542f57dc31bceba759104bd49e989e991ece76f882810a12097048f38a02004"}},{"ruleId":"D2","level":"warning","message":{"text":"oraclePackageSaveAs.prepareOraclePackageSaveAs (cognitive 46): oraclePackageSaveAs.prepareOraclePackageSaveAs has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 5 (15 pts), error handling 5 (10 pts), boolean chains 6 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee77d731eed51c18c67aa7b201b670bce8e0ab068ad120f981aa922f24fa988"}},{"ruleId":"D2","level":"warning","message":{"text":"routineParameters.tokenizeXuguRoutineDefinition (cognitive 46): routineParameters.tokenizeXuguRoutineDefinition has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (10 pts), boolean chains 6, ternaries 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dbe652d90a8969384fa620b7bb5fc4f0a18162a268e2d924bae19811b85e25"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.listCompletionColumns (cognitive 46): connectionStore.useConnectionStore.listCompletionColumns has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 11 (16 pts), if/else 8 (15 pts), boolean chains 12, error handling 1 (3 pts) (nesting depth added 14). Of this number, 24 points are the body\u0027s own statements and 22 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10676}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d58115f8ba08cb343530b7374b61dc1224672eeab8a1e0e8ddc6be898725105"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.publishSnapshot (cognitive 46): plDebugStore.usePlDebugStore.publishSnapshot has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 19, ternaries 3, loops 1 (2 pts) (nesting depth added 7). Of this number, 45 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a991878d0137db945696d618f395126646f2f710d523fd7cc500318e880e165f"}},{"ruleId":"D2","level":"warning","message":{"text":"server.createMockHost.api (cognitive 46): server.createMockHost.api has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 9, ternaries 3 (6 pts), error handling 1 (2 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 17). Of this number, 17 points are the body\u0027s own statements and 29 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"95053dc67cda9f6b97a3761dee56dd1da11034169ee28e3d91da8b4eff200d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"runStep (cognitive 46): runStep has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 4 (8 pts), boolean chains 5, other 5, error handling 2 (4 pts), ternaries 2 (4 pts), match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb30af7775af4076edd54f0aef499a595043d307a8ed5bd8024a8cc19cd9e21"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::insert_connection_pool_inner (cognitive 45): AppState::insert_connection_pool_inner has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (36 pts), match/switch 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c515a09fd3385e652b932af3a8461d839655450ff258b45d16147ca65d7f3b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::query_result_export::try_export_clickhouse_query_result_stream (cognitive 45): dbx_core::data::query_result_export::try_export_clickhouse_query_result_stream has cognitive complexity 45 (threshold 15). Drivers by points: if/else 32 (39 pts), boolean chains 4, match/switch 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":2144}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aa20d399710c321034baf88a82268d122639ced9b3909e32959ca1ef36f745"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::oracle_table_contract::character_lengths (cognitive 45): dbx_core::data::transfer::oracle_table_contract::character_lengths has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (40 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"684edb037d7e314984a3079aa6cfbefb1b82f2fcea79d0e715d5985dc7a08292"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::cloudflare_d1::sql_lexer::lex_sql (cognitive 45): dbx_drivers::db::cloudflare_d1::sql_lexer::lex_sql has cognitive complexity 45 (threshold 15). Drivers by points: loops 7 (19 pts), if/else 6 (18 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3687fdf7f1721377e30887184e359341f0ed862aff1a53b7adce6b29ac12e843"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::validate_oracle_object_source (cognitive 45): dbx_sql_core::object_source_sql::validate_oracle_object_source has cognitive complexity 45 (threshold 15). Drivers by points: if/else 26 (29 pts), boolean chains 10, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea6962baf0d48877c9600f54aa4150c65c00cc7783a310a375e6052cc49f607"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::top_level_sql_tokens (cognitive 45): dbx_sql_data::query_result_sql::top_level_sql_tokens has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 5 (13 pts), boolean chains 7 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":3064}}}],"partialFingerprints":{"codehealthFindingId/v1":"1400dfedd62a6bc4cc2f72f73024ba27c83ab7e73c6212786699a98bfb4f4951"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::diff_schema (cognitive 45): dbx_sql_schema::schema_diff::diff_schema has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (37 pts), loops 6, boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bfec1026953b2fa446a36325156f846d89dfc67ca761c1874c74e871461d25"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.listIndexes (cognitive 45): DbxJdbcPlugin.listIndexes has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 10, error handling 6 (10 pts), ternaries 3 (6 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4090e559fcecf70f4a89b561754eb107b89d8ec814a14b06ba16baba1e35569"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseOracleAgent.completionAssistantPackageMembers (cognitive 45): OceanBaseOracleAgent.completionAssistantPackageMembers has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 7 (14 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"63729c28314818237d82df33c2d1250567fef31a2bea578f5b3c4ef25c16789d"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.load (cognitive 45): PlDebugTarget.load has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 6 (12 pts), boolean chains 8, ternaries 4 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6935a78e087aa4952b73e43c029301ecf0342d917d717903ef145e40b5fa2d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeSelectConstructor (cognitive 45): main.plDebugNativeSelectConstructor has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 19). Of this number, 42 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":"agents/drivers/oracle-go/pldebug_object_select.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d6ca9185a94f0e4d061d4d759d5ff2ee6cd9a4716005b61ceffd8fd16483f9"}},{"ruleId":"D2","level":"warning","message":{"text":"gosasl.parseChallenge (cognitive 45): gosasl.parseChallenge has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/gosasl/sasl.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacc862dc26344e329c1f816a963b8c8646f5efb34ebb8b57d1dd8869f586f80"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridConditionHighlight.tokenizeDataGridCondition (cognitive 45): dataGridConditionHighlight.tokenizeDataGridCondition has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 15, loops 4 (11 pts), if/else 5 (10 pts), ternaries 3 (9 pts) (nesting depth added 18). Of this number, 43 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridConditionHighlight.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"840edc1fa09e8d266d0b9018cbcb93ad3d2af1a3c6a6a13067033ed9a03d9621"}},{"ruleId":"D2","level":"warning","message":{"text":"model.parseCteSources (cognitive 45): model.parseCteSources has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (26 pts), ternaries 5 (10 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 23). Of this number, 44 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27d5975085fbdc09af0ac83298f85dd617f3253abb905eee5bcb7084bea835d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.parsePostgresRegclassPrefix (cognitive 45): sqlCompletion.parsePostgresRegclassPrefix has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 10, loops 4 (8 pts), ternaries 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"96187420fc6c6fe7628dce303fb2d0a142d53119db0d7869fbce8cac57c83083"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlVariables.replaceReferences (cognitive 45): sqlVariables.replaceReferences has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (36 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2956f79d04b28e8882ddb942276e450612eab24dd92c124f4fc0d7e4b86897d1"}},{"ruleId":"D2","level":"warning","message":{"text":"IssueSubmissionLimiter.fetch (cognitive 45): IssueSubmissionLimiter.fetch has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (26 pts), ternaries 7 (14 pts), boolean chains 4, error handling 1 (nesting depth added 17). Of this number, 29 points are the body\u0027s own statements and 16 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/worker.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b799c229ca9605b54fe4df1886988cbd6b8732f00c7cf325e7d665264e81e5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::ddl_plan::prepare_table_ddl (cognitive 44): dbx_core::data::transfer::ddl_plan::prepare_table_ddl has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 11, match/switch 3 (8 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/ddl_plan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b33185b393e1b5ada2ac2d2bbf29d90f22c6f412452a2caa3b5f3371bde0b76"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::get_object_source_once (cognitive 44): dbx_core::schema::get_object_source_once has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 8, match/switch 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":13800}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d15c5dd5f64cc71f9878006cf0de52e11d37c1a5b388c6dc01a09adedcfde61"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::render_sqlserver_table_ddl_details (cognitive 44): dbx_core::schema::render_sqlserver_table_ddl_details has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (38 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":19243}}}],"partialFingerprints":{"codehealthFindingId/v1":"847b23fe98ebc7d0db7a53866df0d71f8e40643d34bb3833e068a86bdf29685a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::rewrite_oracle_table_references (cognitive 44): dbx_sql_core::object_source_sql::rewrite_oracle_table_references has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 14, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19a52d40e0e6b347cfeee06e3b790b946a457d2a74fe8acb964ab853794e344"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::oracle_trigger_metadata_matches (cognitive 44): dbx_sql_core::object_source_sql::oracle_indexes::oracle_trigger_metadata_matches has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 2 (5 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad4442849b741dbd1c0c8397664c111dde50852c30e61932666475aae0c2d70"}},{"ruleId":"D2","level":"warning","message":{"text":"DeferredLobValues.read (cognitive 44): DeferredLobValues.read has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (24 pts), ternaries 7 (9 pts), boolean chains 6, error handling 2 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fe271d340b270c0a7d972c8b8a211141727a892fbabb6761caba580bc3b470"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSession.debugBefore (cognitive 44): PlDebugSession.debugBefore has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 8, ternaries 4 (7 pts), error handling 3, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"003431bcea021788088429dd83360fee3be677e7aed2d9e629f2b1d73ccbca4f"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSource.load (cognitive 44): PlDebugSource.load has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (27 pts), ternaries 3 (7 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSource.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c6bc741e761ea76ef91c36a3da96bc40a77cc1022119e68073a98eab1f3f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.appendGraphDisplay (cognitive 44): main.appendGraphDisplay has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 3 (10 pts), match/switch 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/graph_display.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b86ef48ec398b93c38a0391a9dcd9d224476d2033ca2a7204499696ab28979"}},{"ruleId":"D2","level":"warning","message":{"text":"server.pendingNativeCompletion (cognitive 44): server.pendingNativeCompletion has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_drain.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b67d27d6c79c140c6aac0aa4e31c99f6fdd1747063d4f0be35307d768c7804"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.writeValue (cognitive 44): plDebugNativeEntry.writeValue has cognitive complexity 44 (threshold 15). Drivers by points: if/else 26 (33 pts), boolean chains 10, loops 1 (nesting depth added 7). Of this number, 30 points are the body\u0027s own statements and 14 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_frame_write.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f417bd30c8debe79ca6b3025a7ae864568ade0524cb8d0cd1debe400db825c5c"}},{"ruleId":"D2","level":"warning","message":{"text":"useAppUpdater.useAppUpdater.checkUpdates (cognitive 44): useAppUpdater.useAppUpdater.checkUpdates has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 13, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c4bc2fdb66adfc2621dff35465e515b42691355d80b2d313165839f7edabdf"}},{"ruleId":"D2","level":"warning","message":{"text":"xmlFormat.parseXmlDocument (cognitive 44): xmlFormat.parseXmlDocument has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 21). Of this number, 42 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/xmlFormat.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"968e3ec88d21c87f7f62b8240f312aeec51474874408b316c0efa8042b9a28e7"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridExecutedQuery.dataGridExecutedQueryConditions (cognitive 44): dataGridExecutedQuery.dataGridExecutedQueryConditions has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 15, loops 4 (5 pts), ternaries 2 (nesting depth added 9). Of this number, 40 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridExecutedQuery.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e87e6b286b56b80ebaaf60eee71e8848c1198288117a5edead6b823a73b3fe"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseAuthorizationPlan.postgresDatabaseAuthorizationSteps (cognitive 44): databaseAuthorizationPlan.postgresDatabaseAuthorizationSteps has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 8 (18 pts), loops 3 (7 pts) (nesting depth added 24). Of this number, 42 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b18c60b4a5f772c87e20427e497e7645ec2d99566cd4be849fed861e97dd4eb"}},{"ruleId":"D2","level":"warning","message":{"text":"productionSafety.sqlTargetSafetyText (cognitive 44): productionSafety.sqlTargetSafetyText has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 10, loops 3 (7 pts), ternaries 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"81167132b88b15568046417828b76b0cf51fc6d603353aaf72fbc73a8bf21ccc"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorTrimmedSelectionLayer.trimmedSelectionLayer (cognitive 44): codemirrorTrimmedSelectionLayer.trimmedSelectionLayer has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (32 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 25). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorTrimmedSelectionLayer.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"89297491a19262028034265e9a2e538025958d7bcc898405bc5d5ccce3aa4d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"mcpCapabilitySearch.searchMcpCapabilities (cognitive 44): mcpCapabilitySearch.searchMcpCapabilities has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 5 (9 pts), boolean chains 6, ternaries 1 (4 pts) (nesting depth added 22). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mcp/mcpCapabilitySearch.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea898799e9f6327e9da79e02260382a209c331e6dbb12672d9b6bc476c299df"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDiffDdlNormalize.stripSchemaFromSql (cognitive 44): schemaDiffDdlNormalize.stripSchemaFromSql has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 19). Of this number, 42 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffDdlNormalize.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5aa47978a2df9501c20dfdfca068a1299e51dab808862101a14cfec12ea49d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.collectSqlServerLocalVariables (cognitive 44): sqlCompletion.collectSqlServerLocalVariables has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 10, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 18). Of this number, 40 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3220}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda8d901c26574f930fb8d59ef363b835f516e73a4e2e0a8f6554ab6c25b040d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildObjectItems (cognitive 44): sqlCompletion.buildObjectItems has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 16 (22 pts), boolean chains 20, if/else 2 (nesting depth added 6). Most of this is not in the body itself: 4 of the 44 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5341, 5335). 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa8c5e8118cc209202a710934aac24afcb9be0f0a07c42cfa08a321a6eeb058"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectTriggerPseudoRecordFieldStarts (cognitive 44): sqlParameters.collectTriggerPseudoRecordFieldStarts has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 8, 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea35c9419ca208b8d4227795c6ba16856b9786b82cc1ad233b9376432d6a82c"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlRisk.sqlSafetyText (cognitive 44): sqlRisk.sqlSafetyText has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 10, loops 3 (7 pts), ternaries 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cf51b3ff2c9b664db26d69d38e850321993ead99792153d33ee35af8933e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"createMockHost.api (cognitive 44): createMockHost.api has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 7, ternaries 3 (6 pts), error handling 1 (2 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 17). Of this number, 16 points are the body\u0027s own statements and 28 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dfe67930fbee80d9330cca947da9fe0ff7ae800b4e25b0a72dc29912caf968"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_claude (cognitive 43): dbx_ai_provider::ai::stream_claude has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (37 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3873}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e3a83d37559bab412ebf65677f002b3158d937e42a02ef8ff70e48cd389b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::nacos::access_control::plan_operation (cognitive 43): dbx_core::admin::nacos::access_control::plan_operation has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 3, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a1682bc2e567b30e7728e06f098c678a4b2441575b1b6bdbe5b8d331895122"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::xugu_objects::render_definition_in_scope (cognitive 43): dbx_core::data::transfer::xugu_objects::render_definition_in_scope has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 10, loops 3 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d45b1ccd62ece67edc0f5ddda6e427e116601fb9530268139d8833a29140f05"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::pg_ndim_array_element_json (cognitive 43): dbx_driver_postgres::postgres::pg_ndim_array_element_json has cognitive complexity 43 (threshold 15). Drivers by points: if/else 28 (42 pts), match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a4c8569b22319e1dc92a5d09bcd2aa73852112ae60799ee6cbb753222d3990"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginManifest::compatibility (cognitive 43): PluginManifest::compatibility has cognitive complexity 43 (threshold 15). Drivers by points: if/else 25 (36 pts), boolean chains 3, match/switch 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb213d0d1c3713b24b99336097f4789ca504c3213ba81bfe914851716bac8df"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::parts::apply_changes (cognitive 43): dbx_sql_schema::native_job_changes::dameng::parts::apply_changes has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng/parts.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"72590fb4be01ad5e52c592ad12a7a391a6517bb4e0f1c629910756c9aba070b5"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseOracleAgent.isSelectWithClause (cognitive 43): OceanBaseOracleAgent.isSelectWithClause has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 10, loops 3 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a548d911ed1cb5eb03d6d5b19442b4ef6501830414217c9ad02bfa00ffe578"}},{"ruleId":"D2","level":"warning","message":{"text":"Loader.ddlSource (cognitive 43): Loader.ddlSource has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 3 (10 pts), loops 3 (4 pts), error handling 3, boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTypeGraph.java"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa46c0d9b97e8198d6d3add775c8c2f0298a91ce18725e8d07875007694baa35"}},{"ruleId":"D2","level":"warning","message":{"text":"main.renderXuguIndexPartitionDDL (cognitive 43): main.renderXuguIndexPartitionDDL has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":5254}}}],"partialFingerprints":{"codehealthFindingId/v1":"819b8d675b0f3b0c749a1e37a529b6089232239dc816f693d917eae2f1f7600e"}},{"ruleId":"D2","level":"warning","message":{"text":"geometryMapPreview.buildGeometryMapFeatureCollection (cognitive 43): geometryMapPreview.buildGeometryMapFeatureCollection has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 3 (6 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryMapPreview.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d5f9278f53258672ed3facaae56a1f5347d36eca889e9e6436dad879ed421e"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.extractActiveDatabase (cognitive 43): mongoCompletion.extractActiveDatabase has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (9 pts), boolean chains 6, ternaries 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"b153e7e495c4b4b05f1ef59f88434b616da9b0d7e6f1b5bd89d70a35aacbb649"}},{"ruleId":"D2","level":"warning","message":{"text":"frontendPlugin.pluginConnectionFormValues (cognitive 43): frontendPlugin.pluginConnectionFormValues has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 8 (36 pts), if/else 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"40192cbb71fd15614fd7ab8ed35404252347f7c39a0219c29dc9942259999336"}},{"ruleId":"D2","level":"warning","message":{"text":"treeNodeClick.treeNodeRowDoubleClickAction (cognitive 43): treeNodeClick.treeNodeRowDoubleClickAction has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 4 (12 pts), boolean chains 7 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6d13a8af999867358eb6309132c78b28437875ea32e0e9a1d8bc98fd3f4f41"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.activeSingleQuotedLiteralStart (cognitive 43): sqlCompletion.activeSingleQuotedLiteralStart has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (36 pts), boolean chains 6, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"404b0c9fc8a7d068e122b121c151be92b013919e56d6613b95e7f210a117568a"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTableRename.validateDependentDeclaration (cognitive 43): oracleTableRename.validateDependentDeclaration has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 11, ternaries 5 (6 pts), loops 1 (nesting depth added 14). Of this number, 42 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d934c5b710471b028e4e13ce5835f86cf2f1db39d84a482b16246d6b4f615a2"}},{"ruleId":"D2","level":"warning","message":{"text":"IssueSubmissionClient.IssueSubmissionClient (cognitive 43): IssueSubmissionClient.IssueSubmissionClient has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (15 pts), ternaries 8 (13 pts), boolean chains 11, error handling 4 (nesting depth added 6). Most of this is not in the body itself: 12 of the 43 points are its own statements and the rest belongs to 11 function items inside it that branch (generateDraft, parseResponse, submitIssue, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/issues/IssueSubmissionClient.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c840b775309046d35ddff5e8c6a22a6ce516613dbb717dfc95a96beb9066f7e2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::query_result_export::try_export_postgres_query_result_stream (cognitive 42): dbx_core::data::query_result_export::try_export_postgres_query_result_stream has cognitive complexity 42 (threshold 15). Drivers by points: if/else 30 (37 pts), boolean chains 3, match/switch 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c81bc139d759d24b30f72188697bd801b32c0435e1779c4e336f1822f03616f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::query_result_export::try_export_sqlserver_query_result_stream (cognitive 42): dbx_core::data::query_result_export::try_export_sqlserver_query_result_stream has cognitive complexity 42 (threshold 15). Drivers by points: if/else 27 (34 pts), match/switch 4 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf5956de4b1c448993537ff358ce7351b4e6e45b31eb8f5eafb9ff58c488034"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::mysql_xugu::validate_target (cognitive 42): dbx_core::data::transfer::mysql_xugu::validate_target has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dad6f4ebd0496a7b1b3eec4689e86e21e3ac1e55ff76033cc7512d66c63b32"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::lifecycle::drain_connection_inner (cognitive 42): dbx_core::query::pl_debug::lifecycle::drain_connection_inner has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 3, loops 3, match/switch 1 (2 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/lifecycle.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"229f831f9baeaff97e3d5a4fe30e9428cce74a8dce1f9afc8b4b68ac91c2f3b9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::transport::reserve_transport (cognitive 42): dbx_core::query::pl_debug::transport::reserve_transport has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 13, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/transport.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e3a977517911ddcaf5be6af44e2149a7d76ed862943d7cd9b8f2461727a002"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_evolution::read (cognitive 42): dbx_core::schema::oracle_type_evolution::read has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 9, loops 4 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_evolution.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fce74aa4ea9021dcdd14d339ca8f5b2fc326ae10541eec6451bbddc2111bb62"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::trim_mongo_outer_comments (cognitive 42): dbx_driver_mongodb::mongo_shell::trim_mongo_outer_comments has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 8, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e33947e023760649549e01a1b127a9e8db41caa12c59fae944d6d3ed8a9085"}},{"ruleId":"D2","level":"warning","message":{"text":"SshConfigLoader::parse_lines (cognitive 42): SshConfigLoader::parse_lines has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 4 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/ssh_config.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"402b80ee44476344c69a78d2503fc5160b89ec942ad2a4f183218abcb831e342"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::strip_sql_comments (cognitive 42): dbx_drivers::db::sqlite::strip_sql_comments has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 5 (13 pts), boolean chains 6 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb2da7b7237bdd26fea162d3d95ae9fdfa09abd034af3aac17b9f7bdfc0599b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::append_sequence_diff_sql (cognitive 42): dbx_sql_schema::schema_diff::append_sequence_diff_sql has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (38 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6492538ebb2395dee4a8182299c099b6d1b6901ade918cf20b35b27c4e216350"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.readValue (cognitive 42): DbxJdbcPlugin.readValue has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 12, ternaries 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":6283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbca943afc348700fbca07ec627bd8576efd6cafbcefd704ca63e604f7a8b97"}},{"ruleId":"D2","level":"warning","message":{"text":"main.pumpLongPollWatch (cognitive 42): main.pumpLongPollWatch has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 6, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/watch.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5d742f43bda65e3574ad0c6292e4b5268d915f3a0983526e2489a098241aab"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeObjectCallables (cognitive 42): main.plDebugNativeObjectCallables has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 6 (10 pts), boolean chains 7 (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":"agents/drivers/oracle-go/pldebug_object_constructors.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ab0e082758ac03f0978a6a2ac94c0d3bde9e9d45a9a06c12da6ee58a0376e5"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugRecordDecoder.leaf (cognitive 42): plDebugRecordDecoder.leaf has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (38 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_record_input.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d6d88000a28696f7978c6a784737b74bc8a57775134b3284f580c3cabede99"}},{"ruleId":"D2","level":"warning","message":{"text":"ddlStorage.stripOceanBaseOracleStorageOptions (cognitive 42): ddlStorage.stripOceanBaseOracleStorageOptions has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (26 pts), ternaries 3 (9 pts), boolean chains 6, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a838ab5d46fcac454db6c6f29010230028743b462ab515133c2b54f8d338393e"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridActions.useDataGridActions.refreshDataTabTableMeta (cognitive 42): useDataGridActions.useDataGridActions.refreshDataTabTableMeta has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 11 (22 pts), boolean chains 12, if/else 8 (nesting depth added 11). Of this number, 16 points are the body\u0027s own statements and 26 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d408496a1e60912dd7f6b0cd0d55026b5f8115468f9381fe57a81420eae308a"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleIndexes.executeOracleIndexPlan (cognitive 42): oracleIndexes.executeOracleIndexPlan has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (28 pts), error handling 3 (6 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6de7ae294fd4651145f3bf087e874716399af14361ad940383553388085b0ff"}},{"ruleId":"D2","level":"warning","message":{"text":"triggerToggleSql.buildTriggerToggleSql (cognitive 42): triggerToggleSql.buildTriggerToggleSql has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 8 (17 pts), if/else 8 (14 pts), boolean chains 10, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/triggerToggleSql.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4feaaa05795a6442c61a01bb67bb74a653b1eee7a4542afc3057a5eb666eff0"}},{"ruleId":"D2","level":"warning","message":{"text":"explainPlan.parseDamengExplainText (cognitive 42): explainPlan.parseDamengExplainText has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (27 pts), ternaries 4 (7 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e12518cd6603d39df9468d88baacb3db03355904eb4938796011939f251d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"model.parseRowSourcesAtDepth (cognitive 42): model.parseRowSourcesAtDepth has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (8 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3d9cc9bde30993c44043c3a7bc0bb3b7d5f88b5ec3e701770ee2d75d8ecddc"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.extractReferencedTables (cognitive 42): sqlCompletion.extractReferencedTables has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 10 (23 pts), boolean chains 10, if/else 4 (8 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f175e115960aba144bc073d39d5c321573450fb95e4414b0bb230cf43b90ac7b"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectNativeSqlServerParameters (cognitive 42): sqlParameters.collectNativeSqlServerParameters has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 6, 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c248bc0970ea5d550d775e0913e503e86455f1fa00f077740e1b693c571b9d"}},{"ruleId":"D2","level":"warning","message":{"text":"tableStructureEditorState.columnDataTypeForEditor (cognitive 42): tableStructureEditorState.columnDataTypeForEditor has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 12, ternaries 4 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"185ddfc4c1bcf7275c2f5c3aadcb7db470bd5f16a0c644f194a33851d676d75c"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.executeTabSql::bindLargeValueContext (cognitive 42): queryStore.useQueryStore.executeTabSql::bindLargeValueContext has cognitive complexity 42 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 6 (16 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (queryStore.useQueryStore.executeTabSql, queryStore.useQueryStore.executeTabSql::executeWithoutManualTransaction) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9562}}}],"partialFingerprints":{"codehealthFindingId/v1":"71875b9c17ec17e59bd1a31e6ad8cf3424430359ce630a28d9f4fe8f952996c5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::rewrite_mysql_create_table_name (cognitive 41): dbx_core::data::transfer::rewrite_mysql_create_table_name has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 8, loops 4 (8 pts) (nesting depth added 17). Of this number, 35 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6732}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa9dcdc684c63893fcead7ab2c067bb3202a3c0c9be0e2a81ef5f5a5e1849a0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oceanbase_sequence_edit_sql (cognitive 41): dbx_sql_core::object_source_sql::oceanbase_sequence_edit_sql has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 5, loops 2, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bce7a384ec7ae730011769d122c47760ff8410b435a1ee52ff7ee5daa25c374"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_routines::analysis::package::parse_specification (cognitive 41): dbx_sql_core::object_source_sql::oracle_routines::analysis::package::parse_specification has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 4, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb66b6e44ae1c01430d19986a52cca4a979b7649fac80a6d7169c5a8bbafe2c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::mysql_charset::without_create_charset (cognitive 41): dbx_sql_schema::schema_diff::mysql_charset::without_create_charset has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 8, loops 2, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/mysql_charset.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55bcd272d94aeb06143cbb88f0e74341c7d0da4631eaf479bf5b7a24d700f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugLegacyCollectionFromSource (cognitive 41): main.plDebugLegacyCollectionFromSource has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_declarations.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aa40d7d1b9cb19dfdd09e84f4f50c741028966c3ff50d4332ad1490602e940"}},{"ruleId":"D2","level":"warning","message":{"text":"main.openClient (cognitive 41): main.openClient has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (33 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d10db03eb5e7a8d2003d79914746758a7a55c7250ad9cf20c76b44b575845df"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.listCompletionObjectsForContext (cognitive 41): useQueryEditorCompletion.useQueryEditorCompletion.listCompletionObjectsForContext has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (25 pts), ternaries 3 (7 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 20). Of this number, 39 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"30efc020bcb9a7a759a9862702cd596e91d569012fea8b606c8516ff81f0a73a"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGenerateSession.streamInsertTable (cognitive 41): useDataGenerateSession.streamInsertTable has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 7, error handling 2 (3 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 15). Of this number, 27 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGenerateSession.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7d99db6d10d62e73400ff7e9dd8cdf1156d4b7d7aa4eadeb6eb2315f5fd17a"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportFullTableDataViaBackend (cognitive 41): useDataGridExport.useDataGridExport.exportFullTableDataViaBackend has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 19 (20 pts), boolean chains 11, if/else 8 (10 pts) (nesting depth added 3). Of this number, 37 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1942f59a2aa583eb6284a5bc7b2a3cfa7e35b2b8dc3ca939e45a5c15c61997c3"}},{"ruleId":"D2","level":"warning","message":{"text":"useDialogSources.useDialogSources (cognitive 41): useDialogSources.useDialogSources has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (41 pts) (nesting depth added 20). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to 20 function literals inside it that branch (lines 176, 193, 203, \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":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb91cfbe1d24300605839b145dea24deee24fd7a36848e65129cf145954e1482"}},{"ruleId":"D2","level":"warning","message":{"text":"regexGenerate.parseClass (cognitive 41): regexGenerate.parseClass has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (33 pts), ternaries 1 (4 pts), boolean chains 3, loops 1 (nesting depth added 20). Of this number, 37 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0cd2229e4ce94d7915da1cf318abace3a6198e15a904b037aeca9dcdfd9414"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlIntentionActions.tokenizeSelectionIdentifiers (cognitive 41): sqlIntentionActions.tokenizeSelectionIdentifiers has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af7b7c3833836931e4ffe023bd2364730469d4dcf6a7580ed33e7f52be3f804"}},{"ruleId":"D2","level":"warning","message":{"text":"graphSignatureHelp.getGraphFunctionSignatureHelp (cognitive 41): graphSignatureHelp.getGraphFunctionSignatureHelp has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 11, ternaries 3 (5 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphSignatureHelp.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3186c6461303121fd2d2f8115cc4d9b217d24d8f4791a1ba23b12b17ee97e24"}},{"ruleId":"D2","level":"warning","message":{"text":"queryCursorOffsetPagination.executeCursorOffsetPage (cognitive 41): queryCursorOffsetPagination.executeCursorOffsetPage has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 3 (6 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/query/queryCursorOffsetPagination.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"687513abc99383023bc26de0f522bff7e1ba7aef0f8899ea6194009e9b564a28"}},{"ruleId":"D2","level":"warning","message":{"text":"redisKeyTree.sortRedisTreeLevelCooperatively (cognitive 41): redisKeyTree.sortRedisTreeLevelCooperatively has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 7 (14 pts), boolean chains 9 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyTree.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a1bd1100c6804f61e73eeeca5420ae37108b30856bfe554f8d21436cb7784a"}},{"ruleId":"D2","level":"warning","message":{"text":"insertValueHints.stepLexState (cognitive 41): insertValueHints.stepLexState has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 12, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98578e0ab6dc78b3b6e89866f19ad7b7c4721255866476d2ee1ef05608277c8"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.scanSelectListContext (cognitive 41): sqlCompletion.scanSelectListContext has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"30803fefd0a8ec9f4fcba9ffb9850ad137eeccc5f7f6e7f9829e9c57d431efae"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectSelectAssignmentVariables (cognitive 41): sqlParameters.collectSelectAssignmentVariables has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 10, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c2ec2d8f217a66687ff3af9196383c55394236b3b7f51c9248966fa19275a4"}},{"ruleId":"D2","level":"warning","message":{"text":"tableSelectSql.sqlCteVisibilities (cognitive 41): tableSelectSql.sqlCteVisibilities has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"634a77779b7d407dd9ee6aa551ba811a7294ed72459fae44634b977eebb0fdfb"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.refreshSidebarObjectPagination::refreshNodes (cognitive 41): connectionStore.useConnectionStore.refreshSidebarObjectPagination::refreshNodes has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (35 pts), boolean chains 5, loops 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11464}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d48c4f1a997b8367d1686634f560d0891851144f2d7f43865ccce8b58c7f524"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.refreshDataTabInternal (cognitive 41): queryStore.useQueryStore.refreshDataTabInternal has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 11, error handling 3 (4 pts), ternaries 3 (nesting depth added 8). Of this number, 39 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5930}}}],"partialFingerprints":{"codehealthFindingId/v1":"563966b59ccaaddc0002f813de618c5dbd90064694bfcd0ca6780d6c1325d25a"}},{"ruleId":"D2","level":"warning","message":{"text":"settingsStore.normalizeMcpGlobalPolicy (cognitive 41): settingsStore.normalizeMcpGlobalPolicy has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 24, ternaries 11 (13 pts), if/else 4 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 24 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3513c4c4b901eb401755a45b1803d2ca68dff63ea5aaa2f52a0723aa036975c7"}},{"ruleId":"D2","level":"warning","message":{"text":"SnippetSyncClient::put_snapshot_with_expected_remote_hash (cognitive 40): SnippetSyncClient::put_snapshot_with_expected_remote_hash has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 3, match/switch 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4847ffdd7c43df0e205f1678b15eae5e0566d25cffb2844c133c61c04b8ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::mysql_xugu::prepare (cognitive 40): dbx_core::data::transfer::mysql_xugu::prepare has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 4 (8 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"99426f0c940eccb7606ae41081f353eb98607258093891b5ed3e37bb06bf6805"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::service::summaries (cognitive 40): dbx_core::schema::native_jobs::service::summaries has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/service.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a544e32437da60b0396557a937e41810c8b3f7cdb5e759ff4be0af5dd6e6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::split_entry_ranges (cognitive 40): dbx_core::schema::table_structure_sql::sqlite_rebuild::split_entry_ranges has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (33 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b3f249c6edcaf921871d0e68306244e2154186c7edb80afb41c22929d0ec66"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::ob_oracle::get_object_source (cognitive 40): dbx_driver_mysql::ob_oracle::get_object_source has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 1 (4 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/ob_oracle.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"270766ae8684c1f46dd1a9599a77add4063750a6e05f4e442c031dca102b4d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::rewrite_oracle_routine_self_references (cognitive 40): dbx_sql_core::object_source_sql::rewrite_oracle_routine_self_references has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 11, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca2136f7e54976a0c647f9a6eca51f5860c9dcc79d05710ae12148926a0f504"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.stripCommentsAndLiterals (cognitive 40): DbxJdbcPlugin.stripCommentsAndLiterals has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"6845d0111056a50adb67d7ae4ab66403d005a2bc3102cdb9bb8719d78f8a6d33"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.requiresTypedLobConnection (cognitive 40): PlDebugTarget.requiresTypedLobConnection has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 12, loops 3 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc254e49a8e4d879b24da7398aeb276edcf54134aaf54832d57e2bf1cbbc1819"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listIndexesWithoutOrdinality (cognitive 40): server.listIndexesWithoutOrdinality has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0970c7aba71dbb5317313a49d3a3438e399cc67a4d68d70b1e51384282385dd"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugDecodeCollectionEnvelope (cognitive 40): main.plDebugDecodeCollectionEnvelope has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 7, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_collection_input.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b38b552efc72d8a37647908ce7fdb3cd68ee968bbd994d36281097efe05cac"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.executeTarget (cognitive 40): plDebugNativeEntry.executeTarget has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 621, 682, 672). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23e8113e53a927ac615fa2f32515309a9bb536114d6de22a01e2223db47c21f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.convertObjectKeyedInt64Map (cognitive 40): main.convertObjectKeyedInt64Map has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 6 (11 pts), boolean chains 9 (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":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"48972d09f4592e9789b64d5454fdde3212ac621c3beb1964a794d16f23fe210d"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridPaintTheme.resolveDataGridPaintTheme (cognitive 40): dataGridPaintTheme.resolveDataGridPaintTheme has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 39, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridPaintTheme.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"41782c6de59ffb3f83472eaf4944f9303b19a6f4ae9f0c050de8bbb124cc240e"}},{"ruleId":"D2","level":"warning","message":{"text":"oceanbaseSessionDiagnostics.collectOceanbaseSessionDiagnostics (cognitive 40): oceanbaseSessionDiagnostics.collectOceanbaseSessionDiagnostics has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 6 (13 pts), boolean chains 8, error handling 4 (6 pts) (nesting depth added 10). Of this number, 39 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa054a42426843a2b0639d5eef5508460cf96f1e28103e3dcf33f66d21aa1d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTriggerPlan.executePreparedTriggerPlan (cognitive 40): oracleTriggerPlan.executePreparedTriggerPlan has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (30 pts), ternaries 9 (22 pts), error handling 7 (14 pts), boolean chains 12, loops 5 (10 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (oracleTriggerPlan.executePreparedTriggerPlan::run) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2701845656dccf38af286e207f426a5c0af8d9a19d1e5b203d2b814c7368531d"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarTableSearchControl.resolveLocalTableSearchParent (cognitive 40): sidebarTableSearchControl.resolveLocalTableSearchParent has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTableSearchControl.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"546ec47efd31cf76ff5d229d75795e55c8fbeb71ad3b76a0b5884d7a2f439881"}},{"ruleId":"D2","level":"warning","message":{"text":"insertValueHints.selectProjectionStarts (cognitive 40): insertValueHints.selectProjectionStarts has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 11, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"806f93a32229e82735e094e7aac500c9295803d94ea71fd18d7dd8d7bae40ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives.renderInline (cognitive 40): primitives.renderInline has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (24 pts), ternaries 7 (12 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/primitives.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c5be1f27f747d1b5eb8506c764a0917e5609fc7e1335899a143bfd124375e0"}},{"ruleId":"D2","level":"warning","message":{"text":"validateRecord (cognitive 40): validateRecord has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 16, if/else 10 (16 pts), ternaries 2 (6 pts), loops 1, other 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/connections.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1b924d4363eea405db469fd5f21bd207dd17444286f0f460c7a0f4ee354228"}},{"ruleId":"D2","level":"warning","message":{"text":"RoutineOperationRegistry::prepare_batch (cognitive 39): RoutineOperationRegistry::prepare_batch has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 6 (7 pts), boolean chains 5 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/operations/retention.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb07da368d8c24cfb70ce54bb4578054bda4c7012429375a33c91c228cde4034"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::write_large_value_snapshot (cognitive 39): dbx_core::query::write_large_value_snapshot has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"d748e2e3f6dca4bc1f01e1ade5857a478257089020191c243efac1b58e452b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::stream_rows_in_manual_transaction_with_cancel (cognitive 39): dbx_core::query::stream_rows_in_manual_transaction_with_cancel has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":7416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23dab231336fec9a66025b50f916cde38e2317d555cca4c19f53ea4f3107c24"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_management::dependencies (cognitive 39): dbx_core::schema::oracle_type_management::dependencies has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_management.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79cc0a8affbf4e72700ee14382a6d8c5717aa5ff3e18174fb12b4819a6bacd1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::build_executable_object_source_statements_with_mysql_validation_name (cognitive 39): dbx_sql_core::object_source_sql::build_executable_object_source_statements_with_mysql_validation_name has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (22 pts), boolean chains 17 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee82a0968731051ff6dd236515578ddde63ff0f45b40ac9a0ecd3f78d0e053b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::generate_table_trigger_sql (cognitive 39): dbx_sql_schema::schema_diff::generate_table_trigger_sql has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a405f09bc1da63f13ffd235c988cc7250a3ceadfe814a15e8e5b31ce411e355"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::triggers::oracle_trigger_body_start (cognitive 39): dbx_sql_schema::table_structure_sql::triggers::oracle_trigger_body_start has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (10 pts), boolean chains 6 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"394f56fea2133b8502f033c0c2dd7874d0fc80cdeb9f0da408852c45fc435997"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::list_sql_files::scan_sql_files_with_diagnostics (cognitive 39): dbx::commands::list_sql_files::scan_sql_files_with_diagnostics has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/list_sql_files.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5380dbd26d0c9551ebfccfe28852c7b124d6d37a2443e822c5559916785c0216"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::mcp_bridge::handle_sql_approval (cognitive 39): dbx::commands::mcp_bridge::handle_sql_approval has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (24 pts), match/switch 7 (8 pts), boolean chains 7 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into 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-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c33e944b65760e0014a3f116c824f586408d545fb79dac4261efada67912b4"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.brokerEndpoints (cognitive 39): KafkaAgent.brokerEndpoints has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (18 pts), ternaries 4 (8 pts), boolean chains 7, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a5077682ef600a335fc7e7ef2a2377f03a715f9f3b7900094b144ed3de9004"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugObjectConstructors.select (cognitive 39): PlDebugObjectConstructors.select has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugObjectConstructors.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8436de8b3a68917ecbbd992b6831687391f3f150e6a418e98170b28117dd183a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.buildTLSConfig (cognitive 39): main.buildTLSConfig has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5d4dc03d31eede93e0694ed55c18b86069fe3525ec3394b592c732250eae2a"}},{"ruleId":"D2","level":"warning","message":{"text":"kerberosConfig.finalize (cognitive 39): kerberosConfig.finalize has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (35 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/kerberos.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"256a9b1ae30209f1f7017dae7a91552f61fb6ae51374d4fa061b6a8830b04784"}},{"ruleId":"D2","level":"warning","message":{"text":"etcdSession.status (cognitive 39): etcdSession.status has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 6 (13 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/status.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7bff12c26bbcdc52ece1dc83fb7d4f19298c13887f0d546108f51df7f994c6"}},{"ruleId":"D2","level":"warning","message":{"text":"main.buildTLSConfig (cognitive 39): main.buildTLSConfig has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"319f94b8569502527cc0e714160d0ac2cb53b5baa81643373948c703fa3bb306"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugLegacyCollectionElementMatches (cognitive 39): main.plDebugLegacyCollectionElementMatches has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 9, loops 2 (3 pts), match/switch 1 (nesting depth added 14). Of this number, 38 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_type_graph.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f33fee765966121024336381f028b48cd0fcf2be2b06d8b9222addfdce9965"}},{"ruleId":"D2","level":"warning","message":{"text":"server.dispatch (cognitive 39): server.dispatch has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (33 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaba7d56d0739153f57498c831cff18177c511566274bedbee96be74af3feab4"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.completionOptionForItem (cognitive 39): useQueryEditorCompletion.useQueryEditorCompletion.completionOptionForItem has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 12 (18 pts), if/else 10 (15 pts), boolean chains 6 (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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad325f38bfe1c50c339377f42b6a24dbbbdf15353c74319fb54a0344151c33cd"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferValues.escapedTextLiteral (cognitive 39): queryResultTransferValues.escapedTextLiteral has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 3 (9 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 18). Of this number, 32 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7f6ae9171b6ce3d6409f52627913cf945f74a8fc3c91b530c28083cd5d0e07"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportQueryResultViaBackend (cognitive 39): useDataGridExport.useDataGridExport.exportQueryResultViaBackend has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 12, boolean chains 9, error handling 1 (nesting depth added 4). Of this number, 33 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89cfb9f670f72c848a008d06ac5570fecd3453e8109f16f5c272588a2f71d38"}},{"ruleId":"D2","level":"warning","message":{"text":"regexGenerate.pickFromClass (cognitive 39): regexGenerate.pickFromClass has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 5 (16 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee89d5434cc96fd98e65619c9739f95fd0f01b0e0723519c09972d4b98e8b51"}},{"ruleId":"D2","level":"warning","message":{"text":"dbAdminSql.buildDuplicateTableStructurePlan (cognitive 39): dbAdminSql.buildDuplicateTableStructurePlan has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 19, ternaries 6 (11 pts), if/else 7 (9 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5b06d922d270cdef525435bac4df091ede559c9f7efe297044e0efe55b26d8"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.readOracleForeignKeyReferenceSnapshot (cognitive 39): oracleForeignKeys.readOracleForeignKeyReferenceSnapshot has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 19, if/else 6 (11 pts), ternaries 6 (7 pts), loops 1 (2 pts) (nesting depth added 7). Of this number, 38 points are the body\u0027s own statements and 1 belongs to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"873af296e51ff5639da431d68a8bd5a821f3a1054fde792fa533682247b98cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.collectScopeVariables (cognitive 39): mongoCompletion.collectScopeVariables has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (9 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b3b193762a89c01ff06ffa19f70312f564b5e100f1d2edd5177425239111f0"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printClause (cognitive 39): printer.printClause has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 8, ternaries 4 (7 pts) (nesting depth added 9). Most of this is not in the body itself: 9 of the 39 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 85, 99). 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":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c91fe9dfa21ca57e4534903890651720d40a4b3f87dcd603584454c8a30974d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.parseTrailingIdentifierContext (cognitive 39): sqlCompletion.parseTrailingIdentifierContext has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 8 (14 pts), boolean chains 8, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3457}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b67dcad17efbfb1940ca2c7aa8146d20dbfe084022c0ee4e02f86a9563043c"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.parseTrailingIdentifierPart (cognitive 39): sqlCompletion.parseTrailingIdentifierPart has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 8, loops 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4eecb86f057916344054a8be50be9ef53ae5f87ab841b9996cf6fc2570cb8c"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.searchSidebarObjects (cognitive 39): connectionStore.useConnectionStore.searchSidebarObjects has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 5 (9 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 15). Of this number, 27 points are the body\u0027s own statements and 12 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3273}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d8bf5ff1808fc41bb6b0b19a427c742ea14f0508db88ef3fe1e944e3c7c51d"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.connect (cognitive 39): connectionStore.useConnectionStore.connect has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 13, error handling 2 (nesting depth added 5). Of this number, 36 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5556}}}],"partialFingerprints":{"codehealthFindingId/v1":"413f2aad0753b1c9b2bfbc4b1e8986b20d3c8587d426998684df8c686e4189c1"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.resolveResultMetadataForBatch (cognitive 39): queryStore.useQueryStore.resolveResultMetadataForBatch has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 9, ternaries 3 (6 pts), loops 1 (nesting depth added 15). Of this number, 33 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10954}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3c442d523be1f36e64f15287eccb04c8173f12d150d9bf22f2a0dc7db67e23"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::execute_multi_core_with_options_for_client_and_progress_typed_inner (cognitive 38): dbx_core::query::execute_multi_core_with_options_for_client_and_progress_typed_inner has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 4 (6 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":4038}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb2bec0ac493bef6ac6f369996a6ca504a34cb53f20d4e28523d22da18d1ce4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_driver::bulk_write (cognitive 38): dbx_driver_mongodb::mongo_driver::bulk_write has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (34 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b506ab14520bf16bda7a99e3da848ab059415a09f77ba17e1c8d5273ee734224"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::top_level_sqlserver_tokens (cognitive 38): dbx_driver_sqlserver::sqlserver::top_level_sqlserver_tokens has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (10 pts), boolean chains 8 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"120886e4727fe82408f22adc60223b96745668fbb0e2b8accec4bb6e0f824cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginPackageInstaller::install_bytes_locked (cognitive 38): PluginPackageInstaller::install_bytes_locked has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21 (31 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"713fb7675c097664bc9086598ee10ed0dcbe7a3e7c02f21ae2e8e75ce1c875c8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::oracle_post_table_constraints (cognitive 38): dbx_sql_core::object_source_sql::oracle_indexes::oracle_post_table_constraints has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 7, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2669016eafb815c15c9310d0e8c109fe65a2b1b0fde44fefb01b224cf4cdcab"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_types::models::connection::normalize_postgres_url_params (cognitive 38): dbx_types::models::connection::normalize_postgres_url_params has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"2977cd4ecef0e1ddafef18eb9faf134bc0b73beb6c75835d8ccc572d315018f0"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.oracleListIndexes (cognitive 38): DbxJdbcPlugin.oracleListIndexes has cognitive complexity 38 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 11, ternaries 3 (7 pts), error handling 3 (5 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f9e405699944b83d42645a431edcb5bc65c9c2eb4aca25dea010daf0d1ec76"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleTriggerMetadataReader.summaries (cognitive 38): OracleTriggerMetadataReader.summaries has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 6 (12 pts), boolean chains 7, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c283c1eeb50a5751cf896a2e9743f9c96ecb0cb2621532813e10ec0d372ef95"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseConnectionConfig (cognitive 38): main.parseConnectionConfig has cognitive complexity 38 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3514fc3df87cf382fa3515b2df128da3965631aa66b7e28ee07a317000a80ec"}},{"ruleId":"D2","level":"warning","message":{"text":"main.rewriteNativeConnectionStringSSLMode (cognitive 38): main.rewriteNativeConnectionStringSSLMode has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 4 (7 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a024461ff753666129a14f0a9ae2ed8eaafcd4cb45755574950f9ddcfef13b"}},{"ruleId":"D2","level":"warning","message":{"text":"rocketMQAgent.listProducers (cognitive 38): rocketMQAgent.listProducers has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 6 (12 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a27108dba74967a702fca97deaeb13c1d6ccfcfee13fbaa62eb94fa78e0df01"}},{"ruleId":"D2","level":"warning","message":{"text":"useSessionDiagnostics.useSessionDiagnostics.refresh (cognitive 38): useSessionDiagnostics.useSessionDiagnostics.refresh has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3 (7 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 14). Of this number, 34 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSessionDiagnostics.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a916b6cb990cc9627d8f9707e74449e8bdc3e06ad97b0e7a4fc63d86109ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportDataLegacyForTarget (cognitive 38): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportDataLegacyForTarget has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 8 (12 pts), boolean chains 7, error handling 1 (nesting depth added 10). Of this number, 22 points are the body\u0027s own statements and 16 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af9c13d8ec584072cf95c14d1253ca9e07dcc33fbbd85da79db7942018c3738"}},{"ruleId":"D2","level":"warning","message":{"text":"documentStoreProvider.buildDocumentFilterCondition (cognitive 38): documentStoreProvider.buildDocumentFilterCondition has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (23 pts), ternaries 5 (8 pts), boolean chains 6, match/switch 1 (nesting depth added 13). Of this number, 37 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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcc1cfc2a89b7af5e9f60dfa6c86ac505471cea1b9a702c82c8862b55c3fe52"}},{"ruleId":"D2","level":"warning","message":{"text":"codeSnapshot.snapshotElementToPng (cognitive 38): codeSnapshot.snapshotElementToPng has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 17, if/else 7 (13 pts), ternaries 6, error handling 1 (2 pts) (nesting depth added 7). Of this number, 29 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7706203c59894d654eeb2b4cc876f160727a947f9d737a8f1c3b89c70513e9"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.splitMongoSemicolonSeparatedSegments (cognitive 38): mongoShellCommand.splitMongoSemicolonSeparatedSegments has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 10, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a660883b397838ef09b2d209da4ca6fea0988da2b896c0cf4896f6365d5d05"}},{"ruleId":"D2","level":"warning","message":{"text":"oraclePackageSaveAs.executePreparedOraclePackageSaveAs (cognitive 38): oraclePackageSaveAs.executePreparedOraclePackageSaveAs has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 9, ternaries 2 (3 pts), error handling 1, loops 1 (nesting depth added 6). Of this number, 35 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6d93545f1a4674ec6d58542e8d62bf871ea803049019d2424b5bc5f354304f"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineRename.prepareOracleRoutineRename (cognitive 38): oracleRoutineRename.prepareOracleRoutineRename has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21 (33 pts), error handling 7 (11 pts), boolean chains 8, ternaries 2 (5 pts), loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (oracleRoutineRename.prepareOracleRoutineRename::walk) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38ad6df8993bdefa7bf587fba7f832fd9c98d8cdbeeca6bdae5ae5cd730f628"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::parse_sql_insert_statement (cognitive 37): dbx_core::data::table_import::parse_sql_insert_statement has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b037289e3f6207c9a92ab675126533319743bd5a13efbaae9fdb68d17bd3762f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::exec_tx_sqlite_inner (cognitive 37): dbx_core::query::exec_tx_sqlite_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":6254}}}],"partialFingerprints":{"codehealthFindingId/v1":"047e252d2c24c1a3d893c0e25352d854569e5f6aad8e19552fe401f422ee47c1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::mutation::pl_debug_claim_mutation_core (cognitive 37): dbx_core::query::pl_debug::mutation::pl_debug_claim_mutation_core has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 9, loops 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/mutation.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab3954723f92bb1b5c666e55f9a6ccc344e713da2302edcf9e2891130ff1310"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::get_oracle_type_management_snapshot_with_objects_core (cognitive 37): dbx_core::schema::get_oracle_type_management_snapshot_with_objects_core has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 4 (9 pts), boolean chains 3, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":13166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de0726abde6e531647c4f536415ae7d2672453bb6971b20b7c733e379c5db1e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::transfer::packages::external_types::read_type (cognitive 37): dbx_core::schema::oracle_routines::transfer::packages::external_types::read_type has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages/external_types.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb972e0e4973585fee3120fae6c0e207c85034eec7c757885821cdba149c259"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::backend_error::consume_sensitive_value (cognitive 37): dbx_driver_agent::backend_error::consume_sensitive_value has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 4 (9 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/backend_error.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"d272817d01dd825be2612477ddeb17e89814eb787ee4890dcae2174a75e993eb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::couchdb_driver::get_columns (cognitive 37): dbx_drivers::db::couchdb_driver::get_columns has cognitive complexity 37 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 2 (10 pts), match/switch 2 (9 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e5a0cba9b68ff73cf8d17399be1b54959ce9ea35cf2197a493c5e8b59053a0"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::execute_redis_command (cognitive 37): DbxMcpServer::execute_redis_command has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (22 pts), match/switch 7 (8 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa741f38d1c896486f2c6b9911e4ee8736fee6c05fcd67bd83009cd79e10e2a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Analysis::select (cognitive 37): Analysis::select has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 6, match/switch 2 (4 pts), loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"6640b46b745ee6bb6554b1176864b91f1cc8d72f69ddbd2804f97b9cce60c6b9"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlScanner::step (cognitive 37): SqlScanner::step has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 16, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4aa1ec5246257c527b01dd41c8ddac7ef14dd9114cd56475aaddffd26b2114"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::dml_preview_sql::build_update_preview (cognitive 37): dbx_sql_core::dml_preview_sql::build_update_preview has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 3 (7 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/dml_preview_sql.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a34c2846bbdf75d46b8e33abe102da07f97b971c42866bbf8f77ebae8875d91"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_jobs::references::native_job_reference_queries (cognitive 37): dbx_sql_schema::native_jobs::references::native_job_reference_queries has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22, boolean chains 12, match/switch 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_jobs/references.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca9fb515422e6207a43bbb44e9d9696523e93f8bb02365612001a8476936a38"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::credentials::restore (cognitive 37): dbx_web::credentials::restore has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/credentials.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b819f5cdf33e0e0aabe7552d34c3e69f00c1dddd2ea4e1ef4667816165cf761e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_cli::dev::build_config (cognitive 37): dbx_plugin_cli::dev::build_config has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/cli/src/dev.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a143bee3498d5b47fb4caa911c714233759cb3f0f63842e03719af49715f280d"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.getExplainInfo (cognitive 37): DbxJdbcPlugin.getExplainInfo has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 5 (12 pts), loops 2 (5 pts), boolean chains 2, ternaries 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9571e824a9618b045133c3fb9fe203b4f26df89cfb680a4202c7a7a85fd5f73"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.listConsumerGroups (cognitive 37): KafkaAgent.listConsumerGroups has cognitive complexity 37 (threshold 15). Drivers by points: loops 6 (13 pts), error handling 3 (9 pts), if/else 4 (8 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d0f2dc56792a1d9cd261cc78cd6825318cc4a32f9b578a3975a80c683bcf58"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.peekMessages (cognitive 37): KafkaAgent.peekMessages has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 7 (11 pts), ternaries 4 (7 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"5745481f2b02314750bdcd81e4e6d64c3ac19d3afb28c0f7bfc2317c82bb637e"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.inputPayloadBytes (cognitive 37): PlDebugTarget.inputPayloadBytes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 2 (9 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59f2272c24718865b5007e65ae8c567a47c80905bee3b9ddc2b9bb9693bc106"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseConnectionConfig (cognitive 37): main.parseConnectionConfig has cognitive complexity 37 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1cf6b719bb6e3a4f9d600bf8cd9fc642161f1ebacfcc763aa808ac688ca197"}},{"ruleId":"D2","level":"warning","message":{"text":"server.completionAssistantSearch (cognitive 37): server.completionAssistantSearch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"43507b0f8b153f47b757c03e0be443421a28832f557b2a782ab85e8f07faecdc"}},{"ruleId":"D2","level":"warning","message":{"text":"server.completionAssistantSearch (cognitive 37): server.completionAssistantSearch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9152ee248c7a7bcb848f959c2d9cb718343ca13945b8c248a373ed88100f7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugLegacyPackageDeclarations (cognitive 37): main.plDebugLegacyPackageDeclarations has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_declarations.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"653293d3b104142b8aa832bfed75279e81c83be73282346bba79439d0025cc61"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugDecodeTimezoneInput (cognitive 37): main.plDebugDecodeTimezoneInput has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 12). Of this number, 33 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_timezone.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10f28cd5d43692f95cdf27d8d1517042aa7bd6a731f834f926c69f3c84e9c78"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeServer.awaitNativeDrain (cognitive 37): runtimeServer.awaitNativeDrain has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 7 (15 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_drain.go"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce8aaf16a2e533a3c9f456b7dc75544247d86ed62c260d16645aaa1dab68399"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeCapture.finishReferences (cognitive 37): plDebugNativeCapture.finishReferences has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 8, loops 2 (nesting depth added 10). Of this number, 35 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_output.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dee1183de06da1c7b6779bb25f90da2cf2af2fd08c02cb39a6d6d2b4c7391f3"}},{"ruleId":"D2","level":"warning","message":{"text":"rocketMQAgent.connectProxy (cognitive 37): rocketMQAgent.connectProxy has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (35 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/proxy.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9956bebff29619d12fcbc9057cb986f74f11823521cf4c6717fb956bb10846b"}},{"ruleId":"D2","level":"warning","message":{"text":"server.completionAssistantSearch (cognitive 37): server.completionAssistantSearch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"32dbc670fac63eceba85d7c8306650dfe50da3a219c746cf713f42aaa56d06fa"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridActions.useDataGridActions.onSort (cognitive 37): useDataGridActions.useDataGridActions.onSort has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 8 (16 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8cfb5f44c1c3aa5e83e80d920ac882df8aab5faf0245ee8afc990016c70794"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.submitBackendExport::execute (cognitive 37): useDataGridExport.useDataGridExport.submitBackendExport::execute has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 8, ternaries 3 (5 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2629}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e5a2a67eb0f68fc33d743379192e0dc2706225830fb953da2053a6d5f01b3f"}},{"ruleId":"D2","level":"warning","message":{"text":"geometryPreview.drawGroups (cognitive 37): geometryPreview.drawGroups has cognitive complexity 37 (threshold 15). Drivers by points: loops 8 (20 pts), if/else 9 (15 pts), boolean chains 2 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f318b461771beaf5b3f2c4956430727d915ebe7bfe0be87e6e07aae5ae4715"}},{"ruleId":"D2","level":"warning","message":{"text":"joinedRowChanges.joinedRowChanges (cognitive 37): joinedRowChanges.joinedRowChanges has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (26 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 22). Of this number, 21 points are the body\u0027s own statements and 16 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/joinedRowChanges.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f24d11b4798454ad845cf8101b3559b834d2a82214b1b835a92a380b5f90f01"}},{"ruleId":"D2","level":"warning","message":{"text":"anotherRedisImport.connection (cognitive 37): anotherRedisImport.connection has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 12, ternaries 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/anotherRedisImport.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a71e3617e9a7c67d4f0e859368a5a9cb380ec67884bafd0ba0afd2821e25a5"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.getMongoCompletionContext (cognitive 37): mongoCompletion.getMongoCompletionContext has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 13 (20 pts), if/else 12 (13 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16d2e9f4393506dc0a98512d01a8c75c978456f74427b40e1839cb21d261d21"}},{"ruleId":"D2","level":"warning","message":{"text":"model.cteBodyProjectionShape (cognitive 37): model.cteBodyProjectionShape has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"769f5bf3530faed5df2b9dd88b4b5906def2f2bdb4457d09324dcde3014dfd23"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildForeignKeyRelatedTableItems (cognitive 37): sqlCompletion.buildForeignKeyRelatedTableItems has cognitive complexity 37 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 9, loops 3 (6 pts), ternaries 5 (6 pts) (nesting depth added 15). Of this number, 25 points are the body\u0027s own statements and 12 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4afbb1ab98e24dadafdd01083a2c88ed5f7cf989721efdbcaa8cb5c9672f18"}},{"ruleId":"D2","level":"warning","message":{"text":"starrocksLayoutCopy.buildStarRocksLayoutCopyDdl (cognitive 37): starrocksLayoutCopy.buildStarRocksLayoutCopyDdl has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 11, ternaries 3 (6 pts), loops 2 (3 pts) (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 16 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksLayoutCopy.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f8bcb5204a42b0de35f0b9502a4e17b78f331c24b64d94cc134da320ed3be0"}},{"ruleId":"D2","level":"warning","message":{"text":"json.shellConstructorToExtendedJson (cognitive 37): json.shellConstructorToExtendedJson has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 7 (13 pts), boolean chains 7, 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":"packages/mongo-shell/src/json.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee93be77eca8e806431e329f5097f68c9abfbc061010fb5dd89e10794fb5514"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::export_bson (cognitive 36): dbx_core::data::mongodb_import_export::export_bson has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":3080}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d6527e5f5e70f8720ec1a017a35915174a2ff724d82ec0c97602dfdc8a49b2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::sqlserver_manual_transaction::execute (cognitive 36): dbx_core::query::sqlserver_manual_transaction::execute has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 5 (10 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/sqlserver_manual_transaction.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccffb5efe53a41e6596eb871f770a531a10784f5e7658b7e95f1f855585ee0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::get_table_ddl_once (cognitive 36): dbx_core::schema::get_table_ddl_once has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 5 (12 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":11735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfdf61d833933a7880635eb1b0915dace2bc384d7cd3068671faedaed45a59d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_table_triggers::enrich (cognitive 36): dbx_core::schema::oracle_table_triggers::enrich has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 5 (10 pts), boolean chains 8, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_table_triggers.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"080072d02ab3e495cefa443dd283e590ff332e5496e8a2fb440ebd39175d3831"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentDriverClient::call_typed_with_timeout_and_cancel (cognitive 36): AgentDriverClient::call_typed_with_timeout_and_cancel has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 8 (15 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb17fcae3a600741cab3985281e6ed2cb91ac1400cf371930b826ebf516a489"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::couchdb_driver::couchdb_docs_to_table (cognitive 36): dbx_drivers::db::couchdb_driver::couchdb_docs_to_table has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (10 pts), match/switch 3 (8 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee084872cf06ac19e02ae90c2d6c38f548eb062ec4f0bd5f30936346d8178748"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::solr_driver::solr_docs_to_table (cognitive 36): dbx_drivers::db::solr_driver::solr_docs_to_table has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (10 pts), match/switch 3 (8 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/solr_driver.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e353df69d65be2066f06bd7d1ed0b8a007ed8e9622a62b7229c49a12c7a9a2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::extract_create_table_body (cognitive 36): dbx_drivers::db::sqlite::extract_create_table_body has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 4 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8dbe40d628d6bb3d72ba026b8991929a0f127fee9cd35b276c19dfbae6d637"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::parse_column_definition (cognitive 36): dbx_drivers::db::sqlite::parse_column_definition has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 1 (5 pts), boolean chains 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9121d85fa6d60cadb5b4ef9083d412a908853ae66b605ccc37dab6be388fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_runtime::plugins::marketplace::validate_and_resolve_catalog (cognitive 36): dbx_plugin_runtime::plugins::marketplace::validate_and_resolve_catalog has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/marketplace.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0db0d1a27383fe57b338609dafe17441c44c4d814a98205722aa011bba8ccf2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::oracle_type_migration_sql::build_type_evolution_sql (cognitive 36): dbx_sql_core::oracle_type_migration_sql::build_type_evolution_sql has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af6447c504a4f884651c1f9c6160fd16528ba5f545426ebf3f55f6aa157d387"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::oracle_type_migration_sql::evolution_shape (cognitive 36): dbx_sql_core::oracle_type_migration_sql::evolution_shape has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 3, loops 3, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d575439e36808b377f89923ad8f98a3b79876a2254fb11cdd77e8fb1d52d4015"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::sqlserver_top_level_blocks (cognitive 36): dbx_sql_core::sql::sqlserver_top_level_blocks has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f8cf1c61995c217131a77458c456262d48431e6e6853cd384dff7f3cb469ec"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::create_index_sql (cognitive 36): dbx_sql_schema::schema_diff::create_index_sql has cognitive complexity 36 (threshold 15). Drivers by points: if/else 24, boolean chains 8, match/switch 2 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":4808}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f66a4adeeb0ee1161ef40efff6bb07e4c421236a55c83e7600ea866ece7323"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::mcp_bridge::start (cognitive 36): dbx::commands::mcp_bridge::start has cognitive complexity 36 (threshold 15). Drivers by points: if/else 28 (30 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44b5606a4c2edec5da7e4ebb662ccc4e8cd2a66f486af37371a66ab75818b6d"}},{"ruleId":"D2","level":"warning","message":{"text":"DamengAgent.getExplainInfo (cognitive 36): DamengAgent.getExplainInfo has cognitive complexity 36 (threshold 15). Drivers by points: error handling 6 (14 pts), if/else 9 (14 pts), loops 2 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3559}}}],"partialFingerprints":{"codehealthFindingId/v1":"20288100de73e4e3c615e28f036480da9643111593979e39a26e779ebe6618c1"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseOracleAgent.getColumnsInContext (cognitive 36): OceanBaseOracleAgent.getColumnsInContext has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 6, loops 2 (5 pts), ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c977a28ceed724643126aa225ae4a6659e66157962d5868f885dc0b58e9d0f7"}},{"ruleId":"D2","level":"warning","message":{"text":"main.loadTrustStore (cognitive 36): main.loadTrustStore has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (6 pts), match/switch 2 (4 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d3b966a8ca1b528c54aa5d34705979d4056765e405e124884e9460fbe9e98b"}},{"ruleId":"D2","level":"warning","message":{"text":"zooKeeperDiscovery.Endpoints (cognitive 36): zooKeeperDiscovery.Endpoints has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d221fcff225110095b2d7e0f35ee7d1835000c05e9841df95d28bb0b8defb35"}},{"ruleId":"D2","level":"warning","message":{"text":"main.loadTrustStore (cognitive 36): main.loadTrustStore has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (6 pts), match/switch 2 (4 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/zookeeper_tls.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed85a7a1f07dcac4ecf5605f845eaa86888b46d543f8183ff6ee2686346261a"}},{"ruleId":"D2","level":"warning","message":{"text":"zooKeeperDiscovery.Endpoints (cognitive 36): zooKeeperDiscovery.Endpoints has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/discovery.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"358bf73992d5d6045f1b4b989b981a849faaf84b56421090c2949e29825d7523"}},{"ruleId":"D2","level":"warning","message":{"text":"main.hasTopLevelSQLKeyword (cognitive 36): main.hasTopLevelSQLKeyword has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (30 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b014be843af7500c028ff34a1966c290713d9a7a6984d244d2488564409254"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-schema-objects.main (cognitive 36): verify-schema-objects.main has cognitive complexity 36 (threshold 15). Drivers by points: error handling 7 (13 pts), if/else 11 (12 pts), boolean chains 6, ternaries 3 (4 pts), loops 1 (nesting depth added 8). Of this number, 26 points are the body\u0027s own statements and 10 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc240ff18d272f6f982d1ab0ab6a198287bec0a611b5b67130de896f0ec27f24"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor (cognitive 36): useDataGridEditor.useDataGridEditor has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 12, ternaries 1 (2 pts) (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 20 belong to 8 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a83e566ce27387e759bc3a2af583118a1dd35d04b71ee0f4bebf0cc976df0e"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridLargeValues.useDataGridLargeValues.resolveLargeValueCells (cognitive 36): useDataGridLargeValues.useDataGridLargeValues.resolveLargeValueCells has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 4 (6 pts), boolean chains 5 (nesting depth added 17). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d19e33d9e7c56a9223f5fb4a7fc12bdaf5f768df0603624029866e53f976175"}},{"ruleId":"D2","level":"warning","message":{"text":"useMultiDbTargetSelection.useMultiDbTargetSelection.validateTarget (cognitive 36): useMultiDbTargetSelection.useMultiDbTargetSelection.validateTarget has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useMultiDbTargetSelection.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45f0b28a16c4ea9ae00b88bd773b282703374548250ab15c7b6496c786da643"}},{"ruleId":"D2","level":"warning","message":{"text":"useScheduledDatabaseBackups.useScheduledDatabaseBackups.update (cognitive 36): useScheduledDatabaseBackups.useScheduledDatabaseBackups.update has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 4 (16 pts), if/else 6 (14 pts), boolean chains 5, loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useScheduledDatabaseBackups.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc95dd4eaeba8257c70274e8a2703459f52f8e936b311249c693fce2044d8f31"}},{"ruleId":"D2","level":"warning","message":{"text":"http.aiAgentStream (cognitive 36): http.aiAgentStream has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (25 pts), error handling 1 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffd165563333cfbf844b9581c9ff5fc6c2876170fe62e3757fd56f834baee94"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridClipboard.prepareDataGridClipboard (cognitive 36): dataGridClipboard.prepareDataGridClipboard has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (nesting depth added 14). Of this number, 32 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":"apps/desktop/src/lib/dataGrid/dataGridClipboard.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd84ba11003cabe8b2371c26b0f74081404c9bf9bca19b41493a0d12f18e247c"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridInsertPaste.readBracketedGroup (cognitive 36): dataGridInsertPaste.readBracketedGroup has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fced5fae4bee15ce976e8983801cb4983ee3471e0f287dccfa44d6eccae91e"}},{"ruleId":"D2","level":"warning","message":{"text":"legacyLargeValueExport.fetchLegacyLargeValueRequestChunk (cognitive 36): legacyLargeValueExport.fetchLegacyLargeValueRequestChunk has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 9 (14 pts), if/else 10 (12 pts), boolean chains 8, loops 2 (nesting depth added 7). Of this number, 25 points are the body\u0027s own statements and 11 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/legacyLargeValueExport.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"38955fdc57f2213a1db269394ce53bb5218ccfec6ba30b3369e8be2c5d97ce6f"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleConstraints.expressionTokens (cognitive 36): oracleConstraints.expressionTokens has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2064de2445653bc67f34e9fccb5ab4426a6fa9f11a62cc85834206a9c8a2a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleSecurity.oracleGrantSources (cognitive 36): oracleSecurity.oracleGrantSources has cognitive complexity 36 (threshold 15). Drivers by points: if/else 3 (12 pts), ternaries 4 (12 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSecurity.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"de30d95e7225d88377dc6cbf7a301f8d8f988c59d658ac7d5e7c592e7dc4b95e"}},{"ruleId":"D2","level":"warning","message":{"text":"xuguUserPermissions.xuguGrantSql (cognitive 36): xuguUserPermissions.xuguGrantSql has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 7, ternaries 4 (6 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8cf285d2e0d95c2b214efbabe078ed708cdf3953bdfa08ddff58b7f2dc21d3"}},{"ruleId":"D2","level":"warning","message":{"text":"match-engine.inferRelationships (cognitive 36): match-engine.inferRelationships has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (21 pts), ternaries 3 (12 pts), loops 2 (3 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/match-engine.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c60cb85cedc9e3cfa35451f12e3ffb8979a064574453837864657dfaac9e27"}},{"ruleId":"D2","level":"warning","message":{"text":"keyboardShortcuts.matchesShortcut (cognitive 36): keyboardShortcuts.matchesShortcut has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 12 (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":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a930a74b6d3396fd40959f0cfee5ec51bca96ba02691e2a996994ade8f3a6b2"}},{"ruleId":"D2","level":"warning","message":{"text":"pluginAiCompletion.createPluginAiCompletion.runGeneration (cognitive 36): pluginAiCompletion.createPluginAiCompletion.runGeneration has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 4, error handling 2 (4 pts), ternaries 3 (4 pts) (nesting depth added 12). Of this number, 31 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginAiCompletion.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a153a00e3f605227ee4f1ed98acf1a582a394df027c350344c6245a13d6815d"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCommandTokenizer.tokenizeRedisLine (cognitive 36): redisCommandTokenizer.tokenizeRedisLine has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 4, loops 3 (nesting depth added 15). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandTokenizer.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"774b8a2d78b44451dc6cb81ff92b61b35fe330767b776746248940c74f859179"}},{"ruleId":"D2","level":"warning","message":{"text":"solrAdmin.buildSolrQuery (cognitive 36): solrAdmin.buildSolrQuery has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 4, loops 2, ternaries 1 (nesting depth added 10). Of this number, 31 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/solr/solrAdmin.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"2658857c0bf5044b2cb73c081ba02ea672814b9576a8a088c15f5889710334fb"}},{"ruleId":"D2","level":"warning","message":{"text":"cypherFormatter.needsSpace (cognitive 36): cypherFormatter.needsSpace has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc63d302bdc63af3d804b322a27cc726b53aae2fa468e2c3424e055ba0c639b"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics.buildSqlSemanticDiagnostics (cognitive 36): diagnostics.buildSqlSemanticDiagnostics has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 5, boolean chains 3, ternaries 2 (3 pts) (nesting depth added 14). Of this number, 34 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3bd41cffc7d23d7f9ac41f4fc4bed236384b4ebe4fd14cb50993d66e71402d"}},{"ruleId":"D2","level":"warning","message":{"text":"locate (cognitive 36): locate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 8, loops 5 (7 pts), ternaries 3, error handling 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 16 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d13192a30822327ba2b51d07aadfbad125dd9fcb39f122660666d74b170501"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai_cli_agent::run_cli_jsonl_agent (cognitive 35): dbx_ai_provider::ai_cli_agent::run_cli_jsonl_agent has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 3 (6 pts), loops 3 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee55d9c030780220bf060a7fd5568ebaf169bc73b8a4b8f36f082ad4f5e86cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai_pi_agent_cli::emit_pi_event (cognitive 35): dbx_ai_provider::ai_pi_agent_cli::emit_pi_event has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 1 (4 pts), match/switch 2 (3 pts) (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_pi_agent_cli.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"65610a2046d2d8cf7e2884563837f91a018b0453d5d2784b7a309cc5b147e8fb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_cli::run_query (cognitive 35): dbx_cli::run_query has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 9, match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/main.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfefde140ac261d81fedec17ef9a4458e012743bba899bc19ce0f9c4995e5f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::load_connections (cognitive 35): Storage::load_connections has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 5 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8131}}}],"partialFingerprints":{"codehealthFindingId/v1":"38eb176d65849127e98b66aaa4794a991441e2f52b49bfd841cc0ec8d4c63403"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::agent_tools::execute_get_columns (cognitive 35): dbx_core::ai::agent_tools::execute_get_columns has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad133f8815842d58209fbad7edc73088e04c2f625dd05f7b8523264f743faa2c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::connection::connection_secrets::load_connections_from_file (cognitive 35): dbx_core::connection::connection_secrets::load_connections_from_file has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd25ab6edc2d80af33b6d45c97eaff11e17a989362e97ee6a117d0bb56b8597"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::connection::connection_secrets::hydrate_transport_layer_secrets (cognitive 35): dbx_core::connection::connection_secrets::hydrate_transport_layer_secrets has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"097d4001d68a9a771f5c36dd7fe78422aa903f3667a89987d7ad5af458c720d0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_columns_via_metadata_query (cognitive 35): dbx_core::schema::oracle_columns_via_metadata_query has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"524ca2ec922374b47cf645ab2b582c81e3ac50498c6ecf071cfbfb343f6f42e3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::postgres_object_source_sql_inner (cognitive 35): dbx_core::schema::postgres_object_source_sql_inner has cognitive complexity 35 (threshold 15). Drivers by points: if/else 22 (34 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12702}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb60e54bd7457d1699b6b03bce88774b3108631689bdaee18afc6a03d5fe12ac"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_async_url (cognitive 35): dbx_driver_mysql::mysql::mysql_async_url has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3262}}}],"partialFingerprints":{"codehealthFindingId/v1":"082c24e42a86f1e07d167e0aeaaf093299f30cd4abac0c4da85c216919cc1be6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::postgres_connection_url (cognitive 35): dbx_driver_postgres::postgres::postgres_connection_url has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":3504}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b99f3113c606c4dfade09b2730c2d5e9b6b45db1d92963675ae81a28b2c75f"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::ensure_plugin_tool_policy (cognitive 35): DbxMcpServer::ensure_plugin_tool_policy has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4933}}}],"partialFingerprints":{"codehealthFindingId/v1":"2736b21cb705af2ce6ddad037cd15c731a29002260369977b5ddfbba90e08e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_editability::contains_top_level_aggregate (cognitive 35): dbx_sql_core::sql_editability::contains_top_level_aggregate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"7892daaf5add33d47d5ffc19aa2203c7451f0abd6f4c9d67b973de52d531b045"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::consume_postgres_cast_group (cognitive 35): dbx_sql_schema::schema_diff::consume_postgres_cast_group has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 6, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aec25dd127c8abd8a2bfaea2a61c555134368d83a4bcfb3c9baaf0670f09476"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::global_search::search_root (cognitive 35): dbx::commands::global_search::search_root has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 5 (9 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/global_search.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3665a68b1fedcde3c7d56fc7d2b1df42d175dbe7b5554bceb9e040795db25711"}},{"ruleId":"D2","level":"warning","message":{"text":"DamengAgent.isIgnorableDbmsOutputError (cognitive 35): DamengAgent.isIgnorableDbmsOutputError has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03093f561106ce48a340ca5a16a2b146c98a829e61158a45a62239b1a0ee228"}},{"ruleId":"D2","level":"warning","message":{"text":"DamengAgent.queryConstrainedTables (cognitive 35): DamengAgent.queryConstrainedTables has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (27 pts), error handling 5 (7 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcff3e11065b77f0b69324335d886489ca87619d11341f9b0922060133b053a2"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompositeInput.requireInputAdapter (cognitive 35): PlDebugCompositeInput.requireInputAdapter has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (7 pts), boolean chains 5 (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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e03399f685d7e3c00453f450412b2c6b8c6aa67d3ad2b4d5a70f7407e65c83e"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompositeOutput.helperDeclarations (cognitive 35): PlDebugCompositeOutput.helperDeclarations has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 8 (24 pts), if/else 5 (8 pts), loops 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeOutput.java"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b23cdc2eea78f0f1bd54bebb19eb7aa12338f53537b3f27fd0112db2419b530"}},{"ruleId":"D2","level":"warning","message":{"text":"rocketMQAgent.listACLs (cognitive 35): rocketMQAgent.listACLs has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/acl.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"16450260ed80370ac5b25b0c93936695f53627d91616ff017828344911142293"}},{"ruleId":"D2","level":"warning","message":{"text":"krb5.newInitiatorClient (cognitive 35): krb5.newInitiatorClient has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/go-gssapi/krb5/krb5.go"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67a9de4d18d45acb9291b2cf49db2dd054d0ca5002c6ec06a1e968b2bcd63e0"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportXlsxResult (cognitive 35): useDataGridExport.useDataGridExport.exportXlsxResult has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 11, ternaries 2 (3 pts), error handling 1 (nesting depth added 5). Most of this is not in the body itself: 2 of the 35 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1872, 1911). 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"46242987b6dd8db62c6473951b856314e0cf1d9adc33f29bb9deda27eac61aab"}},{"ruleId":"D2","level":"warning","message":{"text":"useQuickOpen.useQuickOpen.remoteSearchContexts (cognitive 35): useQuickOpen.useQuickOpen.remoteSearchContexts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 5 (8 pts) (nesting depth added 17). Of this number, 33 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9bdaa58fa5d2e6e36cdfbb15d8c9786870206eda38e478fe5934b42220fc4f"}},{"ruleId":"D2","level":"warning","message":{"text":"safeJsonFormat.myersDiff (cognitive 35): safeJsonFormat.myersDiff has cognitive complexity 35 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 6 (10 pts), boolean chains 9, ternaries 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"de360000aa36c38ea9734cbcf29109a57e5f5b58fa288acd5c2273d7daf1ae13"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionDeepLink.parseConnectionDeepLinkUpdate (cognitive 35): connectionDeepLink.parseConnectionDeepLinkUpdate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 5, loops 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ade8140fc34607cf103ea6323b0de730863d21221dfdb5c6431e3def7554241"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnFilter.unwrapOuterParentheses (cognitive 35): dataGridColumnFilter.unwrapOuterParentheses has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3330fadc245dc214cc281fc2021fd5847e6eb5b603d492bea886e925372df8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"dataDictionaryExportTask.startDataDictionaryExport (cognitive 35): dataDictionaryExportTask.startDataDictionaryExport has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 5 (11 pts), boolean chains 7, error handling 2 (3 pts), loops 1 (nesting depth added 12). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 43, 91, 67, \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":"apps/desktop/src/lib/docs/dataDictionaryExportTask.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10a7182389543aee399973c639e71527e4beffb159073f574461f14ebb1d5be"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlSemanticSelectionRanges.collectExpressionSection (cognitive 35): sqlSemanticSelectionRanges.collectExpressionSection has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 6 (7 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 12). Of this number, 33 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7816251a74e0dbe291718052d6d726ee138fbda41535d042b18b07d29b5fdf74"}},{"ruleId":"D2","level":"warning","message":{"text":"elasticsearchCompletion.inspectJsonBody (cognitive 35): elasticsearchCompletion.inspectJsonBody has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 8, loops 3 (5 pts), ternaries 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba7f0b1f5964ae57b29691cfef5f5015f7824e81526d86f0a2312018787636a"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildComparisonValueItems (cognitive 35): sqlCompletion.buildComparisonValueItems has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 6, loops 2 (3 pts), ternaries 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5780}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c40d84717793fea4c2137921789f684660422b2c2afbc4931f474c62167d01"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTableRename.maskTriggerCommentsAndStrings (cognitive 35): oracleTableRename.maskTriggerCommentsAndStrings has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, loops 3 (5 pts), ternaries 1 (3 pts) (nesting depth added 15). Of this number, 31 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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4b1599c4e08c462e42b5652fbee11d752b7311e3ddfb90adea5f41c95bcce0"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.normalizeConnection (cognitive 35): connectionStore.useConnectionStore.normalizeConnection has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 17, if/else 9, ternaries 9. Of this number, 33 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"305d3ecbbaa99985a9c20dcbaa23df45aa127cac692aae011306454e8f83b0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.setValue (cognitive 35): plDebugStore.usePlDebugStore.setValue has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 10, ternaries 6 (8 pts), error handling 3 (nesting depth added 3). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5b119974a2d7164f904e954e0269fa8e7d8208625d17e73d3fb6396377cfea"}},{"ruleId":"D2","level":"warning","message":{"text":"Nb3Archive::restore_steps (cognitive 34): Nb3Archive::restore_steps has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 8 (10 pts), match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad3855efba24b7a5cb7fd2f0102dd90119fe73bfc837c633489f9aa71154bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::decode_unicode_escapes_for_export (cognitive 34): dbx_core::data::database_export::decode_unicode_escapes_for_export has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (31 pts), boolean chains 2, loops 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"0850572edea83c74109e4b3834237dd802bf96d1f5a9a0bf83bbfe5dad58a196"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::restore_mongodb_database (cognitive 34): dbx_core::data::mongodb_dump::restore_mongodb_database has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bea75076e2aac15d5433d89826c6e675dfa72896cd8a1b4e7e630b722a8542"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::parse_json_preview (cognitive 34): dbx_core::data::mongodb_import_export::parse_json_preview has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 4 (11 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa73e1a88adcd2d1a2c60a3495a54a9014e47179462ad1a41dc8d8ce9e241ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::sql_non_code_spans_with_mysql_identifiers (cognitive 34): dbx_core::data::transfer::sql_non_code_spans_with_mysql_identifiers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 4 (10 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"e502d5dcff8b90e3581530457af952d55bd0228ca86e0f26c2a364f2314fdc8b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::persistence::cloud_sync::validate_sensitive_payload (cognitive 34): dbx_core::persistence::cloud_sync::validate_sensitive_payload has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e06a8b2196c25348d92b54d2ee49faac85e637b803cf3f9bd559618b283a1b7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::dameng::parts::verify (cognitive 34): dbx_core::schema::native_jobs::operations::dameng::parts::verify has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 12, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng/parts.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"869f4f81f79f89dd9affeb15353c8d7655e3f8b5942afe79edbdc33c6ef0fb21"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_service::open_agent_download_response (cognitive 34): dbx_driver_agent::agent_service::open_agent_download_response has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 4 (13 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":2419}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61cf1b2e22517d5d8bff25d458e6100ca8a2ed71fe0f0657fa246081d0f4901"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_service::validate_offline_zip_preflight (cognitive 34): dbx_driver_agent::agent_service::validate_offline_zip_preflight has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 2, loops 2 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":3554}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b51a75d1131d879941f2b23fa54e3fb1f5d99dd062f0b17293fbc59962934a4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::first_sql_tokens (cognitive 34): dbx_sql_core::sql::first_sql_tokens has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33d919be07156c91e6c5519c55aaf43465980453dbddd41ec3a8450186c02fe"}},{"ruleId":"D2","level":"warning","message":{"text":"InputResolver::resolve (cognitive 34): InputResolver::resolve has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (9 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/sql_parser/input.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74a24a278b61b62e7399d2221c4687f39c079476e541375c2fee8c0852a9ea"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::mysql_charset::table_defaults (cognitive 34): dbx_sql_schema::schema_diff::mysql_charset::table_defaults has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 2 (6 pts), boolean chains 4, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/mysql_charset.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e668be831f3391709697155e3afad88790f0486719349c17809fe466cec503"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::oracle_constraints::validate_unique (cognitive 34): dbx_sql_schema::table_structure_sql::oracle_constraints::validate_unique has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 17, if/else 13 (15 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ca9e5723374d197df0c1242aa68d714682f248dab6e59387d307bc873f9b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::connection::sync_connection_configs (cognitive 34): dbx::commands::connection::sync_connection_configs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/connection.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b03eec5dfbfb708066586acb33e5aeb56e887798d14ddc17d9ea8894e3c411"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.handleRequest (cognitive 34): DbxJdbcPlugin.handleRequest has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 4 (8 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"a214de2c039adf5f6f4df7baa0aeffb2df8542b741df4fda7dea09b7c4f071e3"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugNative.stackResult (cognitive 34): PlDebugNative.stackResult has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 13 (28 pts), boolean chains 3, if/else 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugNative.java"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"08223355bd9c0dea813b054cdde3e7780af4932eead4192f391f5c14ba4dd772"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTypeMetadata.resolveObjectOwner (cognitive 34): PlDebugTypeMetadata.resolveObjectOwner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (22 pts), error handling 2 (5 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTypeMetadata.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7267fc27adb0e4104f57033192d3158e2d4cfba40b3c1a1ec94ce116820269c7"}},{"ruleId":"D2","level":"warning","message":{"text":"main.applyHOCONAuthentication (cognitive 34): main.applyHOCONAuthentication has cognitive complexity 34 (threshold 15). Drivers by points: if/else 25 (28 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config_file.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fee09c86c62ec4f1d5aa79dd64f2767818a62e4f379aab1407c45818a3a663"}},{"ruleId":"D2","level":"warning","message":{"text":"main.splitNativeDSNFields (cognitive 34): main.splitNativeDSNFields has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (11 pts), boolean chains 6 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bb35a1a916c3546feca0d2f6ab452080e55b1793d3b2aeb44f383031af1417"}},{"ruleId":"D2","level":"warning","message":{"text":"main.splitNativeDSNFields (cognitive 34): main.splitNativeDSNFields has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (11 pts), boolean chains 6 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1961e2a1f83b415e9b80f1663d509bd6ce2d425af57bb9e6329bd18effe280"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getColumns (cognitive 34): server.getColumns has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff46808b4d8b5977bbedbd31e74e2659430b368ca49059b67949a70468e356e5"}},{"ruleId":"D2","level":"warning","message":{"text":"ddlStorage.stripOracleStorageAttributes (cognitive 34): ddlStorage.stripOracleStorageAttributes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 11, ternaries 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8faf0fd39ac793aeb64c1705e6a3dafd31874b0593311579bbc76d458aad27c6"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletionMetadata.useQueryEditorCompletionMetadata.ensureColumnsForTable (cognitive 34): useQueryEditorCompletionMetadata.useQueryEditorCompletionMetadata.ensureColumnsForTable has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (nesting depth added 12). Of this number, 25 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae1c9c0fc43aa29596c0cd06b40eeed0aa3de853706aa07f1b2d98ab6e275bb"}},{"ruleId":"D2","level":"warning","message":{"text":"useCellDetailEditor.useCellDetailEditor.create (cognitive 34): useCellDetailEditor.useCellDetailEditor.create has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 8 (10 pts), boolean chains 4 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 14 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useCellDetailEditor.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed8c56381968248fbfafe208f2d0ef38e0b07214213dd79469b537d42f726c0"}},{"ruleId":"D2","level":"warning","message":{"text":"safeJsonFormat.decodeJsonSource (cognitive 34): safeJsonFormat.decodeJsonSource has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 17). Of this number, 33 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":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0167fa93718e08486a11ae1b7e5b0e7d064be12cae3bf84cc0d7ac04344181a"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionDeepLink.kafkaConnectionDraft (cognitive 34): connectionDeepLink.kafkaConnectionDraft has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 14, ternaries 4, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c64e4329e03641a7b395bf83ccaf3b915bc6875e0c739037605620cc2a4faf"}},{"ruleId":"D2","level":"warning","message":{"text":"oceanbaseSessionDiagnostics.readPlan (cognitive 34): oceanbaseSessionDiagnostics.readPlan has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 9 (15 pts), boolean chains 10, if/else 7 (8 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7f151027527e7fdfa78cedcf93a25833788540c744d353b1d1e5527d77fe83"}},{"ruleId":"D2","level":"warning","message":{"text":"xuguUserPermissions.xuguRevokeSql (cognitive 34): xuguUserPermissions.xuguRevokeSql has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 7, ternaries 5 (7 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f39b51169b97929b1f360e93949b2d124ecd58d9f20e9ad6a0e6cdf4e78de8"}},{"ruleId":"D2","level":"warning","message":{"text":"xuguExplainPlan.parseXuguExplainText (cognitive 34): xuguExplainPlan.parseXuguExplainText has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 3 (6 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/xuguExplainPlan.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfa5ff63298740f75d1d4105f29b9d1570f68427ee4db0ca26b64f5bd29569d"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorSqlDialect.codeMirrorBaseDialect (cognitive 34): codemirrorSqlDialect.codeMirrorBaseDialect has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (30 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorSqlDialect.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"489bb2ab1c59aa1015eef2a459a159066d433e056167d47919a0570e161bacaa"}},{"ruleId":"D2","level":"warning","message":{"text":"queryEditorNativeSelection.createQueryEditorNativeSelectionGuard (cognitive 34): queryEditorNativeSelection.createQueryEditorNativeSelectionGuard has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 12, ternaries 4 (8 pts) (nesting depth added 5). Most of this is not in the body itself: 6 of the 34 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 627, 645, 582, \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":"apps/desktop/src/lib/editor/queryEditorNativeSelection.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f621ba52c17a55d66e071b20172ae41002e28963553368f98b3c8c54cfb1755b"}},{"ruleId":"D2","level":"warning","message":{"text":"elasticsearchCompletion.flattenElasticsearchMappingFields (cognitive 34): elasticsearchCompletion.flattenElasticsearchMappingFields has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (18 pts), ternaries 3 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa09c86196ea9cd6eeb47c56d7d9d4fbe73cee121a4619ee4d8c5192ca45db7c"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCommandPreview.redisDeleteKeysPreview (cognitive 34): redisCommandPreview.redisDeleteKeysPreview has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (9 pts), error handling 1 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7975799163cbab13148e760ac2c43e75def87bbc5a02c17634f59bd75a2705"}},{"ruleId":"D2","level":"warning","message":{"text":"redisContentSearch.worker.onmessage (cognitive 34): redisContentSearch.worker.onmessage has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 2 (7 pts), boolean chains 4, loops 1 (2 pts), error handling 1 (nesting depth added 18). Of this number, 21 points are the body\u0027s own statements and 13 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":"apps/desktop/src/lib/redis/redisContentSearch.worker.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa661355dc65c8987cbd2c951aa8a8b53db77cee2fd0a9541529a2214db27b12"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics.leadingUnquotedSqlKeywords (cognitive 34): diagnostics.leadingUnquotedSqlKeywords has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 2 (7 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf64674e04d8f1d6c04ec1e2488fcefa246727b6dbcff796f31d8bc085a2ef1b"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlAnalysis.stripSqlComments (cognitive 34): sqlAnalysis.stripSqlComments has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 7, loops 3 (7 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acfe7725d2ebe2cd7b613822390934ae50e004bddc8b16ee00b513e7027bd1c"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.maskSqlForStructureScan (cognitive 34): sqlCompletion.maskSqlForStructureScan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (10 pts), boolean chains 6 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"054d3e2cc307e054b7318711f72f1bf034bd10888d8b013f69a633362ed178b5"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.currentSqlLikeLineBlockSpan (cognitive 34): sqlCompletion.currentSqlLikeLineBlockSpan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"081fa00b8960dbd63a70c56ac5dc22b14cdc88b1619dcbfe8610b88afa523c0b"}},{"ruleId":"D2","level":"warning","message":{"text":"objectSourceTabSave.saveObjectSourceTab (cognitive 34): objectSourceTabSave.saveObjectSourceTab has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 14, if/else 11 (14 pts), ternaries 3 (5 pts), error handling 1 (nesting depth added 5). Of this number, 29 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectSourceTabSave.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9097c5fb9b3408bb14cf938bcfde9c545212a6acd3a0be634e2b101837ea9dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineRename.verifyBeforeDrop (cognitive 34): oracleRoutineRename.verifyBeforeDrop has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 9, ternaries 4 (8 pts), loops 4 (5 pts) (nesting depth added 9). Of this number, 30 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed32f3820cb660ceabc6323325e7786f19bb9a73141ecba625bb50d86b4e8264"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.isReusableTreeSnapshot (cognitive 34): connectionStore.useConnectionStore.isReusableTreeSnapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 7, loops 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3757}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cfb055ed1389cdd9552bd3b756df4f1ec7b58d673f357cf01438d5eff65b89"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.runPublicOperation (cognitive 34): plDebugStore.usePlDebugStore.runPublicOperation has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (36 pts), boolean chains 28, error handling 3 (6 pts), ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (plDebugStore.usePlDebugStore.runPublicOperation::dispatch) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf73073f5d1fe09ef196a7c6ab9693b76508f2d234348ca894807ffff8496298"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.createTab (cognitive 34): queryStore.useQueryStore.createTab has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 13, ternaries 5 (nesting depth added 8). Of this number, 29 points are the body\u0027s own statements and 5 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa11e759fe4505410a06c5cc9708f60425dde5e721275c993b78ea01311fe6f4"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.duplicateTab (cognitive 34): queryStore.useQueryStore.duplicateTab has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 21 (22 pts), if/else 7 (8 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4e65bb5bfa5d2472f24f5be4c439b9dd7aaf115c410b3dc3cf68fa2c0ab9a5"}},{"ruleId":"D2","level":"warning","message":{"text":"publish (cognitive 34): publish has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 7 (15 pts), if/else 8 (9 pts), boolean chains 6, loops 2 (3 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/publish.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb012d72ddc9ae97ba522d30c554b257942d07a0674f5644dbe6fdf37e595843"}},{"ruleId":"D2","level":"warning","message":{"text":"registerDbxMcpBridge (cognitive 34): registerDbxMcpBridge has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (17 pts), other 8, boolean chains 4, error handling 2, loops 2, ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 34 points are its own statements and the rest belongs to 18 function items inside it that branch (a function literal at line 84, a function literal at line 111, execute, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/assets/pi-mcp-bridge.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e57c0d2e688cd8d5921f953d9667c2afb6081fbe059f03f2d2c433870e2566f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_duckdb_driver::sql::split_sql_statements (cognitive 33): dbx_duckdb_driver::sql::split_sql_statements has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 9, loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"299b9a63bf9176ab34b987f827c8bbd177c2ad6ae9dd7b74d639185931d6f340"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_duckdb_driver::sql::rewrite_duckdb_current_date_literal_arithmetic (cognitive 33): dbx_duckdb_driver::sql::rewrite_duckdb_current_date_literal_arithmetic has cognitive complexity 33 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 11, loops 3 (7 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3b6add6aa645348ee560591c0bb07db010d07402c3bae9e40c1facf8dc2a43"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::prepare_connection_transport_with_claimant (cognitive 33): AppState::prepare_connection_transport_with_claimant has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 7, match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":4553}}}],"partialFingerprints":{"codehealthFindingId/v1":"1deeb271cac28bc2058aeb3e2f451fae1f71b9852a4569fb398939b3eda206e0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::navicat_nb3::classify_statement (cognitive 33): dbx_core::data::navicat_nb3::classify_statement has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda4cb69e4b6fca60f1d641970ecbc1807c0b0a1aa906cf491b4df5eb9f29dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::exact_metadata::request (cognitive 33): dbx_core::schema::exact_metadata::request has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/exact_metadata.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67ee17fbc9206f9728ba9425d5b4aee164421af4c32dc09078ba76d2615d7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::duckdb_sql::split_sql_statements (cognitive 33): dbx_drivers::db::duckdb_sql::split_sql_statements has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 9, loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_sql.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aba959f437aab0734b4171326c2d561be99fc1a3e63f358ae39c5a4f56c2755"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::dynamodb_driver::json_to_attribute_value (cognitive 33): dbx_drivers::db::dynamodb_driver::json_to_attribute_value has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (32 pts), match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56ff24f3d8d1d9d102904e8ed869173261151e92018d6de0d2b4eee2ef341f8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::oracle_view_rename::parse_view (cognitive 33): dbx_sql_core::oracle_view_rename::parse_view has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 9, loops 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc14f16462c6f75f2b5227d4f2350bad40abe1c9456bbe34010648db8397136c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::oceanbase_blob_literals (cognitive 33): dbx_sql_data::data_grid_sql::oceanbase_blob_literals has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":4354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d381bd8dd05d83ee12d5c21f682c9f9efd65f9f63b9711a603ec94623ebf33e2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::scheduler_attribute_steps (cognitive 33): dbx_sql_schema::native_job_changes::scheduler_attribute_steps has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 9 (13 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd7f1a3e9e5e517f3d3bc3fc2e296706a1578ea63ee04513111af9fe979ae4d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::oracle_foreign_keys::build_new_table_keys (cognitive 33): dbx_sql_schema::table_structure_sql::oracle_foreign_keys::build_new_table_keys has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 8, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_foreign_keys.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9b5ba4e67a6c1307a5595d14982774a5feac4536ca47ddb85a048c3a42ccd2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sqlite_worker::runtime::query_statement (cognitive 33): dbx_sqlite_worker::runtime::query_statement has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 3 (10 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sqlite-worker/src/runtime.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad3d311df8a736fb4ca2838b0c5841f897ddcd815ccea5f33ad15cbb4538ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.listSchemas (cognitive 33): DbxJdbcPlugin.listSchemas has cognitive complexity 33 (threshold 15). Drivers by points: error handling 8 (20 pts), if/else 8 (11 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3081}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35ae81a7d5596aef8a8a642ba5ac4cdb1c332c7a2d08bce67b36bf702882fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeLegacyJobSession.prepare (cognitive 33): NativeLegacyJobSession.prepare has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 6 (7 pts), boolean chains 6, error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/NativeLegacyJobSession.java"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07049a63572564e1a61f19b7b63d0688b60647b4f3c24c8341c3df1f6e2853b"}},{"ruleId":"D2","level":"warning","message":{"text":"MongoAgent.bulkWriteModel (cognitive 33): MongoAgent.bulkWriteModel has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (6 pts), ternaries 2 (5 pts), match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e4be2d521909e058b429313606e852d015414b18d57b97af86230f7d0af7c7"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseLobValues.mark (cognitive 33): OceanBaseLobValues.mark has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 4 (9 pts), loops 6 (8 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseLobValues.java"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c27e2a35eb2fe6ca356526da67145451940bea6b34b74035e8a79d239eb8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSession.continueWith (cognitive 33): PlDebugSession.continueWith has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 4, error handling 1, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d2e99073a5f349bb355cd4476294028da11db39630ba8486b0c6b37646c67c"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTemporalJson.copy (cognitive 33): PlDebugTemporalJson.copy has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTemporalJson.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab3c97c1d62f69aea27a7b555c6ed319504fd05d68c7ff75e815f0faee4b958"}},{"ruleId":"D2","level":"warning","message":{"text":"ci-gradle.acquire_and_run (cognitive 33): ci-gradle.acquire_and_run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 8, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/ci-gradle.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9ee48af55eac4075fb19d528294b468389347a83a85a591c086520bfe02b04"}},{"ruleId":"D2","level":"warning","message":{"text":"etcd2Session.status (cognitive 33): etcd2Session.status has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/status.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5481dae57440c45181a7ad967227bca874ffb6a8b261e7fd0af5bdcd8fdeb1"}},{"ruleId":"D2","level":"warning","message":{"text":"server.completionAssistantSearch (cognitive 33): server.completionAssistantSearch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/metadata.go"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd8976b91169ddb24f8c9e4ef180fdc1375894a88a5f6e262b520a9bd5d91f1"}},{"ruleId":"D2","level":"warning","message":{"text":"main.skipSQLParenthesized (cognitive 33): main.skipSQLParenthesized has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac8bc539ec624bd9059c51cbbefb5db82654051f8d6ec84b208be689b4ce988"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeTypeLoader.compiledSource (cognitive 33): plDebugNativeTypeLoader.compiledSource has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 7, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_source.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cb474283e8879ad24b9beb5046b598cda0ca487cf7795051b0ec47706685b7"}},{"ruleId":"D2","level":"warning","message":{"text":"client.valuesToBytes (cognitive 33): client.valuesToBytes has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 9 (26 pts), if/else 2 (6 pts), loops 1 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4c7c14d80b29e8a509abcb1bce1c176f587cf0ce33ef2f1459c24513b991b4"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.resultToExport (cognitive 33): useDataGridExport.useDataGridExport.resultToExport has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 13 (17 pts), boolean chains 9, if/else 4 (7 pts) (nesting depth added 7). Of this number, 30 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dd6585e905a8ff5d55506ba4d400220c0549abea7d93a450512dd0ac0e655e"}},{"ruleId":"D2","level":"warning","message":{"text":"openTabsPersistence.restoreOpenTabsArray (cognitive 33): openTabsPersistence.restoreOpenTabsArray has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 14 (15 pts), boolean chains 9, if/else 7 (8 pts), error handling 1 (nesting depth added 2). Most of this is not in the body itself: 6 of the 33 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 341, 325, 345). 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":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd13e48cc05adb7b8bc2a09118346a6e06aa5299a12a575430928b1e6bf6b97f"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnFilter.splitTopLevelAnd (cognitive 33): dataGridColumnFilter.splitTopLevelAnd has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d5ae67c9edda851204ed7b6709ea7a47da0e9f633d6c672243b61cc97038e0"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleSessionDiagnostics.collectOracleSessionDiagnostics (cognitive 33): oracleSessionDiagnostics.collectOracleSessionDiagnostics has cognitive complexity 33 (threshold 15). Drivers by points: error handling 6 (12 pts), if/else 9 (12 pts), ternaries 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionDiagnostics.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99f0989ca0e16edeceb628ca82b947646842b335a82201e92d2464ea47d3341"}},{"ruleId":"D2","level":"warning","message":{"text":"xuguUserPermissions.decodeXuguAuthority (cognitive 33): xuguUserPermissions.decodeXuguAuthority has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 4, loops 1 (2 pts), error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"77191cdfa0846cd191326cfe8538f9869fab6fc57362689f93987e2ebb1037b0"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugAnonymousBlock.stripPlSqlComments (cognitive 33): plDebugAnonymousBlock.stripPlSqlComments has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (10 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/plDebugAnonymousBlock.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ff703ab0d71a5b1554f6c2d1b64a0ace07222784a136153498e4ac187cc698"}},{"ruleId":"D2","level":"warning","message":{"text":"shortcutDisplay.shortcutKeyLabel (cognitive 33): shortcutDisplay.shortcutKeyLabel has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16, ternaries 8 (15 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/shortcutDisplay.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0294e0e31c30e1fcff395440855550e4a6d2cd9014546d602fb435361544936c"}},{"ruleId":"D2","level":"warning","message":{"text":"pluginUiHtmlCache.inlineLocalUiAssets (cognitive 33): pluginUiHtmlCache.inlineLocalUiAssets has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (7 pts), boolean chains 5, ternaries 2 (nesting depth added 13). Of this number, 23 points are the body\u0027s own statements and 10 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":"apps/desktop/src/lib/plugins/pluginUiHtmlCache.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7c393125473bddd9cbe29ad4c6a9756adbbd71fb9f2911f05fe8878d09438f"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCommandDocs.commandKeySpecs (cognitive 33): redisCommandDocs.commandKeySpecs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 5 (12 pts), boolean chains 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandDocs.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cdb02becd7e764b7d4ad65a570793087271d3856d855e780123078f5053a16"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarLayout.restoreSidebarLayoutDeletion.restore (cognitive 33): sidebarLayout.restoreSidebarLayoutDeletion.restore has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 4 (13 pts), boolean chains 5, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bff430da383cc9a427b47f0f5c1a9ca9a877760633b6e323cd8633afe2f8be"}},{"ruleId":"D2","level":"warning","message":{"text":"CypherPrinter.format (cognitive 33): CypherPrinter.format has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, ternaries 2 (5 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be31439989660f63620881fba733467789c6fc0db0eb1d5125d377e8c99154a"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.singularTableName (cognitive 33): sqlCompletion.singularTableName has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 12 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6709}}}],"partialFingerprints":{"codehealthFindingId/v1":"12000c6e6b4fbcffb88313ab3a127cfb08cfa9da9dc26912fbcdc409d6cad045"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.computeMatchScore (cognitive 33): sqlCompletion.computeMatchScore has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7095}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d5f8645abbb937b74aca7537eb5f3cb8feecf623d192383f96f81cd7966449"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlDiagnosticKeywordRecovery.analyzeSqlDiagnosticReferences (cognitive 33): sqlDiagnosticKeywordRecovery.analyzeSqlDiagnosticReferences has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 7, error handling 2 (5 pts), loops 2 (5 pts) (nesting depth added 17). Of this number, 31 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDiagnosticKeywordRecovery.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"349d510aaf9b4474c310b6820649cac696d66ac422ae6b0f3ec3e18c88581e94"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.runPublicOperation::dispatch (cognitive 33): plDebugStore.usePlDebugStore.runPublicOperation::dispatch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 11, error handling 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (plDebugStore.usePlDebugStore.runPublicOperation) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4e64b1189ace98b0b1651bfa2a83e009cb7d5245645a805987893e854f3359"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.applyLoadedObjectSource (cognitive 33): queryStore.useQueryStore.applyLoadedObjectSource has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 11, ternaries 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3648}}}],"partialFingerprints":{"codehealthFindingId/v1":"093e4c85c6823468fa0cc60d325ab32a3b4d011308c5c22e6272d1b7dd6d7975"}},{"ruleId":"D2","level":"warning","message":{"text":"bringIntoView (cognitive 33): bringIntoView has cognitive complexity 33 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 3 (9 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 16). Most of this is not in the body itself: 3 of the 33 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 401, 434). 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":".github/ui-preview/record.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6338e92d4d9964ef36c8c1f68e9a5c5612fc1fe2529c518f66073b3fe8f387df"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_tdengine_driver::runtime::run (cognitive 32): dbx_tdengine_driver::runtime::run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 4 (11 pts), loops 5 (8 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/tdengine/src/runtime.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69e7588432dc89504f9bf786fad456724ec067e7c3a7011ab729f48e77f65ca"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::agent_kv::parse_etcd_prometheus_metrics (cognitive 32): dbx_core::ai::agent_kv::parse_etcd_prometheus_metrics has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75054f76287b91c6e0a7dcd00bc79db0f9aaed971fdd8a548c98e1f96612659"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::plugin_tools::sanitize_schema (cognitive 32): dbx_core::ai::plugin_tools::sanitize_schema has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 1 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_tools.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b4847df6796443827eac10c82adf0f029edbefaa84521f6e66ce61b12ad229"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::archive::stream (cognitive 32): dbx_core::data::mongodb_dump::archive::stream has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/archive.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fd3b0a7e54e4f3c4412b595f5550252c59bcb6584a4ae8496c43c8fd171dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::script_generator::wrap_if_not_exists (cognitive 32): dbx_core::data::script_generator::wrap_if_not_exists has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a016e2ea7fb66f837ad0045cca673fa08a9c0bbd5f76d4e2b35367323e94949"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::execute_import_rows_batch (cognitive 32): dbx_core::data::table_import::execute_import_rows_batch has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":6580}}}],"partialFingerprints":{"codehealthFindingId/v1":"017dc0c5eef4d9ceb93be6a8ae0c952cb7767f5927769a0dce8010c15b6d2fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::oracle_table_contract::check_physical_options (cognitive 32): dbx_core::data::transfer::oracle_table_contract::check_physical_options has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 6, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd18561d9ec967dedbe3cf04f6e200dcfa6c1205168939bfe21bce6340ec9af7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::xugu_objects::add_definition_dependencies (cognitive 32): dbx_core::data::transfer::xugu_objects::add_definition_dependencies has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (17 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9c7800b1742b17bb5f7c58d5e8668b73d4602542daed8a001f9bda2f7a83e1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::get_table_ddl_core_with_options (cognitive 32): dbx_core::schema::get_table_ddl_core_with_options has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":11397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d70c76731a926d55e09812d54db35beaf96626359a1dff8acf8fd5423e57ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::details::read_native_job_details_with (cognitive 32): dbx_core::schema::native_jobs::details::read_native_job_details_with has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/details.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f9590d616ac229a3002a01ff1f4dd1b7ab65d08ba6fb5588b56a95b7fb3e86"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::legacy::run_create (cognitive 32): dbx_core::schema::native_jobs::operations::legacy::run_create has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/legacy.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a45a9d81709ce0d15885707f0e9af4f6f41c1038819c7a66ccd844ac760fdfe"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::skills::list_skill_files (cognitive 32): dbx_core::skills::list_skill_files has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/skills/mod.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ecf2d612e36e2bc954c270b6993cebcf807b9258f9d55be22509801babb329"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentRuntimeClient::call_typed_with_policy (cognitive 32): AgentRuntimeClient::call_typed_with_policy has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 5 (10 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d035353bdff05a39289f1806bfeba898d8919d29ca4025ca7f8071226595c02a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::split_table_body_entries (cognitive 32): dbx_drivers::db::sqlite::split_table_body_entries has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14300a43176f41cdc93469878f51b1af448724074249dea4ac55155264c485f"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::finish_group_by_check (cognitive 32): Analyzer::finish_group_by_check has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e4a74dba1cc576885f439c59d436a517f576c2eb0ede699bfc7954178605a1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::oracle_type_migration_sql::oceanbase_table_read_only_from_ddl (cognitive 32): dbx_sql_core::oracle_type_migration_sql::oceanbase_table_read_only_from_ddl has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"80502a4cca361739d35dab9e243f17998d5bfef4641b8c954fb6207d5333f972"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::leading_executable_sql_with_options (cognitive 32): dbx_sql_core::sql::leading_executable_sql_with_options has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 9, loops 4 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3686}}}],"partialFingerprints":{"codehealthFindingId/v1":"e294879ee4eeb5f99ae4909f6e2c7e6089b1d48df0efcbad669e6cc5cfdf6839"}},{"ruleId":"D2","level":"warning","message":{"text":"DialectYaml::build_capability_flags (cognitive 32): DialectYaml::build_capability_flags has cognitive complexity 32 (threshold 15). Drivers by points: if/else 32. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/dialect_yaml.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfcbb70832272dea8d366da7fdc1015eb045f3cb392596ed9453dfa28fa6afa"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::trim_outer_parentheses_for_match (cognitive 32): dbx_sql_schema::schema_diff::trim_outer_parentheses_for_match has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2ad7cf0c9e30162df82af3f7dfa620e9a35010050d04b0ccf8e73512524692"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::oracle_routines::diff_oracle_routines (cognitive 32): dbx_sql_schema::schema_diff::oracle_routines::diff_oracle_routines has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 3, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/oracle_routines.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd7b3368478c98a45162dada01a119505302e637c332b900678df2f3d3b9ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::alter_dialect::build_column_order (cognitive 32): dbx_sql_schema::table_structure_sql::alter_dialect::build_column_order has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 8, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/alter_dialect.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"574ee15603f95c828c152be38fb48f1240aa07067031cd98acd7dcb0866918ee"}},{"ruleId":"D2","level":"warning","message":{"text":"DamengAgent.splitTableDdlDefinitions (cognitive 32): DamengAgent.splitTableDdlDefinitions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea3a40317586a11f5fa562c3564ee14f77df46a1d258859a3e3e14b26dec0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.getConsumerGroupSnapshot (cognitive 32): KafkaAgent.getConsumerGroupSnapshot has cognitive complexity 32 (threshold 15). Drivers by points: loops 7 (13 pts), error handling 3 (7 pts), if/else 4 (6 pts), ternaries 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e70a670e1744561f2e40286770980a84731ae58eb8c37790f1d06c2119aa21"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.validatePeekRequest (cognitive 32): KafkaAgent.validatePeekRequest has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"13af519ba369f0d2a2742516f4f890897a67c77fa6047f8820598012efe15fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompositeInput.payloadBytes (cognitive 32): PlDebugCompositeInput.payloadBytes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (9 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e1b73e2f3b9f7c4a0af56bedbb867bd5231ceb122ca717328e0453e857ab52"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listTables (cognitive 32): server.listTables has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d950320964dad99f85e1c63de13cda1b7ed192486b1bd1440be22ccb9418563"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listTables (cognitive 32): server.listTables has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/metadata.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b53b42f7904552b2e2ce3354a185bc5a8738551cf770ebf5fd4303d7e273a2"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeTypedTransport (cognitive 32): main.plDebugNativeTypedTransport has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_transport_preflight.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"873de01ac581e3e43b4dfb62cfe32f09be645ff927bd487074664b5749185ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugLobOutput.collect (cognitive 32): plDebugLobOutput.collect has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 9, loops 1 (3 pts) (nesting depth added 7). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 125). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_lob_output.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"248e119e81cd44c2e0a64fbbdfc3a5dc090b6116f3c3bee6aea714f51fe51f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugRecordDecoder.collection (cognitive 32): plDebugRecordDecoder.collection has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_collection_input.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"94500e822308390e8d1d3cf468629790234c040545d3fe8fd389cffe87a14d0b"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeTypeLoader.query (cognitive 32): plDebugNativeTypeLoader.query has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_type_graph.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b9806ee191b9617da074d00eab99ceabae25720c6895bf3fa9a8c00e6ea54e"}},{"ruleId":"D2","level":"warning","message":{"text":"main.convertObjectKeyedMap (cognitive 32): main.convertObjectKeyedMap has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (7 pts), boolean chains 6 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/routing.go"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc6d49381e0bf8fa3e711666a5b93779edaa7e047b8560f607d6e9bd3a069a3"}},{"ruleId":"D2","level":"warning","message":{"text":"useNavigationTargets.useNavigationTargets.onStructureEditorSaved (cognitive 32): useNavigationTargets.useNavigationTargets.onStructureEditorSaved has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 9, error handling 4 (7 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 8). Of this number, 29 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":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"48af8422ab4e757ca6a8f4c468af7ed01c0e93d3a8bb201861c583313e80a4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"useTauriEvents.useTauriEvents.setupTauriListeners (cognitive 32): useTauriEvents.useTauriEvents.setupTauriListeners has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14, error handling 10, loops 5, boolean chains 3. None of this is in the body itself: all 32 points belong to 11 function literals inside it that branch (lines 41, 87, 64, \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":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd16ddd9711f07271fb56dcc6381802de0d061875c979eff85d1831e43ad3607"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionConfigTransfer.prepareConnectionConfigImport (cognitive 32): connectionConfigTransfer.prepareConnectionConfigImport has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 7 (12 pts), boolean chains 4, ternaries 2 (nesting depth added 13). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionConfigTransfer.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff453ee6c7022d02515fb8014ed4c2725abe3ab32009206ace7fc69c4e8b6a0"}},{"ruleId":"D2","level":"warning","message":{"text":"oceanbaseSessionDiagnostics.readAudit (cognitive 32): oceanbaseSessionDiagnostics.readAudit has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 10, if/else 9 (10 pts), ternaries 6 (10 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d148810755fbfd7d086103f8fedbc43b9a286bded778ed876e4d4f3b1f86772e"}},{"ruleId":"D2","level":"warning","message":{"text":"oceanbaseSessionDiagnostics.parseOceanbaseCachedPlan (cognitive 32): oceanbaseSessionDiagnostics.parseOceanbaseCachedPlan has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 8 (14 pts), if/else 6 (10 pts), boolean chains 7, loops 1 (nesting depth added 10). Of this number, 29 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":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9aa5064bea90254b5f82f1d5ebe2c226c48d1399bc6d52233a11dee63240d1"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.validateOracleForeignKeySourceChanges (cognitive 32): oracleForeignKeys.validateOracleForeignKeySourceChanges has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 11, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22fcbc96a8f80a80ecccb01b9d5fd876d336967b0e48972a774cfb627fbc231"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleIndexes.mergeOracleIndexDraftsAfterRefresh (cognitive 32): oracleIndexes.mergeOracleIndexDraftsAfterRefresh has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 5 (10 pts), boolean chains 9, loops 2 (nesting depth added 11). Of this number, 27 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31ea151ac05fab34eab8d2875d7514a99b6120a8166058f56864e86209865a2"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTriggerPlan.executeTriggerSequence::run (cognitive 32): oracleTriggerPlan.executeTriggerSequence::run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 3 (6 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bc414df5982992f2664e9153d4bd67cdb476ad06935f9706817522adb57200"}},{"ruleId":"D2","level":"warning","message":{"text":"explainPlan.parseOracleExplainText (cognitive 32): explainPlan.parseOracleExplainText has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 6 (10 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 11). Of this number, 30 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13a691f175072407a10bf4dc230e35d0dd67d55d5bc9555e6e51d11de7cc1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"mcpAccessTree.buildMcpAccessTreeRows (cognitive 32): mcpAccessTree.buildMcpAccessTreeRows has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 8, ternaries 7 (8 pts), loops 2 (nesting depth added 5). Most of this is not in the body itself: 4 of the 32 points are its own statements and the rest belongs to 6 function items inside it that branch (summarize, connectionRows, a function literal at line 252, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mcp/mcpAccessTree.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b243ad9ad38895c64c1ec90810948928cd61b337c68f94a30d351eab1ae291"}},{"ruleId":"D2","level":"warning","message":{"text":"nacosAdmin.normalizeNacosEndpoint (cognitive 32): nacosAdmin.normalizeNacosEndpoint has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 5 (11 pts), boolean chains 10, if/else 7 (10 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":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f309793fa7715df4d0a93978ad77e391ceda34b8d42c09c8b4c70766abf5f9"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisCollectionSearchController.scan (cognitive 32): RedisCollectionSearchController.scan has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 5 (11 pts), boolean chains 5, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCollectionSearchController.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b077b5a5b011fea2a6050f45e81ab2ceac5a21b20f6dd7aa92aa7221e44a93"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineDeploy.refreshOracleRoutineDeployment (cognitive 32): oracleRoutineDeploy.refreshOracleRoutineDeployment has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 12, ternaries 2 (3 pts), loops 2, error handling 1 (nesting depth added 6). Of this number, 27 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"1699ad7eb422d16a9d3952dd9662028c8573c50776d082e38daf392f872a0dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarSearch.matchSidebarLabelWithRegex (cognitive 32): sidebarSearch.matchSidebarLabelWithRegex has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearch.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12126943d8897b034b238c487c5d6eacfb1280885ea9067c225cb59dbaffa8a"}},{"ruleId":"D2","level":"warning","message":{"text":"insertValueHints.parseInsertClause (cognitive 32): insertValueHints.parseInsertClause has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 8, ternaries 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"897f5a7814eb11c2aa53edc9641a19d1ea9c22d0a73bf9af7450ef1145d646b6"}},{"ruleId":"D2","level":"warning","message":{"text":"mysqlRoutineSyntaxDiagnostics.tokenizeMysqlRoutineSql (cognitive 32): mysqlRoutineSyntaxDiagnostics.tokenizeMysqlRoutineSql has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 4 (14 pts), boolean chains 3, loops 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e92c247f73d19fbfdd59c9a17f026bccb363f94fb447282ef9ffc1955db7a9"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlAnalysis.containsTopLevelAggregate (cognitive 32): sqlAnalysis.containsTopLevelAggregate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 6, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f8ed258302406b98e521b16678f4d3589f78fd016cd2d8d378489de9824cca"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlServerQueryWrapping.topLevelSqlTokens (cognitive 32): sqlServerQueryWrapping.topLevelSqlTokens has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (10 pts), boolean chains 8 (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":"apps/desktop/src/lib/sql/sqlServerQueryWrapping.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7900c551884e8f874f1391ef06cd6de53e142e06916f062e4f46171f12e59660"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlVariables.collectDeclarations (cognitive 32): sqlVariables.collectDeclarations has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6c92a666bb93a99af1cdfd16dd9276dc02f83451fe98b68d57c61126d0bf22"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.syncTabTitleNumbers (cognitive 32): tabPresentation.syncTabTitleNumbers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8997f8882a402889a243d7692f1bf6335af09dd1a7fdaa94de38157ba78d0057"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.tabTooltipLines (cognitive 32): tabPresentation.tabTooltipLines has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, if/else 12 (14 pts), ternaries 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d76e876de3e7fbab7f73b157b29518e60dca4a67d73a13fb85ed51db8e1da55"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.tabIconClass (cognitive 32): tabPresentation.tabIconClass has cognitive complexity 32 (threshold 15). Drivers by points: if/else 26, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"355b3d89d002653a3fe5684e831456a3c4bd09b832cd6a710fab5aefe08bd754"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.persistConnectionDeletion (cognitive 32): connectionStore.useConnectionStore.persistConnectionDeletion has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 4 (10 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 15). Of this number, 29 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10901}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e32ccbef5e6f5f6650123515a0f1222de8dbfede921043f6755939f49ec2a8b"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.resolveEditableSourceMetadataTarget (cognitive 32): queryStore.useQueryStore.resolveEditableSourceMetadataTarget has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 24, ternaries 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee00225ab334565a96d152c1878482559033271247857b368e68360a9084f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"json.hasUnclosedMongoDelimiters (cognitive 32): json.hasUnclosedMongoDelimiters has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 2 (7 pts), boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df23fb3fe317da78af8064fe5c10d29c2571cd0b949da480203b1e6216becee"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_duckdb_driver::sql::contains_unquoted_sql_keyword (cognitive 31): dbx_duckdb_driver::sql::contains_unquoted_sql_keyword has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 10, loops 4 (10 pts), if/else 3 (9 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"58db4f3d36d4096284217f77ef6942cfd5c88ea543c4f0409b69961d85e213f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Nb3SqlReader::next_tuple (cognitive 31): Nb3SqlReader::next_tuple has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7080e2474da3e92129f61432e98724bc30454e17f1a8131f009f4642b101c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::call (cognitive 31): Resolver::call has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 7, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/references.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6909ce622e3ff250e041ec989fbdc13ac41dfe12ef8241ed5ec7b9348eabcc01"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::consul::operator::validate_snapshot_archive (cognitive 31): dbx_core::admin::consul::operator::validate_snapshot_archive has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/operator.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a563719b6e3960c16cce4e36d3c90151c2e447dcb08ad095dad6ce33b722bd1d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::format_export_sql_literal_typed (cognitive 31): dbx_core::data::database_export::format_export_sql_literal_typed has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c6864179af59a4e0724c722c7e3c3779059dce87c9e583afb3003e26d8cc02"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::export_agent_find_pages (cognitive 31): dbx_core::data::mongodb_import_export::export_agent_find_pages has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06d194b0530fd50c6c11b925747fc0769076900e5185abfc10fd19f9cdacd99"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::stream_xlsx_rows_to_channel_with_control (cognitive 31): dbx_core::data::table_import::stream_xlsx_rows_to_channel_with_control has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":4353}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc961ecd66f4623a8d68116bbc13f6ed8a0265894ea5389fff38a372177c08b3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::verify_effect_with_extra (cognitive 31): dbx_core::schema::native_jobs::operations::verify_effect_with_extra has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 7 (15 pts), boolean chains 8, if/else 6 (8 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb1995449a82fccef9235a4323c4aeaa01c557e2fd5a7ce3b82b9ebf370e0e9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::try_connect (cognitive 31): dbx_driver_sqlserver::sqlserver::try_connect has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"242eba28f484a67fa9d4a8b8c7b0a04913d603aea625bd9cf0587008d3c7ffb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Analysis::statement (cognitive 31): Analysis::statement has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 4, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d78367400165ef762b1f16cdf5b2a448091a7d56d9dad66af438a3e4e01d332"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::validate_data_grid_save (cognitive 31): dbx_sql_data::data_grid_sql::validate_data_grid_save has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (22 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"505e1a9cc50e7c82433b145a43a5b7566d1671f7ecddf90b29f82420aa150cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSchemaSyncTableDdl::render_triggers (cognitive 31): OracleSchemaSyncTableDdl::render_triggers has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (10 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/oracle_indexes.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"329e7b0ab914aa4fea6aab1913340de4b5c943e71a5b29963a50929b0e4220a8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::strip_postgres_default_casts (cognitive 31): dbx_sql_schema::schema_diff::strip_postgres_default_casts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 7, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a5055ad67240e2af620622f09a4b2fa1e66074a1c5245c0828853687673f55"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::triggers::build_exact_trigger_operations (cognitive 31): dbx_sql_schema::table_structure_sql::triggers::build_exact_trigger_operations has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ee90624778eb7f87fe7578bca416266e7529d13a65131a63e44726d47fb411"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::routes::mongodb_import_export::preview_import (cognitive 31): dbx_web::routes::mongodb_import_export::preview_import has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 7 (20 pts), if/else 5 (10 pts), loops 1 (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8f0e53896e3434fee4582cc464311bd214b13aa5df4620ae03657c0b530448"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::routes::table_import::preview_import (cognitive 31): dbx_web::routes::table_import::preview_import has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 7 (20 pts), if/else 5 (10 pts), loops 1 (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/table_import.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6900197a663346c94a9529ab7b243436ca821a39882dc39ede6ff50d6666e0cf"}},{"ruleId":"D2","level":"warning","message":{"text":"MongoAgent.configureBuilder (cognitive 31): MongoAgent.configureBuilder has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 11, ternaries 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dac28cf2e31c89fc9d33707290d95e54a7f9920fe891f22dbabcfd7fd85042"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompositeOutput.procedure (cognitive 31): PlDebugCompositeOutput.procedure has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (6 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeOutput.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d00c32fe46fa1a260e861dc898e8a319bcc44c6472830b88f0cea01932c38a6"}},{"ruleId":"D2","level":"warning","message":{"text":"cassandraConfig.finalize (cognitive 31): cassandraConfig.finalize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 9 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae388bb36b24b010071fd9ac91f1c229bb599593eceef3f89984f8e11f5fdd55"}},{"ruleId":"D2","level":"warning","message":{"text":"etcdSession.put (cognitive 31): etcdSession.put has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 6 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1a51d565bf1190cdf411a50f65f7a8c3a59e56c3d01f5af7eb7a197207738f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseKingbasePartitionBound (cognitive 31): main.parseKingbasePartitionBound has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"66281202a9cdcfe54b4bcecf44c79801b6a4652958ae20f793a8fedfda728f63"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runOracleAgent (cognitive 31): main.runOracleAgent has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"5325e12d2351c163cbbcc6592ad6b66bdcd03f653d144289c737bae1c1f575b8"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugSubprogramRange (cognitive 31): main.plDebugSubprogramRange has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":5063}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30d276b058c1953198af7d5044868e5a11e449b99187695398b29e6096d798a"}},{"ruleId":"D2","level":"warning","message":{"text":"server.closeNativeAllocations (cognitive 31): server.closeNativeAllocations has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_connections.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bb10a3f622abd2cba59e2077ab20c912b4a48d24400c6d8f095c2c131d0831"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.driveNativeEntry (cognitive 31): plDebugNativeEntry.driveNativeEntry has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 7, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_entry.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81b3b232aa361d50490b082b1a2c8f3bc4bf7048fd011e8c00d132173220923"}},{"ruleId":"D2","level":"warning","message":{"text":"main.isQuerySQL (cognitive 31): main.isQuerySQL has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, loops 3 (5 pts), match/switch 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42af5c2cd25645ed7443afb507d603e15f94bdafae4e80c341d762dcba65dfd"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGenerate.findGeneratorKey (cognitive 31): dataGenerate.findGeneratorKey has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 10, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7d7862f714ca62d7614f4f4516a0eb250df78837982fc17d996042f61b3396"}},{"ruleId":"D2","level":"warning","message":{"text":"regexGenerate.parseAtom (cognitive 31): regexGenerate.parseAtom has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a350faba07b399ab06b65f7a5024ced24ed6aaccaa226ce0a11f603ae64b80b1"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.prepareOracleForeignKeyPlan (cognitive 31): oracleForeignKeys.prepareOracleForeignKeyPlan has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 12, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"885aef7ee21a0e900e2af305137d5db035110b0ed1c86e695f1a71c492c9db1e"}},{"ruleId":"D2","level":"warning","message":{"text":"datagripImport.extractUserName (cognitive 31): datagripImport.extractUserName has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"69974395a959e17bbf3f99b55393356d4ad606e8e7c9cd6c56f4459df5bc1ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"navicatImport.parseConnection (cognitive 31): navicatImport.parseConnection has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 15, ternaries 8 (10 pts), if/else 5 (6 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":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1ee184d13bce333680c1f73a16ef298920ed40984aa279f58acf197821cb10"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.classifyMethodOptions (cognitive 31): mongoCompletion.classifyMethodOptions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 3 (6 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"4106e7373b1da1924c0e4f09b26d8515e864425cd1a6b82b419935ffbfcbeaee"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCompletion.argumentTokenItems (cognitive 31): redisCompletion.argumentTokenItems has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 7 (12 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 15). Of this number, 24 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad748ae1bfa2904e6bc2cb1ea0d04f615fad440cfbd4f8c6677666105175ccda"}},{"ruleId":"D2","level":"warning","message":{"text":"redisKeyGrouping.compileRedisGroupGlob (cognitive 31): redisKeyGrouping.compileRedisGroupGlob has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (9 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyGrouping.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c88371a52633fe241666ffc436c210ab23b2f3300bad97536deb4174d42c245"}},{"ruleId":"D2","level":"warning","message":{"text":"identifierSearch.identifierMatchScore (cognitive 31): identifierSearch.identifierMatchScore has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/identifierSearch.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a01c21e691e1a764e2f8ab80f874ca783f8f9aeeb8c0a8707021649292d3c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"ddl.createTableLayout (cognitive 31): ddl.createTableLayout has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 111, 100, 106). 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":"apps/desktop/src/lib/sql/layout/ddl.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"080b334f8564869e35bfca26673c73dd6e7be801ebf00759a227ec8dac939f98"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics.isSqlServerGoSeparatorLine (cognitive 31): diagnostics.isSqlServerGoSeparatorLine has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 6 (9 pts), boolean chains 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e81361eadb5728eeb0834d9a270b173fdeb2c2ac7332c249e6227842b75984c"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlAnalysis.findTopLevelKeyword (cognitive 31): sqlAnalysis.findTopLevelKeyword has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"5585b500148e8d032b691bf86aa1a7a437f8b3edde34566ab669ac0fa079fe9c"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlDatabaseLinks.collectSqlXmlKeywordPositions (cognitive 31): sqlDatabaseLinks.collectSqlXmlKeywordPositions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 9, ternaries 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDatabaseLinks.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed3204cde663ff038a65e5e40791d4235728c1636c8f765f67d9657af530b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"starrocksDdlDisplay.formatStarRocksDdlForDisplay (cognitive 31): starrocksDdlDisplay.formatStarRocksDdlForDisplay has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 16, if/else 8 (10 pts), ternaries 1 (3 pts), loops 2 (nesting depth added 4). Of this number, 23 points are the body\u0027s own statements and 8 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/starrocksDdlDisplay.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afcf97ec756889e80de05b5269d41b667abfb738c69de082ff0d6518f91f5eb"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.closeTab (cognitive 31): queryStore.useQueryStore.closeTab has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 5). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5317}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e66ffc851bbc6c3f2e2a7dce3b86859ec50ba7d8e358d2e0cb2176ddebadd8"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.commitTransaction (cognitive 31): queryStore.useQueryStore.commitTransaction has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (28 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 15). Most of this is not in the body itself: 9 of the 31 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 6447, 6482). 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6432}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a82c4bc0b8bcc67280f7cf6d709539128b1f1b94f1ba2ce5c8a40144cf3b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_responses_api (cognitive 30): dbx_ai_provider::ai::stream_responses_api has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e1d27e3e105d3f219ac82374aeea5df382eb29a28f4f747404b024bc494565"}},{"ruleId":"D2","level":"warning","message":{"text":"NacosOpenApiAdmin::get_config (cognitive 30): NacosOpenApiAdmin::get_config has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f28cf8c3b3a83434f7cde837b1ac0264d494bbc37f7719bada95268f510d39"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::data_compare::build_data_compare_select_sql (cognitive 30): dbx_core::data::data_compare::build_data_compare_select_sql has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22 (29 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f9854a5f8e9c6c1ced846109396a75f887a06455a2521e9ad764136fc9ef11"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::script_generator::generate_joint_script (cognitive 30): dbx_core::data::script_generator::generate_joint_script has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b2a5d14f4e60e0e873c87037ec94b31336279766d69d687c323990192af36c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::xugu_objects::cte_bindings (cognitive 30): dbx_core::data::transfer::xugu_objects::cte_bindings has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dda6d6849968d205684c1f74badff8f43b2ed9aac9d314a7f885b2073d4d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::pl_debug_status_core (cognitive 30): dbx_core::query::pl_debug::pl_debug_status_core has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 1 (5 pts), boolean chains 4 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"242dd58bcbaf510cb46e261d04917a0ba2eaf5b2376eae6c8b2b765e8b4c2c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::safety::production_safety::mongo_pipeline_targets_production_database (cognitive 30): dbx_core::safety::production_safety::mongo_pipeline_targets_production_database has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 5 (19 pts), if/else 5 (8 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36c8eed3002808b1f3db37b89c12d4570bbb0c19b893883fad78f9162e3630d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_management::object_metadata (cognitive 30): dbx_core::schema::oracle_type_management::object_metadata has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 4 (10 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_management.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"869c22537dfa2bfb82e8dd08364125c170d4bb53ae4a3bf55a47aa5f6b08b0ed"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_offline_export::validate_managed_jre_tree (cognitive 30): dbx_driver_agent::agent_offline_export::validate_managed_jre_tree has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb8ae8005d6e5a43f19520771fec8fc95715e607d5ac42950bd131be879bacf"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlDataCharset::decode (cognitive 30): MySqlDataCharset::decode has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql_data_charset.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb26003ec143f1ee2924ada1d07fcaf9f1e819756fa4fed6c4bf2a78854d6ce"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_value_to_json_with_data_charset (cognitive 30): dbx_driver_mysql::mysql::mysql_value_to_json_with_data_charset has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ddf949dbcf77349a43ecb3523a2400468103a1e6e60e77328bbbfc79a70310"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::list_objects (cognitive 30): dbx_driver_mysql::mysql::list_objects has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 9 (12 pts), boolean chains 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":4897}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9a34bca97b378450a880c4a12869124d192d112d3062b1fcb78da1cca88434"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::classify_pg_type (cognitive 30): dbx_driver_postgres::postgres::classify_pg_type has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24 (25 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc7cb13164900da3e32d39015fac67434cc30fe9a2e91cb772187d44c855c71"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_jobs::native_job_catalog_queries (cognitive 30): dbx_sql_schema::native_jobs::native_job_catalog_queries has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 6 (10 pts), boolean chains 4 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_jobs.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbe818673286f7296195a85987f3732d1212c356ac5650b4fd44e725241921c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::diff_names_with_patterns (cognitive 30): dbx_sql_schema::schema_diff::diff_names_with_patterns has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (9 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"893df9abdf4d914d25cf778c6af8f3ff505bb0110a89b315486a15896e844f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::resolve_schema_diff_table_names (cognitive 30): dbx_sql_schema::schema_diff::resolve_schema_diff_table_names has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0444242fd363e4d3be991f138a2866adeaf48c917ca7616d2f073f40845003b4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_format::column_definition (cognitive 30): dbx_sql_schema::table_structure_sql::column_format::column_definition has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 8 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b43230f849b09e52829d6494a06fe271e0a69eb063968542cd9a58882f5253"}},{"ruleId":"D2","level":"warning","message":{"text":"BlobBoundStatement.validate (cognitive 30): BlobBoundStatement.validate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 8, loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/BlobBoundStatement.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92278d030dd62bea712b3667aad43809453a94d64eeceb29b716874db0a6375"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompositeInput.child (cognitive 30): PlDebugCompositeInput.child has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 11, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a818d417654610b9ee2d22362f5eca34f8c174d816a49ec69bd076ef346c36"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer.composite (cognitive 30): Writer.composite has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 4 (6 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2cf292670ffe602c50c78587898442f16041c514a5546c2bf4a5bd1360ba74"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan.bindComposite (cognitive 30): Plan.bindComposite has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 4 (15 pts), if/else 6 (9 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92e4a3ac0a76c44f347040c49265a8d481746f55831ef05bc6a62989778a4d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan.\u003Cinit\u003E (cognitive 30): Plan.\u003Cinit\u003E has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c75875d715b802bcdf33e59104f2b304a53382cdc5c73a99dc80747972bb85f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseHiveConnectionString (cognitive 30): main.parseHiveConnectionString has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (27 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cb2a1d48b551777235aff0b59f5a71d15906ada4816783e4b0d247d441667a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseHiveConnectionString (cognitive 30): main.parseHiveConnectionString has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (27 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"474c90d5d01f7be2394b444bdb8a9ced068637e97da3e33e8507d2eb69c66e13"}},{"ruleId":"D2","level":"warning","message":{"text":"server.completionAssistantSearch (cognitive 30): server.completionAssistantSearch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/metadata.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"187e147bab89c8fb044ee8e85c8b417e81b7853e3bcccbcfc3831d16f6b43d53"}},{"ruleId":"D2","level":"warning","message":{"text":"server.enrichExactTriggerObjects (cognitive 30): server.enrichExactTriggerObjects has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 6 (12 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/trigger_metadata.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2d6c5ac4ee884a7daab84ca811fc2b70707a82658587d1f786b31b7103b39b"}},{"ruleId":"D2","level":"warning","message":{"text":"useQuickOpen.matchQuickOpenText (cognitive 30): useQuickOpen.matchQuickOpenText has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e63205ed082905113ea60b8285a2fe9c4a2923f98409c1d82149c6a7c89cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"index.localeFromLanguageTag (cognitive 30): index.localeFromLanguageTag has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 14 (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":"apps/desktop/src/i18n/index.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbb19e7c6e1e026b5758b5e0acc5188ca314d20f8c3a3fa986de54f5f9ed237"}},{"ruleId":"D2","level":"warning","message":{"text":"ai.buildSystemPrompt (cognitive 30): ai.buildSystemPrompt has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 14 (22 pts), if/else 7, 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":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3f0812e7f0ca872c0bcd3e34c092cfa31b49e702534066aeb7ce2b0b21938e"}},{"ruleId":"D2","level":"warning","message":{"text":"documentStoreProvider.parseMongoFilterValueAs (cognitive 30): documentStoreProvider.parseMongoFilterValueAs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68c03d5432f8eb0ff96181d6d9bb8574b996ffe70033f375dc747c40bad7b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"http.aiStream (cognitive 30): http.aiStream has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (20 pts), error handling 1 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d068cc78ed8ce275b49614b745834b1be69cf1cd0ce8060d9388159dd2c1f8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnType.resolveDataGridTypeVisualKind (cognitive 30): dataGridColumnType.resolveDataGridTypeVisualKind has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnType.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c422d7d268784ee7718f1a69ef5a46d785c8bea15b05e07b4698700d17e4d65d"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnWidthState.saveDataGridColumnWidthState (cognitive 30): dataGridColumnWidthState.saveDataGridColumnWidthState has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 4 (8 pts), boolean chains 6 (nesting depth added 8). Of this number, 25 points are the body\u0027s own statements and 5 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":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead420153dbbf47d789dec16905fb3a04997c67f5cedf9d8f3b56f8033ee368c"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorCurrentStatementFrameLayer.currentStatementFrameRect (cognitive 30): codemirrorCurrentStatementFrameLayer.currentStatementFrameRect has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 9, ternaries 4 (8 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorCurrentStatementFrameLayer.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"22aebcac16d73b7fff284728725822e9ad93edd10b3d3533fb71e698c35e101a"}},{"ruleId":"D2","level":"warning","message":{"text":"graphCompletion.buildGraphCompletionItems (cognitive 30): graphCompletion.buildGraphCompletionItems has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 7, ternaries 3 (4 pts), loops 1 (3 pts) (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 7 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletion.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b5669944c64a39d5182c23437e8b97387b91b34c27361619fd5bf903aa6d00"}},{"ruleId":"D2","level":"warning","message":{"text":"neo4jNodeResult.projectNeo4jNodeResult (cognitive 30): neo4jNodeResult.projectNeo4jNodeResult has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 7 (12 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/neo4j/neo4jNodeResult.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb018255f48c0b1ab74c9944664cccaaf6b4070e4984e179572b58138285b3a1"}},{"ruleId":"D2","level":"warning","message":{"text":"editorSettingsDraft.normalizedDraftValue (cognitive 30): editorSettingsDraft.normalizedDraftValue has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, ternaries 4 (8 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/editorSettingsDraft.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6674fb4087ed7123b90cdfd0e76d9f9005bd26bed12f2e01a75d0dc0eb5eeebb"}},{"ruleId":"D2","level":"warning","message":{"text":"completion.sqlCompletionContextFromSemantic (cognitive 30): completion.sqlCompletionContextFromSemantic has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, ternaries 10 (11 pts), if/else 4 (nesting depth added 1). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c7b9ed57b92269d3875a151aa3ec9adcf43e8503972c42c95a315baea3ff04"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics.updateSqlServerBatchScanState (cognitive 30): diagnostics.updateSqlServerBatchScanState has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 2 (7 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"539c015d10d947ef5d48a1df6406bdae9fb799fc55054b4108472a8f14fa8ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"model.sqlSemanticTableNameSpans (cognitive 30): model.sqlSemanticTableNameSpans has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a33629ed9adf5d687b445cd8b60cbf3da5ec152386cdbd1f208c696724fd57d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlFormatter.formatLeadingCommas (cognitive 30): sqlFormatter.formatLeadingCommas has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 4 (9 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f994a6d907d350925f5dd8be8cb7fd0a9ef924a0a6a9d6f4a74db5d8705b54"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.resultRunSourceLabel (cognitive 30): tabPresentation.resultRunSourceLabel has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 6 (9 pts), boolean chains 4, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"8add76af5965f555696e1eadc94aa212bb0d154f2e54ab79f668e6bd5a671e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.closeOriginal (cognitive 30): plDebugStore.usePlDebugStore.closeOriginal has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 9, error handling 2 (3 pts) (nesting depth added 7). Of this number, 28 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d3790884c08e2d3305456b9f5eec586d578ad895ce35ee31dc99abe84d873b"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.annotateQueryResultSources (cognitive 30): queryStore.annotateQueryResultSources has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 5 (11 pts), boolean chains 5, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1dfe52f91ba0f958549f810740fa1800c0c923844ce06c36e56f641f8f3858"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.rollbackTransaction (cognitive 30): queryStore.useQueryStore.rollbackTransaction has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (27 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 15). Most of this is not in the body itself: 7 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 6507). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6494}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19ebf8e2b46bb5d8713700f14725b41a49acac4c3454981dab3d5c796449b49"}},{"ruleId":"D2","level":"warning","message":{"text":"agentBundle.assembleCustomBundle (cognitive 30): agentBundle.assembleCustomBundle has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (23 pts), error handling 3 (4 pts), loops 2, boolean chains 1 (nesting depth added 10). Most of this is not in the body itself: 8 of the 30 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 506, a function literal at line 535, reportDownload). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/lib/agentBundle.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e015cb6d308c7f2429abdcea89b84093f9542fdcbc96e5a13a557e123ea87b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_duckdb_driver::query::duckdb_logical_type_to_string (cognitive 29): dbx_duckdb_driver::query::duckdb_logical_type_to_string has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/query.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"3041177c079a01120bb21657e2ad0f17f06e6aa5e8dc673ae6732229fa25af11"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::mq::adapters::rabbitmq::read_thrift_value (cognitive 29): dbx_core::admin::mq::adapters::rabbitmq::read_thrift_value has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"494577c83f300a1d368bed77173aae97d11a5adac1f2bf9e3b505c8a77191b63"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::sql_import_leading_keyword (cognitive 29): dbx_core::data::table_import::sql_import_leading_keyword has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (13 pts), boolean chains 9, if/else 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a7e81412001714f5bf511d2d888099cc1b4b2e2943bfe6cf0003903035c090"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_oracle_schema_objects (cognitive 29): dbx_core::data::transfer::transfer_oracle_schema_objects has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 3 (12 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10433}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1192351e75e044504100d567f79ac407d66325bc043992c168cd8bbfe96744"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::structure_plan::build_structure_preview (cognitive 29): dbx_core::data::transfer::structure_plan::build_structure_preview has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 9, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/structure_plan.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1da97fbd66bc841283a85056f1cf07e90e76a3c06cc09f50be342896835782"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::external_driver_gaussdb_m_indexes (cognitive 29): dbx_core::schema::external_driver_gaussdb_m_indexes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d93f6773447bf43c9d9f1643937cf7d4600a83311ded5e5cdb6f3d8e9c388b4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_triggers::list_objects (cognitive 29): dbx_core::schema::oracle_triggers::list_objects has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 6, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_triggers.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b13123a317e132610a18c9eea29dff31f2f03fb382324278b43e4f9a556987"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::completion_assistant_search (cognitive 29): dbx_driver_mysql::mysql::completion_assistant_search has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (9 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3869}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89a386c00575eb361a389de1d19bf7e9ec7797b2efc69deaf1c20e04c9463fd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::execute_non_result_batch_on_conn (cognitive 29): dbx_driver_mysql::mysql::execute_non_result_batch_on_conn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7552}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac9a389588b517cd1535aba2acfee3ab26081ed239ac73d4b4d5ae6ce710acd"}},{"ruleId":"D2","level":"warning","message":{"text":"TextEncoding::encode_copy_text (cognitive 29): TextEncoding::encode_copy_text has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (9 pts), match/switch 2 (8 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/text_encoding.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"510b037f196fe8c627a6356ccc2678f83cee58181776dc0c2e0e2b2603e7905c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::proxy_tunnel::test_proxy_endpoint (cognitive 29): dbx_drivers::db::proxy_tunnel::test_proxy_endpoint has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/proxy_tunnel.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"23db05a83f02c5b613dc73c58dd1713469156668a653a464d5f73aeda088f54b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_editability::strip_sql_server_top_clause (cognitive 29): dbx_sql_core::sql_editability::strip_sql_server_top_clause has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2299204329117f31accd6c9eda783d56af0df979893b5da1c4e999499d247e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_extractors::copy_formats::write_dbunit (cognitive 29): dbx_sql_data::data_grid_extractors::copy_formats::write_dbunit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/copy_formats.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"256e217f7ffb373e692eee4cd402f7bbb318bf2d487974d712967d33c9bc5448"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::is_simple_sqlserver_order_projection (cognitive 29): dbx_sql_data::query_result_sql::is_simple_sqlserver_order_projection has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf73ef389bb328ce7cf9b8dd9bd3c222118bfa1a77e6b0c435d6eafb4ea0f21"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::routes::connection::run_prepared_temporary_connection_test (cognitive 29): dbx_web::routes::connection::run_prepared_temporary_connection_test has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 5 (12 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"729d72d9ddf196a03d888d597fc99935bfe2af7c0936832afb264c939ae319d8"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRpcServer.legacyJob (cognitive 29): JsonRpcServer.legacyJob has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 3 (7 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d239af41a047d779b7659f7136b0d47a716fad46704811b18f464f389fa1c89"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.applySecurityProperties (cognitive 29): KafkaAgent.applySecurityProperties has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 2, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1db3b64c057601594120b9b7764eaf365a3bc2a0380e0ea3cc99127445a9da6"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSession.evaluateBreakpointRules (cognitive 29): PlDebugSession.evaluateBreakpointRules has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 8, ternaries 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1c4dd5a632a4f16225296b8103bf9f259be50bd88fad9bc2ee7264993c180b"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.decodeZoned (cognitive 29): PlDebugTarget.decodeZoned has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 6 (9 pts), boolean chains 7, error handling 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e27c742b2b558280e30fb298a5b0cd4e62deea5570c106974755d81e6a52a2"}},{"ruleId":"D2","level":"warning","message":{"text":"SpannerAgent.completionAssistantSearch (cognitive 29): SpannerAgent.completionAssistantSearch has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 2 (6 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5f2bf6d4f602bbd73da3e74e69e4164850da3022dd6aa5262b166c9ee52142"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_tunnel.run_worker (cognitive 29): dbx_tunnel.run_worker has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 3, error handling 1, loops 1, ternaries 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":"deploy/dbx_tunnel.php"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0d20ead73513c80a638c82df6198574b86b9dd8e27fad564137ed8d185378c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.loadClientKeyStore (cognitive 29): main.loadClientKeyStore has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a446b841efade7b63f253d66edf0f3a55feeaa2aba7d965c8e306dec6ef3fb0b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.loadClientKeyStore (cognitive 29): main.loadClientKeyStore has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/zookeeper_tls.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"df857a671921f4c4a93457f9a566b78f8ecdd2492ed8195999e400dacece439a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.appendGraphValue (cognitive 29): main.appendGraphValue has cognitive complexity 29 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/query.go"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"440a76378da3f3efb472a8cbfaed0dda1b7e29f95d64a10cb4d05db84fb84bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugEvaluateCondition (cognitive 29): main.plDebugEvaluateCondition has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 5, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_condition.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac4f1c52f20beb96a3668474133a4bc5e1ebe57ea3cc96d1b77846c3952dd3d"}},{"ruleId":"D2","level":"warning","message":{"text":"client.NewIoTDBRpcDataSet (cognitive 29): client.NewIoTDBRpcDataSet has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"522a96e07c9a21eb5ba548ba3eb6705ad65d147377a0d37a67865ddf2fa076c4"}},{"ruleId":"D2","level":"warning","message":{"text":"IoTDBRpcDataSet.getStringByTsBlockColumnIndexAndDataType (cognitive 29): IoTDBRpcDataSet.getStringByTsBlockColumnIndexAndDataType has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2166ad654405a7b2c192cd14bbe94b25d6e0f144d1b71b01da93e9c7b05ea91"}},{"ruleId":"D2","level":"warning","message":{"text":"Tablet.SetValueAt (cognitive 29): Tablet.SetValueAt has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 6 (10 pts), boolean chains 2 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/tablet.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"894853b118d416cc53657664a15f5b19d6348206bf3bd18b2eb4d6fd8f2aecfc"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.statementRangeAtCursor (cognitive 29): sqlStatementRanges.statementRangeAtCursor has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"7535a2e8f6526fe0774f54eb17579c9f3b409c899e51ba797dc19a5eb8ee6e14"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.completionItemsForBypassedFilter (cognitive 29): useQueryEditorCompletion.useQueryEditorCompletion.completionItemsForBypassedFilter has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 8, ternaries 3 (4 pts) (nesting depth added 6). Most of this is not in the body itself: 4 of the 29 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 452, 464). 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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c1550887887922efa3bff3e163413d9c354b3837ac72a8918943fe8fe83620"}},{"ruleId":"D2","level":"warning","message":{"text":"transferStrategy.createTransferSubmission.start (cognitive 29): transferStrategy.createTransferSubmission.start has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 9, error handling 1, ternaries 1 (nesting depth added 6). Of this number, 28 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":"apps/desktop/src/components/transfer/transferStrategy.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da3d40ec4f0c96d0d98fc45cecacbdc39a701933481e253ee17ebb10935a750"}},{"ruleId":"D2","level":"warning","message":{"text":"errorUtils.normalizeBackendErrorAtDepth (cognitive 29): errorUtils.normalizeBackendErrorAtDepth has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, error handling 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"405ccec4d39a265f9ccce1258f67ed2d386f0a37340074ada458e44223499b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionParameterDocument.writeConnectionParameters (cognitive 29): connectionParameterDocument.writeConnectionParameters has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 8, ternaries 5 (6 pts), loops 3, error handling 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 14 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":"apps/desktop/src/lib/connection/connectionParameterDocument.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b54fb53b1c4114bf760ff3320231babcb0c25cdd89e9a7bebea84f778a5405"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridCellCoercion.coerceDataGridCellValue (cognitive 29): dataGridCellCoercion.coerceDataGridCellValue has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 9 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d24255c40629ff60036ba580d7d712ea993edf07d8e275bda563b7dd6a1008"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridSelectionPersistence.captureDataGridSelection (cognitive 29): dataGridSelectionPersistence.captureDataGridSelection has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 7 (9 pts), boolean chains 7 (nesting depth added 7). Of this number, 23 points are the body\u0027s own statements and 6 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSelectionPersistence.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafb5cbc61f8cff3a4148622ed9c77e445e9d72b90746019fa392de5b13a884b"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseAuthorizationPlan.databaseAuthorizationsFromTableGrants (cognitive 29): databaseAuthorizationPlan.databaseAuthorizationsFromTableGrants has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 6, if/else 3 (6 pts), loops 3 (4 pts) (nesting depth added 11). Of this number, 22 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"68999b2d6dbff113ac11813baaae321be7c4502e4010fbc94a354af28ccabdf8"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeJobAdmin.nativeJobProgramArgumentLayout (cognitive 29): nativeJobAdmin.nativeJobProgramArgumentLayout has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 10 (17 pts), boolean chains 8, if/else 4 (nesting depth added 7). Most of this is not in the body itself: 11 of the 29 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 281, 276). 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":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289b21ac2fcd37647b963c2ee3ca438a39e900588f1ee8aac4e4aeb2a52cf37"}},{"ruleId":"D2","level":"warning","message":{"text":"explainPlan.parseDamengPlanLine (cognitive 29): explainPlan.parseDamengPlanLine has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e718e9a5b4a38bb9e5a2ec513caec2180193f3e72d734f969581d03a0a2e78"}},{"ruleId":"D2","level":"warning","message":{"text":"explainPlan.buildDamengTree (cognitive 29): explainPlan.buildDamengTree has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 9, ternaries 2 (4 pts), loops 3 (nesting depth added 8). Of this number, 26 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55866f416ac6b6402a6100747bd613dcdf44eec6f3757900d0c9d8ab5c2e649"}},{"ruleId":"D2","level":"warning","message":{"text":"hoverTableSql.parseColumnLine (cognitive 29): hoverTableSql.parseColumnLine has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (7 pts), boolean chains 6 (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":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"35711a57a2e6174b592f12fb4545f5d8efe2df0bb3daa1a82ccc734af928df23"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlIntentionActions.resolveNavigationTarget (cognitive 29): sqlIntentionActions.resolveNavigationTarget has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 4, error handling 1 (nesting depth added 14). Of this number, 18 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"6394d53f0083c6f7862cc93d600aa2f3ec43050301c2f1e1971acb8bf9a41c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"influxDbV1Delete.resolveInfluxDbV1DeleteTarget (cognitive 29): influxDbV1Delete.resolveInfluxDbV1DeleteTarget has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5, loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/influxdb/influxDbV1Delete.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8740befad27b9377ae3f05a57a0bbcd3537e854c6cca2af1c911bbdf999919f"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.classifyFilter (cognitive 29): mongoCompletion.classifyFilter has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 4 (8 pts), boolean chains 4, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"285aabce059ee8f9a3ebe868b1e1209518d43aa564a87f492ab731ecef597c14"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoDocumentValues.renderMongoShellLiteral (cognitive 29): mongoDocumentValues.renderMongoShellLiteral has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 11, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e20dbd2371319bea4759f5841240b4fc75e6d05c03f8fbd545ebb937637a97"}},{"ruleId":"D2","level":"warning","message":{"text":"mqConsoleDefaults.resolveAvailableMqTabs (cognitive 29): mqConsoleDefaults.resolveAvailableMqTabs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/mqConsoleDefaults.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9539cb5db2a0dfca3dd42c33342a56a86a25a21209ee7172002b153702f15873"}},{"ruleId":"D2","level":"warning","message":{"text":"pluginShortcuts.collectPluginShortcuts (cognitive 29): pluginShortcuts.collectPluginShortcuts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 8, loops 3, ternaries 2 (3 pts) (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginShortcuts.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"608c3e45ad22ea2f4357ceee13b17072638e64df6588d102dd750264b2c272c0"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCommandDocs.commandArguments (cognitive 29): redisCommandDocs.commandArguments has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 11 (22 pts), boolean chains 4, if/else 1 (2 pts), loops 1 (nesting depth added 12). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandDocs.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a52624c346ef2583935e7f6d75d89eaf48a4f22b2e0d7ea796750306d8d0ea"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildTableItems (cognitive 29): sqlCompletion.buildTableItems has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 12 (16 pts), boolean chains 13 (nesting depth added 4). None of this is in the body itself: all 29 points belong to one function literal inside it that branches (line 5173). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5153}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6d7135d2bd261aedfcc625220b7828a81e3b94a8f2063e66d733d237c8e1cc"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.objectMatchesCompletionContext (cognitive 29): sqlCompletion.objectMatchesCompletionContext has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 9, ternaries 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5506}}}],"partialFingerprints":{"codehealthFindingId/v1":"878dbe55b095fa7a70a665b4f3ddf7a2d0032486f520b4f8dba03d5adeadd657"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlSourcePaste.readStringLiteral (cognitive 29): sqlSourcePaste.readStringLiteral has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 3 (8 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlSourcePaste.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"472bf3646549c33a2e0ed84086a8d2d8b8dec9ce8206de8a7ac102f28206dd5d"}},{"ruleId":"D2","level":"warning","message":{"text":"tableSqlTemplates.columnPlaceholderValue (cognitive 29): tableSqlTemplates.columnPlaceholderValue has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 7 (13 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableSqlTemplates.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"156fb3d8fc13b56098492634a5528c5dbef7f938d1fa0f5d1e5d9c7b19f77e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"tableStructureEditorState.isWrappedByOuterParens (cognitive 29): tableStructureEditorState.isWrappedByOuterParens has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ff760d1748a5866ab23cee3e42a12abe1831f6dfbc1f7ed039f9c1ca23f2f6"}},{"ruleId":"D2","level":"warning","message":{"text":"tableTree.mergeTableTreePageChildren (cognitive 29): tableTree.mergeTableTreePageChildren has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 6, boolean chains 3 (nesting depth added 5). Most of this is not in the body itself: 13 of the 29 points are its own statements and the rest belongs to 5 function items inside it that branch (addNode, collect, addToParent, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b86ea93a4377a64083cb167bb17a52facef2e300db3302e1065e3105597178"}},{"ruleId":"D2","level":"warning","message":{"text":"tableTree.coalesceXuguPackageObjects (cognitive 29): tableTree.coalesceXuguPackageObjects has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 3 (6 pts), boolean chains 2, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c315e9750cd4c9dfc0cca9f67540fe0f932972dfc9339a24b77a7f148fdc87"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.statementExecutionMarkers (cognitive 29): tabPresentation.statementExecutionMarkers has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7, ternaries 2 (3 pts), loops 1 (nesting depth added 8). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1280e1fca0f564d1f5cf51390da9c14dd43e6fd14c32404b832fe702b17672"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadDorisCatalogTables (cognitive 29): connectionStore.useConnectionStore.loadDorisCatalogTables has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 9 (10 pts), boolean chains 4, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 8 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 7526). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7502}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6219254ec5267826e0a6875b1a6bafa37017b0afcc1a33bac6a959077f98959"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.appendQueryResultSegment (cognitive 29): queryStore.appendQueryResultSegment has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 13 (15 pts), boolean chains 8, if/else 4, loops 2 (nesting depth added 2). Of this number, 23 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ab6d4faf1763600070bf9a3bd18a4829381ffad9cf77541b6b401a34e61575"}},{"ruleId":"D2","level":"warning","message":{"text":"requireAiRecommendationUpdate (cognitive 29): requireAiRecommendationUpdate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 13, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5990a849382089f8ee07a9ad3edce716b7f5b449975847ad2c5a2f4485cf4059"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::measure_first_stream_chunk (cognitive 28): dbx_ai_provider::ai::measure_first_stream_chunk has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d71107b52b9ef2bf9ba9fba5f1b6a8180f2f008e7de72486067f42b2621fdf9"}},{"ruleId":"D2","level":"warning","message":{"text":"DegradationChain::decide (cognitive 28): DegradationChain::decide has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"35471ec7d20e53c345e192f17df37dbb020b1c403d16838790252d1dab446dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"McpGlobalPolicy::normalized (cognitive 28): McpGlobalPolicy::normalized has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 4, boolean chains 3, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"e239d11ccff8d3d38905c39c23ea47025c36b235689bf184db3996660f93aa00"}},{"ruleId":"D2","level":"warning","message":{"text":"RetainedResults::manifest (cognitive 28): RetainedResults::manifest has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/results.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f41bdac1c708e4bedd24a443f347cdacb4389b15738a020f731ee0d40ede756"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupService::tick (cognitive 28): BackupService::tick has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/engine.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3f87fc24cd01057b798db9aa47521aefeb3beb7d53425e54dbac2b0ce4cf73"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::nacos::access_control::validate_replayed_commands (cognitive 28): dbx_core::admin::nacos::access_control::validate_replayed_commands has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dba9e30f43f0a9ce3d80859b055be90fa30113f7305f8af973498ffe6208cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::export_mongodb_query_inner (cognitive 28): dbx_core::data::mongodb_import_export::export_mongodb_query_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"4feef0f388464ca4893b0b88e969d35ed1e7474a65eaabecd2a7b1b6a8ed827a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::begin_transaction_session (cognitive 28): dbx_core::query::begin_transaction_session has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 6 (10 pts), loops 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":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":6754}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d6f6c5f80f74072aa15a3631e692d2d1cce21706d1c12db7329399d615d5fb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::inspection::wait_for_inspections (cognitive 28): dbx_core::query::pl_debug::inspection::wait_for_inspections has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/inspection.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"26060022a1f92b5faa9dc02e2e65d3cb70d2e5c7633ad0096ab5d862d219e0eb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::lifecycle::cleanup_original (cognitive 28): dbx_core::query::pl_debug::lifecycle::cleanup_original has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/lifecycle.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b90fbf87fbf2893d8d4c764b61ef57ea40624580b3dabda39489fb73830846"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::safety::production_safety::referenced_databases (cognitive 28): dbx_core::safety::production_safety::referenced_databases has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33656344edd301f7fdf88cb71b1cb088d5bf5ff0c2d241fee248475735e77d6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::list_completion_objects_once (cognitive 28): dbx_core::schema::list_completion_objects_once has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (9 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":9269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5d96ac3d25dfdc11348426edf34e74d80eeeaaf4c9e40bd3e1c8611fd4f22c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_data::read_data (cognitive 28): dbx_core::schema::oracle_type_data::read_data has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8444fee6d4715234dffd952e375a611ffc3534bbef0dfe6db3902455d0746a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::state_calibrator::build_rebase_plan (cognitive 28): dbx_core::schema::state_calibrator::build_rebase_plan has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/state_calibrator.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d7b5c329b309728e9f3696aee8cc3e9e45c96352133f60908ce8625ef63e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::is_shell_regex_value_position (cognitive 28): dbx_driver_mongodb::mongo_shell::is_shell_regex_value_position has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c7585175528a1e57a82598ab123bec15652d818b06d926296cd2212cea8e72"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::mysql_routine_block_is_complete (cognitive 28): dbx_sql_core::sql::mysql_routine_block_is_complete has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c8781687292579c7829496a4a6a268cb3cde8c7d25c809bc28b5d4f18c70f7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::has_executable_sql_with_options (cognitive 28): dbx_sql_core::sql::has_executable_sql_with_options has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4834}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdfc158b4a0508b6cea3dddee47d5d663f7112bb94f6389ce072a525a8cd103"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_editability::strip_sql_comments (cognitive 28): dbx_sql_core::sql_editability::strip_sql_comments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbbeaabfb2df84ad30ffd654ebc6cd12630a870e4afe4495b2424d15e02f766"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::build_data_grid_copy_insert_statements_with_formatters (cognitive 28): dbx_sql_data::data_grid_sql::build_data_grid_copy_insert_statements_with_formatters has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 8, match/switch 4 (5 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5438fc38d4217eda4147b9a417b490da6f8ceaad9f043e7f12c6d7ef1d16a9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_dialect::sql_dialect::table_select::large_value_preview_kind (cognitive 28): dbx_sql_dialect::sql_dialect::table_select::large_value_preview_kind has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 7, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"978e272c28a74608dccb52fb85df6a6866f8f9e8f41050fac6564a383ad06ab4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_types::models::connection::normalize_sqlserver_host_port (cognitive 28): dbx_types::models::connection::normalize_sqlserver_host_port has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":3187}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e547ce6fb565f76c84d475e13f0f940b1f377c92c23b34dc1fc94b1762c149"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::serve (cognitive 28): dbx_web::serve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (19 pts), match/switch 7 (8 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7249ed04b45358d5935d3f3e13b1cdb2eef827930282425a846d07cd2d3333d"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardJdbcMetadata.getColumns (cognitive 28): StandardJdbcMetadata.getColumns has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 9 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"738b6edfa764d4605276aa9587a9168e52d383b41da64737e2127bd26f2d6663"}},{"ruleId":"D2","level":"warning","message":{"text":"MongoAgent.parseDropIndexesValue (cognitive 28): MongoAgent.parseDropIndexesValue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7827ae0f49dc6e893bc95a5e7029147b4a09fe8ac65af0e4fe11bad0a5ee459"}},{"ruleId":"D2","level":"warning","message":{"text":"cassandraConfig.clusterConfig (cognitive 28): cassandraConfig.clusterConfig has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ad56972f05d88ee8c9db3155452e6668c34083d1d94f98627bfb50d7d52db9"}},{"ruleId":"D2","level":"warning","message":{"text":"etcdSession.readableKeyRanges (cognitive 28): etcdSession.readableKeyRanges has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dc679742c94154dad71f43f816fd386657b86c16155f709128ba7d67b57bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listIndexes (cognitive 28): server.listIndexes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"822b94959eeaaed5a747dff0ad00adcf68481dc3037e24d7d4245b9ab5db2adc"}},{"ruleId":"D2","level":"warning","message":{"text":"server.completionAssistantTables (cognitive 28): server.completionAssistantTables has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23c9186866da51e4a569571dc5fc31e62bbb2003eb54282ee76da93c0ebb7a0"}},{"ruleId":"D2","level":"warning","message":{"text":"server.queryRowsWithOracleValueRewriteIfNeeded (cognitive 28): server.queryRowsWithOracleValueRewriteIfNeeded has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 6 (nesting depth added 9). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5217}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ccb4123b9b16b07a8b49d5089a293d83fad75f30d548d21a7b44008a97a34f"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeRoutineScan.identify (cognitive 28): plDebugNativeRoutineScan.identify has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5, 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":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"66108aa12fe6a73e61122eef75f14f3ac5764bc9049dc2243269239d13737afb"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativePlan.boundInputs (cognitive 28): plDebugNativePlan.boundInputs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbf67df797175b5523709272d50a884e5a011985e3ac964e91fcf4c95d2c26a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.applyMessageProperties (cognitive 28): main.applyMessageProperties has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/message_properties.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4efbd88856e47e90b984d808aeb959898e91d144b00fa81c22d995399dfb5b"}},{"ruleId":"D2","level":"warning","message":{"text":"rocketMQAgent.viewMessage (cognitive 28): rocketMQAgent.viewMessage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dda26127cde23b8cc291861e792e4fbf626e483aa1b8e0a05c81044a3c161b"}},{"ruleId":"D2","level":"warning","message":{"text":"server.completionAssistantSearchTypeMembers (cognitive 28): server.completionAssistantSearchTypeMembers has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/type_members.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e206ca12e8c6e03ec899130483f59ffe1fa0716439bead9539a13a81d759662"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.scanSqlServerControlFlow (cognitive 28): sqlStatementRanges.scanSqlServerControlFlow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 7, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad34723132e9632994e4e35da2412e8cf53aa53af1a6011f1d9e5511629c40d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.advanceMysqlRoutineBlockCompleteness (cognitive 28): sqlStatementRanges.advanceMysqlRoutineBlockCompleteness has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed14f162e6f1256479701c8dea2b60ac90f1c69b68ba2bdcb324bf30a2b5735f"}},{"ruleId":"D2","level":"warning","message":{"text":"useAppUpdater.compareParsedUpdateVersions (cognitive 28): useAppUpdater.compareParsedUpdateVersions has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (10 pts), boolean chains 3, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef30becaf11ddafd8b7e3e4ab2f643ff7e8f277b8a68db7b11b83fcec796ac9e"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridCellDetail.useDataGridCellDetail (cognitive 28): useDataGridCellDetail.useDataGridCellDetail has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 8). None of this is in the body itself: all 28 points belong to 5 function literals inside it that branch (lines 38, 67, 30, \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":"apps/desktop/src/composables/useDataGridCellDetail.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d936eddf3e5909290e570dc9532c85bd6413ff08d01e36f9e376b4ff6dcae07d"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportCsv (cognitive 28): useDataGridExport.useDataGridExport.exportCsv has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 9, ternaries 1 (2 pts), error handling 1 (nesting depth added 5). None of this is in the body itself: all 28 points belong to 2 function literals inside it that branch (lines 1562, 1585). 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57f15931133ffa7c898aea3d35b7cefb693f12e59f998b1b6172f3101f73f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportQueuedMongoCollection (cognitive 28): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportQueuedMongoCollection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 7 (11 pts), boolean chains 4, error handling 1 (nesting depth added 5). Most of this is not in the body itself: 8 of the 28 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 837, 845, 886, \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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"0674e9c9bd7a81d3402e8090555b6279729d0f8b3fceff49a0cb2e040ee2310a"}},{"ruleId":"D2","level":"warning","message":{"text":"looseJsonFormat.formatLooseJsonText (cognitive 28): looseJsonFormat.formatLooseJsonText has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/looseJsonFormat.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcaffaf9476d371ce6010ec323e355270ce1ef7d5df260dd1662ab1d2498521"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridSelectionPersistence.restoreDataGridSelection (cognitive 28): dataGridSelectionPersistence.restoreDataGridSelection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 7 (10 pts), boolean chains 3, loops 1 (nesting depth added 7). Of this number, 24 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSelectionPersistence.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1ca29afe268fda412bd6ad0620c2b9b40cc64f96628598d3ce219e74e2635b"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineEntryLine.routineBodyCandidateLine (cognitive 28): oracleRoutineEntryLine.routineBodyCandidateLine has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/oracleRoutineEntryLine.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95293d6f7942d61ac64f2ddec7d7d5dd23d31fe29d338625b072a68ea8d249e"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorSqlDialect.createDbxCodeMirrorSqlDialect (cognitive 28): codemirrorSqlDialect.createDbxCodeMirrorSqlDialect has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 13 (14 pts), boolean chains 13, if/else 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorSqlDialect.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf94c6d10b72d0abe1a5088259cfec1ab772745bec98b979030a27f0b452a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorSqlBlockFolding.computeBlockFoldRanges (cognitive 28): codemirrorSqlBlockFolding.computeBlockFoldRanges has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorSqlBlockFolding.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0883c65451788bb05f51c9b0d27d5b8bed7cf14307a4a1b1a6410b5a6c5120"}},{"ruleId":"D2","level":"warning","message":{"text":"gridSnapshot.renderGridSnapshotHtml (cognitive 28): gridSnapshot.renderGridSnapshotHtml has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 21 (23 pts), boolean chains 5 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/gridSnapshot/gridSnapshot.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80abfa9a45f982652b4a518a07a8220b355644ecc6b3c6707a89563affa6a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCommandTable.firstRedisArgvUpper (cognitive 28): redisCommandTable.firstRedisArgvUpper has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 5, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandTable.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf614626fdd52041604d860e1b5d4a2c02c436fed035866af57d040e9ec26e49"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineDeploy.includeOraclePackageCompanion (cognitive 28): oracleRoutineDeploy.includeOraclePackageCompanion has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (9 pts), ternaries 5 (6 pts), loops 1 (nesting depth added 2). Of this number, 26 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d622e47a4885ce7c119c3e0ffc494f42125c95b78e9d1c6f4b898e6c1bf07a"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.findMatchingXmlTagClose (cognitive 28): sqlParameters.findMatchingXmlTagClose has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"590094c2df194d5e8bc2b806590bf2e085cf10d88a66383eaa950670626fc027"}},{"ruleId":"D2","level":"warning","message":{"text":"routineDefinitionSave.routineDefinitionKind (cognitive 28): routineDefinitionSave.routineDefinitionKind has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 9, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineDefinitionSave.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4342f9f720db7364b656478e4cae2aed1f2e862c5a08f416d36c1df288e5159"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadPagedSimpleTableChildren (cognitive 28): connectionStore.useConnectionStore.loadPagedSimpleTableChildren has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 12 (19 pts), boolean chains 5, if/else 3 (4 pts) (nesting depth added 8). Of this number, 21 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7a35f9eff9cfea387bcc4f53870cdf04322f3d4108ece92343368c8dc94027"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.buildSidebarTableSearchIndex (cognitive 28): connectionStore.useConnectionStore.buildSidebarTableSearchIndex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 7 (9 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4236}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fdac2d75c83195d4e294a79294ab560fd177432cc210970cf9f3a7afa80db0"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadTableGroups (cognitive 28): connectionStore.useConnectionStore.loadTableGroups has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7, ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8514}}}],"partialFingerprints":{"codehealthFindingId/v1":"186d8c32a7037185452bf7dc32caa176d436721dfa226a36dcac55de48a0346b"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.readDataGripImportFile (cognitive 28): connectionStore.useConnectionStore.readDataGripImportFile has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 pts), error handling 3 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11617}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaadf7bef4a6e96f309fb031619cad3bd543877eb0a9fb77298bb539133c82f0"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.skipAccordingToRules (cognitive 28): plDebugStore.usePlDebugStore.skipAccordingToRules has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a0b7ccd8189d568bcce1b26c06af3e41c95f7596da2554779fa151aaac4b2c"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.normalizeGroups (cognitive 28): queryStore.useQueryStore.normalizeGroups has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"23348bdb36170487cb08b68b6e2af9d37f10b0482cbf8cd4b5f1ba56be6252b1"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.loadDdlViewerTab (cognitive 28): queryStore.useQueryStore.loadDdlViewerTab has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 7, error handling 1 (2 pts), loops 1 (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3730}}}],"partialFingerprints":{"codehealthFindingId/v1":"f040d9c548211c23d0fc161e2910def88c396bebe08ec7a4f721011b3241b7fb"}},{"ruleId":"D2","level":"warning","message":{"text":"start (cognitive 28): start has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), error handling 3 (5 pts), boolean chains 3, ternaries 2 (nesting depth added 6). Most of this is not in the body itself: 8 of the 28 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 111, 157, 144, \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":"plugins/sdk/dev-host/sidecar.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec51c95825b0a5d8b63a879249eea20b13666fd896052db35054a7412f5cd0a7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::import_mongodb_file_core (cognitive 27): dbx_core::data::mongodb_import_export::import_mongodb_file_core has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa740c9fb9768b5b48ccbe0da776ab6201b95ae9a1541c619362acbae3ae43a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::generate_upsert_typed_for_transfer (cognitive 27): dbx_core::data::transfer::generate_upsert_typed_for_transfer has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5823}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c2b7fc413955225d9229c420d99a327f1870df8ee453bf9b21e89ac983d330"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::execute_on_pool_with_options (cognitive 27): dbx_core::data::transfer::execute_on_pool_with_options has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":9035}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6c2e8abd110340046c6700e6d650a78c27b90810425101e004852960b3629f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::execute_statements_inner (cognitive 27): dbx_core::query::execute_statements_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 4 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f63e8706e1670d89ded74e596a369537e22754474c203f1e27ecb2217ccb1a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::transfer::packages::prepare_transfer_packages (cognitive 27): dbx_core::schema::oracle_routines::transfer::packages::prepare_transfer_packages has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (7 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55ede63f33d863e112dfcd4534f8431636e46b5cbb4f54f6388fe05bfd5b2b7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_evolution::type_state (cognitive 27): dbx_core::schema::oracle_type_evolution::type_state has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_evolution.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"593ef6d86eaca2f7c4da6dfac44e7ebe99526196e09049ca8f41bfd6aab0046e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_elasticsearch::adapt_elasticsearch_sql_query (cognitive 27): dbx_driver_elasticsearch::adapt_elasticsearch_sql_query has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2892}}}],"partialFingerprints":{"codehealthFindingId/v1":"190e880a419fc331f3c0c6ea7f9de38d1a98f62574dca0b862a0b91b3ebac260"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql_compatible::indexes_from_create_table_ddl (cognitive 27): dbx_driver_mysql::mysql_compatible::indexes_from_create_table_ddl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql_compatible.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f548a857484c46837a997d434cacdbf328e9fefb2a04bee6ba653308b468fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::build_custom_type_ddl (cognitive 27): dbx_driver_postgres::postgres::build_custom_type_ddl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":7984}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd2253066331e1083f9346e6758152c7ddbbfc5009f42a032ae10ea28421733"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_support::ssh_config::apply_host_entry (cognitive 27): dbx_driver_support::ssh_config::apply_host_entry has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/ssh_config.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d1a750f4a8e7f7e4b9f08aed4c277a5309266b56c9befe68d769cbd5e1dbf4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::salesforce_driver::apply_fields_function_limit (cognitive 27): dbx_drivers::db::salesforce_driver::apply_fields_function_limit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 7, loops 2 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/salesforce_driver.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79b323332ebe3eda71c56c055d88231906b61a197b72d5268179e062124c996"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::remove_connection (cognitive 27): DbxMcpServer::remove_connection has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 5 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2675310b7ead3b16d8bfb547303802ebdfba9b83f6f0859eaaca6f47736d0892"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_mcp::transaction::handle_command (cognitive 27): dbx_mcp::transaction::handle_command has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 7 (10 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/transaction.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5af5e7417b937f1cfaab14f9eb79e9bff786183bc0fef25b6f4cefc20be5ae"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_runtime::plugins::manifest::validate_localizations (cognitive 27): dbx_plugin_runtime::plugins::manifest::validate_localizations has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (9 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0606f7e6686befb69b850c4ae800944d586e97a14696ee1f2dab085669f1e4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::oracle_type_migration_sql::oceanbase_scalar_insert_columns (cognitive 27): dbx_sql_core::oracle_type_migration_sql::oceanbase_scalar_insert_columns has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"06991dc8bc38fde8bea4c0232120375b18217a9f9d587a5f0112f7bbc63d9106"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_analysis::normalize_sqlserver_alter_table_add_tokens (cognitive 27): dbx_sql_core::sql_analysis::normalize_sqlserver_alter_table_add_tokens has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc39dffab1dd353564592a74c69b55fdf7ba734701710e693c4d858df633472"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::sqlserver_default_literal_for_schema (cognitive 27): dbx_sql_schema::schema_diff::sqlserver_default_literal_for_schema has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 8 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5529}}}],"partialFingerprints":{"codehealthFindingId/v1":"c212c6b693e3cd59c88b0e62958649f0c0c46a3c1444ba27cfdcb03c853fc0b8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_format::normalize_generation_expression (cognitive 27): dbx_sql_schema::table_structure_sql::column_format::normalize_generation_expression has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7323abbc81b6f1841e17547988c4a96d301f2581fc68bb600ccd514b1be1c452"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::routes::connection::plan_connection_config_sync (cognitive 27): dbx_web::routes::connection::plan_connection_config_sync has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 2, match/switch 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb467fdc31611a399cdeb6f59490af44dcd2ed5dcac36580f214101ab8986b3"}},{"ruleId":"D2","level":"warning","message":{"text":"PoolEntry.borrow (cognitive 27): PoolEntry.borrow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (6 pts), boolean chains 2, error handling 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":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"157a9ce37a857477510473e3ea1195aa5a4cb8e16e9cb11218615c92cacdc152"}},{"ruleId":"D2","level":"warning","message":{"text":"2.read (cognitive 27): 2.read has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fddd75d3c6c155aa86c7e4292083b3c215695b632b5ca296ff876108e339158"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompositeOutput.\u003Cinit\u003E (cognitive 27): PlDebugCompositeOutput.\u003Cinit\u003E has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeOutput.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"930ca56f2f82659e1e10b3f83f3aed74a90a2a457417f924bc5d77c8a3db16e0"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugManager.mutate (cognitive 27): PlDebugManager.mutate has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 6 (9 pts), boolean chains 6, 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"42987cb05d773ccf38f6ed2926f465df45f93be1b17d4324c181021474db2b24"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.constructorLobProfile (cognitive 27): PlDebugTarget.constructorLobProfile has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcaaa6b15464a85bdedea278fb0d44421e272d5406fe1a49f2052f232c55ade"}},{"ruleId":"D2","level":"warning","message":{"text":"server.executeStatements (cognitive 27): server.executeStatements has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ef978ea78b6f89a423d8771297fbcabc2b4fa7691eb4f65fb5c9c06f328dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"server.executeStatements (cognitive 27): server.executeStatements has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/query.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"531c8e1ce7f5a740e1a8bdd81a66f588d0e3fe3523d347aac4adec4854a059b4"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listForeignKeysFromCatalog (cognitive 27): server.listForeignKeysFromCatalog has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec520c53285e3b8ed3e012fac56e1f0a714f9376ec355045f030778cdd73f1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleLegacyCharset.validateValue (cognitive 27): oracleLegacyCharset.validateValue has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/legacy_charset.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7c4798fc64435a82e832f092e11bf37ceb637382c5a800a5311708c99e0df3"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeServer.dispatch (cognitive 27): runtimeServer.dispatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cca5fe29d547a8dd0f65a3e3b0f25e7c1a781842757dc2d59925c590899348"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.pendingCleanupContinuation (cognitive 27): plDebugNativeEntry.pendingCleanupContinuation has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 12, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_drain.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"54af7c52d53185d8730f6f4d6f5a4db86c24ae26c3899f9c7af756060861fcf0"}},{"ruleId":"D2","level":"warning","message":{"text":"rocketMQAgent.listTopics (cognitive 27): rocketMQAgent.listTopics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/topics.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9683de18f8a17ac3f6f557ad4cffdc473f9898e9abea9da58563ad5694c51bfc"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseXuguObjectTypeMethod (cognitive 27): main.parseXuguObjectTypeMethod has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/type_members.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"60339e2c6a39f6d1a35713d8c0345cf2c7622bc8b41332430d0d043072ed99e7"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.elasticsearchRequestLineCandidates (cognitive 27): sqlStatementRanges.elasticsearchRequestLineCandidates has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"358f7cbcb9cce7bf2272a19254be8f70cdfbc193ed8e743f33fe68d140d1aec9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderNotice (cognitive 27): index.html.renderNotice has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 12 (17 pts), if/else 5, boolean chains 3, loops 1 (2 pts) (nesting depth added 6). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/index.html"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"606eb56a6d3df3f55b8583f18bf46cd876ee30be29d4f99bb6a8380467f8d583"}},{"ruleId":"D2","level":"warning","message":{"text":"queryEditorSqlExtensions.configureQueryEditorSqlExtensions.createViewDecorations.currentStatementFrameExtension (cognitive 27): queryEditorSqlExtensions.configureQueryEditorSqlExtensions.createViewDecorations.currentStatementFrameExtension has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5776dd57f28ac2d7821e01ec8d96dde50d276910052562bf5d194eee8dd70d8"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlFilePreviewLabel.buildDisplayFileNames (cognitive 27): sqlFilePreviewLabel.buildDisplayFileNames has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (9 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 16). Of this number, 23 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/sqlFilePreviewLabel.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db132015d462e20668426771b50426301db55e259f071404cbf973d51531aae"}},{"ruleId":"D2","level":"warning","message":{"text":"useAppUpdater.useAppUpdater.initialize (cognitive 27): useAppUpdater.useAppUpdater.initialize has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43f36282ab202f6b110845a90077aeb861698d0e261578853f2237d58c6fab0"}},{"ruleId":"D2","level":"warning","message":{"text":"largeValueSnapshot.readLargeValueSnapshot (cognitive 27): largeValueSnapshot.readLargeValueSnapshot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 8, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/largeValueSnapshot.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d891197d210fdc62443f97f9c8458a3c8d79095ec80db660a58760a6c1f252"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.prepareOracleForeignKeyCreatePlan (cognitive 27): oracleForeignKeys.prepareOracleForeignKeyCreatePlan has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 9, ternaries 3 (5 pts), loops 1 (nesting depth added 6). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0690da6cdec96d8f2a695f8535526dd262ab0a747f4d5c2f82820051f36c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleIndexes.loadedColumnType (cognitive 27): oracleIndexes.loadedColumnType has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, ternaries 3 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2cbef510e5954c449d835f35afe43d4e9f76b9cdcb9686819b6753e3b85794"}},{"ruleId":"D2","level":"warning","message":{"text":"productionSafety.referencedDatabases (cognitive 27): productionSafety.referencedDatabases has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (7 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b7b5e622bbf2f23e2757f2839cd62828a5f2eecccb640b08fd37d6550f1fca"}},{"ruleId":"D2","level":"warning","message":{"text":"editorThemes.resolveEditorTheme (cognitive 27): editorThemes.resolveEditorTheme has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (24 pts), match/switch 1 (2 pts), if/else 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/editorThemes.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6ea46e692aea5ab4eaffaba3cfab73c80c7f371d2694e06e2e03ea3b082e8a"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseExport.runDatabaseExportUntilTerminal (cognitive 27): databaseExport.runDatabaseExportUntilTerminal has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, ternaries 1 (4 pts), error handling 1 (2 pts) (nesting depth added 12). Of this number, 20 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExport.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a8f1529c9239ac41d1e76c556e30781f29c1389ff0e713e9903965dcd7164f"}},{"ruleId":"D2","level":"warning","message":{"text":"redisSyntaxDiagnostics.buildRedisSyntaxDiagnostics (cognitive 27): redisSyntaxDiagnostics.buildRedisSyntaxDiagnostics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 3 (7 pts), ternaries 3, boolean chains 2 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisSyntaxDiagnostics.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"418bd453cf6384325c3495981debd569371b7c7463a3b618ad27169b7825b7c5"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineDeploy.synchronizeOracleRoutineSelection (cognitive 27): oracleRoutineDeploy.synchronizeOracleRoutineSelection has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, ternaries 2 (5 pts), loops 3 (4 pts) (nesting depth added 9). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6504d0ffd1727ac1d29574cadb3582f86feac6fe0ebef1d1888d1564365133"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarUserAdminVisibility.sidebarUserAdminVisibility::filterNodes (cognitive 27): sidebarUserAdminVisibility.sidebarUserAdminVisibility::filterNodes has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (16 pts), boolean chains 5, if/else 3 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarUserAdminVisibility.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f7421868ff36eb65c48ac81831b73d33c67c313f6d920c27f058ce246a2d04"}},{"ruleId":"D2","level":"warning","message":{"text":"cypherFormatter.compressCypherText (cognitive 27): cypherFormatter.compressCypherText has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (7 pts), boolean chains 6, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dea6fc24e721060b9facee5ccd7728128418af7966b63e8f84a8c4b471e089c"}},{"ruleId":"D2","level":"warning","message":{"text":"primitives.renderCompactCaseExpression (cognitive 27): primitives.renderCompactCaseExpression has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 1, loops 1 (nesting depth added 13). Of this number, 26 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":"apps/desktop/src/lib/sql/layout/primitives.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"608b5d14466909776a3643ad373b17816303154fc7a1dd445d59bd5fe248da9f"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlRisk.classifySetTokens (cognitive 27): sqlRisk.classifySetTokens has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08d47767b6144859ed1b317cb93307770025d73501b973fbafafe72fea9b28b"}},{"ruleId":"D2","level":"warning","message":{"text":"tableColumnDefinitionPaste.validateDefaultExpression::operand (cognitive 27): tableColumnDefinitionPaste.validateDefaultExpression::operand has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, loops 1 (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. This shape REPEATS in the file: one other method here (tableColumnDefinitionPaste.validateDefaultExpression::expression) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5ce99d4de97d2d116fc2e43764916cfcdcf9b9a0b1d4686890bd06bd57d0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"tableVGroup.reorderTableVGroupEntry (cognitive 27): tableVGroup.reorderTableVGroupEntry has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 9). Most of this is not in the body itself: 9 of the 27 points are its own statements and the rest belongs to 3 function items inside it that branch (insertNear, removeEntry, entryId). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6605155503ce2c41c9d01d5bfd5c10a09692e536dfdd385947e7f83bbd628758"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadPagedObjectGroupChildren (cognitive 27): connectionStore.useConnectionStore.loadPagedObjectGroupChildren has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 15 (20 pts), boolean chains 6, if/else 1 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"931acd266c59189a085f8fbe4de15af599f7cf7a04079639ba2c5ef575322f81"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.start (cognitive 27): plDebugStore.usePlDebugStore.start has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 11, error handling 2 (nesting depth added 4). Most of this is not in the body itself: 12 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 947). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bbb6861e20b216f293f92e562d636b4e3cc7a6afd1c683c1176375b1f733db"}},{"ruleId":"D2","level":"warning","message":{"text":"NacosOpenApiAdmin::list_instances (cognitive 26): NacosOpenApiAdmin::list_instances has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 4 (9 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":3123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fb231e75298243506b95ae7dfb280c25b2e873ef7ae5b04d0d1bf2af66cb4e"}},{"ruleId":"D2","level":"warning","message":{"text":"McpAccessPolicy::from_v1 (cognitive 26): McpAccessPolicy::from_v1 has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/mcp_access.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8638338a3d635741c209b2b401d19ddcf1f7d3e8c92f251c7d3bffb144aea2f"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlServerBatchSplitter::push_line (cognitive 26): SqlServerBatchSplitter::push_line has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6528eb168e4cc53ff42dde1e76652f219472708101ecebf171d8174da2165d48"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::dameng_dump::run_dameng_dump_task (cognitive 26): dbx_core::data::dameng_dump::run_dameng_dump_task has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/dameng_dump.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a417f7cea6221d7fd046418d3aa209755ee92155bcdd19ea102ac20d69717f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::docs::collector::collect_snapshot_with_concurrency (cognitive 26): dbx_core::data::docs::collector::collect_snapshot_with_concurrency has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 5 (8 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/docs/collector.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b15c94bcea8e824ff44d87f9691b8ad6b996683aef03440da08915ab24e662"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::script_generator::extract_object_identifier (cognitive 26): dbx_core::data::script_generator::extract_object_identifier has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"864928a1088942af42874033cc133d3718e8aa80c85c04784d821a981ea5c628"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::parse_json_bytes_with_options (cognitive 26): dbx_core::data::table_import::parse_json_bytes_with_options has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"33737b785abc3feaa871b91b5e9e21fc092f5da02f20f8eb048feca7bd3c30ca"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::parse_xlsx_range (cognitive 26): dbx_core::data::table_import::parse_xlsx_range has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":4631}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1da7b5bade9498d54b8e477e4dc1e1ef78a8a4840c5a8878821f86cfebfb72"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_cross_family_schema_objects (cognitive 26): dbx_core::data::transfer::transfer_cross_family_schema_objects has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 4 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10657}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ebc06a52805d413f5ada3eec90494416da8325629346ac14df73c9c4f12337"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::sort_table_names_by_dependencies (cognitive 26): dbx_core::data::transfer::sort_table_names_by_dependencies has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":11861}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75fdac969b4053d15cac70c47a4163a2b915aaa29c6157d3f28f6d043a3f90a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::execute_mysql_batch_statements (cognitive 26): dbx_core::query::execute_mysql_batch_statements has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":4588}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad1c7a41bdc9df290435b72fe41629b145eb8a074ee9813132be34f8004a604"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::sqlserver_manual_transaction::finish (cognitive 26): dbx_core::query::sqlserver_manual_transaction::finish has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/sqlserver_manual_transaction.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e0f26c7cf6e0b30a236260d53fbdf48c6b424fddc779a78e1c47f4c64bf5cd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::dameng::verify_step (cognitive 26): dbx_core::schema::native_jobs::operations::dameng::verify_step has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 12, if/else 10, match/switch 3 (4 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"064ccf1fc573879dacfc8baed6ebc0637057f20c37c6e7cb05ef2e9a75f49676"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::scheduler::verify_initial (cognitive 26): dbx_core::schema::native_jobs::operations::scheduler::verify_initial has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"10576b69deaeda1b48274e710a5065262422a72eeabf5f6c7fd002533900280a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::transfer::packages::prepare_pending_tables (cognitive 26): dbx_core::schema::oracle_routines::transfer::packages::prepare_pending_tables has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b99c2059422b0c5ef382f960aad9efa253fe7a02ca7aa20bab3fe27b3949548"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_service::is_macho_binary_for_cpu (cognitive 26): dbx_driver_agent::agent_service::is_macho_binary_for_cpu has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":4454}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ce6aceaf836bb1b15a648a318ab215ce701e24df3483caf4032c7f07dd070e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::ssl_fallback_url (cognitive 26): dbx_driver_mysql::mysql::ssl_fallback_url has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee486f110df7aa66998c4d39939899a508682216d6b1638e4951e21056d4e15"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::list_sequences (cognitive 26): dbx_driver_postgres::postgres::list_sequences has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (6 pts), match/switch 2 (3 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":10904}}}],"partialFingerprints":{"codehealthFindingId/v1":"003632add8c4ef46d9acccbce663ccde1488087bab637b0fcfedb22ef4eb5608"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::collect_ordered_result_sets_limited (cognitive 26): dbx_driver_sqlserver::sqlserver::collect_ordered_result_sets_limited has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ba5d77671655eeedd5c1e4bef518497f893c38d226c25e9f2b772031a46591"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::stream_first_result_set (cognitive 26): dbx_driver_sqlserver::sqlserver::stream_first_result_set has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 4 (8 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2affc726ceedb38a68c09d2735d8cd44430efb6bf8ecd0d68cbb016f808832b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::first_sql_tokens (cognitive 26): dbx_driver_sqlserver::sqlserver::first_sql_tokens has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (11 pts), boolean chains 8, if/else 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":4607}}}],"partialFingerprints":{"codehealthFindingId/v1":"9528351289ef0c757c161c125796f12b8e47314fa76180b6e8df99aed1b34658"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::dynamodb_driver::parse_dynamodb_statement (cognitive 26): dbx_drivers::db::dynamodb_driver::parse_dynamodb_statement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, match/switch 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a392bf827ef8b5ef3d7d40f0442f0bdf9fe45f4d806e2d64f9dcb1c27252955"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::visit_expr (cognitive 26): Analyzer::visit_expr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85045956241e541991b7d933fe5af0c2f50a45c39a359f5be662f57345b4fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::oracle_view_rename::hint_bindings (cognitive 26): dbx_sql_core::oracle_view_rename::hint_bindings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (12 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eee23e6ffa1c2b7bc66e94aa536622b26051f3f4613888a8ec081bafbc924be"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::query_execution_sql::tokenize_set_statement (cognitive 26): dbx_sql_core::query_execution_sql::tokenize_set_statement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0e878c828ddf62b23fcc95769f3cd482f31733c8d9375c96c8d889f4a974d5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::leading_mysql_executable_comment_start (cognitive 26): dbx_sql_core::sql::leading_mysql_executable_comment_start has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (9 pts), boolean chains 8 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3591}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2aa31b2df436c87a854566f3406a0d7d4650289095d2d3155ec6893647926c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_extractors::copy_formats::write_php (cognitive 26): dbx_sql_data::data_grid_extractors::copy_formats::write_php has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/copy_formats.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"59243e27d1b72e16ffa97e3dd2a3300fefc462f917986076b44c94b1d589fb54"}},{"ruleId":"D2","level":"warning","message":{"text":"EwkbWktDecoder.geometryToWkt (cognitive 26): EwkbWktDecoder.geometryToWkt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, loops 1 (2 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa37daea853a9214e4a2a0bdbbbeb593c971fc52cbe25f8aa8359fe01b262b92"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeLegacyJobSession.prepare (cognitive 26): NativeLegacyJobSession.prepare has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 3 (6 pts), boolean chains 3, error handling 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":"agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c70bb1dba82cd4bdf8eaddafbd09dc02b8f412e7b6a677f4d687f58dd31baf8"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.registerDrivers (cognitive 26): DbxJdbcPlugin.registerDrivers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc64abb8b53edbfa75e307512a4a41f9d3702d60c4b5b07a30f2a8e0bc25150"}},{"ruleId":"D2","level":"warning","message":{"text":"DamengAgent.queryConstrainedObjectsWithoutValidity (cognitive 26): DamengAgent.queryConstrainedObjectsWithoutValidity has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), error handling 5 (7 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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2af3ce080be1e7cf1ed4ad66413ef7755c3b1c893044ea04c2824d0db8e929"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.collectPeekedMessagesNewestFirst (cognitive 26): KafkaAgent.collectPeekedMessagesNewestFirst has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"295e67a8f7266ffc146b0bd1c2f47d81bee01f3fd3b0068570c36ab24351bc23"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugBreakpointRegistry.set (cognitive 26): PlDebugBreakpointRegistry.set has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 2, ternaries 2, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugBreakpointRegistry.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5167d4ce212ee934ab2cf473bb49a73be3b80982b0fb2b2ce838fc1193ee8c"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCondition.evaluate (cognitive 26): PlDebugCondition.evaluate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCondition.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1659ea57532a596ec2fce074b8f354895154c321da7269eb8e2121476773d386"}},{"ruleId":"D2","level":"warning","message":{"text":"main.withTerminalKeyword (cognitive 26): main.withTerminalKeyword has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d51db9b99fb643ed88671a168cab687e71dafae9f50ffd9b3e2e9ec595a820"}},{"ruleId":"D2","level":"warning","message":{"text":"main.rewriteNestedOracleSelects (cognitive 26): main.rewriteNestedOracleSelects has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5461}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dec43fb04c1350fd49166e8b5b8cdcd4b97513c0dc50835113afd1ad67e6269"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeInputTransport (cognitive 26): main.plDebugNativeInputTransport has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_transport_preflight.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3342b0f82649560ba86144052b4741c5dad58d02b5bdc04ec16566bfe2b54cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugValidateTypedUnicode (cognitive 26): main.plDebugValidateTypedUnicode has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, loops 1 (nesting depth added 9). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_unicode.go"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5070a60d33f8c739eec31c90de49da04f902ed3181b1f6fe45e24d35a46580"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getTableDDLWithIdentity (cognitive 26): server.getTableDDLWithIdentity has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (24 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3886}}}],"partialFingerprints":{"codehealthFindingId/v1":"d914069c1466db2711c8ccc30a67652e126bbaed72275279c022ec418f17b0af"}},{"ruleId":"D2","level":"warning","message":{"text":"main.paginateManagementArray (cognitive 26): main.paginateManagementArray has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 1, loops 1 (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 6 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":"agents/drivers/rabbitmq/management.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da18eeed851149a278937402b007f162ae62aab3e8c36451a8f1305ef49a551"}},{"ruleId":"D2","level":"warning","message":{"text":"proxyMessagingClient.Send (cognitive 26): proxyMessagingClient.Send has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/proxy.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35bd514fd61420a26ac7bc1bdc7dde778ebae17d4bf4e5a8b19436a9e07c9df"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listObjects (cognitive 26): server.listObjects has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a43486c41d67cf924bcb1d6f216da898e72f8fe168e375eb66f151a68a02365"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.sapHanaScriptBlockIsComplete (cognitive 26): sqlStatementRanges.sapHanaScriptBlockIsComplete has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29c3e8aa6c225bf0018ba8cfe36c58577cb5d46ae66bda6939dcfe0c2fb942c"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataCompareSession.runDataCompareSession (cognitive 26): useDataCompareSession.runDataCompareSession has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), error handling 2 (3 pts), ternaries 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataCompareSession.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60807fd6f1fb6f49150ea1fc1c48cb591c84e46a39e05266e68e3e1ee643b71"}},{"ruleId":"D2","level":"warning","message":{"text":"ai.formatSchema (cognitive 26): ai.formatSchema has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 5 (7 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 11). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to one function literal inside it that branches (line 804). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"d718b2118ff7142a7d64e03fd4ce7572e6acd121f0ba497eb54efaf5c798891a"}},{"ruleId":"D2","level":"warning","message":{"text":"documentStoreProvider.translateFieldFilterToElasticsearchQuery (cognitive 26): documentStoreProvider.translateFieldFilterToElasticsearchQuery has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5514d51f6af6e9aa3ed66858143553c3e4d1cbaa3d98d6d5a0160be042251a3"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeJobAdmin.buildNativeJobDefinitionCreate (cognitive 26): nativeJobAdmin.buildNativeJobDefinitionCreate has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 11 (14 pts), boolean chains 6, if/else 6 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 12 belong to 7 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ff75fd34b46b15518e7e5448dece84896a37857a9e49f158a16db6f573b909"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeJobs.buildNativeJobEdit (cognitive 26): nativeJobs.buildNativeJobEdit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bd574d74110eb9e8aebe636f69d0ea20b5bbe6d7b88c42f63aff8fa5b92d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleConstraints.validateChange (cognitive 26): oracleConstraints.validateChange has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 9 (nesting depth added 8). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"5990660a439274ae64b1eca976671113a228892f1981982df32a64528ed975b1"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleIndexes.prepareOracleIndexPlan (cognitive 26): oracleIndexes.prepareOracleIndexPlan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef100ccfdbc50b6882b5f2d3436ae2a2bceec89be7976e1c77bb044f8434a61"}},{"ruleId":"D2","level":"warning","message":{"text":"elk-layout.extractHierarchicalLayoutResult (cognitive 26): elk-layout.extractHierarchicalLayoutResult has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (9 pts), loops 4 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/elk-layout.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"142fa7c594b48cb7ca7583b2d53445aafac3ce9d7a1cf0b3d462eed0a7cddf37"}},{"ruleId":"D2","level":"warning","message":{"text":"ltr-auto-layout.orderTablesByConnectivity (cognitive 26): ltr-auto-layout.orderTablesByConnectivity has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 7 (8 pts), boolean chains 2 (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 11 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":"apps/desktop/src/lib/diagram/ltr-auto-layout.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c69bf433a32849f3e5dc954ba62b489b235d79a973c6a76db2c7ad1f8b5db9"}},{"ruleId":"D2","level":"warning","message":{"text":"soqlCompletion.fieldItems (cognitive 26): soqlCompletion.fieldItems has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (6 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/soql/soqlCompletion.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d5daff672e70e0c53ae8e83a55d5bc072d3596c1744d1cc4c95d7d09f09be9"}},{"ruleId":"D2","level":"warning","message":{"text":"executableStatementRangeCache.executableStartAfterLeadingComments (cognitive 26): executableStatementRangeCache.executableStartAfterLeadingComments has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/executableStatementRangeCache.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc56082140944a3f309097e43ceecd041215a6d3ac81c7843829aef32b8520d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlAnalysis.analyzeEditableQueryEditability (cognitive 26): sqlAnalysis.analyzeEditableQueryEditability has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, boolean chains 7, ternaries 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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4d7904a3bd8b77ca0dfa6935f055c53a12a8884dd7328d6939af94879340e3"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.findMatchingParen (cognitive 26): sqlCompletion.findMatchingParen has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4527}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dc66e4c47e34a87c497f94662f9597f7980a9e58d6e5619ebf6cede0d388f6"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildJoinConditionItemsForPair (cognitive 26): sqlCompletion.buildJoinConditionItemsForPair has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 4, ternaries 3 (4 pts) (nesting depth added 5). Of this number, 21 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6518}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cf065dca943469adeb7bc012ef9e27eba75608505288967fd0c39346062579"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.extractSqlParameterDescriptors (cognitive 26): sqlParameters.extractSqlParameterDescriptors has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 13). Of this number, 20 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4fd3c52403bf36149076bcb1bf92949f3b8e18c48934392fa78ca1581f26a4"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.decodeMyBatisXmlComparisonEntities (cognitive 26): sqlParameters.decodeMyBatisXmlComparisonEntities has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac4948666f662c048eb8783117dbd48552758603f5e5b4e4f48a558e64157d1"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectComplexTypeFieldSeparators (cognitive 26): sqlParameters.collectComplexTypeFieldSeparators has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f7cf2233b4c3462ec9fe42742cb9176a1067cbf92afbbe84f130aa7d321cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlFileTreeFilter.filterAndSortSqlFileEntries::filterEntries (cognitive 26): sqlFileTreeFilter.filterAndSortSqlFileEntries::filterEntries has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFileTreeFilter.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad23d7011aa45f6857bbc65513b15f9a4a106294bc0c6bdcbfb4d920bfca274"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlServerHostPort.parseSqlServerHostPort (cognitive 26): sqlServerHostPort.parseSqlServerHostPort has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sqlserver/sqlServerHostPort.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b5ecd4f6be6d563b60302dd7df3a59c84f956bc5a4c9b8d6c0f113c6862bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTableRename.verifyFinalSnapshots (cognitive 26): oracleTableRename.verifyFinalSnapshots has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 6 (9 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"a301117eac92096b863df931eb140620c63ef2427dafa2400cdfbadfe3ee9126"}},{"ruleId":"D2","level":"warning","message":{"text":"routineParameters.stripXuguSqlComments (cognitive 26): routineParameters.stripXuguSqlComments has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0b727f52a4dd9ba39a091cfee99e2c8c57e20c438b540dc04e136f0c1a2b92"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.setChildren (cognitive 26): connectionStore.useConnectionStore.setChildren has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"407774074957880f0cff54e0d2d67f396753c735bee3ac566e1b13f87b5d91dd"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.setBreakpointEnabled (cognitive 26): plDebugStore.usePlDebugStore.setBreakpointEnabled has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (7 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 9). Of this number, 25 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"143eb59f4a1c9364eeddfed37fcf7af4f812c5fef2976d93c72c4876e5a33032"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore (cognitive 26): queryStore.useQueryStore has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6, boolean chains 4 (nesting depth added 6). None of this is in the body itself: all 26 points belong to 11 function literals inside it that branch (lines 4882, 1237, 1256, \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc61d093d0ce5c929d507c95660b79c1b0fbcef4946a56fe4def89ccf9cd51d9"}},{"ruleId":"D2","level":"warning","message":{"text":"tableCopyTaskStore.useTableCopyTaskStore.syncBackgroundTask (cognitive 26): tableCopyTaskStore.useTableCopyTaskStore.syncBackgroundTask has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 9 (19 pts), boolean chains 4, if/else 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/tableCopyTaskStore.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"61da9fc71e68135e7ec873db0f046ca932be0a50cb65e52d1df305830bf0952c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai_claude_code_cli::parse_claude_code_models (cognitive 25): dbx_ai_provider::ai_claude_code_cli::parse_claude_code_models has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1210df2f39a34158bf7ab88cc68267aaf2b312fd9b76a53598effddf2b223990"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::cleanup_migration_backups (cognitive 25): Storage::cleanup_migration_backups has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4db0e0344afcbe447c0cbc47f0ae93713040151e84c294f297f01be8ee60b7"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupService::serve (cognitive 25): BackupService::serve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (9 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/engine.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c12e80762e784b312aa75b73a7f0de4e2f50d8fd78822dfd1fbbad9036609a2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::directory::collect (cognitive 25): dbx_core::data::mongodb_dump::directory::collect has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/directory.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"adde5ddfb092e0f8172725fa66e044bdfe852dc215fe013441a4f3cf8664b8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::sql_import_expr_value (cognitive 25): dbx_core::data::table_import::sql_import_expr_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 4 (8 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2179113a8ebb15ee9824e47a3cf4b4dff55c901a0b04173492bf8df7ac20eb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::extract_server_large_value_markers_with_charset (cognitive 25): dbx_core::query::extract_server_large_value_markers_with_charset has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1626968bb2009cc1eedcb438c7c19376d2dd287088a1cba9572afcf0ca66065"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::execute_multi_sqlserver (cognitive 25): dbx_core::query::execute_multi_sqlserver has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4dda47f4b62192e8008e18bc7937f995bf31ed99b6edf90c7477b9ac043232"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::inspection::inspect_on_channel (cognitive 25): dbx_core::query::pl_debug::inspection::inspect_on_channel has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/inspection.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"382fa588604600f4df17a54b47705c8b6ad80c7c2e85c324603ab4501fad4f89"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::details::parse_argument_layout (cognitive 25): dbx_core::schema::native_jobs::details::parse_argument_layout has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/details.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0d53baabd076fd3b48f354aba7cb1d1cdd5b6227c002937bd8a486b4ef7f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::readback::readback (cognitive 25): dbx_core::schema::oracle_routines::readback::readback has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 8, match/switch 2 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/readback.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db4e81d09b8f7a0537f50d4b74a6c584a37533b436933d681fd51cfce1c1295"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_management::direct_privileges (cognitive 25): dbx_core::schema::oracle_type_management::direct_privileges has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_management.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"858ff4bb7f46026622698389eb907551d023b996fb5d46ed9042f7e88c26332f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_service::collect_offline_entries (cognitive 25): dbx_driver_agent::agent_service::collect_offline_entries has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":3441}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c97d30ba8ac6ed8b7469122e98afb02138fd00883f646f581ac9da9de09bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::backend_error::next_sensitive_assignment (cognitive 25): dbx_driver_agent::backend_error::next_sensitive_assignment has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/backend_error.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"141d286c8d0a835aa937788526c479a67b41f0cec8e9472981617535a31b9542"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_elasticsearch::normalize_elasticsearch_rest_path (cognitive 25): dbx_driver_elasticsearch::normalize_elasticsearch_rest_path has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a5a519545f2facabc42336bfb2acac33abd5ba36c10d2363d1fa870e01bf68"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::parse_mysql_enum_values (cognitive 25): dbx_driver_mysql::mysql::parse_mysql_enum_values has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 4 (7 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5482}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99f120aacb63cc55b29e71ff65fd8be6c17727ddc626ed0befd1f8255140363"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::skip_sql_whitespace_and_comments (cognitive 25): dbx_driver_mysql::mysql::skip_sql_whitespace_and_comments has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (12 pts), boolean chains 7, if/else 3 (6 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7900}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d36a46c9accc03e73b318d8031b9151cc2dec3fddef2246dc0caa7148fa2a0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::get_slowlog (cognitive 25): dbx_driver_redis::get_slowlog has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (6 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f77ac71943624976c2a0d2df2c9465dc2706a0787bd63dce3fc6dede5bf85d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::sqlserver_completion_assistant_sql (cognitive 25): dbx_driver_sqlserver::sqlserver::sqlserver_completion_assistant_sql has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4fbed4614a6691acf27a3c38b1f39b6bccd7c904862a699ddbd1a4007bd5f8"}},{"ruleId":"D2","level":"warning","message":{"text":"OraclePlSqlBlockWalk::step (cognitive 25): OraclePlSqlBlockWalk::step has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a44082f8d97e444ae5b3cf9cf8f681bc9367e86efb11828f64dd3200554a11"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::find_sqlserver_statement_at_cursor (cognitive 25): dbx_sql_core::sql::find_sqlserver_statement_at_cursor has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"d471c41085fccbe485f3efa83e9d405f0b3ee77555f8f1a5263f1b43e79e3434"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_editability::analyze_editable_query_editability (cognitive 25): dbx_sql_core::sql_editability::analyze_editable_query_editability has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"298fe3d224bb4d4a6172a065fe4153b634ccc667b8a8a2c7728b8c2edd93c43f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_tdengine_sql::build_tdengine_data_grid_save_statements (cognitive 25): dbx_sql_data::data_grid_tdengine_sql::build_tdengine_data_grid_save_statements has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_tdengine_sql.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6479aa32760e3828e96797fa6cbbe36bfaa3da9cac53aa9a67ebef0ba1f37ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::sql_server_count_sql (cognitive 25): dbx_sql_data::query_result_sql::sql_server_count_sql has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, match/switch 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e51183ae2676c382d70d7406e6dbf85633c4b4bcb656b5d8304e5ccde03ed14"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::db_admin_sql::build_duplicate_table_structure_sql (cognitive 25): dbx_sql_schema::db_admin_sql::build_duplicate_table_structure_sql has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 1 (2 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/db_admin_sql.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"15be7c39f4e6ecbe6170b12236fbe2a9b925d907be3e6d9c93cfdbf5439ccb30"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_arguments::scalars::date_value (cognitive 25): dbx_sql_schema::native_job_arguments::scalars::date_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 9 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_arguments/scalars.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9c14b4db4f21b8261b8f700e3e2e2b868ebed97dbf63f64efb614ecc033e93"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::diff_indexes_with_options (cognitive 25): dbx_sql_schema::schema_diff::diff_indexes_with_options has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":3780}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd3ad763b9ea2944b02d902336b9d1075dc2d7898bf3dec44d84b10849ac943"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::sqlserver_column_change_statements (cognitive 25): dbx_sql_schema::schema_diff::sqlserver_column_change_statements has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 2 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5723}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b0883f90a570af0e1672ecb7209617bbf0f924b52ce03a9922a548e2969c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_format::column_extra_clause (cognitive 25): dbx_sql_schema::table_structure_sql::column_format::column_extra_clause has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26b87b374475560dd602010fae6c61ad5eda1be886a6a33d953f7a3e1f90053"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::mcp_cleanup::sweep (cognitive 25): dbx::commands::mcp_cleanup::sweep has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_cleanup.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab9bb7a18678dba3799512a10ee81f299c8ee866e230345b79837e3664d7a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::plugin_file::drop::open_dropped_plugin_files (cognitive 25): dbx::commands::plugin_file::drop::open_dropped_plugin_files has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (8 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/plugin_file/drop.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a9b5a818707d61ed1e0d531e033d3a745f8a336bfe23642e1f34bd8cac2c6d"}},{"ruleId":"D2","level":"warning","message":{"text":"JdbcConnectionParameters.describe (cognitive 25): JdbcConnectionParameters.describe has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 4 (9 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d1afed9c9b75b6632934dc6da40f84a2f87c7866f55e0e8d6fe30a147421c3"}},{"ruleId":"D2","level":"warning","message":{"text":"JdbcExecutor.executePage (cognitive 25): JdbcExecutor.executePage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 2 (4 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a33bbf48956fa52e02d93d1c8ee1b0d4f0f4baaf56635dbb0b505498ca6bc6b"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.executeQueryOnConnection (cognitive 25): DbxJdbcPlugin.executeQueryOnConnection has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 5 (7 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dfa0c1837c4cd32d724a5a2de052a75b4bd0b2837d68faeccee16e5528d6d3"}},{"ruleId":"D2","level":"warning","message":{"text":"JdbcConnectionParameters.describe (cognitive 25): JdbcConnectionParameters.describe has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 4 (9 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/JdbcConnectionParameters.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b26c7714e1f2c989246b4f3fb05ed9709b449a36e9e47658c70b966017d143"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleForeignKeyDefinition.read (cognitive 25): OracleForeignKeyDefinition.read has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 5, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OracleForeignKeyDefinition.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7719db45eaae6424122cac409d73301fb23514eb5bba562f3b0081a0decbcd2"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCapabilities.probe (cognitive 25): PlDebugCapabilities.probe has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 5 (7 pts), error handling 5, boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCapabilities.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4381a21e60e40345d9bf9e863189c55b36d5bc317fd6fe2c3646e5e05ed8589b"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompositeInput.objectValue (cognitive 25): PlDebugCompositeInput.objectValue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, ternaries 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4747edc155ab185ff7cd2d03f6ae273301c034e72c822f8c05ef3a7645f55d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSource.reference (cognitive 25): PlDebugSource.reference has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, ternaries 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSource.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff656d11f3d4572a32984390272a912785187ff68c715070218bef8cba439da"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlServerLegacyAgent.shouldFallbackToJtds (cognitive 25): SqlServerLegacyAgent.shouldFallbackToJtds has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 10, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78660000853255fec1525bb1fffe14e3806227167dc3585ca37101a43ff045a"}},{"ruleId":"D2","level":"warning","message":{"text":"server.runPagedOracleSelect (cognitive 25): server.runPagedOracleSelect has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 1, loops 1 (nesting depth added 13). Of this number, 20 points are the body\u0027s own statements and 5 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4740}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7f9d39eace4172a062112bcf4d037f6a221a0f6743d3026d12f1efd0f5a885"}},{"ruleId":"D2","level":"warning","message":{"text":"server.prepareLegacyJob (cognitive 25): server.prepareLegacyJob has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (22 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/native_jobs.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9957de630b9a8a994b011d4f3dbf4e3091e4a0ecc3ddc385d4bdd6828d4eb3e"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.resolveNativeAnonymousSources (cognitive 25): plDebugNativeEntry.resolveNativeAnonymousSources has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 7, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_anonymous_source.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"626a88d6b5cb53ce8dcf0626586219b2bf84f8143ef01dda0d8f1b745e69ccd7"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugResultCache.page (cognitive 25): plDebugResultCache.page has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_results.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fddbaf56b3951ac5f6deb21829c1d828faeb26e9989418a577254eadcc229a"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getTopicConfig (cognitive 25): server.getTopicConfig has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8a868628e7c66a8820ea574470296a5bc4fca611cb78f18dfe8b57c85439cf"}},{"ruleId":"D2","level":"warning","message":{"text":"wkbGeometry.wkt (cognitive 25): wkbGeometry.wkt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b429f3fd3c88ead2149fd435c70edf1126fa3ef97c358d58f2dde071afb18b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.classifyRPCError (cognitive 25): main.classifyRPCError has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/protocol_error.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd1b0502c2c2cedec48a679d57849e206320562736f10e1b47ea909ea40ce48"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorBatchSelection.useQueryEditorBatchSelection.applyBatchColumnSelection (cognitive 25): useQueryEditorBatchSelection.useQueryEditorBatchSelection.applyBatchColumnSelection has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 7). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4253fa69f862855c5b8ed7fb3a39b268ee97ea0375a3e895b2a66b484cc28b"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferDdl.transactionalMysqlTableDdl (cognitive 25): queryResultTransferDdl.transactionalMysqlTableDdl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 11). Of this number, 23 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4433df3b9f85718ce6c1c1586ecbf77bf0dfc7fda0033af8867c35af56531e9a"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferDdl.columnDefinitions (cognitive 25): queryResultTransferDdl.columnDefinitions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"537976d55099709d0e384b836383d9affdd96cc40c4d2f1721c4c48af299b203"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridColumnFormatter.useDataGridColumnFormatter.loadFormatterForeignKeyColumns (cognitive 25): useDataGridColumnFormatter.useDataGridColumnFormatter.loadFormatterForeignKeyColumns has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 11, error handling 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7146f7db5b2e99c7f9919035229db9387a794e925e748bb5c209db6d17f3eaf1"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridConditionEditor.useDataGridConditionEditor.columnSuggestions (cognitive 25): useDataGridConditionEditor.useDataGridConditionEditor.columnSuggestions has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 7 (15 pts), if/else 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 10). Of this number, 24 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"4384a20599c3cfdb86c2b77cf07f02231dbfd11f697af13cd47a83529eeafef8"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportResultSheetsXlsxFallback (cognitive 25): useDataGridExport.useDataGridExport.exportResultSheetsXlsxFallback has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, ternaries 2, error handling 1, loops 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 2235, 2257, 2275, \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4326e20a931da154bb1e0fda6ac13cbbcd05e50f6da4d7def66cf9f5f3b63b07"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExtractor.useDataGridExtractor.copyWithExtractor (cognitive 25): useDataGridExtractor.useDataGridExtractor.copyWithExtractor has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (9 pts), boolean chains 8, if/else 7, error handling 1 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e531f81ba1221c7750ca044ad7ec834366329264ca9661ed1d52a676af909b7"}},{"ruleId":"D2","level":"warning","message":{"text":"useExportTracker.useExportTracker.updateDataTransferTask (cognitive 25): useExportTracker.useExportTracker.updateDataTransferTask has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 14, if/else 11. 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":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"012217e5f2fd14eaee442e89a2c05016b67aa0eae9db69de319244d42a1e2fef"}},{"ruleId":"D2","level":"warning","message":{"text":"useSqlExecution.useSqlExecution.continueExecute (cognitive 25): useSqlExecution.useSqlExecution.continueExecute has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ad02c801627985d4137fcfefeceb0eed42cbb0f996d7b39f59e3689af76e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"backend-errors.translateKnownMessage (cognitive 25): backend-errors.translateKnownMessage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 2 (7 pts), loops 1 (nesting depth added 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/backend-errors.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7ad6d346ffa37f46d6035c84e0e29dda2f8d8f2d5556e85e6c0ce53e7e7eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridCopyExtractor.validateDataGridExtractorOptions (cognitive 25): dataGridCopyExtractor.validateDataGridExtractorOptions has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 10, if/else 9, ternaries 3 (6 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":"apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ff73c4297c43a095acb4d46c24f3f8bc70193cde673bb8916ef5ac988579a6"}},{"ruleId":"D2","level":"warning","message":{"text":"xuguUserPermissions.parseXuguAclRows (cognitive 25): xuguUserPermissions.parseXuguAclRows has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 12 (22 pts), boolean chains 3 (nesting depth added 10). None of this is in the body itself: all 25 points belong to 2 function items inside it that branch (a function literal at line 426, field). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24fba60fe49288adc51016efdd6a35c2ec5246872c869274a257888f80463b9"}},{"ruleId":"D2","level":"warning","message":{"text":"queryEditorTableDrop.parseTableReferencePayload (cognitive 25): queryEditorTableDrop.parseTableReferencePayload has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, ternaries 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorTableDrop.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec474dce77d0f9f34bc066f00353ff42174a8be3a466ee2a5fdc9973f20be30f"}},{"ruleId":"D2","level":"warning","message":{"text":"diagramSvgExport.buildTableDiagramSvg (cognitive 25): diagramSvgExport.buildTableDiagramSvg has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/diagramSvgExport.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"624d2b978d0aa28088df6a47522fd21929fb1e1ac944c349d085682ed3a6ebb0"}},{"ruleId":"D2","level":"warning","message":{"text":"datagripImport.parseDbForestGroupPaths (cognitive 25): datagripImport.parseDbForestGroupPaths has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 2, ternaries 2 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b377003f7b128c945910abd2a5f1be6e983e56a838f1ee063733252755c7b8"}},{"ruleId":"D2","level":"warning","message":{"text":"tableMetadataCache.loadTableColumns (cognitive 25): tableMetadataCache.loadTableColumns has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 7 (15 pts), if/else 4 (6 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0353ba1c9ca1651877c8c9eedff2a72c409398bf53ea99de3702d0733b2d205e"}},{"ruleId":"D2","level":"warning","message":{"text":"treeNodeClick.treeNodeRowAction (cognitive 25): treeNodeClick.treeNodeRowAction has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12, ternaries 3 (7 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2e7a249ec73612b3772b2336c2a32c83564f1f09c09e80b540ae933e7fadd9"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printStatement (cognitive 25): printer.printStatement has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 8). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"d594d59b51f443f795b432f3e9bc4d53941a67bff5736cf3f191e79fba13fc8c"}},{"ruleId":"D2","level":"warning","message":{"text":"cteNavigation.findCteColumnResolution (cognitive 25): cteNavigation.findCteColumnResolution has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, ternaries 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/cteNavigation.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc9e5bb4a6e6c8efac34f373cf50a4d507406a4cbc2f628adaf0c34549e1350"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlAnalysis.hasTopLevelSemicolon (cognitive 25): sqlAnalysis.hasTopLevelSemicolon has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"8845e6dc122ea619ea4f97ffee535222bef72f7dc71056cf9c8ff60fa742ad09"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildKeywordItems (cognitive 25): sqlCompletion.buildKeywordItems has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 13, if/else 6, ternaries 6. Most of this is not in the body itself: 5 of the 25 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 7033, 7042). 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7018}}}],"partialFingerprints":{"codehealthFindingId/v1":"f255b84e7fbd4d70797abaa1b5420f2155e57d41fcd579c8743a8a1ea9ce1242"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlServerRoutineSyntaxDiagnostics.tokenizeSqlServerSyntax (cognitive 25): sqlServerRoutineSyntaxDiagnostics.tokenizeSqlServerSyntax has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlServerRoutineSyntaxDiagnostics.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"62866a6673b39bdf51761302f51f9bb8084db821d2a602aa3360740400fa9260"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectDeclareStatementVariables (cognitive 25): sqlParameters.collectDeclareStatementVariables has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f58c75a416f5b970df2b4128167c03cb1ad3abd4772886ab7b75f8879f465f5"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectSetStatementVariables (cognitive 25): sqlParameters.collectSetStatementVariables has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (sqlParameters.collectExecNamedArgumentStarts) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c959a943b90d4c1279719562c25d78fdbc9999a44a4788ce728caa739c44ec83"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectRoutineDefinitionVariables (cognitive 25): sqlParameters.collectRoutineDefinitionVariables has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e39cc8166c27424417f4be6b29de3f6447d378d2b7f2f3dd083d1b5b4f2ee92"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectExecNamedArgumentStarts (cognitive 25): sqlParameters.collectExecNamedArgumentStarts has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (sqlParameters.collectSetStatementVariables) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0578c59544d1f3e76fb6f11bd0cbb083801120bb3d234ad9d115b5f5fea514"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlVariableSyntax.normalizeSqlVariableSyntaxOverrides (cognitive 25): sqlVariableSyntax.normalizeSqlVariableSyntaxOverrides has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariableSyntax.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cf9afe69152557ce80541adace622300c41135c1cee2cdf445cc2beecf0b44"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTypeManagement.assertNoUnapprovedChange (cognitive 25): oracleTypeManagement.assertNoUnapprovedChange has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 9, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6191a5d30164806b08f9e3f8d527bf28eb5da30203572c76703d7288bb3dc11f"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadSchemas (cognitive 25): connectionStore.useConnectionStore.loadSchemas has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 4 (5 pts), boolean chains 3, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 7194, 7237). 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7179}}}],"partialFingerprints":{"codehealthFindingId/v1":"45af15e1d4abefd60a372f9fd9ed093f3099c3632c0bb32f53a131a449f2b21b"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadTriggers (cognitive 25): connectionStore.useConnectionStore.loadTriggers has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 13 (16 pts), if/else 4 (5 pts), boolean chains 3, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 8838). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63716cfc84373556d647de250f77bc7c58963747671ab4e95619f52e3364585"}},{"ruleId":"D2","level":"warning","message":{"text":"DriversClient.DriversClient::fetchBundlePackage (cognitive 25): DriversClient.DriversClient::fetchBundlePackage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 3 (8 pts), loops 3 (5 pts), error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DriversClient.DriversClient) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e05739792281cd473bedc69c42b38faaa8ba8f513f34e21e805ce79bbe6514"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributorsExperience.ContributorsExperience (cognitive 25): ContributorsExperience.ContributorsExperience has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 10 (14 pts), if/else 5 (6 pts), boolean chains 5 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 8 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/contributors/ContributorsExperience.tsx"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8af10bc162d4f4752a5a9590328bfb700efd4620605a9d8f927d322a371da01"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_duckdb_driver::sql::first_executable_sql_token (cognitive 24): dbx_duckdb_driver::sql::first_executable_sql_token has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (10 pts), boolean chains 8, if/else 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfd4781971fabc51debeeb873e3d965aa92508484c6b40b876140289583af05"}},{"ruleId":"D2","level":"warning","message":{"text":"McpAccessPolicy::with_v2_only_rules_from (cognitive 24): McpAccessPolicy::with_v2_only_rules_from has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/mcp_access.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b39635a784749162eba5a6a439893eab16a1e5d5b89880dde9ac1944de4ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::xlsx_temporal_kind_from_format_code (cognitive 24): dbx_core::data::table_import::xlsx_temporal_kind_from_format_code has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (7 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9c498650c96df3ebe731550d78c3b38208fd25d7f0b7b7eb4490a0b4ccb6f6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::sync_xugu_identity_sequences (cognitive 24): dbx_core::data::transfer::sync_xugu_identity_sequences has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e117d7e74dda52c6b176c352427fa227d30e1c77ecda879e36e9c45c74ffd4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::strip_dameng_storage_clauses (cognitive 24): dbx_core::data::transfer::strip_dameng_storage_clauses has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (8 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1240681402e42de91558eaf59acee065a7e3d67ac7e9a6ef55033e2a402bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::overwrite_clear::clear_foreign_key_linked_overwrite_targets (cognitive 24): dbx_core::data::transfer::overwrite_clear::clear_foreign_key_linked_overwrite_targets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (5 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/overwrite_clear.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9c4eb532ccfd1839aa585dab0537cc9a1d7dba221e19712290995b804a427d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::completion_assistant_search_core (cognitive 24): dbx_core::schema::completion_assistant_search_core has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8387}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10ff72a63f724af09e957726bc62c5c9442a8a892410a935edfe6c2da305fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_connection::agent_connect_params_with_role (cognitive 24): dbx_driver_agent::agent_connection::agent_connect_params_with_role has cognitive complexity 24 (threshold 15). Drivers by points: if/else 21, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_connection.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab51c2b21f6f80c706dcf44f41b4e1f2383017b9cd1db4c2c0a69650827e7ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_bounded_value_preview (cognitive 24): dbx_driver_mysql::mysql::mysql_bounded_value_preview has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa973d8818a5776b60282c8f4a84f5bc407559b6da0f034153c334367c037588"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::pg_temporal_array_text_to_json (cognitive 24): dbx_driver_postgres::postgres::pg_temporal_array_text_to_json has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (7 pts), match/switch 3 (5 pts) (nesting depth added 8). Most of this is not in the body itself: 4 of the 24 points are its own statements and the rest belongs to 4 function items inside it that branch (parse_array, parse_quoted, skip_whitespace, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dec8c325e2a6c8664b19e7a128ac48d1724ea1da92bb086afa1cba587b4742"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::execute_select_text (cognitive 24): dbx_driver_postgres::postgres::execute_select_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":2226}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b63a6cc973b6de3ad4089ebd5b6de05604aa5f72340ba18896fb5c70fbd682"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::cancel_postgres_query (cognitive 24): dbx_driver_postgres::postgres::cancel_postgres_query has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (10 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":9991}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f279067df388796cc7aac0a53eeefdbcb69fc80932fca9e377dcf1792ae992"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::build_sqlserver_unsafe_type_query (cognitive 24): dbx_driver_sqlserver::sqlserver::build_sqlserver_unsafe_type_query has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"911db0779f7f3ca20acc26315a8f32f0e3d64200ccf6f14a74ae6c077074839b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::solr_driver::translate_field_operator_filter (cognitive 24): dbx_drivers::db::solr_driver::translate_field_operator_filter has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (9 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/solr_driver.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e70265600cf2f00fbc40836a15a30403ec3464c1b1f25037c4f4e1681915ce"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::execute_and_show (cognitive 24): DbxMcpServer::execute_and_show has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 5 (7 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe44c87b55ad6f51b9d12fbb53450f9a584a4636483cba4e255e28c2ce15f612"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::query_execution_sql::strip_sql_comments (cognitive 24): dbx_sql_core::query_execution_sql::strip_sql_comments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2baa677217f9c1af6d28e2d13dda50ef3cdf50ad964b4f097daec80efdd05c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_diagnostics::redact_sensitive_assignments (cognitive 24): dbx_sql_core::sql_diagnostics::redact_sensitive_assignments has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (11 pts), boolean chains 7, if/else 3 (6 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_diagnostics.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d033dc48ce74e53e9c75c3e3f19e344cd841fd4160acfbb21bba68ce8489786b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::iotdb_tree_count_sql (cognitive 24): dbx_sql_data::query_result_sql::iotdb_tree_count_sql has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 6 (9 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8336c365dc8808180985489b5824fc4082562483d9c49b7dacae42b37ab38a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::detect_pattern_conflicts (cognitive 24): dbx_sql_schema::schema_diff::detect_pattern_conflicts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f49a5b86f6dadac46b64139e9502a518b1c913d4b64d833153ef627a643f50"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::diff_columns_with_compatibility_options (cognitive 24): dbx_sql_schema::schema_diff::diff_columns_with_compatibility_options has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ba774b741512f4496b7794352ebbc6fe9671bb5256207ab6c71eaa8225005a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_alter::build_sqlserver_existing_column_sql (cognitive 24): dbx_sql_schema::table_structure_sql::column_alter::build_sqlserver_existing_column_sql has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd4344741d098f27235aa7f6888839e638e15cecae8f4320dac52cb6e095149"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::util::format_default_for_sql (cognitive 24): dbx_sql_schema::table_structure_sql::util::format_default_for_sql has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/util.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b818b15e6bb0a1d1946d4b950040cc21e2f5df88c4b71db47809535f59b90cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleTriggerMetadataReader.enrich (cognitive 24): OracleTriggerMetadataReader.enrich has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (8 pts), error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bab14a6e61b550f3106667c4190f8e4af9cba2f4932c096daf92a2d97e8d112"}},{"ruleId":"D2","level":"warning","message":{"text":"MongoAgent.applyAggregateOptions (cognitive 24): MongoAgent.applyAggregateOptions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"2758feb27088de44da157266ed162fc84eca9074304afe36d9e214ec3bcc142b"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseLobValues.read (cognitive 24): OceanBaseLobValues.read has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 7 (8 pts), boolean chains 6, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseLobValues.java"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"645e37c31e2b9ac980806903a6afa86a20166d366b0ad0d5424b70cf21527548"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer.child (cognitive 24): Writer.child has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 7, boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a06153fad9761b7b022d6decff4ab61279be21dfaf35df03af48166c36241f3"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugManager.start (cognitive 24): PlDebugManager.start has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed96c9964b8ee2d6a8a504d9abffbe713a196b5d50116b9973c69fb33d9160c5"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSession.recoverOutput (cognitive 24): PlDebugSession.recoverOutput has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 6 (7 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b13daf3931622a49cdae0d93b89961bb39c69b1a27ec15f97538f8fcf272f4"}},{"ruleId":"D2","level":"warning","message":{"text":"TranswarpAgent.getColumns (cognitive 24): TranswarpAgent.getColumns has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (15 pts), boolean chains 5, error handling 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/transwarp/src/main/java/com/dbx/agent/transwarp/TranswarpAgent.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1884700be70b64fe8d419e353ed5783a100d3bafc0c8e15ca1924201da693f"}},{"ruleId":"D2","level":"warning","message":{"text":"ci-install-system-deps.install (cognitive 24): ci-install-system-deps.install has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/ci-install-system-deps.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa5a603aeca5675a1a6963a97fcf7c113a5b32e9e83a9fb702ea5d6e98d4a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"main.materializedViewDDLFromCatalog (cognitive 24): main.materializedViewDDLFromCatalog has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/materialized_view.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ea8b0ed329c556c010f5bea5acee932daff3cbdaa12d47d8db325219311d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getTableDialectDDL (cognitive 24): server.getTableDialectDDL has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/metadata.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a794d513de3ccca80e78609807d9c1a536d8d5f6b3ddc497ece129d9ebcf4289"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseHostEndpoint (cognitive 24): main.parseHostEndpoint has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10efc176f5f14f3fe1584230920aa15376193408a5dfabb46e1c4140a5f7a82"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getTablePartitioning (cognitive 24): server.getTablePartitioning has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, loops 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb11ab42c5cf8995dcbb10c4a3a16c4189ce253dc812241bd06a1ae5839201a"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getExactTriggerSource (cognitive 24): server.getExactTriggerSource has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/trigger_metadata.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"325258fa00a04e2fb2f4893b51819de27920fb81a996dc6d96a08cc114e5bd17"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugSession.resumeUntilException (cognitive 24): plDebugSession.resumeUntilException has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7f591ee1f4b156696f1e1f15283f955f492a5df2a0fdb47743743191271581"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugLobOutput.freezeNationalSource (cognitive 24): plDebugLobOutput.freezeNationalSource has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_lob_output.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d2fd145240cccf9185e14eaeaf674437bb526b8902937071c64dd9598a6f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.xuguParenthesizedGroups (cognitive 24): main.xuguParenthesizedGroups has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":5730}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bba92d3edd8ee50dc0c03d57ac7fb06944e76af70fcd35b0e41ca0cc8f9553"}},{"ruleId":"D2","level":"warning","message":{"text":"ddlStorage.oracleStorageClauseEnd (cognitive 24): ddlStorage.oracleStorageClauseEnd has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, ternaries 4 (8 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f93e6154db7bd4277246a642e6398a55983d313f7f5883d9d5f19b215144f65"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.provideGraphCompletions (cognitive 24): useQueryEditorCompletion.useQueryEditorCompletion.provideGraphCompletions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, loops 1 (2 pts), error handling 1, ternaries 1 (nesting depth added 4). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"76de13fdeb323fe404dce77552ed39a1842eab6a9330c468147accb46a733f49"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrl.urlParamsRequireTls (cognitive 24): connectionUrl.urlParamsRequireTls has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (12 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed6b160b7db848ca8352c5fa4a09380bfea05bc83a6b59f5957d84761c536bb"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGenerate.isWrappedByOuterParens (cognitive 24): dataGenerate.isWrappedByOuterParens has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a701aedf958939258111558a6678b3b6e1147e2be2e639afb28b4444c8e44c03"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridSort.compareDataGridValues (cognitive 24): dataGridSort.compareDataGridValues has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSort.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a80f1ee812694408f10471ded9f97d5a6b1d1f859d5cf72d49bc92d0d3ca592"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseStructureSearch.runDocumentStructureSearch (cognitive 24): databaseStructureSearch.runDocumentStructureSearch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseStructureSearch.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcff232f2148526e3e1c17cb03ff5769660d68a6e7df74f09815d4e0f4bfc30"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleConstraints.oracleConstraintDefinitionFromInfo (cognitive 24): oracleConstraints.oracleConstraintDefinitionFromInfo has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 11 (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":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f2bcb2303c6f1b5f8340e3d55491595cbecc99896f54ac9849ccfbae281176"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.validateOracleForeignKeyReference (cognitive 24): oracleForeignKeys.validateOracleForeignKeyReference has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 9, loops 1 (nesting depth added 6). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f07cce0ed01d77a9df0f5f6ad629300e0213f33504edfadc93682fbb9c614b6"}},{"ruleId":"D2","level":"warning","message":{"text":"elasticsearchRequestRisk.uncommentedLines (cognitive 24): elasticsearchRequestRisk.uncommentedLines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchRequestRisk.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a240eac7b3634f38669a4ae0c1571fddd26b6e7c734112663644fb53209cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.classifyUpdate (cognitive 24): mongoCompletion.classifyUpdate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d2d52ef3e187eaf9071d71015456c334baa773a39840797dcfcfe4a197ed23"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.cursorMethodItems (cognitive 24): mongoCompletion.cursorMethodItems has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 8 (24 pts) (nesting depth added 16). Most of this is not in the body itself: 3 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 1885). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd754e66dfbde6f92d20043a796150d200ae2cff55dbc4837bf4aa53bb083ced"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.parseMongoFindCommand (cognitive 24): mongoShellCommand.parseMongoFindCommand has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 6, ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace234a1005668eafe6a858fdab35f6cb412ad9940ce6a5bae27606892aee60d"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.mongoCommentAwareBodyEnd (cognitive 24): mongoShellCommand.mongoCommentAwareBodyEnd has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 7, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a7708ba14b0b3039ec6537c6b6bd56d4318353991a7e6231969ec185424c23"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoSql.comparisonToFilter (cognitive 24): mongoSql.comparisonToFilter has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 4, boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fe37fb8cf89fb1a70da3acc89f459aa2de1ec64a35bf3bee32b74df8cdc9be"}},{"ruleId":"D2","level":"warning","message":{"text":"thriftBinary.readValue (cognitive 24): thriftBinary.readValue has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/thriftBinary.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96c729274c2eb8c3f72a0c8f6953b2718d9b97cf84f4a230384a01af0c2ec28"}},{"ruleId":"D2","level":"warning","message":{"text":"pluginFloatingWindow.parseFloatingWindowRequest (cognitive 24): pluginFloatingWindow.parseFloatingWindowRequest has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 10, boolean chains 8, if/else 6. Of this number, 17 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f125a7134aa3bf17063e42e4d1f09a40a605ee8df75601409ae68bac9c56d4"}},{"ruleId":"D2","level":"warning","message":{"text":"pluginMarketplace.comparePrerelease (cognitive 24): pluginMarketplace.comparePrerelease has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginMarketplace.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"9794bc030856a247ad829a0dec15303be0ba653cacfc479e67a8db867ee0bc7e"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDiffTableMapping.reconcileSchemaDiffTableMappings (cognitive 24): schemaDiffTableMapping.reconcileSchemaDiffTableMappings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, loops 3 (4 pts), ternaries 2 (nesting depth added 8). Of this number, 21 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffTableMapping.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecdbd685b746abd35f68346940714e809abc9586487b2ee848af43f74eeaee5"}},{"ruleId":"D2","level":"warning","message":{"text":"solrRequestRisk.uncommentedLines (cognitive 24): solrRequestRisk.uncommentedLines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/solr/solrRequestRisk.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a605912de72f2a29bafebd01316fdc55fea069d908eda7a6a78e6c3f5611680e"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.splitTopLevel (cognitive 24): sqlCompletion.splitTopLevel has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 7, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4802}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65ab727c6947e9a5b90591400ee598b7e68d1c9a419478748fe3aa93ad21a22"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.splitRoutineSignatureParameters (cognitive 24): sqlCompletion.splitRoutineSignatureParameters has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5379}}}],"partialFingerprints":{"codehealthFindingId/v1":"04668d5f91c30657227d7a50c86fb34435575a67b9092ca63baab3d4be0014f9"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.completionColumnPrefixCandidates (cognitive 24): sqlCompletion.completionColumnPrefixCandidates has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6077}}}],"partialFingerprints":{"codehealthFindingId/v1":"946ec2de5332e58419fc00c366f5619feda064928ea9d1f4b706eb7a7a84420a"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.isMysqlRoutineHeader (cognitive 24): sqlParameters.isMysqlRoutineHeader has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 15, if/else 8, loops 1. Of this number, 19 points are the body\u0027s own statements and 5 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd5c7f5a6c21eada223f55773dca4db68fd97a7678c95cef8d97d096cac46c4"}},{"ruleId":"D2","level":"warning","message":{"text":"batchTableDrop.runBatchTableDrop (cognitive 24): batchTableDrop.runBatchTableDrop has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 1 (4 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 9). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/batchTableDrop.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4671676a7bcb8313d60746270bef40e606978284ab8e6a4b81b09ddd15981374"}},{"ruleId":"D2","level":"warning","message":{"text":"tableVGroup.findTableVGroupContainerNode (cognitive 24): tableVGroup.findTableVGroupContainerNode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 8, ternaries 4 (5 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to 4 function items inside it that branch (walk, a function literal at line 663, matchesOptional, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"392f91eae260b6823f1d81976f70e188a864896e4417813888ed3d1f41eb8bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.disconnect (cognitive 24): connectionStore.useConnectionStore.disconnect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 5, match/switch 1 (2 pts), ternaries 1 (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5809}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee838d4c1fc525c16060f574b8666cf47707f0fb303dbe3bcc986d5817c69b13"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.applyRestoredOpenTabs (cognitive 24): queryStore.useQueryStore.applyRestoredOpenTabs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, loops 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2806}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf535d5066c2a2a004094fc5d767710f7771300abee11c4f74b0ececc197bef4"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.openObjectBrowser (cognitive 24): queryStore.useQueryStore.openObjectBrowser has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, ternaries 8 (9 pts), if/else 4 (6 pts) (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3913}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b16b46fc7a6569d7ef681a7b3200c1c2fd28eb769cc3003c243716073114e9"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.captureResultLegacyValuesForExport.read (cognitive 24): queryStore.useQueryStore.captureResultLegacyValuesForExport.read has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, ternaries 4 (6 pts), error handling 2, loops 1 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10893}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff2e07213d78298a4117a3ab047d9765ddf071d80cbf44624e6f3432cadfbc3"}},{"ruleId":"D2","level":"warning","message":{"text":"json.isMongoRegexValuePosition (cognitive 24): json.isMongoRegexValuePosition has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c9f74ecd915faf3ce3b0f28119ce5dc48fef0709ffa91e0b825b269e0cdd58"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::stream_gemini (cognitive 23): dbx_ai_provider::ai::stream_gemini has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0556c87ac524e9ecb652ffe85d898116627adfecd4fe796618af288c18a591"}},{"ruleId":"D2","level":"warning","message":{"text":"TupleScanner::next (cognitive 23): TupleScanner::next has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fec591bfe1bd36fcfff71800acdff7b4115c786ecd8a87b38b83a073d06f43"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::connection::native_postgres_url_config (cognitive 23): dbx_core::connection::native_postgres_url_config has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8972}}}],"partialFingerprints":{"codehealthFindingId/v1":"3337b2f4599c0af7d76035f9aae808dd5d87da12d2f8e1956b3514d7774d5245"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::csv_export::write_table_csv_pages (cognitive 23): dbx_core::data::csv_export::write_table_csv_pages has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/csv_export.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f961a38be59ba897dd6b67f2418619d523210ebf873744cd10e96ffc1058ed"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::stream::restore_data (cognitive 23): dbx_core::data::mongodb_dump::stream::restore_data has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (9 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/stream.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e27f8f9ce4c6a02c605682ede92c696f911b2ba7e8cd44bc4c379922035333c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::extract_json_container (cognitive 23): dbx_core::data::mongodb_import_export::extract_json_container has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8266f31b419af3c1eae52d7b740dc21b66834b421002c5984a350740c2db3f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::generate_insert_typed_sql_batches_from_value_rows_with_options (cognitive 23): dbx_core::data::transfer::generate_insert_typed_sql_batches_from_value_rows_with_options has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6945}}}],"partialFingerprints":{"codehealthFindingId/v1":"03447719451e6ee8997a4c69ce2f87ac8c6a7896e203fcc1b49c92b0b3ae7ce4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::structure_plan::mysql_schema_object_preview_sql (cognitive 23): dbx_core::data::transfer::structure_plan::mysql_schema_object_preview_sql has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/structure_plan.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc93c7503acbbbe0509dd67b3fac3171e675c7554938986e9bca1d65488a629e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::lifecycle::wait_for_entries (cognitive 23): dbx_core::query::pl_debug::lifecycle::wait_for_entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/lifecycle.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdbb2dfdb561a33b0616ec62ff8e58555d6a895cd22bb90f16d78b106434e89"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::list_object_statistics_once (cognitive 23): dbx_core::schema::list_object_statistics_once has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b63fe995d570d3e0448201d0b534d08e52e69af98afa0cb7557eba5f658dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::references::read_references_with (cognitive 23): dbx_core::schema::native_jobs::references::read_references_with has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/references.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ec74178e1f7ffca635982fe3fddd5640f516c1b1758c150d2d9c91b9696285"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::service::runtime_identity_in_session (cognitive 23): dbx_core::schema::native_jobs::service::runtime_identity_in_session has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 6 (10 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/service.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45494cd4c1fd8abb467c8c2d0555f05ac1773dbb49312305f6cdff385913f48"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::plan::package::normalize_input (cognitive 23): dbx_core::schema::oracle_routines::plan::package::normalize_input has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan/package.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"704aa7b56c303329cc057d80a4b406df552478e9a257789a36e6e50296913692"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_elasticsearch::es_send_page (cognitive 23): dbx_driver_elasticsearch::es_send_page has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 7 (9 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"efea1788e9989071e7091a9e33a3d5e8866ff7d15e1f8f7603de41a228b25b07"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_elasticsearch::execute_sql_query (cognitive 23): dbx_driver_elasticsearch::execute_sql_query has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30b0e6aab607def872c148d34704ce2dc35b2c4c1c598b3c7dda70868f20992"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::list_keyspace_databases (cognitive 23): dbx_driver_redis::list_keyspace_databases has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (21 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4b5c8a5cba8015189093bc2268cacbcc303fdf6d4469c0b476926edd73ad4e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::scan_cluster_values_page_with (cognitive 23): dbx_driver_redis::scan_cluster_values_page_with has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4503650df6b3478732bed3be8a2725ad3a860bd288ad3afb5304d6ef77823025"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::solr_driver::translate_solr_document_filter_value (cognitive 23): dbx_drivers::db::solr_driver::translate_solr_document_filter_value has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), match/switch 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/solr_driver.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5333a37526c364e1527400db7057f45c883bd1ca21c213bafe7bd67e5d4423"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::sqlite_unistr_text (cognitive 23): dbx_drivers::db::sqlite::sqlite_unistr_text has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d04d8e52c6e6fbf3e49a94c3097264e296d7da6b6556a318533294843dbb72"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::ssh_proxy_command::parse_proxy_command_argv (cognitive 23): dbx_drivers::db::ssh_proxy_command::parse_proxy_command_argv has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_proxy_command.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0717bde23c55c5e37bf6ce8b3f8a6f71c7a628880c4db5cc617ed979371de74c"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::call_plugin_tool_dispatch (cognitive 23): DbxMcpServer::call_plugin_tool_dispatch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 4, loops 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5502}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c0a621daf752c1bb993e09352634f2529e6ed238cd97293efd2bd9c1271425"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::visit_select (cognitive 23): Analyzer::visit_select has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 6 (7 pts), match/switch 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2c6ed9cfe18a125ab08276d95e43658b67576c8662779caf45c4172ea9d544"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::mysql_ddl_normalize::normalize_mysql_export_ddl (cognitive 23): dbx_sql_core::mysql_ddl_normalize::normalize_mysql_export_ddl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/mysql_ddl_normalize.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84c57765c5388b2c19455151da1f90dfeab41a8aff842051ba778f6824921c3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::oracle_view_rename::rewrite_query (cognitive 23): dbx_sql_core::oracle_view_rename::rewrite_query has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b8ed487d34b5166ddbdc6f2a73e8d3d0afd6b4702e1aabafab1a9598e82c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::query_execution_sql::is_safe_read_only_set (cognitive 23): dbx_sql_core::query_execution_sql::is_safe_read_only_set has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 8, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"7015f87932c7cf9283f468580671bfdd422e47628a8ce5e5e2979981b14b83e0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::parse_insert_values_tail (cognitive 23): dbx_sql_core::sql::parse_insert_values_tail has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98885c67c65f9242b4918aac1995f7e141fc01d4ed6249cdf21189061fb6e03"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_analysis::mysql_alter_table_options_are_valid (cognitive 23): dbx_sql_core::sql_analysis::mysql_alter_table_options_are_valid has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc6bb6050fb473145d8ebcf17ae4877a04b1d803f24433463599328e54aa074"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::format_grid_assignment_sql_literal_with_spatial (cognitive 23): dbx_sql_data::data_grid_sql::format_grid_assignment_sql_literal_with_spatial has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4a10eabc812906739d30ff161db00e02690431fce3ae47160ed7f2083c54b9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::build_count_query_sql (cognitive 23): dbx_sql_data::query_result_sql::build_count_query_sql has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d100cf1ad0a90bb7b7a08474a0c32e3ffe940a5c5d005a7420b9fc58e67520"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::metadata_changes (cognitive 23): dbx_sql_schema::native_job_changes::dameng::metadata_changes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 6, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2240fdacd3074670ac7165bade056a58c7fbe7406929ce00865961b19a0eca"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::transwarp::validate_create_options (cognitive 23): dbx_sql_schema::table_structure_sql::transwarp::validate_create_options has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/transwarp.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee7d47c710d838dd1c96380f92bbcbf9ad9c96b9a0320058572fcd13c2bbce3"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackedPhysicalConnection.\u003Cinit\u003E (cognitive 23): TrackedPhysicalConnection.\u003Cinit\u003E has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cefd92891683fd8834b20a38771de0b78f4ff8e7fa948bc5e67e961181939a"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.appendInceptorRoutinesFromSystemTables (cognitive 23): DbxJdbcPlugin.appendInceptorRoutinesFromSystemTables has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (7 pts), boolean chains 3, ternaries 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3372}}}],"partialFingerprints":{"codehealthFindingId/v1":"206a3d075a11a287cf00971167277a1f7b06b004c47c13a0a420dbe737507419"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleTriggerMetadataReader.listObjects (cognitive 23): OracleTriggerMetadataReader.listObjects has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"698cbf40e914d80177106fb0bc52561d5528d69d505cd7ef7edf9ad421ea73a7"}},{"ruleId":"D2","level":"warning","message":{"text":"DamengAgent.isDamengMetadataUnavailableError (cognitive 23): DamengAgent.isDamengMetadataUnavailableError has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3591d883c7f5c0f0bbc4da3953bc6749eeb5a44c2c15f4b9f2657898cc7db06"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseOracleAgent.listConstraints (cognitive 23): OceanBaseOracleAgent.listConstraints has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, ternaries 2 (5 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96bdbda051494937fda5a736b2b66e567863e2784c32a41619b453f3d08c6ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.run (cognitive 23): Execution.run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 4 (6 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompile.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f603a50a2bf080e11b70b79991a64467246b16bb7458043e505f8967283ddd8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Entry.snapshot (cognitive 23): Entry.snapshot has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 6, if/else 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7e7a436aa1f73af27cfd5e638ad61ae8a751a5d3660450335e60ddd3a05078"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTemporalJson.entries (cognitive 23): PlDebugTemporalJson.entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, error handling 2 (3 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTemporalJson.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"44238cd1c6bbe9f673bdca15a9cbc07a5c56e5387e320572cc244ccd20823f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"discoveryConnector.Connect (cognitive 23): discoveryConnector.Connect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e5fbc51cf472a6fe2a3868a9155f5f7b04b03cf9d3f9ce7b722121122ff001"}},{"ruleId":"D2","level":"warning","message":{"text":"etcdSession.listReadableRanges (cognitive 23): etcdSession.listReadableRanges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef0b39fcd9a05c5019650ff749cb6c955e27919a520b2bee5421f05174e7538"}},{"ruleId":"D2","level":"warning","message":{"text":"etcd2Session.put (cognitive 23): etcd2Session.put has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/kv.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64245815998889ff9fc07e98c8f0a9eeff4d0fd83b0c85fe5ddf2868b42441f"}},{"ruleId":"D2","level":"warning","message":{"text":"discoveryConnector.Connect (cognitive 23): discoveryConnector.Connect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/connector.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e587648aed6e81c2c9dc28e4400db8360c223682bc12a79307b4ff869a3dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"main.oracleLegacyOptions (cognitive 23): main.oracleLegacyOptions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 36). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/legacy_charset.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8825fce05c4d2864edd1e8ef759ff038c7336b43e003eba7318bba7fe439cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"main.oracleColumnTypeDDL (cognitive 23): main.oracleColumnTypeDDL has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf7cbe343bf3f10fdbc4fef2b2eec364687c0bffd77ac77bb3223eacc874707"}},{"ruleId":"D2","level":"warning","message":{"text":"main.oracleRequestedMetadataListQuery (cognitive 23): main.oracleRequestedMetadataListQuery has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 2 (3 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/metadata_queries.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb17361c0dd997fbf07297832e99567011fbe80f575e96882f6255cfc83ad226"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugTargetRoutine (cognitive 23): main.plDebugTargetRoutine has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":5356}}}],"partialFingerprints":{"codehealthFindingId/v1":"736a6638cb8aa87b26686598107df85036c17c451a6024ac6cc192f9ab541ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugDecodeBinaryOrLobInput (cognitive 23): main.plDebugDecodeBinaryOrLobInput has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_lob_input.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d28457b51f9f3490e09301607b322bfcd930f32d6eab038bb9083f02967c05"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeTimezoneResult (cognitive 23): main.plDebugNativeTimezoneResult has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, loops 1 (nesting depth added 3). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_timezone.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"8630e211a332ab59943ad26261724a660358a6f71836097e092bb39a4557820c"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listSchemas (cognitive 23): server.listSchemas has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0af33f42b55a6dcbd4ebb3271ec9bc7d14eb2da18ba955256242665d2dcd9b"}},{"ruleId":"D2","level":"warning","message":{"text":"server.queryRowsWithTimeout (cognitive 23): server.queryRowsWithTimeout has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (23 pts) (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6326}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9ed6c1dca7ae44ee65ae2348a6e503f3a2f7b0cb9bce0826560c8739ea1bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugSession.stepIntoRoutine (cognitive 23): plDebugSession.stepIntoRoutine has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd6ad105ab380e66e650f8ac1ac855814206663d891516fada80d7b2d08a85b"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugCollectionInitializer.object (cognitive 23): plDebugCollectionInitializer.object has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_object_initialize.go"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff33b09056d0058f25650ef5da5562e1e5db2dab03fee229a0bc5f74be6175a5"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugResultCache.retainWithState (cognitive 23): plDebugResultCache.retainWithState has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_results.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"39301a8c1d765e19ab19dd42e6d3ec2e7d430648b1245649d67b45b2bfeb29de"}},{"ruleId":"D2","level":"warning","message":{"text":"server.peekMessages (cognitive 23): server.peekMessages has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f483ea5a8888d5beddb44d6daed50263a9b57e2f9e681038a6c388498427c9b8"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseConnection (cognitive 23): main.parseConnection has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/connection.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3cd0ff1c3dfdac3c447844679dadcb0ca72e7330bc0906a2d028885a63bd89"}},{"ruleId":"D2","level":"warning","message":{"text":"proxyMessagingClient.register (cognitive 23): proxyMessagingClient.register has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 11). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 160). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/proxy.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e761f856d7aba5ae23a3cf2f2618d787b8b7c2c5b2c41b8899ab32b91a3da2"}},{"ruleId":"D2","level":"warning","message":{"text":"main.skipXuguTypeQuotedOrComment (cognitive 23): main.skipXuguTypeQuotedOrComment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/type_members.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba04100017b6e940c347d8e770182654f35d52993e60229026bedb7fb4260b1"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listTablespaces (cognitive 23): server.listTablespaces has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"1435d12bb73860dd689e5d9d91cd0e9009e461340868153c6f657b4f74a0249d"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listTablesByAvailableSources (cognitive 23): server.listTablesByAvailableSources has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0ce3bb794dc4450fc4d6b5fae06c2cf6d2f1515fc4f074198deef3af869de7"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getTableDDL (cognitive 23): server.getTableDDL has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":3750}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9a5dcabf4c374a79e66d4fe86485a91c2cda19446a559f32a01916dcdcbfbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Int32ArrayColumnDecoder.ReadColumn (cognitive 23): Int32ArrayColumnDecoder.ReadColumn has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Int64ArrayColumnDecoder.ReadColumn) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/column_decoder.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05801b1f3141eb1d46a329b39e4c976daecf6c98281accde5a21ce646f9d72d"}},{"ruleId":"D2","level":"warning","message":{"text":"Int64ArrayColumnDecoder.ReadColumn (cognitive 23): Int64ArrayColumnDecoder.ReadColumn has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Int32ArrayColumnDecoder.ReadColumn) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/column_decoder.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a852ed0188d9901ffef1e6d0c887a579c91fdf8fc4c983c52ce792143fc1bfbd"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.Serve (cognitive 23): Server.Serve has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (nesting depth added 11). Of this number, 16 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":"plugins/sdk/go/dbx-plugin-sdk/sdk.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4786bd3f39ea7e5afa229886e26ef4839a26c2220525f191986b735a7796ac27"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.nextSqlWordToken (cognitive 23): sqlStatementRanges.nextSqlWordToken has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ca82015d97981158cfb62386b28d1f70be1333e166f7ec000754c28f704b22"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffHunkBuilder.buildHunks (cognitive 23): DiffHunkBuilder.buildHunks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (5 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":"apps/desktop/src/components/diff/DiffHunkBuilder.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27297a30773eb83670e54ac0bbf386320f5a0280359ad431b6f551df3d96ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletionKeys.useQueryEditorCompletionKeys.acceptSqlServerCompletionOnSpace (cognitive 23): useQueryEditorCompletionKeys.useQueryEditorCompletionKeys.acceptSqlServerCompletionOnSpace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 5, ternaries 4 (5 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cecdc8ea285e1f2d9e7f3cef2656ac4854a4fa6034e3f2626a789a25b2da7a"}},{"ruleId":"D2","level":"warning","message":{"text":"useAppUpdater.useAppUpdater.performInstall (cognitive 23): useAppUpdater.useAppUpdater.performInstall has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a6b85d6e546d8bc7d5fca7f9f86ae8497bd889b2bdf103f718ba53ffb02857"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.executeConditionalUpdate (cognitive 23): useDataGridEditor.useDataGridEditor.executeConditionalUpdate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 3 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e338b55f9259e36fcb22b92e4b5cc5642e146ea0e5de0f03d9396c8e373e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonSourceScanner.readNumberToken (cognitive 23): JsonSourceScanner.readNumberToken has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"6486346f9b41c9dc79ac3f699f2af48e0818af298a347589cfd6e18a8591ee11"}},{"ruleId":"D2","level":"warning","message":{"text":"columnFormatter.formatTemporalValueForExport (cognitive 23): columnFormatter.formatTemporalValueForExport has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (13 pts), if/else 4 (9 pts), boolean chains 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ac9de26fdcd527305ac53f8bb907a5366ead65407ea29032ff5da489a5b32e"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGenerate.generateTableRowsChunk (cognitive 23): dataGenerate.generateTableRowsChunk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 11). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 2077). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"5919160049dd2222643bcf031d23f9c77a02be86da6b6dd94ef56fbebdb2c017"}},{"ruleId":"D2","level":"warning","message":{"text":"regexGenerate.gen (cognitive 23): regexGenerate.gen has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0b89f23cdfe7355183691d68e6b836af63844d2b28c44a26981578d2f1514a"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeJobs.damengChildChanges (cognitive 23): nativeJobs.damengChildChanges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, ternaries 2 (3 pts), loops 2 (nesting depth added 6). Of this number, 22 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":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f5223db2af7b7546c9d2401168776f174c9bf239db19c65959e6eaeecdba77"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleInvalidObjects.readAllOracleInvalidObjects (cognitive 23): oracleInvalidObjects.readAllOracleInvalidObjects has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleInvalidObjects.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea6a2c2155b811cd19f9bab473001a57f4d27ebfd4aa354a8b833d63ad49ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorSqlAliasHighlights.createSqlAliasHighlights (cognitive 23): codemirrorSqlAliasHighlights.createSqlAliasHighlights has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 7 (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorSqlAliasHighlights.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"752c66daeaf1254e1c431506de591ad7e4552c278c7fbb3c8ad886ef3ae07c42"}},{"ruleId":"D2","level":"warning","message":{"text":"hoverTableSql.reformatHoverDdl (cognitive 23): hoverTableSql.reformatHoverDdl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 2, boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"0359c9066fe64ad939c09b5a481f07e130f53fd9a90742659cb4dad1ce6f219a"}},{"ruleId":"D2","level":"warning","message":{"text":"historyRestoreTarget.resolveHistorySqlRestoreTarget (cognitive 23): historyRestoreTarget.resolveHistorySqlRestoreTarget has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9, error handling 1 (2 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/history/historyRestoreTarget.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"05abed60956884fd1233367e0ff03ae6066a6be8bb216e6cf0e7d6549132ee87"}},{"ruleId":"D2","level":"warning","message":{"text":"redisDesktopManagerImport.connection (cognitive 23): redisDesktopManagerImport.connection has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 8, if/else 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/redisDesktopManagerImport.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7aff03d8e0b99b306101724e0ff2b6dcd85837406ca68c1349845e4134534f"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoDocumentValues.parseMongoDocumentInputValue (cognitive 23): mongoDocumentValues.parseMongoDocumentInputValue has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"63624fece5cb07cdc402c67f04415c7cd504214f0d795cb05daa222e38d1386d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parsePredicate (cognitive 23): Parser.parsePredicate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"52094a979e97b90d35da965b8f0e38407785e83225f35c948594fa370d3c449b"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendPluginRegistry.listPaletteMenuCommands (cognitive 23): FrontendPluginRegistry.listPaletteMenuCommands has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 14). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12b952275d6f7ad9de149eee4c04dc64f9a088a0360dcddd418d95b2fd5331d"}},{"ruleId":"D2","level":"warning","message":{"text":"javaSerialized.normalizeJavaSerializedValue (cognitive 23): javaSerialized.normalizeJavaSerializedValue has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/codec/javaSerialized.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dd179dcc18e99d19583fffc946119715b518888fbb5b091f2e463cd014d3d0"}},{"ruleId":"D2","level":"warning","message":{"text":"redisKeyPattern.createRedisKeyPatternMatcher.\u003Creturned closure\u003E (cognitive 23): redisKeyPattern.createRedisKeyPatternMatcher.\u003Creturned closure\u003E has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 6 (7 pts), error handling 1 (2 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyPattern.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfc24f1664506cdc7c6a7d085a93cc61974ddf642be1d7fead908d85ff8815c"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineDeploy.executeOracleRoutineDeployment (cognitive 23): oracleRoutineDeploy.executeOracleRoutineDeployment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, error handling 2 (3 pts), loops 1 (nesting depth added 7). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 679). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5bd7e1dc23ee7c79c2ba1ffa532b605175fcb37c9347ab0f86d2270ad0ebd1"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarSearchTree.isUnloadedTypeFilterContainer (cognitive 23): sidebarSearchTree.isUnloadedTypeFilterContainer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf43802780a99391fcef55fa13819a460fd9c95e73f6fd6dce2442ee8c324c4"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarTreeArrowNavigation.sidebarTreeArrowAction (cognitive 23): sidebarTreeArrowNavigation.sidebarTreeArrowAction has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTreeArrowNavigation.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5bd14f441aa6cfcf5096636cd2a5b0317d5b20921a88185061195c883554b1"}},{"ruleId":"D2","level":"warning","message":{"text":"xuguTypeMembers.buildXuguTypeMemberNodes (cognitive 23): xuguTypeMembers.buildXuguTypeMemberNodes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (8 pts), boolean chains 6, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/xuguTypeMembers.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1da90585670f9bd0ad01b837e5581b50ec320516416d761f3ca311ca944e875"}},{"ruleId":"D2","level":"warning","message":{"text":"ddlDisplay.applyDdlDatabaseQualifier (cognitive 23): ddlDisplay.applyDdlDatabaseQualifier has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d686bcd5aa52a836f50b362944d0ef49d01a0e23564e9e01d3ff9537e8de96a"}},{"ruleId":"D2","level":"warning","message":{"text":"errorPosition.resolveSqlErrorOffset (cognitive 23): errorPosition.resolveSqlErrorOffset has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 5, boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/errorPosition.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b90f1dd3cba13a35f78112b0e8c185f145550a1744107d8f443e00e41c394f8"}},{"ruleId":"D2","level":"warning","message":{"text":"insertValueHints.findEnclosingDollarQuoteStartInText (cognitive 23): insertValueHints.findEnclosingDollarQuoteStartInText has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (3 pts), boolean chains 1, ternaries 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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"be52ee1dd19e45a25dc55e5cce5fbe9fe01b7be4d3525ea79044e581a305b745"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlAnalysis.analyzeSelectStructureForDisplay (cognitive 23): sqlAnalysis.analyzeSelectStructureForDisplay has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, ternaries 8, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"3046f1f88c8feb5df638df43ddc4d24db13d8651c5bfd8d0e3a0fc0f501d626d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlAnalysis.parseFromSources (cognitive 23): sqlAnalysis.parseFromSources has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce105f11eebf5148f47d1113998e90e328becb043ef533d3eee7d0f02cacdab4"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.parseXmlAttributes (cognitive 23): sqlParameters.parseXmlAttributes has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 5 (10 pts), boolean chains 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af3618ba41f4d0a43db6d5f4a25e7e0da4fb7a361aa631c911a0b33d0e54f3c"}},{"ruleId":"D2","level":"warning","message":{"text":"routineParameters.parseXuguRoutineParameter (cognitive 23): routineParameters.parseXuguRoutineParameter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecea5b37189512b082f5e0d2a845116dd39e4042d9c156a530c05aaeaf2af8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"tableDataExport.fetchTableDataForExport (cognitive 23): tableDataExport.fetchTableDataForExport has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableDataExport.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2f657cec4dc7e1eeb58ca886304f76855906fca6fd0a80d29d7054640cc878"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.sidebarTableSearchIndexManifestEntry (cognitive 23): connectionStore.useConnectionStore.sidebarTableSearchIndexManifestEntry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 10, boolean chains 1, loops 1 (nesting depth added 6). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (findPath, a function literal at line 3886). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3861}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8ab72cf3453ed63b7a9fd9d113f2267e1a052963b77f4b23a02f559ffdb17f"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.updateConnectionDatabaseInfo (cognitive 23): connectionStore.useConnectionStore.updateConnectionDatabaseInfo has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5065}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7eb2c96f5f27955eb009bedcf21ec48967c042c5f63adc45175f7285346e20"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.buildHiddenPrimaryKeyPreparation (cognitive 23): queryStore.useQueryStore.buildHiddenPrimaryKeyPreparation has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 9, if/else 4 (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7695}}}],"partialFingerprints":{"codehealthFindingId/v1":"963d654e546fbc9ca01b54810057cae76a9127b34b75c1b863fba652b4ad75f1"}},{"ruleId":"D2","level":"warning","message":{"text":"savedSqlStore.useSavedSqlStore.updateFilesExecutionTarget (cognitive 23): savedSqlStore.useSavedSqlStore.updateFilesExecutionTarget has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, error handling 2 (4 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f583f462a9e73c124550f575b9c345538de3504115deab4bd47ac2763fdf8f"}},{"ruleId":"D2","level":"warning","message":{"text":"transferTaskStore.normalizeTask (cognitive 23): transferTaskStore.normalizeTask has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (7 pts), loops 1 (2 pts), ternaries 2 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe78eea591c1b0d0f4f8c5472358aec4d7860ffe62e9b56a288b2391ddfa0a50"}},{"ruleId":"D2","level":"warning","message":{"text":"seedApi (cognitive 23): seedApi has cognitive complexity 23 (threshold 15). Drivers by points: error handling 5 (10 pts), loops 4 (5 pts), if/else 1 (3 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 9). Of this number, 22 points are the body\u0027s own statements and 1 belongs to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/seed.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"71723e45fe8147e0f8222ab7acd0659e00961bba9f5586a22064da3b9f0b1646"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::mq_admin_config_for_connection (cognitive 22): AppState::mq_admin_config_for_connection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":5301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d5ff74d2a3099dbcfa77dcd77b06a2c285a09a7faf27513059ae913957c7c7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::nacos::search::process_candidate_page (cognitive 22): dbx_core::admin::nacos::search::process_candidate_page has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/search.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"05122b262f21d9ff231a0e63fbdafcc9dfc7d267a6006854620fdbcd1c09c60f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::begin_database_backup_snapshot_core_for_export (cognitive 22): dbx_core::data::database_export::begin_database_backup_snapshot_core_for_export has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76010508ba00e8adcea2f20f0ef2530b2224f8d882d8ddcab92cc5d3a4f05f3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::docs::annotations::apply_annotations (cognitive 22): dbx_core::data::docs::annotations::apply_annotations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/docs/annotations.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aa8a77bf56337ac8a59b053725adc78b8a57e6c7e2797f44a5fb1a613a5209"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::infer_csv_types (cognitive 22): dbx_core::data::mongodb_import_export::infer_csv_types has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"217224723251f1a7edb90a55ad6eb26c43660cf66c448a45736a8412908d289f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::sql_file_import::strip_leading_sql_comments (cognitive 22): dbx_core::data::sql_file_import::strip_leading_sql_comments has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c85accf2aa53807278c1b689a470e69511a451724fca98420165eb0c715c28"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_postgres_schema_dependencies (cognitive 22): dbx_core::data::transfer::transfer_postgres_schema_dependencies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 4, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f24c9a1ba4aeb322a91f6e4ef1981f5a62d10eedd1cc0049e3c248a439a3fd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer_rebuild::view_query_target_references (cognitive 22): dbx_core::data::transfer_rebuild::view_query_target_references has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 6 (7 pts), boolean chains 5 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_rebuild.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"69544d739c4ea96cf4adb1af344852d51fee813fbee6a33a4a2229ae9cb9ad83"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::persistence::storage::apply_sync_tunnel_profiles_in_tx (cognitive 22): dbx_core::persistence::storage::apply_sync_tunnel_profiles_in_tx has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":9830}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49415776bc04cb24e076153802faa9afaca4410e123615a4ebf839247201f38"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::document_ops::find_documents_core_with_total (cognitive 22): dbx_core::query::document_ops::find_documents_core_with_total has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f947501e5132d6f3f6e7517d392d2ee705eb21fd380591d3740b7e11a5a07b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::results::read (cognitive 22): dbx_core::query::pl_debug::results::read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/results.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f92a349250521451937513154212def6fcf811cd3a5c5af26cc60efa4cf7bc"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::native_job_prepare_with_references (cognitive 22): dbx_core::schema::native_jobs::operations::native_job_prepare_with_references has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49b0dc98aec9de523648d274ae10227af9f6ade12c7ad33d82af8e52d7009eb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::dameng::run_configure (cognitive 22): dbx_core::schema::native_jobs::operations::dameng::run_configure has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f5d2b993b151aa24ce5cb8a1c94d6f3c632689c918b5affdd02054f1683686"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::transfer::packages::pending::read_completed_table (cognitive 22): dbx_core::schema::oracle_routines::transfer::packages::pending::read_completed_table has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages/pending.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"22307a561dac13ac04ec432a74a2e55bd3811b18a1a42f71bbcc3c78f553b972"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::read_shell_regex_literal (cognitive 22): dbx_driver_mongodb::mongo_shell::read_shell_regex_literal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"827aa9456066c6867358281ffb61179dacf41fb2f8bbdc23e334a9e3709c7c8d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::matching_paren (cognitive 22): dbx_driver_mongodb::mongo_shell::matching_paren has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3fadf8b2ad387ac954f2348f1e4597aa74055ee3019ed2a5d9094f895cf39a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::split_top_level (cognitive 22): dbx_driver_mongodb::mongo_shell::split_top_level has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"603341a6db5201793a73b901a355c8efc18b0890895b65b3e0e7c9a0d234fb7e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::execute_result_set_with_text_protocol_on_conn (cognitive 22): dbx_driver_mysql::mysql::execute_result_set_with_text_protocol_on_conn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6063}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff9200ecf8d7237a4254a6625348f59df8f9169d15c9ca1c108dd17763d16f0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::cloudflare_d1::sql_lexer::complete_sql_statements (cognitive 22): dbx_drivers::db::cloudflare_d1::sql_lexer::complete_sql_statements has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1084f5a65c43bc566d29bb225374a995943d1d308e4e5ef5b1792b9cd8d70ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::transport_layer_tunnel::start_transport_layers_internal (cognitive 22): dbx_drivers::db::transport_layer_tunnel::start_transport_layers_internal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/transport_layer_tunnel.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e457586804e4cf4c53a70ab928b95adf50d0eb9c7f530aec8175d8eb5e92cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::visible_scoped_tools (cognitive 22): DbxMcpServer::visible_scoped_tools has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (9 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f231a342cfe23a05f10df91b6f6366c609364912ff15e1b5f69c85cbcda4532"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarType::read (cognitive 22): ScalarType::read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd2caa028b63539cb5bfed8493def97f1d853231977d3cb55259a5787443568"}},{"ruleId":"D2","level":"warning","message":{"text":"HanaScriptBlock::is_complete (cognitive 22): HanaScriptBlock::is_complete has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4052}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde1e283434e3d1663c46405a72d983f8f7f575dd88e6172b1b5dfad094924c2"}},{"ruleId":"D2","level":"warning","message":{"text":"OraclePlSqlBlock::with_function_is_complete (cognitive 22): OraclePlSqlBlock::with_function_is_complete has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b861c572db4153db7d9c43b21db0f49d194a6a6c229d53e3a6725cc63dd694d1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_routines::analysis::package::block_contents (cognitive 22): dbx_sql_core::object_source_sql::oracle_routines::analysis::package::block_contents has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0fe07201e3b75186a0e4a51c794351c1ac474152b6b90e7e7e0eb4752fbf4d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_routines::analysis::package::parameters (cognitive 22): dbx_sql_core::object_source_sql::oracle_routines::analysis::package::parameters has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"42062c826c8d4c401d943d515890ae3de519794da13d0ea43080072332f20e1e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_trigger::prepare_oracle_trigger_sql (cognitive 22): dbx_sql_core::object_source_sql::oracle_trigger::prepare_oracle_trigger_sql has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_trigger.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3dd4e96f8ca509567064f56face38ee44aab9ecd7d024fcfe9e85f773209d4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::split_statement_range_at_blank_lines (cognitive 22): dbx_sql_core::sql::split_statement_range_at_blank_lines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3699e1c71caa16053720c7c6568affd581456496ad74a38c5fc66cc5bf1d81"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_analysis::strip_mysql_table_comment_if_parseable (cognitive 22): dbx_sql_core::sql_analysis::strip_mysql_table_comment_if_parseable has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"226ec3baf4aa5647cdfa8c5c00af8896ba6910c482af20d669453c68957ec965"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_editability::parse_expression_alias (cognitive 22): dbx_sql_core::sql_editability::parse_expression_alias has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c193bf491e5a6f6663686269f5b71a5e457329abc8c306828384f8cde5eca2b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_editability::find_top_level_keyword (cognitive 22): dbx_sql_core::sql_editability::find_top_level_keyword has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"112054de7c7c3a07474c7eb5eec203854237f74027b1a4bb8f8a523cc056bd95"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_extractors::sql::write_sql_deletes_inserts (cognitive 22): dbx_sql_data::data_grid_extractors::sql::write_sql_deletes_inserts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d1a5da8801e51074343c82b12001a44871ac47cdbe8a969d013afe9f2bbfa9"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraph::collect_uncovered_edges (cognitive 22): DependencyGraph::collect_uncovered_edges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b76b4f8c7b82148d8c5fcf587bb32ba04954f555a3157a51efb204715314a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_jobs::native_job_list_queries (cognitive 22): dbx_sql_schema::native_jobs::native_job_list_queries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 4, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_jobs.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2980fe4631e770d0156f89b37006d25e78b10205ea388d78aee3a1b9c1deb063"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::validation::validate_gin_opclass_warnings (cognitive 22): dbx_sql_schema::table_structure_sql::validation::validate_gin_opclass_warnings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/validation.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6471483b3f1371f7ff3f1f469e86e60269f7b058fcf1fffbf17d50c1620ef33f"}},{"ruleId":"D2","level":"warning","message":{"text":"JsSafeCell::serialize (cognitive 22): JsSafeCell::serialize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/types.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c80b16ed8fe1439f5c594077a1c1b977ca5e8fb3e0fb2f858dd60e022e292a4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_packager::run_package_cli (cognitive 22): dbx_plugin_packager::run_package_cli has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/packager/src/main.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39f8ebbd8dd4f64729cf5aadae44454b63dd7cdc69925bc1abbc51f7e0fa9d9"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentRpcError.classify (cognitive 22): AgentRpcError.classify has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (9 pts), boolean chains 8, if/else 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AgentRpcError.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"959e0ee4fb229319201b69f8f59e0f5e36df2ae62385394c383e9e368f6d4094"}},{"ruleId":"D2","level":"warning","message":{"text":"JdbcConnectionAffinity.sanitizeSql (cognitive 22): JdbcConnectionAffinity.sanitizeSql has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionAffinity.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e7dc7c8565cae694be624a3b4ef960c19131502b314bcd3f4d85bbd9c0e323"}},{"ruleId":"D2","level":"warning","message":{"text":"JdbcExecutor.withStatementMessages (cognitive 22): JdbcExecutor.withStatementMessages has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (3 pts), error handling 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea36d664519bf1138cd6f60c80f93f627d0c4f3edf615585fdcce246ccddc8e"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryResult.normalizeRowsWithSpatial (cognitive 22): QueryResult.normalizeRowsWithSpatial has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (7 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/QueryResult.java"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b313d2131d2ad7eee0d00b3eb1a9db4e08e7bb47eb7c2e43af5a6630870edeb4"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseOracleAgent.completionAssistantRoutines (cognitive 22): OceanBaseOracleAgent.completionAssistantRoutines has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 4 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"565de4d2ccf9a137fb0972a49a2346e211d7bf08c493e31570e26f80abbb715e"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseOracleAgent.typedLobUrl (cognitive 22): OceanBaseOracleAgent.typedLobUrl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (4 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db1443d4a65e5a146976fbbb57efdcde68d31703a317862261e860c372aee67"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugBreakpointInventory.confirmSet (cognitive 22): PlDebugBreakpointInventory.confirmSet has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugBreakpointInventory.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f60986b37ca2fe47d25d444699031b71b55e7c79de7c957955f12451c3f99a"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompile.readback (cognitive 22): PlDebugCompile.readback has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompile.java"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4160a0c106c5fe17a8c8c0739b5f67d463ebdc6499ccb0dffd75397f8b7784"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugManager.changeBreakpoints (cognitive 22): PlDebugManager.changeBreakpoints has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (12 pts), loops 2 (4 pts), if/else 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"315eb7df653189220f7ab822ce1d5154683e476201e083369d85b6a7c218ae5d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.finalizeKerberosConfig (cognitive 22): main.finalizeKerberosConfig has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9061dfe3c43935f0ffc54a161fd57738aac4597e28fed45b6fec004ec08301"}},{"ruleId":"D2","level":"warning","message":{"text":"main.legacyMaterializedViewOptions (cognitive 22): main.legacyMaterializedViewOptions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/materialized_view.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0889291cf9f35dc8f52a530206e28f905de80d30341f92f037db567175308a97"}},{"ruleId":"D2","level":"warning","message":{"text":"main.finalizeKerberosConfig (cognitive 22): main.finalizeKerberosConfig has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"591acd15752767953accc9c0b080d3e90544950e3d033ec80095d643dc41d53a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.errorResponse (cognitive 22): main.errorResponse has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (10 pts), match/switch 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/rpc_errors.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6acf2d7ef9be7f21bfeb885f97f4af9da388759e69d2c7967c380be824b65e2"}},{"ruleId":"D2","level":"warning","message":{"text":"server.oracleUniqueIndexMetadata (cognitive 22): server.oracleUniqueIndexMetadata has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca4fa7b9c84f8047ebc9020d9611c5b998bcd83b7264ad1ca89414e46ce7e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.recoverOutput (cognitive 22): plDebugNativeEntry.recoverOutput has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 4). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4a880a5c0fce2ee0c285192a95c80f7b46bc9285aa56c989e440a22a4d048c"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.nativeExternalPackageVariableNames (cognitive 22): plDebugNativeEntry.nativeExternalPackageVariableNames has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6, loops 3 (nesting depth added 1). Of this number, 18 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_variables.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"27784cad3f35a9633bc6f83ea154da2388a9c15c6686a51e27beeebde4df7e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeRoutineScan.ownerAtLine (cognitive 22): plDebugNativeRoutineScan.ownerAtLine has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"da936db3198b8df651b95ba87d5afbf482922a66f16c5f83d8645db8830b34a9"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getObjectSource (cognitive 22): server.getObjectSource has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6da2989cf4f2a020e6bf5c8b999feccea2d70098eb971564bbecdddabc91e1"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.mergeSqlServerControlFlowBatches (cognitive 22): sqlStatementRanges.mergeSqlServerControlFlowBatches has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"218d00fcc57e1cdd87b8fe746e6794816418d2fafebff1cf43262bc656c5b3a5"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferValues.binaryLiteral (cognitive 22): queryResultTransferValues.binaryLiteral has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 2 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9d1153b26e33bd849ef5418166d0906263ab55cc99d5ca9345780de85de32b"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridCanvasRuntime.useDataGridCanvasRuntime (cognitive 22): useDataGridCanvasRuntime.useDataGridCanvasRuntime has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 8, error handling 1 (2 pts) (nesting depth added 1). Of this number, 20 points are the body\u0027s own statements and 2 belong to 4 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridCanvasRuntime.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"592f0f07b0bbacb3bd69d1c74661ba01c0c5ea835be5f5b93e3b1bb942ef6e55"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridLargeValues.useDataGridLargeValues.prepareSaveBaseline (cognitive 22): useDataGridLargeValues.useDataGridLargeValues.prepareSaveBaseline has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, loops 3 (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f07180c56fd535fb55547d4399d46ea2da7bd99bd55a9123cf186d10241b203"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridScrollbars.useDataGridScrollbars (cognitive 22): useDataGridScrollbars.useDataGridScrollbars has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, boolean chains 9, loops 1 (2 pts) (nesting depth added 1). Of this number, 21 points are the body\u0027s own statements and 1 belongs to 4 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridScrollbars.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"93981ef2f0a9c3e6cb7a575259ba45c9ca08eb31ee8f99904890ad785c061c4c"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridSearch.useDataGridSearch (cognitive 22): useDataGridSearch.useDataGridSearch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 4, ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 122, 162). 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":"apps/desktop/src/composables/useDataGridSearch.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"26443a36e5b8940f666afe1be602c60b13344100de3cd89296fa1574ebd6aeef"}},{"ruleId":"D2","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.loadStructurePreview (cognitive 22): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.loadStructurePreview has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef21c7154b2ec965aaa70d57366ce3bc4a1f6e6b5fdaa578dbed86c0f203ee0f"}},{"ruleId":"D2","level":"warning","message":{"text":"aiIntentRouter.routeByRulesUnchecked (cognitive 22): aiIntentRouter.routeByRulesUnchecked has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 10. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiIntentRouter.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfcc573fdcd493c22031f4ee7638c95dd464b786db98a075f6c6594220e4590"}},{"ruleId":"D2","level":"warning","message":{"text":"aiMessageRender.parseAiMessage (cognitive 22): aiMessageRender.parseAiMessage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiMessageRender.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bd16612de80fa2024d7c4f600fa6a7be5d535bdca2f187fe887daeb390cf76"}},{"ruleId":"D2","level":"warning","message":{"text":"LightweightJsonScanner.readStringValue (cognitive 22): LightweightJsonScanner.readStringValue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd74668e15579914e836ab2723edf345ec3c0824afcd259f37afd2f0f0cdf662"}},{"ruleId":"D2","level":"warning","message":{"text":"floatingViewportPosition.visibleTriggerRect (cognitive 22): floatingViewportPosition.visibleTriggerRect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/floatingViewportPosition.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6594ceb5211190a305e8db07b7d84867b283dbb580fa16da941764382620eb35"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionDeepLink.parseConnectionDeepLink (cognitive 22): connectionDeepLink.parseConnectionDeepLink has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 4, error handling 2 (3 pts) (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"80395edc4ca54ac2d2351fabd01dcc37cb485592c3ab85e9e9e378cd0a80c293"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrlBuilder.standardUrlScheme (cognitive 22): connectionUrlBuilder.standardUrlScheme has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"054cfbabf99d9552289996d72798c2919bc8faf97ba34e0614b5e146fcfd6863"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrlBuilder.connectionUrlCopyFormats (cognitive 22): connectionUrlBuilder.connectionUrlCopyFormats has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"50435389526f338908b7e6cb8500ca49389d0897cc3e0c647b0195765a2a67d8"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridContextMenu.createDataGridCellContextMenuItems (cognitive 22): dataGridContextMenu.createDataGridCellContextMenuItems 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":"apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a399c0eef20f338c7612eeb1f1b4c820089d9033f2260ac114afbdee0d70e4"}},{"ruleId":"D2","level":"warning","message":{"text":"gridNewRowPlacement.buildOrderedGridRows (cognitive 22): gridNewRowPlacement.buildOrderedGridRows has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3, ternaries 1 (2 pts) (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/gridNewRowPlacement.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8659b4d87cd0d9c963d7070acf6da58e37628b8e41ce9ce297b910d3d8778885"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTriggerStructurePlan.reconcileOracleTriggerStructureDraft.rebase (cognitive 22): oracleTriggerStructurePlan.reconcileOracleTriggerStructureDraft.rebase has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerStructurePlan.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f1d937be6742c3ea73f519eeed2c8190a2872e68706758c840cf1247694388"}},{"ruleId":"D2","level":"warning","message":{"text":"draft-table.validateDraftTable (cognitive 22): draft-table.validateDraftTable has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/draft-table.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e03eb34b82e2104e580a4a20468289460496ba396dc25730441827acc089801"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorSqlBlockFolding.gapIsWhitespaceOrComment (cognitive 22): codemirrorSqlBlockFolding.gapIsWhitespaceOrComment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorSqlBlockFolding.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2836119bfe9031c8c25144a864d70e9d1a10324add5ebd227af8767029c785"}},{"ruleId":"D2","level":"warning","message":{"text":"plainTextSelectionRanges.scanBracketRanges (cognitive 22): plainTextSelectionRanges.scanBracketRanges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/plainTextSelectionRanges.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9f8e17efb4fe4ee5ba234302f5c836aadb8851fd7bc30a1776551c86e4e033"}},{"ruleId":"D2","level":"warning","message":{"text":"shortcutRegistry.computeNormalizedShortcutSettings (cognitive 22): shortcutRegistry.computeNormalizedShortcutSettings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 2, ternaries 2 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/shortcutRegistry.ts"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"037eba3c0533a516b6a945401c9ef2444ee3c1d1e3d2ea3500a6390ccc81d841"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlHoverSearch.applyHoverSearchHighlights (cognitive 22): sqlHoverSearch.applyHoverSearchHighlights has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlHoverSearch.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b916a28ae56f7000c8207cb298df774478eb47910007ceec3e5f558b3d249b8"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlIntentionActions.buildBatchQualifyActions (cognitive 22): sqlIntentionActions.buildBatchQualifyActions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d240760971e1eb3dcfaee19906ee7717b1281f98903369bd93d034d4c3f78cba"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseExport.runWithDatabaseBackupSnapshot (cognitive 22): databaseExport.runWithDatabaseBackupSnapshot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (6 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExport.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8b886963b09c87c09a85c0b91c67f998f2049dd05b642d5924795cb2d934bb"}},{"ruleId":"D2","level":"warning","message":{"text":"tableMetadataCache.loadTableMetadata (cognitive 22): tableMetadataCache.loadTableMetadata has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, ternaries 5 (9 pts), if/else 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07c8aefd183cf3d767effacb325a88d0e71ba8d8827468e731b27fcca35bbd1"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.classifyJsonSchema (cognitive 22): mongoCompletion.classifyJsonSchema has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50c4a7117ab8dcfc5bbae9b66e264d732674b027c809086e1337605856de63d"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.matchCursorMethodDot (cognitive 22): mongoCompletion.matchCursorMethodDot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d725d540611b6bad8b49e98b0f6e89c668c236d19d7a29ed34e1b549a20439"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.skipMongoStringOrComment (cognitive 22): mongoCompletion.skipMongoStringOrComment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"918d37541f18070b4581deb8a5b0deefa2a3c1144537d13e459f2917e5ec7e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.isInsideMongoComment (cognitive 22): mongoCompletion.isInsideMongoComment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 6, ternaries 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45f2cfffa54fced16c0a07ffd3b42898c422f4a1d10a1c7103e29930ba7ebab"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoDocumentValues.buildMongoCopyDocumentFromOriginal (cognitive 22): mongoDocumentValues.buildMongoCopyDocumentFromOriginal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0480dcce963fbec032cb0eaccf61f62a9fdfb7db718f8fd861eae551a37c7d"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.parseMongoCommand (cognitive 22): mongoShellCommand.parseMongoCommand has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 14, if/else 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 2). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 1053, 1057, 1061, \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a4d6e8b55f69bb1105a0eafb29ebe4fbde2b2fbdc6d756d25361d8405dd3ad"}},{"ruleId":"D2","level":"warning","message":{"text":"pluginFloatingWindow.startFloatingWindowReaper (cognitive 22): pluginFloatingWindow.startFloatingWindowReaper has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4, boolean chains 1, ternaries 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 787, 803, 774, \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":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbc76c6352f252e58b2784205f8e89bbd825a9bf8a6c9f82ef7376b7d8ed857"}},{"ruleId":"D2","level":"warning","message":{"text":"batchQueryPagination.prepareBatchQueryPagination (cognitive 22): batchQueryPagination.prepareBatchQueryPagination has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, error handling 1 (2 pts), ternaries 2, loops 1 (nesting depth added 7). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 28, 58). 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":"apps/desktop/src/lib/query/batchQueryPagination.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb97822c3d65eed9c1bed11bf0f269660dd6021092d63d7639975f25fe155e6"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarLayoutMonitor.detectLayoutAnomalies (cognitive 22): sidebarLayoutMonitor.detectLayoutAnomalies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 9 (nesting depth added 5). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec9b19fa2ad8ad2886811c233df6e98dc4fc3ef2b74137ad5dc92747d36f1a1"}},{"ruleId":"D2","level":"warning","message":{"text":"cypherFormatter.formatCypherText (cognitive 22): cypherFormatter.formatCypherText has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf64f8a5ab676c7224df46f09249ec60a91e68c8557b242c50a0da8834d7b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"model.clauseSpans (cognitive 22): model.clauseSpans has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf2b98b6aa764b86bf671ecfb56675a493c9dfa88ebbb76e7587ecfdd2fa798"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlAnalysis.parseSelectColumns (cognitive 22): sqlAnalysis.parseSelectColumns has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff265e4ef886d0af6d1c5492466f63d52fc528dd1b9881ee1a116fb9c662a92e"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlAnalysis.parseTableSourceAt (cognitive 22): sqlAnalysis.parseTableSourceAt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 5, boolean chains 3 (nesting depth added 4). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"87623cbc1152922346bcef35a8a9ffbcecdbfd2ca10126bbd29673e3a8257884"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.maskSqlLiteralsAndComments (cognitive 22): sqlCompletion.maskSqlLiteralsAndComments has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 15, if/else 4 (6 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f767de4c049e1d5924d7f8df59d367164f27fe2a1fea5008ae7f548a56c87e2f"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.splitQualifiedNameRawParts (cognitive 22): sqlCompletion.splitQualifiedNameRawParts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4858}}}],"partialFingerprints":{"codehealthFindingId/v1":"1440d1e1b9e7861b8a89a551a92e1eef77cba0e053cde5b8a564619861c41552"}},{"ruleId":"D2","level":"warning","message":{"text":"tableDependencySort.sortTablesByFkDependency (cognitive 22): tableDependencySort.sortTablesByFkDependency has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableDependencySort.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec037eb3bd38ca4633b26015021a209de291cc3dfb309c0fad09f09a85a4301"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.tabModeLabel (cognitive 22): tabPresentation.tabModeLabel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 21, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b419a6860928617c34d6dadbde0520159ad5a1665d169aa8dd48d8edd78e22"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.parseConnectionsImport (cognitive 22): connectionStore.useConnectionStore.parseConnectionsImport has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11750}}}],"partialFingerprints":{"codehealthFindingId/v1":"744eebe99e6ac8170353095f6f04da19c19bf005a8d13c9697c44409b15a107b"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.runOracleTriggerSourceAction (cognitive 22): queryStore.useQueryStore.runOracleTriggerSourceAction has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 9, error handling 1, ternaries 1. Of this number, 18 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1058ed9f83872467b3e1d5bcb6199ea731a5d935b775916df67003e3d3f91f4"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.openPluginWorkbench (cognitive 22): queryStore.useQueryStore.openPluginWorkbench has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 7, ternaries 3 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4561}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf64eaaf88437c8352b6af1ebe481ac7daee2cb5e0e5aef9547ae2053b056f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.executeTabSql::executeWithoutManualTransaction (cognitive 22): queryStore.useQueryStore.executeTabSql::executeWithoutManualTransaction has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 11 (14 pts), boolean chains 6, if/else 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. This shape REPEATS in the file: 2 other methods here (queryStore.useQueryStore.executeTabSql, queryStore.useQueryStore.executeTabSql::bindLargeValueContext) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9615}}}],"partialFingerprints":{"codehealthFindingId/v1":"2550cbdc65358d02d43ff985868e22d776359d72166df992dfdbcb394817cac1"}},{"ruleId":"D2","level":"warning","message":{"text":"worker.handleInstallBeacon (cognitive 22): worker.handleInstallBeacon has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, error handling 2 (3 pts), ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"37727eaf5816a3b12c6243d2321ba6cfe004bb79692c3bfa4ea369b2b0bee481"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallTabs.InstallTabs (cognitive 22): InstallTabs.InstallTabs has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 12 (16 pts), if/else 5, boolean chains 1 (nesting depth added 4). Most of this is not in the body itself: 6 of the 22 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 325, 242, 251, \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":"docs/components/landing/InstallTabs.tsx"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c992c4a6d9165c092f76ff684d501480408e7e94189bef0d26104602d5e2ec"}},{"ruleId":"D2","level":"warning","message":{"text":"agentBundle.parseTarEntries (cognitive 22): agentBundle.parseTarEntries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/lib/agentBundle.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e3b0f4d1bace15595f7da6a1660aea10776f7cc23d22fcc373646333600ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"json.findMatchingParen (cognitive 22): json.findMatchingParen has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e435e467bd56cf99134a2a149335f494d9d50628613480148e25b9c6f75f84"}},{"ruleId":"D2","level":"warning","message":{"text":"i18n.localizeManifest (cognitive 22): i18n.localizeManifest has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (7 pts), loops 3 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/ui/i18n.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"919a3d28da5971a87ef36f5fdcba2aab98c61f8767f581864b190f7286b217e5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::resolve_endpoint (cognitive 21): dbx_ai_provider::ai::resolve_endpoint has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2a2645917280f4ec43f62432ea54eacf04b30267f499bb19e439a9253789d6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::test_connection_core (cognitive 21): dbx_ai_provider::ai::test_connection_core has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7c5e7851c6be24b71e5f0beca93b78b2d752993060588c7843bbda962573f2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai_opencode_cli::parse_opencode_models (cognitive 21): dbx_ai_provider::ai_opencode_cli::parse_opencode_models has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_opencode_cli.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67fe9cd009dffa5a898b31164520743923b37e97103ea737e6d16d27b8f3efa"}},{"ruleId":"D2","level":"warning","message":{"text":"MySqlSqlFileExecutor::execute_statement_inner (cognitive 21): MySqlSqlFileExecutor::execute_statement_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c604e0cb063c30652327afb4acf1851d71a1a67270b15324b2fcfe41d85ae728"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupConfig::validate (cognitive 21): BackupConfig::validate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/models.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af3d0b94d843f5ade09e7647a7d7b58e7a757ca89531f691a280c6af38bdeaf"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyReader::list_objects (cognitive 21): LegacyReader::list_objects has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_triggers.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ec9a515d84a52f0912bad492afa8768c12e8c18ad250a196712245a6c97a28"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::nacos::archive::decode_config_archive (cognitive 21): dbx_core::admin::nacos::archive::decode_config_archive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/archive.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a75a61e0dce7fc9ebc12de137772376a1bea03db2ef1a8c8ca6edc57407d9b1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::connection::jdbc::install_jdbc_plugin_zip (cognitive 21): dbx_core::connection::jdbc::install_jdbc_plugin_zip has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"33172198dd1487a179856f9d75218f4fac1e4dcb19d0062ef99238428b4ec82f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::next_json_value (cognitive 21): dbx_core::data::mongodb_import_export::next_json_value has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a896c04556eb7d979909b1dc7c1b56e5124a723d77f4a7812930d535e74276"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::script_generator::generate_all_dml_clean_sql (cognitive 21): dbx_core::data::script_generator::generate_all_dml_clean_sql has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"860c1a4f64b72b56647ad4f3ec9fd83071036e2a04cf20358e04de2af0cda945"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::validate_transfer_database_pair (cognitive 21): dbx_core::data::transfer::validate_transfer_database_pair has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 10. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f9e7910ea07c36fcb37449c538c650ee9d6f2aaf68a3086b17276e62b365d7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::strip_opengauss_only_table_storage_options (cognitive 21): dbx_core::data::transfer::strip_opengauss_only_table_storage_options has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6470}}}],"partialFingerprints":{"codehealthFindingId/v1":"051e4ddd680ed74ab14f3862f21779155dd91777ae27280a18e7b8a86ed649a8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::rewrite_transfer_source_table_ddl (cognitive 21): dbx_core::data::transfer::rewrite_transfer_source_table_ddl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6547}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee51a2c6a4667d216eba57e2cdb96df33965c8eb5afdba95e54b596f8123641"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::mysql_xugu::preflight (cognitive 21): dbx_core::data::transfer::mysql_xugu::preflight has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60a198642a6dd450527dfb7dbf6d14b04030b5e533bcbc7c6ee21caa80df064"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::oracle_table_contract::types::from_catalog (cognitive 21): dbx_core::data::transfer::oracle_table_contract::types::from_catalog has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract/types.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"81720e5fc5cc11a937a75f5af4dc918fc5625abe4dc4e0bb820d9598cafebb18"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::lifecycle::observe_isolated_exit (cognitive 21): dbx_core::query::pl_debug::lifecycle::observe_isolated_exit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/lifecycle.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd05dd27bbf98353e4aa54d156d4063f4e84cbe77bb1b677842a6ff39598b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentManager::collect_driver_store_usage (cognitive 21): AgentManager::collect_driver_store_usage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_manager.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4b3e5d5fcccae03080ebd411e5c7349b41506d07a0cfdc0f8351cc7d905233"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_service::install_agent_driver_from_registry (cognitive 21): dbx_driver_agent::agent_service::install_agent_driver_from_registry has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ee426a4963ad6607228ee2732b195799bdc84aac873c48ef92985c8e8383b9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_elasticsearch::collect_mapping_columns (cognitive 21): dbx_driver_elasticsearch::collect_mapping_columns has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86a9056df3bb6266e2a2de1ef44b8fb2d75a8e45a3ff7d0d2bde120ec86f8e6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_elasticsearch::es_execute_paged_search (cognitive 21): dbx_driver_elasticsearch::es_execute_paged_search has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f2f48839b17565813aff71f142a971a0afc5da841fe8bf837ffbd6f69210e0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_oidc::wait_for_callback (cognitive 21): dbx_driver_mongodb::mongo_oidc::wait_for_callback has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1754074ea738e86e00939beb67c266dfefaf8262666fd3415c19cb37074905"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::resolve_doris_opaque_column_types (cognitive 21): dbx_driver_mysql::mysql::resolve_doris_opaque_column_types has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"a570bc619acd6d198a8aa34194dfc71075aa797a358553e1891f27a285d64684"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_column_type_name (cognitive 21): dbx_driver_mysql::mysql::mysql_column_type_name has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ec01dc73f446d930b161bf6d1b4708b2d3bb430e5ce3cb52c328b708535382"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::query_with_column_metadata_fallback (cognitive 21): dbx_driver_postgres::postgres::query_with_column_metadata_fallback has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"054bdb89b6a2a1aea329f85c7620e2b654bda450acda3fcdedd488e54b850d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::hscan_bounded_page (cognitive 21): dbx_driver_redis::hscan_bounded_page has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (dbx_driver_redis::sscan_bounded_page) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0de6c295ab0dbe8cf1e30eeb9e4cb49e529bfc634aa823d287ea38103bae547"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::sscan_bounded_page (cognitive 21): dbx_driver_redis::sscan_bounded_page has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (dbx_driver_redis::hscan_bounded_page) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5382}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd322cb58c0310d9dd685b27053bdf5e7e11ac6a118f98237e488753eee895b"}},{"ruleId":"D2","level":"warning","message":{"text":"WkbGeometry::to_wkt (cognitive 21): WkbGeometry::to_wkt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (3 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/wkb.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"288253b75649b102c2033b0af4d1c5439788c3badd0864fed5f449f046b4c132"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::salesforce_oauth::wait_for_callback (cognitive 21): dbx_drivers::salesforce_oauth::wait_for_callback has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/salesforce_oauth.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"4291b4f26db7f6249390e1a1ebd54e475b90221f2f7ca8ceb23a1c995eefcb1d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::oracle_index_ddl_source_ranges (cognitive 21): dbx_sql_core::object_source_sql::oracle_indexes::oracle_index_ddl_source_ranges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e752c15333dde8db1c1995ee3e84b530d8c2cb30a977b0539919bae586d30db6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_iotdb_sql::build_iotdb_data_grid_rollback_statements (cognitive 21): dbx_sql_data::data_grid_iotdb_sql::build_iotdb_data_grid_rollback_statements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_iotdb_sql.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f41a56b38417e4721a7c9ed9994f5e5a76652442a25472868b6a22ef99d92f2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::line_has_open_line_comment (cognitive 21): dbx_sql_data::query_result_sql::line_has_open_line_comment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":2878}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c49a0946beff412b6729ff50fadb5371a5afc1d5a758dc06240eeb628b8c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_dialect::sql_dialect::table_select::build_select_columns (cognitive 21): dbx_sql_dialect::sql_dialect::table_select::build_select_columns has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"25eeda61fc144f26eedd92da8135fd47155e97bc6f72a2bdd2b1337a8b40d462"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraph::coverage_score_level2 (cognitive 21): DependencyGraph::coverage_score_level2 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b65d0c5b1f948f3ccdac926f77d2e97daed4557700258d7f16075de2400f0c8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::parse_identifier_segment_end (cognitive 21): dbx_sql_schema::schema_diff::parse_identifier_segment_end has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":4658}}}],"partialFingerprints":{"codehealthFindingId/v1":"a672d93ddebce85dbc75125b71cceb77a180fe30d00bd2679cc360573026a35e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::alter_dialect::validate_sort_columns (cognitive 21): dbx_sql_schema::table_structure_sql::alter_dialect::validate_sort_columns has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/alter_dialect.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"16993c1e76f251f401d9d00e7c787ab4caf5862189483270d6767b24b16418d3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_types::models::connection::parse_as400_jdbc_endpoint (cognitive 21): dbx_types::models::connection::parse_as400_jdbc_endpoint has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f293925f211399d7e360acedf8e59cb524404c992e850cb0ce021041294e1e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_packager::validate_unsigned_candidate (cognitive 21): dbx_plugin_packager::validate_unsigned_candidate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/packager/src/main.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b8a1e0a14df53762ed45109992cc799aec09221771a029a380b43a7daef9ec"}},{"ruleId":"D2","level":"warning","message":{"text":"DdlBuilder.buildOracleObjectGrantSql (cognitive 21): DdlBuilder.buildOracleObjectGrantSql has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fdf9362df62b40d44bee6d81c3740d47578b06b2e12ef87d7fe99fb8698fcc"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionFactoryDataSource.getConnection (cognitive 21): ConnectionFactoryDataSource.getConnection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 4, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50674dbaa4962dd3e4099462563ff6076f26b20f737d999aedd01eec9624ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeLegacyJobSession.\u003Cinit\u003E (cognitive 21): NativeLegacyJobSession.\u003Cinit\u003E has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 5, ternaries 2 (3 pts), error handling 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/NativeLegacyJobSession.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1513ce4bba5538b34f12cc0ae07f7fe96d227012cb0cbd24b094dc3390db0565"}},{"ruleId":"D2","level":"warning","message":{"text":"Gbase8sAgent.overrideLocaleParams (cognitive 21): Gbase8sAgent.overrideLocaleParams has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1589c1e9f231e979f7e5b2c7e97075a37dbe874fba2d7fc3988718982bc3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseLobValues.preview (cognitive 21): OceanBaseLobValues.preview has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 7, boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseLobValues.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af06c293bc68587df883fc2fcb512101f88ad4ec3e331c1f01be4f38482ec5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Entry.closeUninitialized (cognitive 21): Entry.closeUninitialized has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 3 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9bc7c6fbe6668245c35353924fbc9d9e5316fd8cc239ee6996a17796ad4694"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugObjectConstructors.callables (cognitive 21): PlDebugObjectConstructors.callables has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugObjectConstructors.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a103d727de4f98a055d7021bc780c40e7d336b3dc71f3a036fbd248175756b3"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSession.start (cognitive 21): PlDebugSession.start has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 5, error handling 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20741547b25ab848781f210eb61bdaa047ee1f756774a45dab5964b005cd9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Source.read (cognitive 21): Source.read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTemporalJson.java"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae13d8af678e3bfe6921194f4a5c1a1bb0744be6c77514aa420c9253c0e83258"}},{"ruleId":"D2","level":"warning","message":{"text":"main.loadJKSTruststore (cognitive 21): main.loadJKSTruststore has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/tls_stores.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a776e3e5ca2bb2137115e9440f6e17af4f8014fd167c8e58723588d2739f4d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.consumeWatchChannel (cognitive 21): main.consumeWatchChannel has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ff710892803a33971ee0c3f1a4bf60c9c824e560acd63eed518d99fde1c8d8"}},{"ruleId":"D2","level":"warning","message":{"text":"etcd2Session.rename (cognitive 21): etcd2Session.rename has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/kv.go"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba802b678f74869348133bcaf90671f3d3d538b3266907cf7c393c56ca46385"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getTypeDetails (cognitive 21): server.getTypeDetails has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a65914f5d9728d9b50eb23c556ae94d67e05d01a6fe02db25d89a0e1404b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listTriggerDefinitionsFor (cognitive 21): server.listTriggerDefinitionsFor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, loops 2 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fd0e8c060fbffcb4e6eb35f98a6a3e43980168db6c6d9dd58caecb5bfc9490"}},{"ruleId":"D2","level":"warning","message":{"text":"agentSession.getTableDDL (cognitive 21): agentSession.getTableDDL has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/metadata.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7a3b4f18ba084941d1f21f05485a368ab9896d1b02b634367e4c9472fe1baf"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeServer.dispatch (cognitive 21): runtimeServer.dispatch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/main.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bbf4e495fb0d2071cf772cdbdd940afe369f3123a6870bc5fa03a4d7966001"}},{"ruleId":"D2","level":"warning","message":{"text":"main.oracleExplainPlanBindParams (cognitive 21): main.oracleExplainPlanBindParams has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4556}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb281c098cc3151b0418b1b984e8c35f79679b9917f2753c6e66be647f39d5d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseSingleOracleTableRef (cognitive 21): main.parseSingleOracleTableRef has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5565}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3214f8189d959ea113d2b9dcadbfb5d1f757b4de46d9ea3051224054d2c6cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugRevalidateNativeTypedSignature (cognitive 21): main.plDebugRevalidateNativeTypedSignature has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (7 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":"agents/drivers/oracle-go/pldebug_typed_signature.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a1964ea77222f8aea580ccb2992c10b15fead13177b2f30bc386b9d33f0bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listIndexesWithIdentity (cognitive 21): server.listIndexesWithIdentity has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3212}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cdb8f82487b39b90c8a5b35158b03cddc5d511553308179057a85b99da0eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativePlan.timezoneTypes (cognitive 21): plDebugNativePlan.timezoneTypes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (7 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":"agents/drivers/oracle-go/pldebug_timezone.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf73d30f87ff78d33ff4de474ac2452b7961931aae1044702cc1ecdabab13264"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeTypeLoader.containerVersion (cognitive 21): plDebugNativeTypeLoader.containerVersion has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_type_graph.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4261e52c49319963848729a90ec5a01a34b8bfd49c8ef220e5a1f35902b78964"}},{"ruleId":"D2","level":"warning","message":{"text":"rocketMQAgent.createACLs (cognitive 21): rocketMQAgent.createACLs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/acl.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a98809cbcfd22c0e9d77739e122b50fba71a237a4fee8bfb233df0fbc472f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"rocketMQAgent.deleteACLs (cognitive 21): rocketMQAgent.deleteACLs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 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":"agents/drivers/rocketmq/acl.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"787a7c6223de2c0fdafbb4865a187d5d736747dc754e6659b7340a1de2c15084"}},{"ruleId":"D2","level":"warning","message":{"text":"main.rewriteNativeConnectionStringSSLMode (cognitive 21): main.rewriteNativeConnectionStringSSLMode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"65437d59356df118099fdd855a8ba1fd02248e81723f01673c69886ad4a7dc3d"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getTypeDetails (cognitive 21): server.getTypeDetails has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d87c2b453818f7f9f4423492df12f918edcee6a6802454e0ff014303b1e724e"}},{"ruleId":"D2","level":"warning","message":{"text":"main.xuguListObjectsQuery (cognitive 21): main.xuguListObjectsQuery has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39d2feabf2e9d8239174b3ce0c8d227e64445049aa9623c6a958962b7496657"}},{"ruleId":"D2","level":"warning","message":{"text":"main.splitXuguTopLevel (cognitive 21): main.splitXuguTopLevel has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":5767}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6f15af08262e2c86d8ec911fafbe40e0f50cf3e229e267809ed67062942c19"}},{"ruleId":"D2","level":"warning","message":{"text":"server.put (cognitive 21): server.put has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/operations.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"63adb8f3a78f087f8340dcb17d5619d0ea78840e6463a817f2e164db383e1a46"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.ExecuteQueryStatement (cognitive 21): Session.ExecuteQueryStatement has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 3 other methods here (Session.ExecuteAggregationQuery, Session.ExecuteAggregationQueryWithLegalNodes, Session.ExecuteFastLastDataQueryForOnePrefixPath) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc2fee88cf50d1659f9abbf22bf4c6040360befc789b919b77727c6c821f762"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.ExecuteAggregationQuery (cognitive 21): Session.ExecuteAggregationQuery has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 3 other methods here (Session.ExecuteQueryStatement, Session.ExecuteAggregationQueryWithLegalNodes, Session.ExecuteFastLastDataQueryForOnePrefixPath) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"6858582932ec6770a917a1b6c7ab832f894091dbdc5e635bac38e3e15c465f2e"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.ExecuteAggregationQueryWithLegalNodes (cognitive 21): Session.ExecuteAggregationQueryWithLegalNodes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 3 other methods here (Session.ExecuteQueryStatement, Session.ExecuteAggregationQuery, Session.ExecuteFastLastDataQueryForOnePrefixPath) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee66e2cdabf5107b6d2936a7d9279a6b998775d44c711aa013dc9c0e570a6c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.ExecuteFastLastDataQueryForOnePrefixPath (cognitive 21): Session.ExecuteFastLastDataQueryForOnePrefixPath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 3 other methods here (Session.ExecuteQueryStatement, Session.ExecuteAggregationQuery, Session.ExecuteAggregationQueryWithLegalNodes) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fe19eb3fe31f835c191dd2776bd577acbf3cbc0a03bc359828a8fe03ddaea8"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.serveFramed (cognitive 21): Server.serveFramed has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/go/dbx-plugin-sdk/sdk.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"150a283733a75dfb56b12f86ea77aa5072d904583b7891e2b5ebec1f9cfa7de8"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.firebirdRoutineBlockIsComplete (cognitive 21): sqlStatementRanges.firebirdRoutineBlockIsComplete has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2598}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bd283897d93976f2687fd232c639d77d6212e29231e509e26e1122de13fa46"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-partition-ddl.main (cognitive 21): verify-partition-ddl.main has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 3 (4 pts), ternaries 3 (4 pts), boolean chains 2 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 6 belong to 5 function literals inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/scripts/verify-partition-ddl.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f661b2fc83675cdda1884ce8041e9c840e0730d1436ec15478a4678fe9ce07d"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffHunkBuilder.alignWithinWindow (cognitive 21): DiffHunkBuilder.alignWithinWindow has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DiffHunkBuilder.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"81259398a9b3a240d22e62fcb1b5623e72372cdb82e03f52aa54c27b4c7db4c6"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferDdl.sqlServerDescriptionParameters (cognitive 21): queryResultTransferDdl.sqlServerDescriptionParameters has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d025e3252a38af8737f9cb1be533525a48b3d5ef71bc191841c88fce6ed84011"}},{"ruleId":"D2","level":"warning","message":{"text":"transferSelections.matchBulkObjectNames (cognitive 21): transferSelections.matchBulkObjectNames has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/transferSelections.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4415b3ec9cecf22ad111fb76e7c40d42379b7d423c2229a0e48b494337ca21"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridConditionEditor.useDataGridConditionEditor.handleKeydown (cognitive 21): useDataGridConditionEditor.useDataGridConditionEditor.handleKeydown has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e63bc10990115984a1ab29f07b68f901e3ee01c8154d7373a428da770bc146"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.applyDeleteRows (cognitive 21): useDataGridEditor.useDataGridEditor.applyDeleteRows has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"852d67c2dbae3db9d4b1480f74cff88231def30ae7cfb6d32dd167789a3f67a0"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportSql (cognitive 21): useDataGridExport.useDataGridExport.exportSql has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 5, error handling 1. Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 2853, 2856). 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"33eb53ea668a1f847d211551cc285ce4cbec37728f4f0968ed85b110c3188ea6"}},{"ruleId":"D2","level":"warning","message":{"text":"useExportTracker.useExportTracker.cancelTask (cognitive 21): useExportTracker.useExportTracker.cancelTask has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, error handling 2 (3 pts), ternaries 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d3cab4e60106b7567e3c4c4cec290bf2c075bd072a99019bde2d4f15210575"}},{"ruleId":"D2","level":"warning","message":{"text":"agentDriverInstallHint.agentDriverInstallKey (cognitive 21): agentDriverInstallHint.agentDriverInstallKey has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/agentDriverInstallHint.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb66fb205254562f5b80a3a88b0e0efeea5207d74b3bb5677ea9a7122ce06573"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeJobs.rebaseNativeJobDamengDraft (cognitive 21): nativeJobs.rebaseNativeJobDamengDraft has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 13, if/else 4 (5 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6fc4b977bcf121af6c68fe1b5b9191ed33aee33793950d6e0e1c244f701db9"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorBookmarks.createQueryEditorBookmarks (cognitive 21): codemirrorBookmarks.createQueryEditorBookmarks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorBookmarks.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a22fe55d9cda7b4efbe3e33d547b82c73ddb3fd7b05bbeffd2c009d4bdd190"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorInsertValueHints.parseClausesNearView (cognitive 21): codemirrorInsertValueHints.parseClausesNearView has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorInsertValueHints.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"99191a1948bcf9fbe29de003c31a32b2b0ce20e0dc9c8235670df42f149ea3a2"}},{"ruleId":"D2","level":"warning","message":{"text":"keyboardShortcuts.eventToShortcut (cognitive 21): keyboardShortcuts.eventToShortcut has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 9 (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":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50a11723cb73cc445b79f00e5ff5a2397b78b257ccda0d531fb60c71374cde0"}},{"ruleId":"D2","level":"warning","message":{"text":"plainTextSelectionRanges.scanQuotedRanges (cognitive 21): plainTextSelectionRanges.scanQuotedRanges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/plainTextSelectionRanges.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"837c13f6aa697a65a497aaacf46ff21741d7dcfccdd32b778c045b70f7730504"}},{"ruleId":"D2","level":"warning","message":{"text":"exportDiagnostics.summarizeExportRows (cognitive 21): exportDiagnostics.summarizeExportRows has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), ternaries 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/exportDiagnostics.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9092403566dda3560a981dfca3c5bf3f5018f2bad174d2f820df628fdafbcfd"}},{"ruleId":"D2","level":"warning","message":{"text":"objectMetadataCache.loadObjectMetadataFacetInternal (cognitive 21): objectMetadataCache.loadObjectMetadataFacetInternal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 1 belongs to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/objectMetadataCache.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce53f85cfc69e878522f1a2bfe54b334772b2fef610608428a67976280447b5"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.findOpenMongoQuoteStart (cognitive 21): mongoCompletion.findOpenMongoQuoteStart has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"2240894cf36121d7c4e8692a166c03c4e02d314ce46f22b39473f303a3bc5861"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoQueryInputBrackets.handleMongoQueryInputBrackets (cognitive 21): mongoQueryInputBrackets.handleMongoQueryInputBrackets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 4 (6 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoQueryInputBrackets.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f723f065b6cbc82511fb58bf1c02da5cb11d2540ebb26e07cf57a68d909609c"}},{"ruleId":"D2","level":"warning","message":{"text":"pluginHostBridge.requirePluginDataQueryRequest (cognitive 21): pluginHostBridge.requirePluginDataQueryRequest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"8921b4883520ff36ebc289e3dd2d101bca5538b8e90790982897edaee0c8e7e0"}},{"ruleId":"D2","level":"warning","message":{"text":"treeNodeClick.copyDisplayPathForTreeNode (cognitive 21): treeNodeClick.copyDisplayPathForTreeNode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d9d714fa570745d8903bb36caedbee6a2ea1ef969d4e97f201e140bb938ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"ddlSearchMarks.applyDdlSearchMarks (cognitive 21): ddlSearchMarks.applyDdlSearchMarks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlSearchMarks.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2691fd82831365b9718dfaaacd76f39fc9a22febe6eaef97d8bd75f23caafffb"}},{"ruleId":"D2","level":"warning","message":{"text":"editableQueryHiddenKeys.appendSelectProjections (cognitive 21): editableQueryHiddenKeys.appendSelectProjections has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, if/else 8 (9 pts), ternaries 2, loops 1 (nesting depth added 1). Of this number, 17 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/editableQueryHiddenKeys.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc910871ba1779cfbba92472b88b1f1377ec7713edae7a20292f2d725d62a3e8"}},{"ruleId":"D2","level":"warning","message":{"text":"mysqlRoutineSyntaxDiagnostics.findRoutineDeclarations (cognitive 21): mysqlRoutineSyntaxDiagnostics.findRoutineDeclarations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"327bd454b9e94ae91030b6bbc94bd73b1ad2f65b44d39b85046c7e9554b3f061"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.collectSqlServerModuleBatchRanges (cognitive 21): sqlParameters.collectSqlServerModuleBatchRanges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, loops 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"0654d683a7f342b859f019ca3cfe2797176a01015b339d3c3d237553b562159a"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlInListPaste.hasSingleWrappingParentheses (cognitive 21): sqlInListPaste.hasSingleWrappingParentheses has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlInListPaste.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49f6aaae0ec2a33b0f5363a1536c8a20e5b3df7569fbae16ad4f7e67c475553"}},{"ruleId":"D2","level":"warning","message":{"text":"objectBrowserRows.groupObjectBrowserRows (cognitive 21): objectBrowserRows.groupObjectBrowserRows has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 6 (7 pts), boolean chains 5, ternaries 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eef5a37f3228b56dbd39867a6c7ee8eb9a90a0bec2aec74282a704cba68f24a"}},{"ruleId":"D2","level":"warning","message":{"text":"objectSourceLoad.loadObjectSourceWithRoutineFallback (cognitive 21): objectSourceLoad.loadObjectSourceWithRoutineFallback has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 2 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectSourceLoad.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8d11434be4c7b2c2cc667c8a6a2fd5eb49b69fc77802631e1eafdbb8fa4775"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineRename.prepareOracleRoutineRename::walk (cognitive 21): oracleRoutineRename.prepareOracleRoutineRename::walk has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (oracleRoutineRename.prepareOracleRoutineRename) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"48300cb7e9248ca5da0ae22f927937e8fd2f22965d6b4cfa1efe3fbf74c8f880"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTypeManagement.sourceOrder (cognitive 21): oracleTypeManagement.sourceOrder has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (9 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"713dab9d8bf69b4e782be16c8a3b00fbb5974a7a5f2cdfa706ace46625dac8ee"}},{"ruleId":"D2","level":"warning","message":{"text":"tabUiState.sanitizeValue (cognitive 21): tabUiState.sanitizeValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabUiState.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2aeaba0cb670b4942bd393ffbf9e359b7868885d3240a284e716ae7387b4d2"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.removeConnectionGroups (cognitive 21): connectionStore.useConnectionStore.removeConnectionGroups has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, error handling 1 (2 pts), loops 2, ternaries 2 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0910d057af870c0bfe40e37e2307284d68dbd0baca17ca353fbf05d7b534a1"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.decodeVariable (cognitive 21): plDebugStore.decodeVariable has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, ternaries 6, if/else 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea622d2b56db55fe6f02229b3e3ce02debb7dcb6e81c7ebb79ccd77b9d9f848b"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.setAutoCommit (cognitive 21): queryStore.useQueryStore.setAutoCommit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3 (nesting depth added 10). Of this number, 13 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90c10e03f80bf391a0a24d29303130fef22347563e1a4f8c2019ba3e70d106c"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.captureQueryResultExportRequest.\u003Creturned closure\u003E (cognitive 21): queryStore.useQueryStore.captureQueryResultExportRequest.\u003Creturned closure\u003E has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 10 (11 pts), boolean chains 6, if/else 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11860}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac4309f40ed73c9f6d175d1f68b0a5700383eb3e02a9649a8dcccc7359db0a0"}},{"ruleId":"D2","level":"warning","message":{"text":"LandingSelect.LandingSelect (cognitive 21): LandingSelect.LandingSelect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 7, ternaries 2 (3 pts) (nesting depth added 1). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 9 function items inside it that branch (toggle, onListKeyDown, onButtonKeyDown, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/landing/LandingSelect.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab7a60ba0ac79b3d803daefd50fa16169058d1cbd260ee407af4337761a2284"}},{"ruleId":"D2","level":"warning","message":{"text":"json.readMongoRegexLiteral (cognitive 21): json.readMongoRegexLiteral has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"576bd68685e8196446117a3d5c6b9769de5f454f679af3d0f4262945ec571e37"}},{"ruleId":"D2","level":"warning","message":{"text":"json.splitTopLevel (cognitive 21): json.splitTopLevel has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"79af37d85b2eb35e52384c07c78e695b15164879e334f212be035da53c3fbff6"}},{"ruleId":"D2","level":"warning","message":{"text":"NacosOpenApiAdmin::list_services (cognitive 20): NacosOpenApiAdmin::list_services has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"5700639cb6dde65ce9eb617eb056719d76f5f7f318afe90e64fb9a4f55aa8901"}},{"ruleId":"D2","level":"warning","message":{"text":"Expansion::file (cognitive 20): Expansion::file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import/includes.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbde7be0aa47184ba37a0338ae4c81a9d5b399600ac92eeda02ef6d4b45164d"}},{"ruleId":"D2","level":"warning","message":{"text":"InsertSqlTemplate::build (cognitive 20): InsertSqlTemplate::build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5543}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a06e3fa2ac88be148378ee59aa1d7c28cd0232c56a412a671ee637ef4f45b04"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::start_data_migration (cognitive 20): Storage::start_data_migration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"365d7ce53a0802cbd7e9f809a1ccbd86d54bb4b4412781b949b97d1007724732"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::apply_sync_import_transaction (cognitive 20): Storage::apply_sync_import_transaction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":7433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e807fc348c97539b7e9cc4e50091eae25435155dfbba89ea06ed9b18cbfe19c3"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugRegistry::register (cognitive 20): PlDebugRegistry::register has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a16082fe0d89188ac59ec7181cd339486003f459680ca69e0bbd2616e8f398d"}},{"ruleId":"D2","level":"warning","message":{"text":"DamengNamedProjection::bind (cognitive 20): DamengNamedProjection::bind has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition/dameng.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e6797d31e4716552a492aff78c2e2b5cc97f2d8b0dee3fc8cc7d10a27dd5ed"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyReader::source (cognitive 20): LegacyReader::source has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_triggers.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"30406da93d08a794e33580cfaf4bf95047cfbb6651474d1a7328cc62b3addd61"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::mq::adapters::rocketmq::probe_namesrv_tcp (cognitive 20): dbx_core::admin::mq::adapters::rocketmq::probe_namesrv_tcp has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rocketmq.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e12098b418ead4335cae59fdc111037d7ddf334364303877003353bc998c18"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::agent_explain::get_agent_explain_info_core_with_execution_id (cognitive 20): dbx_core::ai::agent_explain::get_agent_explain_info_core_with_execution_id has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (11 pts), if/else 7 (8 pts), boolean chains 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_explain.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d206f4eeb61ea776fef9d5891b67e6cd25339b37664d43703d047c22f0af6ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::agent_kv::collect_etcd_prometheus_metrics (cognitive 20): dbx_core::ai::agent_kv::collect_etcd_prometheus_metrics has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3faea4aaa75e51a3f781fd317378a5b17fd75e0815048791002e9522799304c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::correction::append_table_schema_step (cognitive 20): dbx_core::data::correction::append_table_schema_step has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/correction.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f93e77be3c4c47779c9db6b95b3b289675cfff3ff4043c2a639a976d3b36b3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::stream::produce (cognitive 20): dbx_core::data::mongodb_dump::stream::produce has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/stream.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b75fe05648814c6a27cf1a778fe63774fff9f8b1e73caf92416d32a1747df6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::script_generator::generate_shadow_table_script (cognitive 20): dbx_core::data::script_generator::generate_shadow_table_script has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"da28e6e32e66943905fcb56a35dc4de00406a05c46d713050ef2c4e1653d6517"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::sql_file_import::detect_sql_file_encoding (cognitive 20): dbx_core::data::sql_file_import::detect_sql_file_encoding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7de5715edc61c6a876442ef93f360e54a3de7f83e352bafbe19b1c9107fa07c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::sql_file_import::mysql_like_sql_file_bootstrap_analysis (cognitive 20): dbx_core::data::sql_file_import::mysql_like_sql_file_bootstrap_analysis has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"533fafd6e26623eee6b2384327268b95d4063ee09f054ccff180a6dae2a308e8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::build_import_create_table_plan_with_identifier_quote (cognitive 20): dbx_core::data::table_import::build_import_create_table_plan_with_identifier_quote has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":5798}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ef992ae204e531693d26c51942e906cd2a4a1780af4f396aedc11cf2af4cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::sqlserver_bulk_text_row (cognitive 20): dbx_core::data::table_import::sqlserver_bulk_text_row has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":7617}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ab2bc033a7807f854f94018bb4b57974a24515dc4aabd675cd5c3e70641e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::normalize_thousands_numeric_literal (cognitive 20): dbx_core::data::transfer::normalize_thousands_numeric_literal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, match/switch 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d132200b72ea536e85af36fe0c8f3f9b3e7e99433bd7be72a58d36bda49f421"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::normalize_xugu_transfer_clobs (cognitive 20): dbx_core::data::transfer::normalize_xugu_transfer_clobs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":12478}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fdd8a7cfe2654fe0e9fbb1a7ee3d1c510a0085465a7f18bf188399a7aebaaf"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::free_backup_foreign_key_names (cognitive 20): dbx_core::data::transfer::free_backup_foreign_key_names has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14196}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ad1818462e22076981da236ba3100703d58106c9d161aed8e5212486eb240b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::persistence::storage::migration_error_code (cognitive 20): dbx_core::persistence::storage::migration_error_code has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76d41e1fddfdcb7d20174cd6ecec0d96b1f36d141b773af8e33ad1e2b014576"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::finish_operation (cognitive 20): dbx_core::query::pl_debug::finish_operation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c157cbde92e9b8e0845f14e9b68180ea2c16e4ff38c0234b0ff67b5f4a46227"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::db2_column_comments (cognitive 20): dbx_core::schema::db2_column_comments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":14586}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b321ff28ad9ce0e2db074e90338e7189a35cce912ba0f98adc76aacdcfccdd7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::transfer::packages::claim_approvals (cognitive 20): dbx_core::schema::oracle_routines::transfer::packages::claim_approvals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"174155291b05b016d2b8d4ce5bec85ffacce9e5e0773d16b23bca0f150d367f7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_elasticsearch::translate_field_operator_filter (cognitive 20): dbx_driver_elasticsearch::translate_field_operator_filter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a9d433aefbb2c6521a67e722d2370ed70ac18ad5b939f557751350c34c1bbe"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_elasticsearch::parse_select_star_search_query (cognitive 20): dbx_driver_elasticsearch::parse_select_star_search_query has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2bf4775e5ea386c6321a7e0a0cf89855f69b257b8394053b50767e5e139150"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::parse_bulk_write_operation (cognitive 20): dbx_driver_mongodb::mongo_shell::parse_bulk_write_operation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 7 (9 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9995ceaf5556de39728ddf7daf26812f9eb8a350e1f76cb81abf9c6dd1d2fa38"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql_data_charset::data_charset_from_params (cognitive 20): dbx_driver_mysql::mysql_data_charset::data_charset_from_params has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql_data_charset.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"769c27b6532608a3f0f91a1bf94852766700c79063458296219232976f7f757f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::postgres_quoted_search_path_elements (cognitive 20): dbx_driver_postgres::postgres::postgres_quoted_search_path_elements has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":8912}}}],"partialFingerprints":{"codehealthFindingId/v1":"544fb7bb782abb67912e4f395adb5a7dc2daadd04a0751585c31f6e5889cf7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::scan_values_page_inner (cognitive 20): dbx_driver_redis::scan_values_page_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":3431}}}],"partialFingerprints":{"codehealthFindingId/v1":"71336589f05e69dcbf067c8afc79ffcbdc4c57fb4e60141f8ce95ec437a8fc60"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::sqlserver_cell_to_json (cognitive 20): dbx_driver_sqlserver::sqlserver::sqlserver_cell_to_json has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 2 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8745f606cc01df9841a6c2ade3edc3d291981a676cb828935ec432866581fa"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::dynamodb_driver::execute_partiql (cognitive 20): dbx_drivers::db::dynamodb_driver::execute_partiql has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e9dcab6c0cfe52e34ffbba069d3c1b8b609ee7ce17cbb06ff136b5541011df"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::dynamodb_driver::validate_number (cognitive 20): dbx_drivers::db::dynamodb_driver::validate_number has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"1460b00346de70b7f04678c9c344a373f305f9bb6412ae3aaf412678bd86d209"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::influxdb3_driver::build_query_result (cognitive 20): dbx_drivers::db::influxdb3_driver::build_query_result has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/influxdb3_driver.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9588d98e6014210645b368629f01b2f54b1d2af479a5f0f4a5367ac2059e5bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::parse_table_level_primary_key (cognitive 20): dbx_drivers::db::sqlite::parse_table_level_primary_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a7555bbc587bcf3b314305bbfd21f16ccc2cbd7146d34202fae9a6deee5454"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_runtime::plugins::installer::prune_plugin_history (cognitive 20): dbx_plugin_runtime::plugins::installer::prune_plugin_history has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3c0eed07326c16acd18526cdd66147450c9c95d13ec201014a7ae26b371410"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::visit_table_factor (cognitive 20): Analyzer::visit_table_factor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"3589f27311dc38bfcf125174e5951eb839557bd300005eab1c7eed5c059e511c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::oracle_view_rename::hint_arguments (cognitive 20): dbx_sql_core::oracle_view_rename::hint_arguments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef11d13af96945fd3bd4a8d309abd4ca0c869bc66c74eac2855de7fba1710de"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::sqlserver_control_flow_open_blocks (cognitive 20): dbx_sql_core::sql::sqlserver_control_flow_open_blocks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3838}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8ac4bf817766f977c8a104b82f57112b45dee0a9f4c8add62ebcc34c2955b9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::last_qualified_identifier_component (cognitive 20): dbx_sql_data::data_grid_sql::last_qualified_identifier_component has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c1d23bac719c635c9ef380df507b104b59b09a007f02f208bcd6b1beefa6cc"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_dialect::sql_dialect::type_rewrite::rewrite_column_type (cognitive 20): dbx_sql_dialect::sql_dialect::type_rewrite::rewrite_column_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/type_rewrite.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcb653e89cebe013beed81410b1faac740ba43ecab5be8b5851fb4681c05954"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::diff_sequences (cognitive 20): dbx_sql_schema::schema_diff::diff_sequences has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":4220}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8f54a101067c0243927c97e56f201ecf90209132c6940529de9fd88aeb59f5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::consume_postgres_cast_name (cognitive 20): dbx_sql_schema::schema_diff::consume_postgres_cast_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f608f4f943d321fb616f97e9a514f2e6af34fc81fc93c09313f62ded750ced9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_alter::build_oracle_like_existing_column_sql (cognitive 20): dbx_sql_schema::table_structure_sql::column_alter::build_oracle_like_existing_column_sql has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b19408b9acba217ad2026d66d7d3e9def41a6745dbe98ad6843c8ad1bd03ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_format::normalize_column_data_type (cognitive 20): dbx_sql_schema::table_structure_sql::column_format::normalize_column_data_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3a72f208fc2f07ca352cee14aa0f5fa4f64d17b08fb7e025119918c82a19ca"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::triggers::sqlserver_trigger_body (cognitive 20): dbx_sql_schema::table_structure_sql::triggers::sqlserver_trigger_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"803d021007ffd7c7f9175c559eaf405222291766b12fee4703b1afa4018a087b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::captcha::draw_glyph (cognitive 20): dbx_web::captcha::draw_glyph has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/captcha.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a3f834f88c133d559c3d42b9ca5b0b9d0169a203536762e9b86916ba7764c2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::saved_sql::sync_saved_sql_directory_blocking (cognitive 20): dbx::commands::saved_sql::sync_saved_sql_directory_blocking has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/saved_sql.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaeee15466075cc2083088a73b4873a0e08d6340141722e092bf41ebbc78ced"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionFactoryDataSource.classifyCheckoutFailure (cognitive 20): ConnectionFactoryDataSource.classifyCheckoutFailure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb69266ded54aaaa395274efb5d327c257cba36834c9d22dbac344383ac231b"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRpcServer.executeBlobBoundStatements (cognitive 20): JsonRpcServer.executeBlobBoundStatements has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"88516ada1b33025b7d995bf102bceef1094d4ca49ba9de5048f03cfb36c6c5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleTriggerReader.summary (cognitive 20): OracleTriggerReader.summary has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 10, boolean chains 7, if/else 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"571e132d48eb3ba4f92511e829361cfa1187d571a4c1c3c1f2149022f6dc9db5"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.handleLogicalSession (cognitive 20): DbxJdbcPlugin.handleLogicalSession has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b307f260f874135b47cd0f182d100b17572ecff60d0eddba0ed2c7908e2912"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.hive2ShowCreateObjectSource (cognitive 20): DbxJdbcPlugin.hive2ShowCreateObjectSource has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":6063}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08e4d61302516490536d60454be82c861d1acbdf1cbb7e437cfd6c087c10ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.nativeLegacyJob (cognitive 20): DbxJdbcPlugin.nativeLegacyJob has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, error handling 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc4ce81c0ce2c4170b21ddfa1e1514139cd50a3f00c2ecba72e2d1c36204195"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericJdbcDdlBuilder.buildTableDdl (cognitive 20): GenericJdbcDdlBuilder.buildTableDdl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4, ternaries 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/GenericJdbcDdlBuilder.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"facc30b2e93536595e6c8ac6b14d7e01e7fd78aa7ace8151418559d92aaa2152"}},{"ruleId":"D2","level":"warning","message":{"text":"Db2Agent.deferredLobResult (cognitive 20): Db2Agent.deferredLobResult has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (7 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf631c1de8d8a2a9ae14f51a7e9021d880767b3eb227ca54ddc61273e75e099"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.resetConsumerGroupOffsets (cognitive 20): KafkaAgent.resetConsumerGroupOffsets has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (7 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e66226446a810381fe6d865b668266d760af3806f8212298ca7ab7df58d91b6"}},{"ruleId":"D2","level":"warning","message":{"text":"MongoAgent.collationOrNull (cognitive 20): MongoAgent.collationOrNull has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebfa6de3c5dc077af7dadb312fa8a0a362a165d71fc37e956a6f1d3074f4277"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.rawInput (cognitive 20): PlDebugTarget.rawInput has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, ternaries 3 (4 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52eba7b2329069845066d0d96721e0f866e5dd54db33e4a0d173d41bc831bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.readLob (cognitive 20): PlDebugTarget.readLob has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 6 (7 pts), error handling 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06d6d8218cbe49d86e0c0bc4760588f8fd13de39e961c544c14de67e3c2d7d0"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.typedSignature (cognitive 20): PlDebugTarget.typedSignature has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"519d68b06d8b320f37d89684cc567cfd6da38ffcfbbf67c38d36a629cc98993a"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugTarget.zonedInput (cognitive 20): PlDebugTarget.zonedInput has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, ternaries 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c93d9e952121014bd1705efd795bd69e158e43c4ebe8feb364a23aae4e796bb"}},{"ruleId":"D2","level":"warning","message":{"text":"SapHanaAgent.getObjectSource (cognitive 20): SapHanaAgent.getObjectSource has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/saphana/src/main/java/com/dbx/agent/saphana/SapHanaAgent.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5fe65030c9328858c2d86ff25e09419fa8aba058899ac9397cbc6418ce6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlServerLegacyAgent.connectionPropertyParts (cognitive 20): SqlServerLegacyAgent.connectionPropertyParts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"add474c2b7674f2ca99888ee4ab1edfc6c74a41f6e53b3d45d2e12d68ade981d"}},{"ruleId":"D2","level":"warning","message":{"text":"build_driver_zips.build_driver_zips (cognitive 20): build_driver_zips.build_driver_zips has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/build_driver_zips.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08c2d5f23be2b1560e8c7bd64888af1e980aa87214bc1fcd3af9c906e7dd204"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_agents.validate_jdbc_architecture (cognitive 20): validate_agents.validate_jdbc_architecture has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/validate_agents.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7102507c509ae679f2566869ad2ca95d2b7532a28b639ace12c188385876db59"}},{"ruleId":"D2","level":"warning","message":{"text":"main.scanCQLRow (cognitive 20): main.scanCQLRow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (8 pts) (nesting depth added 11). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 245, 264). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/query.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"98949d1749aabbc344ce392d2a0b96f0c03f4f534272fc328a366ab5a8c2298b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.nativeConnectionStringSSLMode (cognitive 20): main.nativeConnectionStringSSLMode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbc4391defb3da9afccd337c7e7503bb1ab9680278544f17e4ccff0dbee866c"}},{"ruleId":"D2","level":"warning","message":{"text":"server.customTypeRangeAttributes (cognitive 20): server.customTypeRangeAttributes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (20 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"20684193ee4f454fba470f8f851d85995716939307b66cb7789c4f5fcd5366f7"}},{"ruleId":"D2","level":"warning","message":{"text":"agentSession.listTables (cognitive 20): agentSession.listTables has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/metadata.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9ae82f35904ad25c1a91a0db2c9efcb04f3639a645e0f2dfe19c3b04eed28c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.appendGraphDisplay (cognitive 20): main.appendGraphDisplay has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/graph.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"89038ec44564b60be7e3ce763b9ae1beec4b098b56128a04d0bf194c0bbe24a8"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugDeclaredNames (cognitive 20): main.plDebugDeclaredNames has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":2791}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baa6c303fcbb82504064d19d4af6f14e22b7c0a441f8c3fa28a129df6effe1c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugLegacyDerivedType (cognitive 20): main.plDebugLegacyDerivedType has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_type_graph.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e72ee0ea1fbbcbdf0e095ae2ec2bcd56a667f44b615aff39dfc46957350476e"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugLoadNativeSourceBounded (cognitive 20): main.plDebugLoadNativeSourceBounded has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6 (nesting depth added 2). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 69). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_source.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a4631ba3d69153aa42f470fe00ff1048b9042e498ddb536b89dc755a32f438"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeResultField (cognitive 20): main.plDebugNativeResultField has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 9 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43ad5b7c8eb8fc27e8f2288881611961515c1b262f3019a2609ae24f733558d"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeServer.compileNativeTarget (cognitive 20): runtimeServer.compileNativeTarget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_compile.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a938cde4a848bbccdd012feae80249c5e46153f5a777b3e21ef16053734f10"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.control (cognitive 20): plDebugNativeEntry.control has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c1837c724406f4bb556ff5da038d3689177fb4246aaa0b095d6da025a17188"}},{"ruleId":"D2","level":"warning","message":{"text":"main.queryMessagesByKey (cognitive 20): main.queryMessagesByKey has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b208d5c823d0af5afb36f007bcc5ca290b7d22682e89f7c2337c66be2e92ee3"}},{"ruleId":"D2","level":"warning","message":{"text":"rocketMQAgent.peekMessages (cognitive 20): rocketMQAgent.peekMessages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8100c9233a2c284f50d3e221cbfa2707603695a3b5b97933dfb8f1be000629"}},{"ruleId":"D2","level":"warning","message":{"text":"main.nativeConnectionStringSSLMode (cognitive 20): main.nativeConnectionStringSSLMode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc19b31ba2856732bcbd3b5593648ade866343dfc17511289044e36a04e198f"}},{"ruleId":"D2","level":"warning","message":{"text":"server.customTypeRangeAttributes (cognitive 20): server.customTypeRangeAttributes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (20 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":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"d278b8c7f3e7f317e8ca83adf41d0e971f1018f003dce065a887a72e6fddd606"}},{"ruleId":"D2","level":"warning","message":{"text":"server.loadIndexPartitionMetadata (cognitive 20): server.loadIndexPartitionMetadata has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (nesting depth added 6). Of this number, 10 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c044723de49a239173430884d62c94bcfaa73ed913d2eb8a54626b7229b798"}},{"ruleId":"D2","level":"warning","message":{"text":"server.buildTableDDL (cognitive 20): server.buildTableDDL has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (20 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":4493}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cddd1007db1b4cf87370188b754883a0d3fe6515aecfa935a585994bd61c275"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listPrefix (cognitive 20): server.listPrefix has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/operations.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ea08b3a249065421f5549b1341433fbc4c1b84a597c82b3ae6cbc9bc535de5"}},{"ruleId":"D2","level":"warning","message":{"text":"server.rowsWithMetadata (cognitive 20): server.rowsWithMetadata has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 389). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/operations.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa6a91985e04a49a941a1e73a301f0c6fa4894e2c1035865195e081312c9124"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.provideMongoCompletions (cognitive 20): useQueryEditorCompletion.useQueryEditorCompletion.provideMongoCompletions has cognitive complexity 20 (threshold 15). Drivers by points: error handling 4 (8 pts), if/else 8, boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43422628a3856ca29c9892b3feda3335e9d212cefd7ce531a68b709a718e018"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorCompletion.useQueryEditorCompletion.shouldStartSqlCompletionAfterInput (cognitive 20): useQueryEditorCompletion.useQueryEditorCompletion.shouldStartSqlCompletionAfterInput has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8700763754ba9159c81877b801e4a69e86c623959b4ec9ab5a088db800bdcc85"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorLayout.useQueryEditorLayout (cognitive 20): useQueryEditorLayout.useQueryEditorLayout has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3 (nesting depth added 3). None of this is in the body itself: all 20 points belong to 6 function items inside it that branch (a function literal at line 72, editorBoxTrackStep, editorAvailableSize, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorLayout.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd2aee2255b282a3eff7bceafa41b53105ab8fce6830a9b8718b290505a59c6"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorTextActions.useQueryEditorTextActions.pasteClipboardAsSqlInCondition (cognitive 20): useQueryEditorTextActions.useQueryEditorTextActions.pasteClipboardAsSqlInCondition has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 6, boolean chains 2, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorTextActions.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43b7ac38fd3240fc29c9cccc96303a8e47ad2d4f45ca73110b6293c87dafdb9"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGenerateSession.runDataGenerateSession (cognitive 20): useDataGenerateSession.runDataGenerateSession has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts), error handling 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGenerateSession.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3286607ae3666bfdc1b41548cf38a0b14c5a5731fa0b3dda1b6bd2e3d5562826"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.exportAllResultsMergedXlsxResult (cognitive 20): useDataGridExport.useDataGridExport.exportAllResultsMergedXlsxResult has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 3 (4 pts), ternaries 3, error handling 1 (nesting depth added 4). None of this is in the body itself: all 20 points belong to 4 function literals inside it that branch (lines 2314, 2335, 2347, \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9f7b0f03d2a347d22e004393572f5d435780f9727fd677863291d5b095dbd2"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExtractor.useDataGridExtractor.extractorCellValue (cognitive 20): useDataGridExtractor.useDataGridExtractor.extractorCellValue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 5 (8 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c6cf4abf56815d8753ad8ce81f3de608d83aeb793012890bf7ce2a2346d0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridSelection.useDataGridSelection.applyDraggedRowRange (cognitive 20): useDataGridSelection.useDataGridSelection.applyDraggedRowRange has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, ternaries 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4894289091d2cd1920cddbc983d6724abdcc7c1c5f999bcfe696420db3421aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportData (cognitive 20): useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportData has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"256f22ffb028af1d8dae1dc2129a011fb747a8fa6f5e3188518ec47ddf9de93f"}},{"ruleId":"D2","level":"warning","message":{"text":"useSidebarTreeToolRuntime.useSidebarTreeToolRuntime.openStructureEditor (cognitive 20): useSidebarTreeToolRuntime.useSidebarTreeToolRuntime.openStructureEditor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeToolRuntime.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdc07d34217d60d7436313a4a3fd54f7206f58416705c76ed566537a804f5ec"}},{"ruleId":"D2","level":"warning","message":{"text":"useSnippetAutoUpload.useSnippetAutoUpload.runSnippetAutoUpload (cognitive 20): useSnippetAutoUpload.useSnippetAutoUpload.runSnippetAutoUpload has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (nesting depth added 4). Of this number, 12 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":"apps/desktop/src/composables/useSnippetAutoUpload.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b956724734aca4ace30ef644d09670ae0fca3d6524a04cb0f19570c47e4f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"appBackgroundImage.surfaceColorWithAlpha (cognitive 20): appBackgroundImage.surfaceColorWithAlpha has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/appBackgroundImage.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2758b4a7fff4f120505ed52360c8c3d1ff4ec3494c169c9c2c5ca1fd2050da46"}},{"ruleId":"D2","level":"warning","message":{"text":"LightweightJsonScanner.readNumberToken (cognitive 20): LightweightJsonScanner.readNumberToken has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b3b65340a19f47fb2f1a2357bfc0aec022602b92d8d2c80442059509a7eed6"}},{"ruleId":"D2","level":"warning","message":{"text":"gridClientFilter.matchesResultClientFilter (cognitive 20): gridClientFilter.matchesResultClientFilter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, ternaries 2 (4 pts), match/switch 2 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/gridClientFilter.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf49a6efd188c22f8513ba947d3aeca3fc41b0513a147ca5b3f2f5c50acaa9e"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseStructureSearch.mapStructureSearchRows (cognitive 20): databaseStructureSearch.mapStructureSearchRows has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseStructureSearch.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f107ea1c7f7657732298f8c8a8fd9e13cd4968839f57de8770c6f9fbcbf97834"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.readOracleForeignKeyMetadata (cognitive 20): oracleForeignKeys.readOracleForeignKeyMetadata has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (8 pts), ternaries 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c108de7845d21ffc5adbb2e187e4ac1dce5e35e69983a4d5767a5ac0e8a615d7"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.readOracleForeignKeySourceSnapshot (cognitive 20): oracleForeignKeys.readOracleForeignKeySourceSnapshot has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 5 (6 pts) (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b0cf4e0aad59b63fee3c60c83429925244df2f1e562f5e7384dd3b9419f042"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.readOracleForeignKeyCreateResult (cognitive 20): oracleForeignKeys.readOracleForeignKeyCreateResult has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (2 pts), error handling 1 (nesting depth added 7). Of this number, 14 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"184adb59e4719f00d4df358700e8e68894e751b29d45fc573ef8b9546926f51b"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleInvalidObjects.buildOracleCompileSql (cognitive 20): oracleInvalidObjects.buildOracleCompileSql has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 7, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleInvalidObjects.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eac6c4d8c2b305f493a5c52188b66e867e0727883ac49e8031318d70b1270fb"}},{"ruleId":"D2","level":"warning","message":{"text":"draft-table.validateLivePendingColumns (cognitive 20): draft-table.validateLivePendingColumns has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/draft-table.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c9d9f0956cce2cdc8978338b175b9be9c3190f95d17d14c7c9a5ebcaa6f79b"}},{"ruleId":"D2","level":"warning","message":{"text":"graphCompletionScope.projections (cognitive 20): graphCompletionScope.projections has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 4 (5 pts), loops 2 (3 pts) (nesting depth added 3). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (add, a function literal at line 24). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletionScope.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3a2804632471ac402e63b6f38d5365826aca7b17af2a9ec18d2c154b593ca3"}},{"ruleId":"D2","level":"warning","message":{"text":"datagripImport.mergeFragments (cognitive 20): datagripImport.mergeFragments has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, loops 3, if/else 1 (2 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d3f5feaf628b329e2032eda68769526a6178bf73df877a28ecf5249a648ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbeaverImport.buildConnection (cognitive 20): dbeaverImport.buildConnection has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, ternaries 4, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/dbeaverImport.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"972b89957f3fefb8e0cb7c976010feaaf77102488f0e641a2c4cf1a8a140dc4a"}},{"ruleId":"D2","level":"warning","message":{"text":"redisValuePresentation.toYamlLines (cognitive 20): redisValuePresentation.toYamlLines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 7). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 476, 465). 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":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f7e4250c1a07580ae093b62d31c3a30e2b5296d5c45b2b4a1117dad9ca54eb"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCommandDocs.mapEntries (cognitive 20): redisCommandDocs.mapEntries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandDocs.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef162c41f7a6dfe8c13a43de02fcc5c440949b9ca173ef07b21b9e810a29e8b4"}},{"ruleId":"D2","level":"warning","message":{"text":"savedSqlTreeRows.compareSiblingItems (cognitive 20): savedSqlTreeRows.compareSiblingItems has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 10 (13 pts), if/else 6 (7 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlTreeRows.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3580494794ef2edb9a4058c8688e7430c25055054cd8a699677074c2be5408"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDiffTableFilter.compileExcludePatterns (cognitive 20): schemaDiffTableFilter.compileExcludePatterns has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 6). Of this number, 19 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":"apps/desktop/src/lib/schema/schemaDiffTableFilter.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1144cb0c95a6454549a0b16239f8e6723a5dcca266e9ef1f840dd0f43438ac86"}},{"ruleId":"D2","level":"warning","message":{"text":"settingsTransfer.isSqlShortcutActionItem (cognitive 20): settingsTransfer.isSqlShortcutActionItem has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7 (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":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9118abaf8a07c27ce2a71cee63da9cf7aa85e12130550b27a1c9d0a7dd9493"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCollectionMutation.buildMongoCreateIndexRequest (cognitive 20): mongoCollectionMutation.buildMongoCreateIndexRequest has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 11 (12 pts), if/else 5 (6 pts), boolean chains 1, loops 1 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/mongoCollectionMutation.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ead0bf0650b94c6aea452ad3f87bdde6f4b34266fcc7f6f2994d6c27f0b67f"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarLayout.reorderEntry (cognitive 20): sidebarLayout.reorderEntry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (insertNear). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3aa0ea0392cb799aad27be9aad4b021f0a32e0cbb5a8236d09bd2149d20b674"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarNodeOrdering.orderSidebarTreeChildrenForParent (cognitive 20): sidebarNodeOrdering.orderSidebarTreeChildrenForParent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarNodeOrdering.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf69896ae4cbccf4cb7c88a1a1b02c05d701943bf5ca8d0d717ecb7373443fe"}},{"ruleId":"D2","level":"warning","message":{"text":"executableStatementRangeCache.executableStatementRangeAtCursor (cognitive 20): executableStatementRangeCache.executableStatementRangeAtCursor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/executableStatementRangeCache.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa0ae21de9e83d0c022e4848ddabe0cb7ab5ca1045c86abc491a67ba3f68427"}},{"ruleId":"D2","level":"warning","message":{"text":"mysqlRoutineSyntaxDiagnostics.analyzeMysqlRoutineSyntax (cognitive 20): mysqlRoutineSyntaxDiagnostics.analyzeMysqlRoutineSyntax has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 44). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d15c5da35b8ce5dfe5c8e9b74bdaf6da6d9ba6ab6a8021d8a09bf5932962c2"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlRisk.highestRiskInSetTokens (cognitive 20): sqlRisk.highestRiskInSetTokens has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (6 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"9863e84ec534c9ba0e49de2b351c1f22bc235123b3b05e4b0bdc63245d74bb0b"}},{"ruleId":"D2","level":"warning","message":{"text":"statementDelimiter.trailingGapIsWhitespaceOrComment (cognitive 20): statementDelimiter.trailingGapIsWhitespaceOrComment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/statementDelimiter.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a94f4036a667e1bacf478c0372c8ed901778e64df2331d57872f087071d112"}},{"ruleId":"D2","level":"warning","message":{"text":"pgPartitionPresentation.splitPgPartitionBoundValues (cognitive 20): pgPartitionPresentation.splitPgPartitionBoundValues has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/pgPartitionPresentation.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2bf4039f22e29321202f5970cae8ee59d91f02b5d1816588d0625cd85a7867"}},{"ruleId":"D2","level":"warning","message":{"text":"tableStructureEditorState.isDataTypeLengthDisabled (cognitive 20): tableStructureEditorState.isDataTypeLengthDisabled has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 8 (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":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"98655d8f2af88ef09346d27ce5db4eda16bbe77fa4374f6ee8ae1ec8c99c2128"}},{"ruleId":"D2","level":"warning","message":{"text":"tableTree.mergeTableInfosIntoObjects (cognitive 20): tableTree.mergeTableInfosIntoObjects has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fd31a4acb9609e23339c9424ccebb56e6318d595402788fff89ffe7b987e88"}},{"ruleId":"D2","level":"warning","message":{"text":"tableVGroup.applyTableVGroupsToChildren (cognitive 20): tableVGroup.applyTableVGroupsToChildren has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 3 (nesting depth added 5). Of this number, 16 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":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"43be8fe307f0142ab0206c0968f8828de73908598424d3083f80926a729d7ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.migrateTimeoutInheritance (cognitive 20): connectionStore.useConnectionStore.migrateTimeoutInheritance has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 6. Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (resolveInheritance). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11008}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13063334203c55acee47facb002fc139701497a661ffb931ec663103eca0d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.cancelTabExecution (cognitive 20): queryStore.useQueryStore.cancelTabExecution has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10770}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9a3e3d6811c3a1599ffe13dd658ee3e06746e7500fa119bcfe8ddbfebc20f5"}},{"ruleId":"D2","level":"warning","message":{"text":"json.replaceMongoRegexLiterals (cognitive 20): json.replaceMongoRegexLiterals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bea4367c93468e0791858d15ef498c24f7fc7a6b516658adb87156b8e79b42"}},{"ruleId":"D2","level":"warning","message":{"text":"json.replaceMongoEjsonDeserialize (cognitive 20): json.replaceMongoEjsonDeserialize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcec545facc48226bbd557455e80f1f503afb67f1874a304badb44996427052"}},{"ruleId":"D2","level":"warning","message":{"text":"json.convertSingleQuotedStrings (cognitive 20): json.convertSingleQuotedStrings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b1ce257c6b865fc44b0500079937f6eb0acbfb1fa1af557047a2782060e4ba"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 20): main has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 5 (6 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1, other 1 (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/migrate-archive.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7db8807842fec35c8e48259c77fbd8738167c63a9ab001c8173681125cd0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"push (cognitive 20): push has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/sidecar.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d1d6c840479a9bae686f692111aa4f6d1402ede9572b11cd1a27daf5a5d2ed"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsulClient::new_with_proxy (cognitive 19): ConsulClient::new_with_proxy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/client.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5293927a359a4550729e0986143b83065c0fabf97f2d95bc9b04ea40025ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"NacosOpenApiAdmin::test_connection (cognitive 19): NacosOpenApiAdmin::test_connection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3dabc73546f30dc556595c71eef0e4f46a0ea642a0f63d7101611e8532e812"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::verify_migration (cognitive 19): Storage::verify_migration has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (6 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"694e8303d6b0b1e823dd9e9a8195bf35faa7243406d9c1f513f9f40a3b14d598"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::load_ai_configs (cognitive 19): Storage::load_ai_configs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4884}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3aa1bcb342a87ef629b0dce7c1077c0f338953e02cf03e4666c90ff231d386"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::append_mqtt_history_messages (cognitive 19): Storage::append_mqtt_history_messages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":7864}}}],"partialFingerprints":{"codehealthFindingId/v1":"990e6fc7d745358815be9182c100ac27bb7aeb9ce7c5c4697db4bb6ae5df5b47"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::consul::session::parse_consul_duration_ms (cognitive 19): dbx_core::admin::consul::session::parse_consul_duration_ms has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/session.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3adb0e53a30d8fc9f588752af31f9f9d3e2804af3e9ffcc1da59e2efb40d362"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::correction::append_data_steps (cognitive 19): dbx_core::data::correction::append_data_steps has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/correction.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a826ed0372d5072077b5e20c08888abb5fdb46a6671d2445620f6b15d669afc8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::navicat_nb3::classify_create (cognitive 19): dbx_core::data::navicat_nb3::classify_create has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d26c8e9eff11c019dc4d220388f078adab09cdbf6250123d1808a097debb79"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::query_result_export::export_query_result_with_cleanup (cognitive 19): dbx_core::data::query_result_export::export_query_result_with_cleanup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"09700c297d46577d0e25f3a9f5251427a8af2f390e357e30652bd54a45764299"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::execute_transfer_write_statement (cognitive 19): dbx_core::data::transfer::execute_transfer_write_statement has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"c179a13ed95a2cc185d9abc8d379392e6ee50c691434d8930ab111a5ca74da2f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::oracle_export_date_parts (cognitive 19): dbx_core::data::transfer::oracle_export_date_parts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":4486}}}],"partialFingerprints":{"codehealthFindingId/v1":"04728b58951f548d1617143f2d0db044f81d7795f88cf1ad4ae67958c66bf450"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_table_via_copy (cognitive 19): dbx_core::data::transfer::transfer_table_via_copy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":8393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc9f0c1e47b3254fbd43b3232a0fd815a03c62dd619f44954a3012414f529f4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_sqlserver_schema_objects (cognitive 19): dbx_core::data::transfer::transfer_sqlserver_schema_objects has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10582}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d23dd02a7444909f6d3235349da38a0ac704f01ec7f428a85004030e3bcfeb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::build_rebuild_preview (cognitive 19): dbx_core::data::transfer::build_rebuild_preview has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":11415}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ad46c0df76579e08216416e8247d8cc791dcbd347cf3055640548bd9b7c7e0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::safety::risk_metrics::export_prometheus (cognitive 19): dbx_core::safety::risk_metrics::export_prometheus has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/safety/risk_metrics.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"572d8296c45b6a60d4e223c51d4c3f7508b41c8ce7677b056143e5b177ec0dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::list_schemas_once (cognitive 19): dbx_core::schema::list_schemas_once has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ef1d0483dbaff8106be7808dc0a01848e93b7d54be8e91af58be0720db0636"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::list_objects_core_with_loading_options (cognitive 19): dbx_core::schema::list_objects_core_with_loading_options has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5302386f0b3f1df196a55f69221f25e359f837ad6742f1f8ed90ef16bc3fe0f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::run_metadata_connection_for_session (cognitive 19): dbx_core::schema::run_metadata_connection_for_session has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":9489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b774395755c60fcc68598925da8528b25908e2cd88137e145fddc2dc32489177"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::list_triggers_core_with_options (cognitive 19): dbx_core::schema::list_triggers_core_with_options has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bb869a1fd728d01130757035b1272be5354553c8ca59ca2692f4ac5146dfa4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_data::validate_insert_target (cognitive 19): dbx_core::schema::oracle_type_data::validate_insert_target has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, match/switch 2 (3 pts), loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd55ce5b7470044707755fa116f7a98f3d480379bca2510c51593c819b0c50"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_connection::zookeeper_connection_endpoints (cognitive 19): dbx_driver_agent::agent_connection::zookeeper_connection_endpoints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_connection.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dba1a316aa9cf8f6f98ce733ecf693f49a0f7694028807ee28ceb256fd51082"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_offline_export::export_agents_offline_unlocked (cognitive 19): dbx_driver_agent::agent_offline_export::export_agents_offline_unlocked has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (4 pts), loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1d358a69a5dfaa0757dc29a27f6f883e8387f2158203c1186926bfa42c7312"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::transform_shell_regex_literals (cognitive 19): dbx_driver_mongodb::mongo_shell::transform_shell_regex_literals has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd608cc679f119674d32bf5d250f9f263e9a438debaf6476dc981174fca1a1d0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::split_mysql_session_variables (cognitive 19): dbx_driver_mysql::mysql::split_mysql_session_variables has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2809}}}],"partialFingerprints":{"codehealthFindingId/v1":"332eaf8d74f361f55795cdb35d3cfc29a0b8535a1205c432fa644fd138201fdf"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::execute_result_set_with_prepared_protocol_on_conn (cognitive 19): dbx_driver_mysql::mysql::execute_result_set_with_prepared_protocol_on_conn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6544}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c01acf3723f2b277c50084317943d98acd3f51181bf6fd5bac292e5eafb0ba"}},{"ruleId":"D2","level":"warning","message":{"text":"TextEncoding::encode_sql (cognitive 19): TextEncoding::encode_sql has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/text_encoding.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c7a7720b04604db5e6252e2aef57e79f353895c12bed590040b6d35dffd8a0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::skip_sqlserver_leading_trivia (cognitive 19): dbx_driver_sqlserver::sqlserver::skip_sqlserver_leading_trivia has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":4354}}}],"partialFingerprints":{"codehealthFindingId/v1":"a546b74250cfefcca8c2576fd882fd2c9a0a62b37bcaffdf4ae623488a3b84c2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_support::execution::await_stream_with_progress_timeout (cognitive 19): dbx_driver_support::execution::await_stream_with_progress_timeout has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 3 (5 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/execution.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"23402cf02286a4df3b0943d9d6079c23dd69afd93a66f847d65f03c83141efbd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::duckdb_worker_process::spawn_stdout_reader (cognitive 19): dbx_drivers::db::duckdb_worker_process::spawn_stdout_reader has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_worker_process.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"0488a67d9bb5a65720750b6d0716555e2a940b5ac6ad7d2e69e4ee8ac1215371"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeConfig::from_environment_and_args (cognitive 19): RuntimeConfig::from_environment_and_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/runtime.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a645c59fafca50e25021ae386670cc970e2b996719af6b3a25c30196676f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::get_schema_context (cognitive 19): DbxMcpServer::get_schema_context has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (9 pts), if/else 6 (7 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4036}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e37f773f5c9be9b298b74e4d203c51c78296be34fcf6b15af98855da56ea31"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::resolve_connection (cognitive 19): DbxMcpServer::resolve_connection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5305}}}],"partialFingerprints":{"codehealthFindingId/v1":"93326658e7496bcbb7215e50edaec0c5785873f4c017632dea4f59b04283e00b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_mcp::server::ensure_plugin_scope (cognitive 19): dbx_mcp::server::ensure_plugin_scope has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":6478}}}],"partialFingerprints":{"codehealthFindingId/v1":"22939ca044a2698bc3cc4f455ad2470d52a6952365deeb2b28716225325e1ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"FirebirdRoutineBlock::is_complete (cognitive 19): FirebirdRoutineBlock::is_complete has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2801c6e2f61d449125332f43f2b8730c5e4b86b04967da49482214b40ea5b55"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_trigger::validate_call (cognitive 19): dbx_sql_core::object_source_sql::oracle_trigger::validate_call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_trigger.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"706fd1e11b890530e95c2e868ca2059130ec4184bfaca14f6a76407cc8e1655b"}},{"ruleId":"D2","level":"warning","message":{"text":"DialectPluginLoader::scan_and_load (cognitive 19): DialectPluginLoader::scan_and_load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/dialect_loader.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c2b6b4b03f2fc111bd6db5de07d4807b680222377e01318e973b5bc60d1ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_dialect::sql_dialect::table_select::build_large_value_preview_items (cognitive 19): dbx_sql_dialect::sql_dialect::table_select::build_large_value_preview_items has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a4ef1dbe9528b8c2156176c8d45926909bd6d826aeae703b6c82080ebca7de"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraph::topological_sort (cognitive 19): DependencyGraph::topological_sort has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f8cd2a93e64a4d71e370237ec98064b7c0908016b73e26d24d67ec18704c00"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_arguments::scalars::normalize (cognitive 19): dbx_sql_schema::native_job_arguments::scalars::normalize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_arguments/scalars.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5905d61e8da0ac55459b0ae166eac8d3c17f53f4834816d5bd22d2ddb4151b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::parts::schedule_definition (cognitive 19): dbx_sql_schema::native_job_changes::dameng::parts::schedule_definition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng/parts.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"214f9cdf6e81e19ba307feb6c34b0ef45f0fd6dc172ae19aefe475c7e0b62071"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::rewrite_quoted_schema_qualifier (cognitive 19): dbx_sql_schema::schema_diff::rewrite_quoted_schema_qualifier has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 2 (4 pts), match/switch 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":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":4582}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfc743cbf208f9721900dcffc945d8d3924fd1f2fa81b97ea854c2f8bc7b386"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::generate_schema_sync_sql_plan_with_charset (cognitive 19): dbx_sql_schema::schema_diff::generate_schema_sync_sql_plan_with_charset has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6407}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c30392016ee5de79377721a67589d239651a4a9b4759cc39f91c22f7d62ae82"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::foreign_keys::build_foreign_key_sql_with_mode (cognitive 19): dbx_sql_schema::table_structure_sql::foreign_keys::build_foreign_key_sql_with_mode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/foreign_keys.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f4038003a1addc7bcf4b0aec24d211632cb5dae88def867d154e833b45fe3d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_types::models::connection::normalize_mysql_url_params (cognitive 19): dbx_types::models::connection::normalize_mysql_url_params has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4460d8945de6a9f6a09e62fb56e15aca5863f6506b5f285dbea3767295b1f533"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::routes::redis_pubsub_ws::handle_monitor_socket (cognitive 19): dbx_web::routes::redis_pubsub_ws::handle_monitor_socket has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 3 (8 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis_pubsub_ws.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cdec66907b82489d34f838bc54dae6dd09f8de6f6ddfece9e6ac7cb95b0efe"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateDownloadSource::installer_asset_candidates (cognitive 19): UpdateDownloadSource::installer_asset_candidates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/update.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f7a8f6aed644857fe3f52b62abece52a78baee2af58908932fd8d3f77db26b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::redis_pubsub_server::handle_monitor_socket (cognitive 19): dbx::commands::redis_pubsub_server::handle_monitor_socket has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 3 (8 pts), loops 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":"src-tauri/src/commands/redis_pubsub_server.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c77d8a0161bd0317c60649977b1ae6cc35254cf7e01bbc3de11e72f72c78e6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::webview2_preflight::spawn_preflight_child (cognitive 19): dbx::webview2_preflight::spawn_preflight_child has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 4 (5 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/webview2_preflight.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"d976ab80db5182e4b01b0c01e7cf5985a36df4a75b20463ea536f356ba694ccc"}},{"ruleId":"D2","level":"warning","message":{"text":"EwkbWktDecoder.tryParseHex (cognitive 19): EwkbWktDecoder.tryParseHex has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (6 pts), loops 2 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a966f77e58e2c2bd95698a1685f4dc3a562c2af5375f3c1d82bf20d384997af5"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiSessionJsonRpcServer.handleRequest (cognitive 19): MultiSessionJsonRpcServer.handleRequest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, ternaries 4 (7 pts), boolean chains 1, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"45718b18820e7796d1757b862cbc259372ef94e193f91c4c360ee9be339747c0"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleTriggerReader.source (cognitive 19): OracleTriggerReader.source has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 2 (5 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"43652f13b2c29c62b6160ebf10ff31d43ba47afdcb17b7acef7f50dd7414b856"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresLikeAgent.listForeignKeysFromCatalogArrays (cognitive 19): PostgresLikeAgent.listForeignKeysFromCatalogArrays has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"3556389bbd64f99e64949793e752f9a1ec58128b0cc306b446527b466da77f47"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.oracleColumnDataType (cognitive 19): DbxJdbcPlugin.oracleColumnDataType has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":6202}}}],"partialFingerprints":{"codehealthFindingId/v1":"512bf91911729d7f9f548dc742082abe42e9e5867fe6a6cd0bdedc59f2047f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.oracleListObjects (cognitive 19): DbxJdbcPlugin.oracleListObjects has cognitive complexity 19 (threshold 15). Drivers by points: error handling 8 (11 pts), loops 6 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5402}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40cf6d8844448ec33f6c3fcbfd167462f619dd7b8ac01d5851e3db0f4f52f0a"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.oracleTypeSource (cognitive 19): DbxJdbcPlugin.oracleTypeSource has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5771}}}],"partialFingerprints":{"codehealthFindingId/v1":"2654ad79bb07ac45b21e76e14d90d3b65f4ab665dcd98a4517d36b07fcf996f6"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleTriggerMetadataReader.source (cognitive 19): OracleTriggerMetadataReader.source has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 5 (6 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df866bd0751acd0e606d6c4746141dbcfed53d3d6cc2449fb3c8225f2bdf8ef"}},{"ruleId":"D2","level":"warning","message":{"text":"DamengAgent.identityColumnsFromDdlText (cognitive 19): DamengAgent.identityColumnsFromDdlText has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38f268829de6fd0dfeb0b037beae73e8a8589492ade77b460d4494c1ea90d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"FirebirdObjectSource.triggerSource (cognitive 19): FirebirdObjectSource.triggerSource has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 3 (4 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdObjectSource.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5639db0041a8f92e2a55018746f19349099af1738c8dee375a95ed54242bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseOracleAgent.formatDataType (cognitive 19): OceanBaseOracleAgent.formatDataType has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bac1db7552e130c3a933132341b203b67221f11291ce143b9bc428d50c22c32"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseHiveAssignments (cognitive 19): main.parseHiveAssignments has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, loops 1 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae8ae3493955be6469efc2d99e49ce15f0cdea34ae80e03a9080e403a78adde"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeServer.dispatch (cognitive 19): runtimeServer.dispatch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1ab8b83e6bd36df924bf1752e067dfea4039187855c69c75328fdcb36e4b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"etcdSession.defrag (cognitive 19): etcdSession.defrag has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/maintenance.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ab9977e4bcf926749fe24c0ac29a61b10ac60b71caf37e5b8610566f730061"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseHiveAssignments (cognitive 19): main.parseHiveAssignments has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, loops 1 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fb10a9b286bf0bbf079d273ec4a02ec9de645da1de21dacaeeeab7c5df1488"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listObjects (cognitive 19): server.listObjects has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (3 pts) (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2fc29de1aa1f3e4514cf58ca8988b7e7215a2d46d1cb0b5b3dfb24d6ca12a4"}},{"ruleId":"D2","level":"warning","message":{"text":"main.neo4jTLSConfigurer (cognitive 19): main.neo4jTLSConfigurer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/driver.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"11044e0d31b5bc7acbd1b962f77b7dd2c0fb78371a7f7010b2aebe7d24c20ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNestedSubprogramRanges (cognitive 19): main.plDebugNestedSubprogramRanges has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":4782}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fad2fdd7516cc497e21d6fe2cc99be5060e8ed73f4b90cc10b3b9fa9b441d68"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeCaptureRender (cognitive 19): main.plDebugNativeCaptureRender has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_output.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb5289535ee651310ad43ac4c63e07466eeb1fa3921f1e3585e8c68372e48e1"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.publishNativeStackLocked (cognitive 19): plDebugNativeEntry.publishNativeStackLocked has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_stack.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4addfdbfd37fedcdf8227b22a734cf8db9576319dbc7ba3b66628fef4ac5d349"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugCompositeEncoder.lobDeclarations (cognitive 19): plDebugCompositeEncoder.lobDeclarations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_record_output.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"195691826dca60607870d907e4cb6d0c432aa4e757d2997101b99d50a2d3ef39"}},{"ruleId":"D2","level":"warning","message":{"text":"main.readConsumerStatusFromBrokers (cognitive 19): main.readConsumerStatusFromBrokers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d39ec76f38174edf5ea0f64c9bac86545f2970b5375e132a601ef04c779f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeServer.dispatch (cognitive 19): runtimeServer.dispatch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d4a113b711b4b7019c90b9d610125ab6c7ce119b3085e4c641a06f1a709b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listTables (cognitive 19): server.listTables has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0b1a017863424293ad3191d87b75b7cbefa8d480330cfa2cbe10f985e988c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Krb5Mech.continueInitiator (cognitive 19): Krb5Mech.continueInitiator has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/go-gssapi/krb5/krb5.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c05fc7c489366c9a0c0536fd2bdcb0a6a006811aacb53641a794b700f607e18"}},{"ruleId":"D2","level":"warning","message":{"text":"client.newTransportWithContext (cognitive 19): client.newTransportWithContext has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/tls.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a7bc1434ec0adc5dbfeec2a33e38a20b296d24eaf988d9940ceaff6cbf88e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Tablet.Swap (cognitive 19): Tablet.Swap has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 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":"agents/go-common/iotdb-client-go/client/tablet.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae679088af83fc26a0c30ae01aa6370e2dcba10eed34f2f1373dc7b0dc7b7a9"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.isSourceAdjacentGap (cognitive 19): sqlStatementRanges.isSourceAdjacentGap has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (7 pts), boolean chains 6, if/else 3 (6 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2837}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6a8dc0e35807966f2e6f83a203aad2bc53105f3de46c024d87014e859c1b6d"}},{"ruleId":"D2","level":"warning","message":{"text":"verify_offline_jdbc_release.main (cognitive 19): verify_offline_jdbc_release.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/verify_offline_jdbc_release.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61abf903b2d24deffb47421651695454819d957d510dfc030c95f666ce4dfaa"}},{"ruleId":"D2","level":"warning","message":{"text":"useAppUpdater.useAppUpdater.downloadUpdateInBackground::run (cognitive 19): useAppUpdater.useAppUpdater.downloadUpdateInBackground::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8, error handling 1, 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2d87cb4b307bb91e23569105ab692e7b37402712defb6dda97641b18ad5e37"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridConditionEditor.activeQuoteAt (cognitive 19): useDataGridConditionEditor.activeQuoteAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"17402543c7ff928fb73b9b77fa6e732857f2a0343545dec9c859e3818c81dbbe"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridConditionEditor.insideInValueList (cognitive 19): useDataGridConditionEditor.insideInValueList has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f3af93a68243669ab46501aad3eeb26f13d9ff2a54ee6079f64a18e7bcf69d"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridConditionEditor.useDataGridConditionEditor.loadSuggestions (cognitive 19): useDataGridConditionEditor.useDataGridConditionEditor.loadSuggestions has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), ternaries 4, error handling 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadd8f9128b708c51b4d7f4f8532807cf18f2e01ad272eeb60d747dae5e3f456"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridExport.useDataGridExport.captureSqlInsertExportData (cognitive 19): useDataGridExport.useDataGridExport.captureSqlInsertExportData has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (13 pts), boolean chains 6 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"e576e87a72893bb140a1d609d4d94d0d6f8063e94fcbf5079bcfaefc416c1122"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridLargeValues.useDataGridLargeValues.preparePreviewSaveBaseline (cognitive 19): useDataGridLargeValues.useDataGridLargeValues.preparePreviewSaveBaseline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (7 pts), boolean chains 4 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7724c844821396531c84a6a4f72d384f41be443d27390699e6f89e744c12b1"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridSelection.useDataGridSelection.selectedCellCount (cognitive 19): useDataGridSelection.useDataGridSelection.selectedCellCount has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"29510f7afd03a6f6516fd172ee51c899a1f1f3d5d4b4e06a5720d97f085307bb"}},{"ruleId":"D2","level":"warning","message":{"text":"useSidebarDatabaseSpecificMutationRuntime.useSidebarDatabaseSpecificMutationRuntime.confirmEditMongoIndex (cognitive 19): useSidebarDatabaseSpecificMutationRuntime.useSidebarDatabaseSpecificMutationRuntime.confirmEditMongoIndex has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, error handling 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 3). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 689). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce55346d106dc2d090713091a267ba5eab895c0c61b30d902853e4e7da698a07"}},{"ruleId":"D2","level":"warning","message":{"text":"aiProposalDetect.lastLineMentionsWriteSql (cognitive 19): aiProposalDetect.lastLineMentionsWriteSql has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiProposalDetect.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c307856015600ad8fc2f4fefeebc19a9cbcc46e1efc2008f13b51f7d71518c14"}},{"ruleId":"D2","level":"warning","message":{"text":"errorUtils.isBackendError (cognitive 19): errorUtils.isBackendError has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 9 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61c59b5766188be12001f25976707ed3d7b8f29c2c5917b135acd79cf4a13f7"}},{"ruleId":"D2","level":"warning","message":{"text":"errorUtils.boundedFallbackTextAtDepth (cognitive 19): errorUtils.boundedFallbackTextAtDepth has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7505284cef019e7dd31e672faea9a362115c1cdf44ac0147bad53c6a034035b"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonSourceScanner.readStringToken (cognitive 19): JsonSourceScanner.readStringToken has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38ed4f325a383e3f64420c3e8cd75d29109fb9a07f0894900fb03b04971c7e7"}},{"ruleId":"D2","level":"warning","message":{"text":"agentTarget.consulAgentWriteBlockedReason (cognitive 19): agentTarget.consulAgentWriteBlockedReason has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 8, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/consul/agentTarget.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7944ce48ebb55b57eee9dca83b6951125a50ca6706d52267eb79033bea5edd"}},{"ruleId":"D2","level":"warning","message":{"text":"cellValueGeneration.generateCellValues (cognitive 19): cellValueGeneration.generateCellValues has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, ternaries 4 (8 pts), boolean chains 1 (nesting depth added 4). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 57). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellValueGeneration.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a974dae45e7e9a6d7b20af038684bc7089a87fbf756e0aa72d70463b4af35b"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGenerate.generateSkuFromPattern (cognitive 19): dataGenerate.generateSkuFromPattern has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ab788625fe98386932c6d9afe40c1ff06ae9b2f65733393635232114e8b2ce"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnLayoutStorage.queryLayoutSql (cognitive 19): dataGridColumnLayoutStorage.queryLayoutSql has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 8, ternaries 1. Of this number, 10 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnLayoutStorage.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4f5f493f2817b5879914297675975819d57f4a1335550d956e99d07b7701bf"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnVisibility.areCellValuesEqual (cognitive 19): dataGridColumnVisibility.areCellValuesEqual has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnVisibility.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c418c9eb0baa403921ca41bb6ac112bbe5e41fd5a3e55d5619c7e3a627f112a1"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnWidthState.loadPersistentDataGridColumnWidthState (cognitive 19): dataGridColumnWidthState.loadPersistentDataGridColumnWidthState has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 2, error handling 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":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ded092938593e4d714e8d7cb9e8ff063526c8630d8ff2653d4298df0981406"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnWidthState.loadDataGridColumnWidthState (cognitive 19): dataGridColumnWidthState.loadDataGridColumnWidthState has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9793ccec98dbb7f510f09c08bb70e116f2102c3d2b6769da25e985c0cc8cce84"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridInsertPaste.parseSingleInsertStatement (cognitive 19): dataGridInsertPaste.parseSingleInsertStatement has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"0118d340518ecfa5c87e1856ab9796a5d88197b0f8c9741a8d5a17c4979b2d53"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeJobAdmin.nativeJobDefinitionForEdit (cognitive 19): nativeJobAdmin.nativeJobDefinitionForEdit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde3c0385574cb0e1fe2ab20d3824a001b76edb0f57bcdc5878ceb84dc4e0316"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.executeOracleForeignKeyCreatePlan (cognitive 19): oracleForeignKeys.executeOracleForeignKeyCreatePlan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, error handling 1 (2 pts), ternaries 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"1542c5955962a89002a5ca5542c4f3a8684cf88795076e20df77391125bdb9c3"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleUserAdmin.oraclePrivilegeSql (cognitive 19): oracleUserAdmin.oraclePrivilegeSql has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 6 (7 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleUserAdmin.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee8fc643540f0a2965648c1b76cc997139acdeed789c2ffb409a55ee1092cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"erDiagram.buildDiagramJoinSql (cognitive 19): erDiagram.buildDiagramJoinSql has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (5 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/erDiagram.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbae861f7745aeb88c2cc44a1e05f7865a7e6242c3275b15f5bca3effa706b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"diagramFormats.buildDiagramDbml (cognitive 19): diagramFormats.buildDiagramDbml has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/diagramFormats.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b3e11aa3a5d2212e0038face22e1b32a1aaa31c67c831aef224b1ed93951cf"}},{"ruleId":"D2","level":"warning","message":{"text":"navicatImport.readNode (cognitive 19): navicatImport.readNode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c6e6f84a51b83933ee86062c9944ae69c93589f13b24929166d79ac7af2c69"}},{"ruleId":"D2","level":"warning","message":{"text":"kvKeyTree.buildKvKeyTree (cognitive 19): kvKeyTree.buildKvKeyTree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/kvKeyTree.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4c913ba35199b4c505ad3f091e8a56b9a4ec393a3ab3a8be3e4f53f04418dd"}},{"ruleId":"D2","level":"warning","message":{"text":"modelTemplates.renderModelTemplate (cognitive 19): modelTemplates.renderModelTemplate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). None of this is in the body itself: all 19 points belong to 2 function items inside it that branch (parse, a function literal at line 50). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/model/modelTemplates.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e77124bb924bdfd73b510d2f7f9fefb822e007b86cad92524fcc8e92169924"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.classifyCursorInCall (cognitive 19): mongoCompletion.classifyCursorInCall has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"67da7374ab3e392a7b3e18e7f536d913fe5db5f52986c03b90be9d598ed7ff54"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.classifyFindProjection (cognitive 19): mongoCompletion.classifyFindProjection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b57a567053237eab97fc1ac147e1c48a403facbc875ec2dbd931b5512cdb48"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoConnectionOptions.mongodbAuthFailureHint (cognitive 19): mongoConnectionOptions.mongodbAuthFailureHint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoConnectionOptions.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cae865ff152acc864737578e58ddc9216cda8c25c64b39edfa5b49a296bd80"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.parseMongoUserInfoCommand (cognitive 19): mongoShellCommand.parseMongoUserInfoCommand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (6 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"effe4cb2c6b971fe9fabb884669825e99be8a508dae9707648af0f312a4fe4b8"}},{"ruleId":"D2","level":"warning","message":{"text":"pluginClipboardImage.requirePluginClipboardImage (cognitive 19): pluginClipboardImage.requirePluginClipboardImage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginClipboardImage.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f444686015de22b203ce31fcd5c373069704b7ae2fad03ba3e1b837c55caebf8"}},{"ruleId":"D2","level":"warning","message":{"text":"batchTableEmpty.runBatchTableEmptyLayers (cognitive 19): batchTableEmpty.runBatchTableEmptyLayers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 81). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/batchTableEmpty.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bf2ca1a84dcdce79646e67a62ecb41da6e32248c9b2db9f4eaa554beeff451"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarGlobalSearchIndex.collectSidebarGlobalSearchIndexes::visit (cognitive 19): sidebarGlobalSearchIndex.collectSidebarGlobalSearchIndexes::visit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, ternaries 2 (3 pts), error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarGlobalSearchIndex.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4290bb69ea41999e230c4de7da7942ef80360bed1759f0e882d275a0cecddcbd"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarLayoutMonitor.createSidebarLayoutMonitor.captureSample (cognitive 19): sidebarLayoutMonitor.createSidebarLayoutMonitor.captureSample has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e059d09aa100f4e9c5537fa377971bcf8746be281b7b0905146a5743cedd51e"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarTreeLabel.sidebarTreeDisplayLabel (cognitive 19): sidebarTreeLabel.sidebarTreeDisplayLabel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTreeLabel.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6355250d9a0bec19622a204c9f3cd5fda93392b0aef516ac8ce7323f47822ef6"}},{"ruleId":"D2","level":"warning","message":{"text":"ddlDisplay.findCreateTableBody (cognitive 19): ddlDisplay.findCreateTableBody has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, loops 2 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"634f6ab00350b600321d2fd38f1c374a496ee929aade87728f08a4cb33407a30"}},{"ruleId":"D2","level":"warning","message":{"text":"insertValueHints.buildInsertValueHints (cognitive 19): insertValueHints.buildInsertValueHints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d10a2f63055af31d2aacbe42ad730ce64c79d99c27e9929c480fe1b0d981dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"model.isTableListContinuation (cognitive 19): model.isTableListContinuation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, loops 2 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"604b46af672aefa83b6136b61de1e287f8f512b57ef4f2cb5066d3f634473539"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildCompositeHeuristicJoinConditionItems (cognitive 19): sqlCompletion.buildCompositeHeuristicJoinConditionItems has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, ternaries 2, loops 1 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6611}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec575e69556a026170ea487ddb2993de6d866800d105bc2491e08a0b9ec4691b"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildFunctionSnippetItems (cognitive 19): sqlCompletion.buildFunctionSnippetItems has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (7 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6841}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed751312bf46223676dc3c52a188e1e8c630c6e13a2bfc48c78f115ca81448e"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.tryReadQuotedSubstitutionPlaceholder (cognitive 19): sqlParameters.tryReadQuotedSubstitutionPlaceholder has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 2 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a9c2d4077d8098b3e07db81fe247a1094a3b8b9ee6247338c39eceddab5cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlInListPaste.splitPasteTokens (cognitive 19): sqlInListPaste.splitPasteTokens has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlInListPaste.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b0fae7004b4fb4c415704ce2757d40bc7311266e52b998354462aa3b165749"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlNavigation.resolveSqlObjectNavigationIdentity (cognitive 19): sqlNavigation.resolveSqlObjectNavigationIdentity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, 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":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92207c5b91b8a745d98c569a1bd6c1ea6f0931835b2d5b63cc2bd64fa67b6d0"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlNavigation.sqlObjectNavigationTargetFromIdentity (cognitive 19): sqlNavigation.sqlObjectNavigationTargetFromIdentity has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 4 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7ec967c7c0745745c62fb0d04c9d400ae340232ed5c5a1107d3c5cb76bb00d"}},{"ruleId":"D2","level":"warning","message":{"text":"columnDefaultPresets.starRocksDefaultPresets (cognitive 19): columnDefaultPresets.starRocksDefaultPresets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/columnDefaultPresets.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade00ef3b34f19525d17dac0d3ec44900202aa8b11d8631cc8143ee1366a44c6"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineWrite.prepareOracleRoutineSourceSave (cognitive 19): oracleRoutineWrite.prepareOracleRoutineSourceSave has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18 (34 pts), error handling 6 (13 pts), boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (oracleRoutineWrite.prepareOracleRoutineSourceSave::execute) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineWrite.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f517bce5194005a437f44546194a2663f7f2a7ad2235141fa1fa8cfe85f23e"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTableRename.readOnlyReconcile (cognitive 19): oracleTableRename.readOnlyReconcile has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"419e83856dd9b7637ed1a0c251d2c0e5c497cf83cb0a6b8dd3dde785b326d87e"}},{"ruleId":"D2","level":"warning","message":{"text":"routineParameters.sqlServerParameterDeclarationType (cognitive 19): routineParameters.sqlServerParameterDeclarationType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7, boolean chains 6, ternaries 3 (6 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":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c387468e8c18bd111d695b410e7ed45b64de153f0b8d186b36cedb742a0f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"tableVGroup.normalizeTableVGroupLayout::normalizeEntries (cognitive 19): tableVGroup.normalizeTableVGroupLayout::normalizeEntries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15e1c8ec3a60653e80bda6337ca321e0d8a3f795ac91a37ea89cc2e66fac177"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.tabDatabaseIconType (cognitive 19): tabPresentation.tabDatabaseIconType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1682e33059c5d1d0cb6d199432ef4a8c0d2595130cd504a114ead3a8ccefe71"}},{"ruleId":"D2","level":"warning","message":{"text":"tabSwitcherKeyboard.tabSwitcherReleaseKeys (cognitive 19): tabSwitcherKeyboard.tabSwitcherReleaseKeys has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabSwitcherKeyboard.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef428cb6cae73213f978bfde179725e0831957567dde6debafe5a5078663ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.startDisconnectRequest (cognitive 19): connectionStore.useConnectionStore.startDisconnectRequest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 1279, disconnectIfCurrent, a function literal at line 1296). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"130b21c1064c020551c1924a06f3425e73738bdf410201a643ada2ba7e5c7911"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.refreshWatches (cognitive 19): plDebugStore.usePlDebugStore.refreshWatches has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"7660bad0bb1eea42620bc48f17f80b682d21ad7f6ca8766c5fa515f4bb023345"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.revalidateObjectSourceTab (cognitive 19): queryStore.useQueryStore.revalidateObjectSourceTab has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 8, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3464}}}],"partialFingerprints":{"codehealthFindingId/v1":"013839119978f5753ae3c21eba7e07771845d4f17e4b00954dbeb37e110c4388"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.releasePluginConnectionsAfterClose (cognitive 19): queryStore.useQueryStore.releasePluginConnectionsAfterClose has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, error handling 1 (2 pts), loops 2 (nesting depth added 7). Of this number, 10 points are the body\u0027s own statements and 9 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3f745d5231d2cabdfc360534030a564cf110045256ee5316eccc702acf178e"}},{"ruleId":"D2","level":"warning","message":{"text":"agentBundle.extractDriverPackage (cognitive 19): agentBundle.extractDriverPackage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, ternaries 1 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/lib/agentBundle.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6628224830dfa8cbee818cd3fde1bad4b95b7716b8004732568e6deeeee1eb"}},{"ruleId":"D2","level":"warning","message":{"text":"json.removeTrailingCommas (cognitive 19): json.removeTrailingCommas has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4492692956beec56fad31f46cb67555bc4d363fd649879bafed14da54f9da63"}},{"ruleId":"D2","level":"warning","message":{"text":"outline::walk (cognitive 19): outline::walk has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (11 pts), boolean chains 4, if/else 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0778b9987697ef3870eae4585a455cb6180ec08447db439ab4cb2a2374ed6e45"}},{"ruleId":"D2","level":"warning","message":{"text":"stopProcessTree (cognitive 19): stopProcessTree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, error handling 1, loops 1 (nesting depth added 4). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (signal, a function literal at line 18, a function literal at line 10, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/process-tree.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba77303ccc7ef3968076a900ea374234a6e8dd717d71150ab3a1d909c3bd5f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::list_claude_models (cognitive 18): dbx_ai_provider::ai::list_claude_models has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4686a9dbeec3361976c0017dbac4f93f1f0ca6597b1df6253e97bb379c4bd9d6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::classify_error (cognitive 18): dbx_ai_provider::ai::classify_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3441}}}],"partialFingerprints":{"codehealthFindingId/v1":"50728a7ba970c8be217269ef1e6038da61fd68e9db5dda567182e9b0d4a311b3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_cli::run_context (cognitive 18): dbx_cli::run_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 3 (4 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/main.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca925c74cc1ee502027fd1bc7b614d6a476f3b4f3a33dee6cf9ca56fd58fa4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"PoolRoutingControl::detach_agent_pool_if_current (cognitive 18): PoolRoutingControl::detach_agent_pool_if_current has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af5d250b8318485a940dbee49c2d2e928120f15148186c0bca36edac452f19b"}},{"ruleId":"D2","level":"warning","message":{"text":"StrictTranscodingReader::read (cognitive 18): StrictTranscodingReader::read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"065c0a034d07713618c39296246cfe2d8493c3763040bf54e8e7f5ff61bc4c11"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupService::cleanup (cognitive 18): BackupService::cleanup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/service.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0e2b0c76981b2d5772bb505e083eccd422fcd5fc37e430ea8ba27525e4db4f"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleSchedulerProjection::bind (cognitive 18): OracleSchedulerProjection::bind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition/projection.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f71d024a9276ca7395cfe3b8083d6085b411eb7932678e5bf599e093625082a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::consul::archive::consul_import_execute_core (cognitive 18): dbx_core::admin::consul::archive::consul_import_execute_core has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/archive.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcb872182df2e2e656eb6a995648bbce133a827f83facfeb994d183438e2605"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::consul::bulk::consul_delete_prefix_execute_core (cognitive 18): dbx_core::admin::consul::bulk::consul_delete_prefix_execute_core has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/bulk.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d38d69cbe15eeaa3cce05f85a1a9db5d08c870dbf81bcf5aa81c1ba971543c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::nacos::access_control::execute_commands (cognitive 18): dbx_core::admin::nacos::access_control::execute_commands has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5be3a432f6554cb6aeb2970a503bbfadedc77b79e4a6b61d257e30c87e8a20"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::agent_loop::maybe_compact (cognitive 18): dbx_core::ai::agent_loop::maybe_compact has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_loop.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2064e44cee9cd0c56b3f98d0c30cd411a4069137d56d90f1defbfcdcc97f115c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::dameng_dump::run_tool_and_collect (cognitive 18): dbx_core::data::dameng_dump::run_tool_and_collect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/dameng_dump.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d81353d78a07671881d16fad48ea089d9e42f1243800ff6e2feb306e7399d1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::parse_export_rfc3339_parts (cognitive 18): dbx_core::data::database_export::parse_export_rfc3339_parts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"099262f44925b97c77dfb180f939ee06c6711a9e5c0ff20eb7f70f307500b8ab"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::script_generator::wrap_conditional_check (cognitive 18): dbx_core::data::script_generator::wrap_conditional_check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58c4ee2330d62efa6351e4d79766ae0945386278d057815b8fb8c5f74f104c2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::script_generator::generate_complete_script (cognitive 18): dbx_core::data::script_generator::generate_complete_script has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"003d4b1c34a69319da3fca754f4afe160042c052bff81409ab264a56c8c18045"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::sql_file_import::sql_file_import_target (cognitive 18): dbx_core::data::sql_file_import::sql_file_import_target has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 3 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1871ffc165d2940f88946d5479cfa2b9f5d14ba83d96e9b3ff69739b28345b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::open_xlsx_shared_strings_with_control (cognitive 18): dbx_core::data::table_import::open_xlsx_shared_strings_with_control has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3500}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fd782e9c74fb623723e6ceeddaf9b9f388352160e7f4ec75c30f12b260c011"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::transfer_ddl_statements (cognitive 18): dbx_core::data::transfer::transfer_ddl_statements has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":8784}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36c5fd30b31f16c68a59d2522b240e14179de4b79b9cf55a34e970e4b8fc971"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::preview_transfer_ownership (cognitive 18): dbx_core::data::transfer::preview_transfer_ownership has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":11536}}}],"partialFingerprints":{"codehealthFindingId/v1":"142dbdd2dc52fd1969fff1dc142c6f03ec23f926eb2f69eaa62eb9e93a63df5f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer_rebuild::detect_parsed_view_dependencies (cognitive 18): dbx_core::data::transfer_rebuild::detect_parsed_view_dependencies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_rebuild.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a13e686f3ede68f2d9d584acf710349bc1199d6258a6e4c3998bfec0008e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::persistence::storage::insert_connection_copy_next_to_source (cognitive 18): dbx_core::persistence::storage::insert_connection_copy_next_to_source has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":7317}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bc6d3629db0b757eae264024898892f314d3943ea3fdd296c3af70acc6c6dd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::get_table_comment_core_with_pool_key (cognitive 18): dbx_core::schema::get_table_comment_core_with_pool_key has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3246994871da88efb368d18b400d9d3b7ac20b8f9fecc144546ef1552803f3fe"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::cloudberry_native_tree_ddl (cognitive 18): dbx_core::schema::cloudberry_native_tree_ddl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (7 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":18483}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d93e552c0d734f47029ba50901165b474219eebceda3b964df5f1c9e9cf410"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::dameng::resolve_operators (cognitive 18): dbx_core::schema::native_jobs::operations::dameng::resolve_operators has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efaf44c67ff015ca8f160570078dc5948ff3a8c0c6fd872f651f7f06dcad468"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::readback::readback_single (cognitive 18): dbx_core::schema::oracle_routines::readback::readback_single has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/readback.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5532aec490d4af8ffce0518d581ae2016c6c798384b1191214b0ea42f7380f88"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::transfer::packages::transfer_input (cognitive 18): dbx_core::schema::oracle_routines::transfer::packages::transfer_input has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59d1fa93076586aa7b596dba7d99facf73c2fba86b6eaa0b12fd182fa304163"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_data::read (cognitive 18): dbx_core::schema::oracle_type_data::read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96927e2388081db44b14919e09dd78f6cedf37f5efd592a906fdc49e151f4ca"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::table_structure_sql::sqlite_rebuild::parse_identifier (cognitive 18): dbx_core::schema::table_structure_sql::sqlite_rebuild::parse_identifier has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e843d475784009b2affdf31126ab458068e1a864abbb72aa9b4c84d46db0f7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_service::upgrade_all_agent_drivers_with_registry (cognitive 18): dbx_driver_agent::agent_service::upgrade_all_agent_drivers_with_registry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8ca8ceaffa120acf52d941dc24c53ec1c2490fe2ffcf6937ceba10c36af8f5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_connection_time_zone (cognitive 18): dbx_driver_mysql::mysql::mysql_connection_time_zone has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"e546ba97ecb4e927834e07ca99715c25b7a9e1f09c969cdcbc06923a5958856f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::list_objects_for_browser (cognitive 18): dbx_driver_mysql::mysql::list_objects_for_browser has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5003}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a3baeafda0fd8d448f18d8e14383b34a0e6fc05128707966f61fe146917488"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::execute_query_on_conn_with_limits_progress_resolved (cognitive 18): dbx_driver_mysql::mysql::execute_query_on_conn_with_limits_progress_resolved has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 4 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7321}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d45602c5ee92885982f7fc66b61dc4a96330f2f5b294038acc6737627ec71f2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::decode_pg_numeric_bytes (cognitive 18): dbx_driver_postgres::postgres::decode_pg_numeric_bytes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4dd870ddd7d33523d58627bccdbfcea3c38c11cdff19d404218e1ad3e40087"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::pg_array_to_json_value (cognitive 18): dbx_driver_postgres::postgres::pg_array_to_json_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf4c26325c203639168ff64b436635565b751bb720e90009acb97bda406aba9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::list_indexes_for_relations_with_sql (cognitive 18): dbx_driver_postgres::postgres::list_indexes_for_relations_with_sql has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":5475}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfbc21865f28ba7cab923825184f9e60a2a3ced6a1033779aa6cd14de54be35"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::custom_type_domain_attributes (cognitive 18): dbx_driver_postgres::postgres::custom_type_domain_attributes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":7815}}}],"partialFingerprints":{"codehealthFindingId/v1":"062f82938ba38c4c2397bab4c6a3219f43caf5e9a4145a2c202463452d4eff02"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::sqlserver_balanced_transaction_batch_can_use_execute (cognitive 18): dbx_driver_sqlserver::sqlserver::sqlserver_balanced_transaction_batch_can_use_execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":4261}}}],"partialFingerprints":{"codehealthFindingId/v1":"257a704d7c6326d13ee9425426a4474b9352f7ad201e9498ed956c93fcccca9f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_support::navicat_mysql_tunnel::serve_client (cognitive 18): dbx_driver_support::navicat_mysql_tunnel::serve_client has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/navicat_mysql_tunnel.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf3f4bb708776f852f22ffa6f44c6396b0aaad91959d9ceaf269b046e0bd8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_support::navicat_mysql_tunnel::parse_navicat_response (cognitive 18): dbx_driver_support::navicat_mysql_tunnel::parse_navicat_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/navicat_mysql_tunnel.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbdf6b87548863cb11c507adf230b631efa2864436f0dca04ddab96093b3bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::cloudflare_d1::proxy_from_transport_layers (cognitive 18): dbx_drivers::db::cloudflare_d1::proxy_from_transport_layers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff8ae421603e5fcc822b1e1fb2ad4210acc93ec8b3bf39017260849a4bfded4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::meilisearch_driver::meilisearch_sort_from_request (cognitive 18): dbx_drivers::db::meilisearch_driver::meilisearch_sort_from_request has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 5 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/meilisearch_driver.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50b2c7d46f4f6aec14b6575ffc3ba855d2feec65033d6a51243ccaab68938bc"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::sqlite_completion_assistant_search (cognitive 18): dbx_drivers::db::sqlite::sqlite_completion_assistant_search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"267c287d9433a291e3c5edfd19937f94368debd415404e649493f7620584eda2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite::list_triggers (cognitive 18): dbx_drivers::db::sqlite::list_triggers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (18 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eda30cd9ecd44fc766e27e8c5759f78d691a8fa6f9aa4be51ff4b7a48523924"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::sqlite_worker::connect_sqlite_worker_with_route (cognitive 18): dbx_drivers::db::sqlite_worker::connect_sqlite_worker_with_route has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite_worker.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a76257093c8899a68b12af2114dcd41dcb1cc0c137096d8ee25fea97e45f978"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::plugin_tools (cognitive 18): DbxMcpServer::plugin_tools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9616f3906bc892237e908de41fd7383a7b05eed6c8103479f97132e4fed4d9a9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_mcp::server::validate_transaction_sql_shape (cognitive 18): dbx_mcp::server::validate_transaction_sql_shape has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":6777}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ca756658eb1fd4869a60e69beed63d3cb677f76dcd2b501fb6cb5107a38c9f"}},{"ruleId":"D2","level":"warning","message":{"text":"UserInputSpec::parse (cognitive 18): UserInputSpec::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/runtime.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f3c246da16992cc681c18d5d745a175c5c09b61eaad7f234d91d897334c0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_runtime::plugins::installer::extract_package (cognitive 18): dbx_plugin_runtime::plugins::installer::extract_package has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a2ea3051fcbdc821890ffcfacbb990747e4c4ecab85b3ce5e59d270fa503bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::unknown_qualifiers (cognitive 18): Analyzer::unknown_qualifiers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1354f2af8753de10cf488ec0f9cf12ac4cf7c037a3956722af2d439ad70f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::retained_index_create_is_redundant (cognitive 18): dbx_sql_core::object_source_sql::oracle_indexes::retained_index_create_is_redundant has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 2 (5 pts), boolean chains 3, 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":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1f0a1c7d9b2340322e8671ee3d923d89b448e96280f1784dcf5595f1efde95"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::oracle_view_rename::add_binding (cognitive 18): dbx_sql_core::oracle_view_rename::add_binding has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab05e4866a62c18204f7da1fe4c7c42e412db6e42b9a30f4ea7a65179cf787d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::query_execution_sql::select_contains_top_level_into (cognitive 18): dbx_sql_core::query_execution_sql::select_contains_top_level_into has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10f69d5ab07d8445cc2997ddd1e0e1330c5165e3bda588456528a716bb5ae9a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::preprocess_psql_control_commands (cognitive 18): dbx_sql_core::sql::preprocess_psql_control_commands has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2686}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c1f7bc3e46bd77d18e8365dea7679c7100a4080e11507d1dc72ad12d228329"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_analysis::analyze_sql_references (cognitive 18): dbx_sql_core::sql_analysis::analyze_sql_references has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, match/switch 3 (4 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f3c99266f9f584b8a305fc670f6d8ed4644897b8ff364dc00801b6473fc6a7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_extractors::delimited::write_dsv (cognitive 18): dbx_sql_data::data_grid_extractors::delimited::write_dsv has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/delimited.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2531a491c60dcc66e8629930f75224980aedc4b4f94de86874a1fc58171a60"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::leading_execution_hint_prefix (cognitive 18): dbx_sql_data::query_result_sql::leading_execution_hint_prefix has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a6d84c62a808f65e0bf40d62764395945f0942f5a60bcc9210713989e83c0a"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraph::count_transitive_edges (cognitive 18): DependencyGraph::count_transitive_edges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1a1b664befebea423d74166fcc6ca4b92b9d6fc463704ec0baebb2acc011b1"}},{"ruleId":"D2","level":"warning","message":{"text":"GitDiffScanner::parse_diff_output (cognitive 18): GitDiffScanner::parse_diff_output has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/sql_parser/git.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"65df89a3b9860b65ea2af00ec4b2b2463894755850e8db3dcbd508fa0d1797ff"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::detect_renames (cognitive 18): dbx_sql_schema::schema_diff::detect_renames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded44ea1b081bb6933b5593d8e4ca4322f69c5d5c5098a0f0f64214505ad6b6d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::columns::build_primary_key_sql (cognitive 18): dbx_sql_schema::table_structure_sql::columns::build_primary_key_sql has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/columns.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bba7ad5cdfbff1516044068561ac15e4083e1f011eaac6e99241dc35a182f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::postgres_foreign_table::create_clause (cognitive 18): dbx_sql_schema::table_structure_sql::postgres_foreign_table::create_clause has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/postgres_foreign_table.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d43c67793ef5032ac0ec6b77680dc227a9797524041336a2b5ddb9219ed5aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_types::models::connection::migrate_legacy_transport_layers (cognitive 18): dbx_types::models::connection::migrate_legacy_transport_layers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9079e8415cd69f5f4f50a8c7f76eddfa4af7cf4123a6087b998df9a95b9dd06"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::locale_family (cognitive 18): dbx::locale_family has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lib.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7e0e9da19fbabc70996fe94188f59bf4903bbfe975af12de8d5ae833b6b0f8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::background_backup::run_if_requested (cognitive 18): dbx::background_backup::run_if_requested has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/background_backup.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f57addd95a09cdb574acc62daadc392df87f77bf4dadf28ed6408f2568e142"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::plugin_download::download_plugin_file (cognitive 18): dbx::commands::plugin_download::download_plugin_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/plugin_download.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e127fd9bf1e8fcce1fa8ea6b1d22e04ad4f9220a477398ffe5c57272f1ca929b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::plugin_file::drop::collect_folder_files (cognitive 18): dbx::commands::plugin_file::drop::collect_folder_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/plugin_file/drop.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cec2fb3637e399ec3c19c84a6867318800a4e13889bdb09e106883e253e822"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::plugin_ui_protocol::media_response (cognitive 18): dbx::plugin_ui_protocol::media_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/plugin_ui_protocol.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4242adc8e6044efeef99754b943780c8328e230b32fb5f56ab80dd603d365c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::webview2_preflight::runtime_health (cognitive 18): dbx::webview2_preflight::runtime_health has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/webview2_preflight.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c100316f20ff28fb87b5a28663f4e5ad23c40ab9b0e63ed124be287ad2753f9"}},{"ruleId":"D2","level":"warning","message":{"text":"DedicatedAttempt.completeOpen (cognitive 18): DedicatedAttempt.completeOpen has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff43ba98a7eca355c8e34aa6abfa46a880b21a8835d40bf079a359b68c4c731f"}},{"ruleId":"D2","level":"warning","message":{"text":"OracleTriggerReader.enrichObjects (cognitive 18): OracleTriggerReader.enrichObjects has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 2 (6 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45126430ba540500a7a59c47bc2342c54db7ef3a3da2fb9bd4359337e25a917"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.openConnection (cognitive 18): DbxJdbcPlugin.openConnection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, error handling 2 (5 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"258c2a45f6a100db0d78523aeccba797844b379df8f0408a250c5f05d3bbfb9d"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.oracleExplainBindMarkerCount (cognitive 18): DbxJdbcPlugin.oracleExplainBindMarkerCount has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2585}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2014591d17cc40be8d36b5e00bdf7d74d1170a9c8fb2ca49b5ba555897ed322"}},{"ruleId":"D2","level":"warning","message":{"text":"DamengAgent.tableColumnComments (cognitive 18): DamengAgent.tableColumnComments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, error handling 2 (3 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"67292772403ba77d6706ec9fc079241ce0baea73eb00f5616f97fe2135e8885f"}},{"ruleId":"D2","level":"warning","message":{"text":"FirebirdAgent.listObjects (cognitive 18): FirebirdAgent.listObjects has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdAgent.java"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a572ec5539abdcac5782906b4b0c11a0948db8eb88cbdcb6b15e2e87350652"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.collectPeekedMessages (cognitive 18): KafkaAgent.collectPeekedMessages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e47c6b94ce66e2b428f02cd5c39b6c4492b4dfe14f668513ed0d61b219510dd"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompositeOutput.validate (cognitive 18): PlDebugCompositeOutput.validate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeOutput.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d288da99fe4f97a3b2f003c25fa80d46604d3c6682f7aa1c2f8d3ea152339b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ci-install-system-deps.rewrite_ubuntu_uris (cognitive 18): ci-install-system-deps.rewrite_ubuntu_uris has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/ci-install-system-deps.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c33258fa5d56a423e78d425ec12df58308ce9de3fd4271b3e3a9b5e5dd7bfaf"}},{"ruleId":"D2","level":"warning","message":{"text":"configure-docker-mirror.configure (cognitive 18): configure-docker-mirror.configure has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/configure-docker-mirror.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c29905f34a7b0abd8effa311b6e28e4402023fca6308f803ec4cadbe513e832"}},{"ruleId":"D2","level":"warning","message":{"text":"server.queryInformationSchemaColumns (cognitive 18): server.queryInformationSchemaColumns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"23889bf61b95503dd58398a1007739d1c8fc5da537ff44f9837b2058514a1ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getViewSource (cognitive 18): server.getViewSource has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 1 (nesting depth added 4). 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: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdb54b5f4c88d5d387429719160a76877491ce950491ad5c0d86e3ed58d4f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"server.routineQueryContext (cognitive 18): server.routineQueryContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/routine_metadata.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75f29f54394dd9c4fa051ab0beb530ac920567555c010e307383e951b8ee278"}},{"ruleId":"D2","level":"warning","message":{"text":"main.drainDBMSOutput (cognitive 18): main.drainDBMSOutput has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/dbms_output.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c05bd7d91f1ddd5b0e1bed800ab268d05b1f138f353fd8f13e33cc6eee7ea98"}},{"ruleId":"D2","level":"warning","message":{"text":"main.splitTopLevelSQLList (cognitive 18): main.splitTopLevelSQLList has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6006}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd48acbe45e365962404eba692e1258d6a31e8312ec959de3f5eb9b56024828"}},{"ruleId":"D2","level":"warning","message":{"text":"main.findTopLevelSQLKeyword (cognitive 18): main.findTopLevelSQLKeyword has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6044}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a12df9f998ca42b1c8a552cb35370c93efd88a747ce146cd63441a503fedde2"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getExplainInfo (cognitive 18): server.getExplainInfo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4419}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0afd691b7c0eed54928378949021af015242526ca757ce36a843bf3f909565"}},{"ruleId":"D2","level":"warning","message":{"text":"rocketMQAgent.listConsumerGroups (cognitive 18): rocketMQAgent.listConsumerGroups has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fef12f73cc7b41d96ca282ccc65f9b037db0934cba364eb45bea8ded63be44d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.readQuerySessionPage (cognitive 18): main.readQuerySessionPage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"2798d6006c8eb3e92388a3d4dff8f58653a23a2e305cd8ec16afa10b8b74705c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.negotiateSASLDigest (cognitive 18): main.negotiateSASLDigest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/sasl.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f7304f07f5485b5564cdedb980bde7ef19ab7e92762760e306f93f5b69232c"}},{"ruleId":"D2","level":"warning","message":{"text":"client.newClusterSessionWithSqlDialect (cognitive 18): client.newClusterSessionWithSqlDialect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e810141ed2f0272cf582eebcfcba7b3e863791e07252d6cede6079d2712109"}},{"ruleId":"D2","level":"warning","message":{"text":"ddlStorage.spliceTightRemovals (cognitive 18): ddlStorage.spliceTightRemovals has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (6 pts), boolean chains 2, loops 2 (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"656a3dd89a8bd6377a3133638c43ed2b426b1e2209c4184bf4bb25c753ffc958"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlStatementRanges.skipSqlTrivia (cognitive 18): sqlStatementRanges.skipSqlTrivia has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7020ea5b69e186d563c44f34ea4ae21d6311762de5da4ef713c2d9ca9df8b9d9"}},{"ruleId":"D2","level":"warning","message":{"text":"queryEditorHoverContent.createQueryEditorHoverContent.createHoverDom (cognitive 18): queryEditorHoverContent.createQueryEditorHoverContent.createHoverDom has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, error handling 1 (2 pts), ternaries 2, loops 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorHoverContent.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"22931daa7809645a097440ee9537d66b4c9d48d27b38c56addf7a68a23af03df"}},{"ruleId":"D2","level":"warning","message":{"text":"queryEditorSqlExtensions.configureQueryEditorSqlExtensions (cognitive 18): queryEditorSqlExtensions.configureQueryEditorSqlExtensions has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 17, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe15e72e92fafd3ead8a9103f66062eb537048b4851f3ecd4268c0c654e3956e"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferValues.timestampTargetType (cognitive 18): queryResultTransferValues.timestampTargetType has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 6, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3f56c2d2484dd6c3788b52d9fee1f65bcd97a7547b82b333525e759acac6bb"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferValues.bitStringLiteral (cognitive 18): queryResultTransferValues.bitStringLiteral has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 5 (7 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb0c04a95dc6307ed8faf2fa2c824af7005538c5ee15a85d5eecf50bdca5488"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.settlePendingSave (cognitive 18): useDataGridEditor.useDataGridEditor.settlePendingSave has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a123fe78c331b5a088a385958f649271580dd210269024eff571afcafe22c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"useExportTracker.findActiveOverlappingTransfer (cognitive 18): useExportTracker.findActiveOverlappingTransfer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"de58c8ca16295853c00084a6a94ab8de17bc1e0a238428c8221dee2c54aa3fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"useFlatTree.createFlatTreeIndex (cognitive 18): useFlatTree.createFlatTreeIndex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useFlatTree.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"30235ef155127b299c25ea97715581f2e4a7e29ff892e6940751af908ea9aa7a"}},{"ruleId":"D2","level":"warning","message":{"text":"useNativeJobExecution.useNativeJobExecution.acceptStatus (cognitive 18): useNativeJobExecution.useNativeJobExecution.acceptStatus has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNativeJobExecution.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dacc15a78e74abca846014c992d7d90a883a5bcc9f3761c17d0008751d605f1"}},{"ruleId":"D2","level":"warning","message":{"text":"useQuickOpen.matchWordPrefixes (cognitive 18): useQuickOpen.matchWordPrefixes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"20adac7eb471a9190a34da504925bc3eca1424fbd3b3da6a3407a9464e3a73e4"}},{"ruleId":"D2","level":"warning","message":{"text":"useQuickOpen.useQuickOpen.runRemoteSearch (cognitive 18): useQuickOpen.useQuickOpen.runRemoteSearch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, error handling 2, ternaries 1 (2 pts), loops 1 (nesting depth added 3). None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 931, 915, 935). 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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3d2255160285684d3cdc5964c29fc6c0d594957e236d67edc0f072b645f594"}},{"ruleId":"D2","level":"warning","message":{"text":"documentStoreProvider.parseDocumentFilterValueList (cognitive 18): documentStoreProvider.parseDocumentFilterValueList has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2e23122b4bacb5097e0397c28e982ddfe6291516affd7d356f054163f2a1a8"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduledDatabaseBackup.normalizeDatabaseBackupSchedule (cognitive 18): scheduledDatabaseBackup.normalizeDatabaseBackupSchedule has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7, boolean chains 6, if/else 3, error handling 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"187fdbcffbb0d884e0c1071480cad1e7bb4fadf0194857844b4b6612a3b57ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeText.decodeImportFileText (cognitive 18): decodeText.decodeImportFileText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/decodeText.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02881ff69baac7a8633e4e09c82ac4f8ab74682d45dc45cf22913a33f42cea9"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionLevelDatabaseBootstrap.stripLeadingSqlComments (cognitive 18): connectionLevelDatabaseBootstrap.stripLeadingSqlComments 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":"apps/desktop/src/lib/connection/connectionLevelDatabaseBootstrap.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38f2946a1f7f3810523ca5139235925ef63072fa41aff46231f8069c775fb18"}},{"ruleId":"D2","level":"warning","message":{"text":"columnFormatter.parseIoTDBTimestampEditorValue (cognitive 18): columnFormatter.parseIoTDBTimestampEditorValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, error handling 2 (3 pts), ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da2c4ad89f2f12d2ee22d25016e6b4f834ec5dd800c5b3c995c364a04f128f7"}},{"ruleId":"D2","level":"warning","message":{"text":"columnFormatter.formatJsonPath (cognitive 18): columnFormatter.formatJsonPath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"e686aaf38068e2df7289f75f824217e4448df1fbeda10e51d3083418933b2d59"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGenerate.formatGeneratedValue (cognitive 18): dataGenerate.formatGeneratedValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"df13a8757e5d5ef8c65c74a1605f8c579febbacd68149a32987bc7945afc0579"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnFilter.splitFilterValues (cognitive 18): dataGridColumnFilter.splitFilterValues has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2a882e76c0e759f18703b910e072197dc62d65d91bf0e57e6bdf825b0392b0"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnIndexIcon.buildColumnIndexMap (cognitive 18): dataGridColumnIndexIcon.buildColumnIndexMap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (5 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnIndexIcon.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"40baa15552021f6cb6ca80407dbe71765fbb2f9be7aaf663e230e6be1ea00767"}},{"ruleId":"D2","level":"warning","message":{"text":"geometryPreview.tokenize (cognitive 18): geometryPreview.tokenize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"10db11efe4ca76249514ca70809321428e30dcd4d2b8c33bce649d9c9725b329"}},{"ruleId":"D2","level":"warning","message":{"text":"gridSelection.summarizeSelection (cognitive 18): gridSelection.summarizeSelection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 3, loops 2 (3 pts), ternaries 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/gridSelection.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b147ace0462485f70d0ec49149b5f9baf670022133de3484d185cf3808184ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"oceanbaseSessionDiagnostics.captureOceanbaseDiagnosticTarget (cognitive 18): oceanbaseSessionDiagnostics.captureOceanbaseDiagnosticTarget has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, error handling 1 (2 pts), ternaries 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2635d1979ced41ea045af56c1b64d4bdf1794334a16d188acd44e386f1acd6b"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleConstraints.constraintRecoveryCandidate (cognitive 18): oracleConstraints.constraintRecoveryCandidate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"213faa6167e5e5d20fde619b2bb87bb43ddfaaef865ee66b557535ce88f4d4fd"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleConstraints.readbackMatches (cognitive 18): oracleConstraints.readbackMatches has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 8 (9 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"704da94ae1f5d09fcdb4b30ffe36cd55d927986c9924c5bedafd031bca2319da"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleConstraints.prepareOracleConstraintPlan (cognitive 18): oracleConstraints.prepareOracleConstraintPlan has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9b257f18d8dca0e074659d3aed6500e5508c6252444e055c9088ec4a872df4"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleUserAdmin.buildOracleObjectAuthorizationPlan (cognitive 18): oracleUserAdmin.buildOracleObjectAuthorizationPlan has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleUserAdmin.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d38a736799f76bb91e1408fbb2aaec013a99530b39fecfaad23344df470d59d"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleUserAdmin.createOracleUserAdminActions (cognitive 18): oracleUserAdmin.createOracleUserAdminActions has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (14 pts), boolean chains 2, if/else 2 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleUserAdmin.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8194e447e8b91ef77c77fbd1a0dbf888c391829cbac295f70cb4328d099282e"}},{"ruleId":"D2","level":"warning","message":{"text":"dataDictionaryPdf.flowObjects (cognitive 18): dataDictionaryPdf.flowObjects has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/docs/dataDictionaryPdf.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d658b72a4f208a3d54484e66fa27bf43c8c4a329851fea795f801c6cfe1fc434"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorShellLineCommentHighlight.createShellLineCommentHighlight::buildDecorations (cognitive 18): codemirrorShellLineCommentHighlight.createShellLineCommentHighlight::buildDecorations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorShellLineCommentHighlight.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0545646a7117e9e09cb89f8fb8a113d461747c3db9371c82dea3b60bfee963ba"}},{"ruleId":"D2","level":"warning","message":{"text":"queryEditorParenthesisMouseSelection.sqlParenthesisContentRangeAt (cognitive 18): queryEditorParenthesisMouseSelection.sqlParenthesisContentRangeAt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorParenthesisMouseSelection.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7fe3b82dcb456590f4646d625cc7280424380b2ec99dc45aa92d86e32abfa2"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlSemanticSelectionRanges.validateTokens (cognitive 18): sqlSemanticSelectionRanges.validateTokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"761ad6a0de7e9a5c17156211e3131b3770b61045783276313afb11849ff39bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseExportOptions.loadSavedDatabaseExportOptions (cognitive 18): databaseExportOptions.loadSavedDatabaseExportOptions has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 12, if/else 3, boolean chains 2, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExportOptions.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4836d75a20d1c3e46210f8348d218fd2ea2096599528a34fc642ef12260c62"}},{"ruleId":"D2","level":"warning","message":{"text":"diagramFormats.diagramExportFileName (cognitive 18): diagramFormats.diagramExportFileName has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8 (17 pts), boolean chains 1 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/diagramFormats.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feba168d4fb59a937651ff7588cb924afbfd85cab9658239a575a139f55ef61"}},{"ruleId":"D2","level":"warning","message":{"text":"xlsxExport.cellXml (cognitive 18): xlsxExport.cellXml has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 5 (6 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/xlsxExport.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0571b922af993ac7536d32193c97720e9597f80f1a535d859164a09bc123a68"}},{"ruleId":"D2","level":"warning","message":{"text":"neo4jGraph.applyNeo4jGraphPropertyToResult (cognitive 18): neo4jGraph.applyNeo4jGraphPropertyToResult has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 5). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 76, propertiesDisplay, a function literal at line 74, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/neo4jGraph.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b4b03dc8e0d9b3071d6a5c97044192ece152ae6e366183a3b1ca30cca20084"}},{"ruleId":"D2","level":"warning","message":{"text":"dbeaverImport.parseJdbcUrl (cognitive 18): dbeaverImport.parseJdbcUrl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/dbeaverImport.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61eec7cbc4cfff2bc407cdf56458d9648e1431c8661496692cd7a93aad571cf"}},{"ruleId":"D2","level":"warning","message":{"text":"navicatImport.inferProfile (cognitive 18): navicatImport.inferProfile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"111302ed0e441ca997104563a5432678a6720cc5b4d86d20e9beaf19dacdc7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoDocumentValues.buildMongoCopyUpdateDocument (cognitive 18): mongoDocumentValues.buildMongoCopyUpdateDocument has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ef629f768fd4811f0acdd15e0b3cea8073224bcc50fc7a2095df5ecacb6a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.findUnsupportedValueConstructor (cognitive 18): mongoShellCommand.findUnsupportedValueConstructor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b709b93dd0487d9a36eaf5bffb8f841cad8b089ade495334ef022dac0843678"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoSql.exprToFilter (cognitive 18): mongoSql.exprToFilter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 4 (8 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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90732853c665d7fe2698fd734bab8fe31589d8d017cb4ebebb281ce1729b450"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoSyntaxDiagnostics.describeMongoWriteRisk (cognitive 18): mongoSyntaxDiagnostics.describeMongoWriteRisk has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 2 (4 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSyntaxDiagnostics.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59b57eecda9344c709de7c8e87ee35f0700dbbd395d8fffe7d40cf631ef39e4"}},{"ruleId":"D2","level":"warning","message":{"text":"nacosAdmin.pairChangedLines (cognitive 18): nacosAdmin.pairChangedLines has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb7d9a5820336935dbad55dea4ce58e4038aa020a7a47b61eb2e5635decab5c"}},{"ruleId":"D2","level":"warning","message":{"text":"savedSqlSearch.findSavedSqlSearchMatches (cognitive 18): savedSqlSearch.findSavedSqlSearchMatches has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 2 (8 pts), if/else 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlSearch.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb63cd205bdeef914ee540d906dac55cf13c5f4203dfd199c1ed9bc482d99cf"}},{"ruleId":"D2","level":"warning","message":{"text":"packageMembers.buildPackageMemberNodes (cognitive 18): packageMembers.buildPackageMemberNodes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/packageMembers.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84ee98245303d2e8a378e2a41d17d4625bbae3797b3e0e9ebfca6ac876b7101"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarSearchTree.filterLocallySearchedTableNodes (cognitive 18): sidebarSearchTree.filterLocallySearchedTableNodes has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, ternaries 5 (7 pts), if/else 2 (nesting depth added 2). None of this is in the body itself: all 18 points belong to 5 function literals inside it that branch (lines 114, 135, 126, \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":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e9afb42e8315f908e1c13a7ab7deb2833aedd75022084606b82fd4fcd7a9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarTableVGroupDrag.resolveTableVGroupDropTarget (cognitive 18): sidebarTableVGroupDrag.resolveTableVGroupDropTarget has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTableVGroupDrag.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"519a1a732929f7aa8b5247fc2374ece20648e7fb49991d08578b0252d60a910c"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printElement (cognitive 18): printer.printElement has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1b4992db6d56094b434ecfa4fa24a9b1d89b60440503956891c426bb13e5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"completion.sqlSemanticSelectStarIsOnlyProjection (cognitive 18): completion.sqlSemanticSelectStarIsOnlyProjection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"488300856db63064867c8b7b964e13f0f8590cff68c77064abb141525a2a4343"}},{"ruleId":"D2","level":"warning","message":{"text":"model.trailingIdentifier (cognitive 18): model.trailingIdentifier has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b4352e9734f1e8a6abac4108ad7466b00e00aad633a7af328dd8e6aedf2f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildAliasItems (cognitive 18): sqlCompletion.buildAliasItems has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5895}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9cd8005fc65829b3f21aae6854a6ceb199d0142203f937f8e948240272978f"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlDiagnostics.sqlErrorDecorationRange (cognitive 18): sqlDiagnostics.sqlErrorDecorationRange has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDiagnostics.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa1a8640a540644d7dbe52588d07bec824852a1c0f19f23e36211c1143914b5"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlSelectionCase.convertSqlSelectionCase (cognitive 18): sqlSelectionCase.convertSqlSelectionCase has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 2 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlSelectionCase.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e6e64409dc4299f9b8f664f5dd48e660efa355a30dc72d7efa675779d2f9f4"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlSourcePaste.parseSourceSqlLiterals (cognitive 18): sqlSourcePaste.parseSourceSqlLiterals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlSourcePaste.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe970aa9eef39ac6eba5c856be82058a946493654a0a5849ea36223b9e2a0c44"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlVariableSyntax.updateSqlVariableSyntaxToggle (cognitive 18): sqlVariableSyntax.updateSqlVariableSyntaxToggle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariableSyntax.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a4fe681700abbcad26a70038ea18c1148ed2093a339648dce8379521bb99bd"}},{"ruleId":"D2","level":"warning","message":{"text":"objectBrowserRowAction.doubleClickRowAction (cognitive 18): objectBrowserRowAction.doubleClickRowAction has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 2 (5 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRowAction.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0296bdb8a3e6923bae9142f29a65749c4f7dbc428cb9a1a7277546a225c23820"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTableRename.validateDraftRelations (cognitive 18): oracleTableRename.validateDraftRelations has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (9 pts), boolean chains 7, if/else 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 6 function items inside it that branch (normalize, a function literal at line 415, a function literal at line 354, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b0772c6a11a83b50698fda79d380ece8acbd665cf32c438cab1c8060562e54"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTypeDataMapping.executeOracleTypeDataInsert (cognitive 18): oracleTypeDataMapping.executeOracleTypeDataInsert has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 7, error handling 3. Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeDataMapping.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"377ef90a5595ff3310908c795a05b014b95e83c320bfa3958bbca2af9281ba79"}},{"ruleId":"D2","level":"warning","message":{"text":"routineParameters.jdbcRoutineParameterType (cognitive 18): routineParameters.jdbcRoutineParameterType has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 5 (6 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"482a75e4d0cbc42b80291a34f2c5b1aa2f141a77fa79f5896750c119daaad19f"}},{"ruleId":"D2","level":"warning","message":{"text":"routineParameters.xuguFunctionReturnType (cognitive 18): routineParameters.xuguFunctionReturnType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b6ddd16772d32c926f3a29003ed3683c43025ea6be88a26f17534c80c0f115"}},{"ruleId":"D2","level":"warning","message":{"text":"tableColumnDefinitionPaste.validateDefaultExpression::expression (cognitive 18): tableColumnDefinitionPaste.validateDefaultExpression::expression has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (tableColumnDefinitionPaste.validateDefaultExpression::operand) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2f544470fd97874b70d62309eb7f300764c6691ae54db41a2504451c397ae4"}},{"ruleId":"D2","level":"warning","message":{"text":"tableStructureEditorState.specialIndexColumnIssue (cognitive 18): tableStructureEditorState.specialIndexColumnIssue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1280e8244ed348416489966a84951dce2a3058ea73505ec02834525d80c1ef"}},{"ruleId":"D2","level":"warning","message":{"text":"tableVGroup.resolveTableVGroupScopeFromNode (cognitive 18): tableVGroup.resolveTableVGroupScopeFromNode has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (6 pts), ternaries 2 (3 pts) (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e96800bc62322914a046d60005e9c2582d61abe4eab01dd45978278d753f66"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.clearLoadedChildrenCache (cognitive 18): connectionStore.useConnectionStore.clearLoadedChildrenCache has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f218c0fda387164bbe04f7ac032404a1df61da3f430e5739c387f66e6995e7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.readImportFile (cognitive 18): connectionStore.useConnectionStore.readImportFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (9 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11700}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b60d1eaee8ce6c6ddb089d5d8496322b930a31afd58b1642dae9e0c7c391b9"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.readPublic (cognitive 18): plDebugStore.usePlDebugStore.readPublic has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, if/else 5, ternaries 2. Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0f915ff51803f37cb1b2825c77ef94378bb30687ed88f26d11be15d38db8ec"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.closeResultSession (cognitive 18): queryStore.useQueryStore.closeResultSession has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, ternaries 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"85377eb03e92d5cae915c955ae3d89f7976c2b282d9da66abb79ec76492425b8"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.loadObjectSourceIntoTab (cognitive 18): queryStore.useQueryStore.loadObjectSourceIntoTab has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 4, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3600}}}],"partialFingerprints":{"codehealthFindingId/v1":"339a3cbf5702cf76a2907f03d541ae13b643b748b0e61bda7e0417b661645f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.resolveQueryDisplayMetadata (cognitive 18): queryStore.useQueryStore.resolveQueryDisplayMetadata has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 7, error handling 1, ternaries 1. Of this number, 12 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7867}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e35c420f60057dc402ed079d991d0c17afe5e0e0f5c139df307faa8fca71c0"}},{"ruleId":"D2","level":"warning","message":{"text":"savedSqlStore.useSavedSqlStore.moveFolderToFolder (cognitive 18): savedSqlStore.useSavedSqlStore.moveFolderToFolder has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, if/else 3. Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1060, 1054, 1055). 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"822ab7e4913422db37bdf403c0f050c90a30ccc07396db92801bded51b22e449"}},{"ruleId":"D2","level":"warning","message":{"text":"transferTaskStore.useTransferTaskStore.moveFolderToFolder (cognitive 18): transferTaskStore.useTransferTaskStore.moveFolderToFolder has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, if/else 3. Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 418, 409, 413). 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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d54393466ef08ffe35d61f74c896758ac6d124a9dde9cf4565699b99bb3174d"}},{"ruleId":"D2","level":"warning","message":{"text":"json.quoteUnquotedObjectKeys (cognitive 18): json.quoteUnquotedObjectKeys has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c56dd1aaa75ce505a5a7bf986b510238006b2b331a0432f6065c08a2e94b248"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_tdengine_driver::runtime::error_response (cognitive 17): dbx_tdengine_driver::runtime::error_response has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/tdengine/src/runtime.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"8012cc9214073768ee18417717216158d82a2364567438d5a21bd63a0166264c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::build_responses_input_with_tools_variant (cognitive 17): dbx_ai_provider::ai::build_responses_input_with_tools_variant has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74e4aef308d3b399ce5183bad2b08e12a59883b074fbe46668b5fb95f90699"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_ai_provider::ai::with_stream_retry (cognitive 17): dbx_ai_provider::ai::with_stream_retry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3687}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed3b722be0665881103693fa2616158d6d25ff4bc07285599499b99bb7313c8"}},{"ruleId":"D2","level":"warning","message":{"text":"NacosAdminConfig::validate (cognitive 17): NacosAdminConfig::validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/config.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a7f15e6953bb6512cc98732a4d76d68eda9cbe50ee3a850d23c32c94d1236e"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::restore_reclaimed_agent_pool (cognitive 17): AppState::restore_reclaimed_agent_pool has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":6493}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bde8e961ce6844f5a4a88f7118f35179f5f8408e5ef37d8e414d075266377f"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::sweep_idle_connections (cognitive 17): AppState::sweep_idle_connections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":7559}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaf800130bc1e062acfd2b4c963324b6174617533131f3bdd674a5f6abb094d"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::finalize_legacy_json_files (cognitive 17): Storage::finalize_legacy_json_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b36764d65b1fedd732c86319c10bfe4766059268a71342170bd0239a494510"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::load_ai_provider_configs (cognitive 17): Storage::load_ai_provider_configs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4792}}}],"partialFingerprints":{"codehealthFindingId/v1":"671305b1baa09914f70641304e28f729b04f55c9386859b48058686a668c2558"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupSchedule::next_after (cognitive 17): BackupSchedule::next_after has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/models.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f612c2bbf82787d716f4b0ba3fbd7f61c2a5997dc9390c5c31d72801bc014a"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupService::import_files (cognitive 17): BackupService::import_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/service.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7243ec333c99125d4a4cc4bd9b990ea32c7adadf4077561256fd7f1e209f7321"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::admin::consul::search::consul_search_core (cognitive 17): dbx_core::admin::consul::search::consul_search_core has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/search.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf73f4d738e073b9bd16900afe3f6d12396924ce09b361839bf4f534c6b933ff"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::mcp_policy::effective_database_execution_policy_with_groups (cognitive 17): dbx_core::ai::mcp_policy::effective_database_execution_policy_with_groups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/mcp_policy.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8dd3286f7b50a6d55089924d65dc5cbbde1f88ccf31adb4fa5cbce741ce9bf"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::plugin_tools::call_result_content (cognitive 17): dbx_core::ai::plugin_tools::call_result_content has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_tools.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08992d127d70973bb0e785ff9e83a46accf779f838c3d9d05df9c777456136d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::parse_export_local_temporal_parts (cognitive 17): dbx_core::data::database_export::parse_export_local_temporal_parts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97f7a056b5e72092d3cfe121adf90382167bcb2e09bc383b4a6fde9e78d1c42"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::list_postgres_export_sequences (cognitive 17): dbx_core::data::database_export::list_postgres_export_sequences has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 3 (5 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":2995}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d9625c104b79324a250383ce774ff1d916128f4930ef2b1eff91ecf31609a7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::await_export_stream_operation (cognitive 17): dbx_core::data::database_export::await_export_stream_operation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":3226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7a803b27a7b45afa93a9fdfc428c60aade94b918c7d8038a9f7e713f5c1507"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::grid_clipboard_guard::neutralize_spreadsheet_formulas (cognitive 17): dbx_core::data::grid_clipboard_guard::neutralize_spreadsheet_formulas has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/grid_clipboard_guard.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"945f22d64bd6999d5f2d4294d9b69a4b02b0fbfc32a1514d19af09506ebd0530"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::ordered_entries (cognitive 17): dbx_core::data::mongodb_dump::ordered_entries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d523d08b9a403b92b6f3f03caebc5d143d62b7296387d822aa5d42167c0869aa"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_dump::archive::inspect (cognitive 17): dbx_core::data::mongodb_dump::archive::inspect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/archive.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"44aa205da96536b742062473f7d7ab0f343bf2e0328fdfa1aee25eb588e54955"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::convert_cell (cognitive 17): dbx_core::data::mongodb_import_export::convert_cell has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee99b7ba2276af860141ca3d35a8311285cf415ecb9eb2917447c1a401ef615"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::extract_json_string (cognitive 17): dbx_core::data::mongodb_import_export::extract_json_string has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0d255b62281098ac68b76dfc1b680f84950d4636861d7cb04d17c262429996"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::parse_xlsx_sheet_cell_styles (cognitive 17): dbx_core::data::table_import::parse_xlsx_sheet_cell_styles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3250}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fb4f515d45b198e6546200f4fd70f1b45bad81c709930f47f56ecfd2426656"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::table_import::import_value_rows_sql (cognitive 17): dbx_core::data::table_import::import_value_rows_sql has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 2 (7 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":5121}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb2488919647bc01b0f4d6712ffcf0221a8899eff7d53625dc070a2548b9929"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::validate_transfer_request (cognitive 17): dbx_core::data::transfer::validate_transfer_request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb291d22ad881cc1d6f7ba7fe2ecb873df70a746e198a89aebd268fe90c3ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::generate_comment_ddl_with_column_quoting (cognitive 17): dbx_core::data::transfer::generate_comment_ddl_with_column_quoting has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3430b01f84606f1b2a56ec94d37a94d58718f3ec29cb426ff4cab178bbe10599"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::generate_insert_sql_batches_from_value_rows (cognitive 17): dbx_core::data::transfer::generate_insert_sql_batches_from_value_rows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":7162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab45d12de3f45bbac9702ee9f9a9570877c7f85b1f34ad6d9250b0d6c2ee7875"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::transfer::get_columns_for_transfer (cognitive 17): dbx_core::data::transfer::get_columns_for_transfer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":9351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a270760e8b9b492378c658e1b5f3a97804082888a45fc79cdf23e5ea9a0571c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::persistence::cloud_sync::preserve_local_transport_paths (cognitive 17): dbx_core::persistence::cloud_sync::preserve_local_transport_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"33924b03e96f1130db75b727cc4f664e7e7608a184fbfd672bee3198e62afa60"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::persistence::storage::apply_sync_connections_in_tx (cognitive 17): dbx_core::persistence::storage::apply_sync_connections_in_tx has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":9748}}}],"partialFingerprints":{"codehealthFindingId/v1":"7deea5648a5b73d423966029102f85c140b82dd4255a18572729a2ad46c623f5"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::execute_multi_mysql (cognitive 17): dbx_core::query::execute_multi_mysql has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, loops 1 (2 pts), match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8b8f7d3c631f62f59d41ca55d82e8f273e53d07e25913469b066accc70caf1"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::execute_schema_diff_deploy (cognitive 17): dbx_core::query::execute_schema_diff_deploy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5681}}}],"partialFingerprints":{"codehealthFindingId/v1":"5664cccb6fb7e16ba1226136afdb16d4b3d7993eb30de6e4286f3c503be70d82"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::execute_result_state (cognitive 17): dbx_core::query::pl_debug::execute_result_state has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99715e8847a606f6807acae067264b5bc6d3cabcfdd686313db34e6341d829e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::snapshot_export::stream_formula_guard (cognitive 17): dbx_core::query::snapshot_export::stream_formula_guard has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/snapshot_export.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"430b5aa2b2bdec9ddb59efb090e40c5c49cb220ad4c532b346d2e570eb5a93f2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_agent_list_objects (cognitive 17): dbx_core::schema::oracle_agent_list_objects has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":14141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c9ffe148ac4f874d5b0da9a51b882b9ff9004a36d93606f8507843baab30c0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::enrich_ddl_with_oracle_style_comments (cognitive 17): dbx_core::schema::enrich_ddl_with_oracle_style_comments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 4 (8 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":14389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b7219df6de12750be70c5c0914665ac813a9c53edf79b9791670284c35ec02"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::postgres_object_source (cognitive 17): dbx_core::schema::postgres_object_source has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, boolean chains 5, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":14696}}}],"partialFingerprints":{"codehealthFindingId/v1":"384bc6d8877242a8116dd9bdfb47b5d8c10a6588d6c879ae276f05994f31ab3d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::operations::scheduler::transition::checked_rows (cognitive 17): dbx_core::schema::native_jobs::operations::scheduler::transition::checked_rows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa8e8d5f06b3760784ebd184fd9582f556d79aa9cbf9141e702be226d299aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::plan::package::read_grants (cognitive 17): dbx_core::schema::oracle_routines::plan::package::read_grants has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan/package.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9d87843b86476bb1a5ea7c4694376ac46fc6f80bc189cfdf83a229a8c7ff38"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::transfer::packages::read_transfer_package_input (cognitive 17): dbx_core::schema::oracle_routines::transfer::packages::read_transfer_package_input has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a93482ca4a0adab6acec0adedb0d766babe35a40b565277a4972093920ebfdd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_triggers::validate_source_definition (cognitive 17): dbx_core::schema::oracle_triggers::validate_source_definition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 4, match/switch 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_triggers.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce525f0cf13f33443a588ea7f7fbb7daa22de913300225d199758871d22d072"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_type_management::compilation_errors (cognitive 17): dbx_core::schema::oracle_type_management::compilation_errors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_management.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc2789ffe7bdbd66a8bc5d202b8889ba745d69e5438c1ff3c53da38f9a320a0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::state_calibrator::detect_drift (cognitive 17): dbx_core::schema::state_calibrator::detect_drift has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/state_calibrator.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2caa4c8a01a21d413d05db7d23826ee5b479b2a94163d602dcfe362e8244a9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_driver::parse_agent_java_opts (cognitive 17): dbx_driver_agent::agent_driver::parse_agent_java_opts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":4065}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe7c0a3bff390b10b182cf1b571b18d2f1344411eb854494ab265a0d4def001"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::transform_ejson_deserialize (cognitive 17): dbx_driver_mongodb::mongo_shell::transform_ejson_deserialize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5d381e18af2c6b607c373fd9f27965d6f481bd6e8740895cc2d42a522c1826"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::matching_bracket (cognitive 17): dbx_driver_mongodb::mongo_shell::matching_bracket has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf0b4d23d387ef14ac3ffee7c9c9cd93fb61e5ac62b8649381843e0cf4ae382"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_group_concat_setup_fallback_mode (cognitive 17): dbx_driver_mysql::mysql::mysql_group_concat_setup_fallback_mode has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 15, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"de169b12c7a33a0e970103b18b2ffd4027535a4f7118daf33942868044093a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::connect_cluster (cognitive 17): dbx_driver_redis::connect_cluster has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ec27dbf15f8f1ec3b7cabbfd6ac0384d8c8fcfa60855aa907c4b23c565ffb7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::attach_hash_field_ttls (cognitive 17): dbx_driver_redis::attach_hash_field_ttls has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, match/switch 2 (3 pts), loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5641}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efef3d10c59c9865055588b856b80c23789c64e2eacaa9e21b28d470d9c129a"}},{"ruleId":"D2","level":"warning","message":{"text":"DuckDbWorkerClient::execute_query_page (cognitive 17): DuckDbWorkerClient::execute_query_page has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_query_sessions.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccfdafa628986576ca4ff4fe14e6a7d549b4219f23765ea5e213fb12d0d3656"}},{"ruleId":"D2","level":"warning","message":{"text":"DuckDbWorkerClient::execute_typed_with_options (cognitive 17): DuckDbWorkerClient::execute_typed_with_options has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 9 (15 pts), if/else 1 (2 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_worker_process.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea0128f880cc2824c8ad0cb71470759bbd1c4dc36ba96d22c84c3983a3fe99f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::hbase_driver::read_scanner (cognitive 17): dbx_drivers::db::hbase_driver::read_scanner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/hbase_driver.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1ba79749b3e21e0e4b25c5b4fc1419882c3632d87341a7f515a91b8394bf60"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::influxdb_driver::parse_flux_csv (cognitive 17): dbx_drivers::db::influxdb_driver::parse_flux_csv has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/influxdb_driver.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84df0bfe27e902f23cc0a8f549d9779aadd7645ccf575957a88bf26e68045db"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::plugin_tool_catalog (cognitive 17): DbxMcpServer::plugin_tool_catalog has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (4 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5593}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c18fb794d0d91ad216e1fd49890bf05cfb148b8dc32e8b472030d96a13f9d1"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxMcpServer::call_plugin_by_id (cognitive 17): DbxMcpServer::call_plugin_by_id has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3, boolean chains 2, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5721}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2a9bd465475a39d71285a21f9e0c3c1ea5f20993205bdcf6ef2f8c43bff20d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::find_statement_at_cursor_with_options (cognitive 17): dbx_sql_core::sql::find_statement_at_cursor_with_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (dbx_sql_core::sql::find_statement_text_in_ranges) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea097d591359847e6f4b94a72e7a84026324c134f21fd2f0392d9ad0c83fe8f2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::find_statement_text_in_ranges (cognitive 17): dbx_sql_core::sql::find_statement_text_in_ranges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (dbx_sql_core::sql::find_statement_at_cursor_with_options) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee7a2247981707ab4754ffc526de36896345bfb05196c35f412606738ad516d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_analysis::parse_mysql (cognitive 17): dbx_sql_core::sql_analysis::parse_mysql has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db9612320674f8bbcfd41eaa07e6b7770718fa6a8b9f50664202cf76178ec72"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::skip_leading_sql_comments (cognitive 17): dbx_sql_data::query_result_sql::skip_leading_sql_comments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2d08a946869daac74b737d063d914a04bf8382f49ec88efd8faf19a530fb1c"}},{"ruleId":"D2","level":"warning","message":{"text":"GitDiffScanner::build_sql_filter (cognitive 17): GitDiffScanner::build_sql_filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/sql_parser/git.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5912485fd298e4168ef6a7ba5a546fb1935a1d2aad6795277dd15009e629a749"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::db_admin_sql::build_drop_table_child_object_sql (cognitive 17): dbx_sql_schema::db_admin_sql::build_drop_table_child_object_sql has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/db_admin_sql.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3ed1426493415c02988adec6a9f2c7670df234866d5c6ea55419065e6a1f2f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::column_alter::build_saphana_existing_column_sql (cognitive 17): dbx_sql_schema::table_structure_sql::column_alter::build_saphana_existing_column_sql has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c19a0bdc3cf60dd1d1be4d0dde4736da4e6a810515b35ff85cd1af68b6e52e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::starrocks_partition::validate_columns (cognitive 17): dbx_sql_schema::table_structure_sql::starrocks_partition::validate_columns has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/starrocks_partition.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d71ca779024cd3ed86ac6f6f57167272ff0f8084d2344258f191a6164d5da0"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::credentials::restore_value (cognitive 17): dbx_web::credentials::restore_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/credentials.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3216758ebb0137f8860dd57a3ab098002784e64b6b44eb418428b2e3d35eae"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_cli::create_project (cognitive 17): dbx_plugin_cli::create_project has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/cli/src/lib.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d36ce5f1f54af03640f45979ad4e5528c17bd518e4cb86973cc799e9c9dd1e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_cli::package_project (cognitive 17): dbx_plugin_cli::package_project has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/cli/src/lib.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff482f295dd3b44e7816e9a0921c6665f13421f3f68452ea72922ca52e829ee"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::mcp_bridge::handle_execute_query_data (cognitive 17): dbx::commands::mcp_bridge::handle_execute_query_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 4 (6 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":2966}}}],"partialFingerprints":{"codehealthFindingId/v1":"5167e92147cecc89a8c9fe3bcb94ba8da5cd60a2149341b2e98dafdc813c95ad"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::update::download_update_inner (cognitive 17): dbx::commands::update::download_update_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/update.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ce441c1f5d011b2ff9c155c09b644971df0313fa511267615a01760d6d3ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractJdbcAgent.finishPooledRequest (cognitive 17): AbstractJdbcAgent.finishPooledRequest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e62f93f14c1e83de54869d8d031e59de2b42730f9fb9349ea88968dbf0436b1"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRpcServer.validateTypedDebugWire (cognitive 17): JsonRpcServer.validateTypedDebugWire has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 2 (7 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32ff58ff35eda9b83b50ec2a5bd6bdff302396f384cab150b3624fac9ea422b"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.filterMetadataNodes (cognitive 17): DbxJdbcPlugin.filterMetadataNodes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 4 (6 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3889}}}],"partialFingerprints":{"codehealthFindingId/v1":"6527669ab4ef006e47ad22813f434e4d97fde5984a7c569bfbe92f1a94971eac"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseOracleAgent.getDictionaryFirstObjectSource (cognitive 17): OceanBaseOracleAgent.getDictionaryFirstObjectSource has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, error handling 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b000d021896ac016ed73acde849b072bba2b725f2c7032afb70c7e5c37fe541"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugResultCache.text (cognitive 17): PlDebugResultCache.text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugResultCache.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bfbf83363429be1729bf4c3f83b6cd5a0fd0a7fd166a85dd208858527370c1"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSession.runToTermination (cognitive 17): PlDebugSession.runToTermination has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf04908b34c6fd6baf7632c0807cf1810ee8781d214b2fcfd9f6a0025cb57fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"SpannerAgent.spannerIndexes (cognitive 17): SpannerAgent.spannerIndexes has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 2 (4 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37a7eb94958d85e9148d13420e8b4da2a72072a1a78fedf7462bda3dd45d653"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_agents.validate_manifest_fields (cognitive 17): validate_agents.validate_manifest_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/validate_agents.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fd51566cbd7149a6e9dc670fe6f55b322786e5869b2ffbb7257dff6f81ccb4"}},{"ruleId":"D2","level":"warning","message":{"text":"main.applyKerberosJAASFile (cognitive 17): main.applyKerberosJAASFile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"efec9c46d026d8817b983d4bc3d0c858976d66c3fcd3940ce0a70643d5396a21"}},{"ruleId":"D2","level":"warning","message":{"text":"server.completionAssistantSearch (cognitive 17): server.completionAssistantSearch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac976c1c05c9d1773995351d8495708d44d73c901f81bfc3a3fd753ad7924b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.renderCQLValue (cognitive 17): main.renderCQLValue has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (6 pts), match/switch 2 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/values.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"20666ae8a30edd48ee8b9d06d50a38201d1a0ed812aa3ce467239e8516db19ff"}},{"ruleId":"D2","level":"warning","message":{"text":"etcdSession.listPrefix (cognitive 17): etcdSession.listPrefix has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5638bf69f83183ecc4b20fc64176ef9ed5771036db6c3ea555eb1ddf9d1a2b"}},{"ruleId":"D2","level":"warning","message":{"text":"etcd2Session.authRolePermission (cognitive 17): etcd2Session.authRolePermission has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/auth.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d08ae2a7b5385f76dcec2e2d599c41b4e194197af57d9124db336995bdb3321"}},{"ruleId":"D2","level":"warning","message":{"text":"main.applyKerberosJAASFile (cognitive 17): main.applyKerberosJAASFile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"791bf7e8306ed01e874cafb4e3bf7a9d29e31e0a563d31d75ed1d9edca500c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"server.completionAssistantSearch (cognitive 17): server.completionAssistantSearch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/metadata.go"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"be88f8cef6810ece60bcf753b1ff773615192740d27917ae5a9efe5ec00a536f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.queryTimestampPrecision (cognitive 17): main.queryTimestampPrecision has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/driver.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b551f19465bc8bb567f23d0c215a33f57a2b491fc6a9e4e2b70e13404f43df5"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeServer.dispatch (cognitive 17): runtimeServer.dispatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/main.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f67b96a56ce776c73e90576020f9bbd285aa93f51b5dd4821af8ae7a327641"}},{"ruleId":"D2","level":"warning","message":{"text":"main.newAgentSession (cognitive 17): main.newAgentSession has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/main.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e289b231ca291af54a5aa97907dd70099cf71a719b737fd1ee6e26831d842741"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeServer.dispatch (cognitive 17): runtimeServer.dispatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/main.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c423df06b896416a0d8cf90e04515f9a43ecbb33737ef084dc2df249a7ee0e46"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugEnsureHelperPackage (cognitive 17): main.plDebugEnsureHelperPackage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd4faec39e51580d47d34253885a208ee11ef8589d235b5107667cbc5491f94"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugAnonymousCallLine (cognitive 17): main.plDebugAnonymousCallLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":5218}}}],"partialFingerprints":{"codehealthFindingId/v1":"708cce5c12ef39f4e31b18f261c59929cf5fa192e11723df641ca16dd8c8afaa"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugExecuteNativeStatement (cognitive 17): main.plDebugExecuteNativeStatement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_execute.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4bbe688fe431e71f871ea21933778c0683634ae73b84783e2cbeeb530edd50"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugLegacyIndexType (cognitive 17): main.plDebugLegacyIndexType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_declarations.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3efb918a7a6498e808b374d4a68d2c3b2441030b503b96005f15d6b46a39df"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugConstructorSplit (cognitive 17): main.plDebugConstructorSplit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_object_constructors.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"498366036b088224eb78d3bcdcbf6482c5ba1106d17d298519665f15d245b0a5"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeObjectHierarchyKnown (cognitive 17): main.plDebugNativeObjectHierarchyKnown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_transport_preflight.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed227a9c8fdc085bc98d92ef72349d07b0caddc4972aef9f62c8124717bb5c6d"}},{"ruleId":"D2","level":"warning","message":{"text":"server.connectionInfo (cognitive 17): server.connectionInfo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/connection_info.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"365bd36027edfadfae49dbdccea2da2a05199127f041f69abd7e54e12d7f4384"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listObjects (cognitive 17): server.listObjects has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"439d3cd35fb86b2033eb8a75ddbdb46b878372340369e967788ccd5089af3e40"}},{"ruleId":"D2","level":"warning","message":{"text":"server.oracleCompletionValidSynonymTargets (cognitive 17): server.oracleCompletionValidSynonymTargets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df250b4ec57f7ff9350dd7b975f33f2d2f7cce46291ff93f21038a17cfdb894"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listTriggersWithIdentity (cognitive 17): server.listTriggersWithIdentity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 6 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3585}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f5878e975752ef894c8619420d3cb1afae18179f83a85da33abe21aba107ee"}},{"ruleId":"D2","level":"warning","message":{"text":"server.enrichObjectComments (cognitive 17): server.enrichObjectComments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/object_comments.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8a9d02934344498c3f2a661efd82d6b03e672ccd7589a9e3bbd6a5e61810bd"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeServer.nativeTargetMetadata (cognitive 17): runtimeServer.nativeTargetMetadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"211ba0bf7d424d6ce80253dbb48d153923cb396ef74c86b70db6de458824c850"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugSession.resumeIgnoreBreakpoints (cognitive 17): plDebugSession.resumeIgnoreBreakpoints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":2579}}}],"partialFingerprints":{"codehealthFindingId/v1":"4882b75c4dbc6727d6721b65603e4863f6662ffd865c3d9bd5801b9c3138ad3a"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.listNativeBreakpoints (cognitive 17): plDebugNativeEntry.listNativeBreakpoints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, loops 1 (nesting depth added 1). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 146). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd531b8843fc36f2152b101cea29eca84e5a72d05f961ba3734eb25fd9a0f77"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugNativeEntry.valueOperationStatus (cognitive 17): plDebugNativeEntry.valueOperationStatus has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_frame_write.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f557df054d17aa41f8f6cbc4594592519e4e6607ce4976a8d2273bb0f054b96"}},{"ruleId":"D2","level":"warning","message":{"text":"main.managementGetAll (cognitive 17): main.managementGetAll has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/management.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3aa8491f4f91d1a30c48bd9919af0e3d2a45737d0566902c226a1ac0a01cee5"}},{"ruleId":"D2","level":"warning","message":{"text":"main.managementGetPage (cognitive 17): main.managementGetPage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/management.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa5c1e8d1c34faa08e80e702a473ae3d1169d2ed501e26eb4e3701ffc8d8db5"}},{"ruleId":"D2","level":"warning","message":{"text":"main.newProxyMessagingClient (cognitive 17): main.newProxyMessagingClient has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/proxy.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5264501377adf33a5d61c09939da98d9070429912799ba094c1a5c9ee6db9490"}},{"ruleId":"D2","level":"warning","message":{"text":"main.matchingBrace (cognitive 17): main.matchingBrace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/routing.go"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a26c7be3dc69932ab7d4fe139488e6769b37276cf7908af61370f1ad0708e2"}},{"ruleId":"D2","level":"warning","message":{"text":"rocketMQAgent.sendMessage (cognitive 17): rocketMQAgent.sendMessage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"6011b338a9a1f6d9c3e3f697edae8dd290055fae28eefb054fadc5e9541da352"}},{"ruleId":"D2","level":"warning","message":{"text":"server.appendTableIndexDDL (cognitive 17): server.appendTableIndexDDL has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":5189}}}],"partialFingerprints":{"codehealthFindingId/v1":"092c0aeb0ee53ebc5ff40bedd4b6a4af12d5d7eb0c3ea90eca14d6f096a55c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.requireReachableServer (cognitive 17): main.requireReachableServer has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 2 (6 pts), loops 3 (4 pts) (nesting depth added 9). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 410, 428). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bd20aca6af20be7ad2b6003ae30071747d9697bb56d9416e2306ad11c09690"}},{"ruleId":"D2","level":"warning","message":{"text":"semver.recursivePreReleaseCompare (cognitive 17): semver.recursivePreReleaseCompare has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/go-semver/semver.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba6b2b43f0feaa4ab65b46f813ff16b3b7e9ec7c8729d0c095e437d5d8540b3"}},{"ruleId":"D2","level":"warning","message":{"text":"GSSAPIMechanism.negotiateSecurityLayer (cognitive 17): GSSAPIMechanism.negotiateSecurityLayer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/gosasl/gssapi.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a566db6d6b56e554146360301bbdeb78c61bca274bfb93166525267ecf75de"}},{"ruleId":"D2","level":"warning","message":{"text":"IoTDBRpcDataSet.getObjectByTsBlockIndex (cognitive 17): IoTDBRpcDataSet.getObjectByTsBlockIndex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d7a5960f9ca5f2fb176c7d0fde98d952bf9f49ac865ba30ec7afbb0f735ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"useCellDetailEditor.useCellDetailEditor (cognitive 17): useCellDetailEditor.useCellDetailEditor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 194, 212, 223, \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":"apps/desktop/src/composables/useCellDetailEditor.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"945611d9dc15b594ed7767b28eaf4512968a42d34d6ef13b363afa8873ffc3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataCompareConfig.sanitizeConfig (cognitive 17): useDataCompareConfig.sanitizeConfig has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 12, boolean chains 3, if/else 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":"apps/desktop/src/composables/useDataCompareConfig.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cd2a3f3ee8442a77f3b381eb5b718152bf04aff2f3b6603fcebcf3d6c93fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGenerateSession.cloneColumn (cognitive 17): useDataGenerateSession.cloneColumn has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGenerateSession.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc76bb29490b9320d0be070470c4071a45692292d48e068cda3fff9a27c10319"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridConditionEditor.useDataGridConditionEditor.defaultSuggestions (cognitive 17): useDataGridConditionEditor.useDataGridConditionEditor.defaultSuggestions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 4 (7 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"b997cffd0d234b7ef1441ea4fe09c84c91584d78d4da30007bec2df14c29c4f7"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridDistinctValueLoader.useDataGridDistinctValueLoader.performLoad (cognitive 17): useDataGridDistinctValueLoader.useDataGridDistinctValueLoader.performLoad has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, error handling 1, loops 1, 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":"apps/desktop/src/composables/useDataGridDistinctValueLoader.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f9cd0720b6ea3388d9d714cd0275f293d5ce7382e9b487c6e5b43896b7fc6e"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.restoreCellValue (cognitive 17): useDataGridEditor.useDataGridEditor.restoreCellValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bcfeac6e632788041b8a94c9461551528aef3287583eaa5faa2fa3c5f02e81"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridSelection.useDataGridSelection.reconcileSelectionAfterColumnReorder (cognitive 17): useDataGridSelection.useDataGridSelection.reconcileSelectionAfterColumnReorder has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 3 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d243de098d278ab67f94538a76298a0d83978bdc547e3b363a2f570bab45af41"}},{"ruleId":"D2","level":"warning","message":{"text":"useOceanbaseCloneDialog.useOceanbaseCloneDialog.request (cognitive 17): useOceanbaseCloneDialog.useOceanbaseCloneDialog.request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useOceanbaseCloneDialog.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7729ea703ba80ee3263cbdd74b5b87b60237555399fa61bebdca29e515da2316"}},{"ruleId":"D2","level":"warning","message":{"text":"codeSnapshot.applySnapshotSqlTableColors (cognitive 17): codeSnapshot.applySnapshotSqlTableColors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (wrapRanges, a function literal at line 285). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50c4cb17e320959091ddab75c5e12c2a19a102a1a58e4567d01e9924836146e"}},{"ruleId":"D2","level":"warning","message":{"text":"clipboard.preserveLegacyClipboardFocus.\u003Creturned closure\u003E (cognitive 17): clipboard.preserveLegacyClipboardFocus.\u003Creturned closure\u003E has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (3 pts), error handling 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":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8753d1bc7c8e1b907bb05b3baf12df40d9d54f4997dfa54180e65e3786148da"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionDeepLink.serviceEndpoint (cognitive 17): connectionDeepLink.serviceEndpoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d936eeabfb8476d65f1602e67ecd7ecdefef9663e7d0e23caa1a9ef0a4852fa"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrl.databendUrlOptions (cognitive 17): connectionUrl.databendUrlOptions has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 5, ternaries 3 (4 pts) (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0810ae07a7a9d2f0c24081d31e9fe3525094bfafd1fa9642d9ea543e249983a"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrl.parseJdbcOracleUrl (cognitive 17): connectionUrl.parseJdbcOracleUrl has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (5 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"37770acd5310ee39e5902f13236387136de12bf8bc1c32943b834ecb7091dcdf"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrlBuilder.buildStandardUrl (cognitive 17): connectionUrlBuilder.buildStandardUrl has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 3, if/else 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0be1c7786fdf611cd00373f8cf9e11baa1f9cf818852b7b51737f592e03f28"}},{"ruleId":"D2","level":"warning","message":{"text":"elasticsearchKibanaProxy.buildElasticsearchExternalConfig (cognitive 17): elasticsearchKibanaProxy.buildElasticsearchExternalConfig has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/elasticsearchKibanaProxy.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a985e873e834346c8bda681fdc71ef2f407087f9fcd19681db76bf17110c5b38"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionModel.normalizeConsulSession (cognitive 17): sessionModel.normalizeConsulSession has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11 (13 pts), boolean chains 4 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/consul/sessionModel.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d0b04a7d754532016ffaebbe3a67f059a50c88cdcfb7b51dbd7b090d206c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"chartData.buildQueryChartOption (cognitive 17): chartData.buildQueryChartOption has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 4 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/chartData.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ea5abb800deed1700d13531a7bd5227668a68fcb5f417d6ce98e90936b3830"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnLookup.filterDataGridColumnLookupItems (cognitive 17): dataGridColumnLookup.filterDataGridColumnLookupItems has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnLookup.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afdea18cada9d6ef26d3c0862f817bf4826cffcab5fe67da2d9f684ce6ff2de"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridReplace.prepareDataGridCellReplacements (cognitive 17): dataGridReplace.prepareDataGridCellReplacements has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridReplace.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f990daa070ea13b91601e2027e4cdb70a1d07e64e761510bcba1d2633df759cd"}},{"ruleId":"D2","level":"warning","message":{"text":"createDatabaseCharsetOptions.parseCreateDatabaseCharsetMetadata (cognitive 17): createDatabaseCharsetOptions.parseCreateDatabaseCharsetMetadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 2, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/createDatabaseCharsetOptions.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"587ddbe44a3280145bae5689ad052e86ee50acf9118e6f62bc0ac3de09a4ef4a"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleForeignKeys.parseOracleCanonicalType (cognitive 17): oracleForeignKeys.parseOracleCanonicalType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"773fe07e856204561d7f79bbc76b2478a3dbd1cde51a79c565d4800f27c3ba14"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTriggerPlan.candidateBinding (cognitive 17): oracleTriggerPlan.candidateBinding has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d2241cd934ce80602f2cd6536eec4c2ae0d92a629249e4e4e939ed55a027fe"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTriggerPlan.verifyBinding (cognitive 17): oracleTriggerPlan.verifyBinding has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"58355fe14667a396f9d43e739c8d91da405fbf3006cc422b758185e3e3ce1cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlExecutionTargetCapabilities.sqlExecutionTargetCapabilities (cognitive 17): sqlExecutionTargetCapabilities.sqlExecutionTargetCapabilities has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (9 pts), boolean chains 7, if/else 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/sqlExecutionTargetCapabilities.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a86cd4b60211b3ede6b6ff89ce36070ba6cb6c18a0a4113a301f304c6d606c"}},{"ruleId":"D2","level":"warning","message":{"text":"explainPlan.oraclePredicateDetails (cognitive 17): explainPlan.oraclePredicateDetails has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb03c2428fcf4205ad868d50faf872c4055fd46b2689402c8449e8576310ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"codemirrorPlDebugEditor.createPlDebugEditorExtension (cognitive 17): codemirrorPlDebugEditor.createPlDebugEditorExtension has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 143). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorPlDebugEditor.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbc107664d54f32d8d249717142266706bb149238139d9e4c67d66297aed082"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlSemanticSelectionRanges.normalizeTokens (cognitive 17): sqlSemanticSelectionRanges.normalizeTokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"51702b6a1aa2c9d5ba7761d2318519dbc6d7e01371c3c033fe87abbc5acb985d"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoDocumentValues.mongoTypedNumberInputValue (cognitive 17): mongoDocumentValues.mongoTypedNumberInputValue has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 4 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"886c8cd2d2a0fc879d39db467f0d36968e4f55edf8415def118d19d32a68ceb0"}},{"ruleId":"D2","level":"warning","message":{"text":"nacosConfigValidation.closeImplicitHtmlTags (cognitive 17): nacosConfigValidation.closeImplicitHtmlTags has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosConfigValidation.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e88b5b00326c93771186f01556bb32401d85f418d8ae24f575131fae9a6e914"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginHostBridge.requestInit (cognitive 17): PluginHostBridge.requestInit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, loops 2 (4 pts), error handling 1 (nesting depth added 3). Of this number, 14 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":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f578dbf4f03f5bb02dcc1d4d44de1d2752e2a81f50199e7bcb94d35003d00aa"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginHostBridge.publishAiRecommendations (cognitive 17): PluginHostBridge.publishAiRecommendations has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (15 pts), boolean chains 1, if/else 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":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d1ec6dfdc06d16a414cf8275e4276d110bff6d3bcb0d3ebb0cba4c9496d24b"}},{"ruleId":"D2","level":"warning","message":{"text":"multiSourceResult.summarizeNumericColumns (cognitive 17): multiSourceResult.summarizeNumericColumns has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/query/multiSourceResult.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3ba5f53eeb22bb6abf28ee47125f4db3dd7d7cf06f35982ea8d8d3d19dbc9f"}},{"ruleId":"D2","level":"warning","message":{"text":"msgpack.toJsonable (cognitive 17): msgpack.toJsonable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/codec/msgpack.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2df4332926c50aeaf45b8610f776d78f2f22f877907a736b81b43f19af5c54"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCompletion.argumentGrammar (cognitive 17): redisCompletion.argumentGrammar has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 2 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 5 function items inside it that branch (compileContent, compileArgument, a function literal at line 334, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58f0b5cd6d702c3a891d3abb6e5d50d8b3af2ed7c56bb20a5ab26c7ab2e9d38"}},{"ruleId":"D2","level":"warning","message":{"text":"savedSqlExecutionTarget.resolveSavedSqlExecutionTarget (cognitive 17): savedSqlExecutionTarget.resolveSavedSqlExecutionTarget has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlExecutionTarget.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb84868e0973979602c986de61024a182d0f2efe62673d0e42804acb7065607"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDiff.normalizeSchemaDiffDependencyGraph (cognitive 17): schemaDiff.normalizeSchemaDiffDependencyGraph has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 2, if/else 2 (nesting depth added 4). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 326). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8889f944d71d4ec66684b6d7f1dbfe3bd740950b9f860181453b32cc318fef8"}},{"ruleId":"D2","level":"warning","message":{"text":"customTypeTree.buildCustomTypeTreeChildren (cognitive 17): customTypeTree.buildCustomTypeTreeChildren has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 4 (5 pts), boolean chains 4 (nesting depth added 6). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 24, 46). 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":"apps/desktop/src/lib/sidebar/customTypeTree.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e56a98fbbc9b02e6011c8a5f86e193fdec6837b5e982a0292c012fec8a66024"}},{"ruleId":"D2","level":"warning","message":{"text":"soqlCompletion.valueItems (cognitive 17): soqlCompletion.valueItems has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (addValues). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/soql/soqlCompletion.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2683ff7815a49f82408abdab66ccdfc18cfbb384e9bc1a3c1ebebc8345386c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"insertValueHints.parseValuesRows (cognitive 17): insertValueHints.parseValuesRows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a85757e8aa6e4f5c16ed50e5db0be54383d1ebc0c8d5198cfad1d7e4fbcf6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"references.mergeSqlSemanticReferenceAnalysis (cognitive 17): references.mergeSqlSemanticReferenceAnalysis has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2 (nesting depth added 5). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 102). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/references.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7f06333db523033034b47db528ea4100938492697cdf75426cdf7de1f57fb6"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.shouldAutoOpenSqlCompletion (cognitive 17): sqlCompletion.shouldAutoOpenSqlCompletion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5712b1c9e14379cb08ba42dbb381988128aabec8b833784ded388fab62259184"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.detectCompletionContextKind (cognitive 17): sqlCompletion.detectCompletionContextKind has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1aed89acb0e9a9624613b262c9b119021d193685cec8d7fb6726ef7f27bf3c"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.buildAliasCandidates (cognitive 17): sqlCompletion.buildAliasCandidates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5973}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a855608ddef84b221e58e0fc299e2d53a69ef5ed0c35d130a2beaec2faf3ef"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.findActiveFunctionOpenParen (cognitive 17): sqlCompletion.findActiveFunctionOpenParen has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4399d96d5f85f855bb570fdb56a6c44f0cd6239e660ce74b7559926455d37bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.splitCommaSeparatedValues (cognitive 17): sqlParameters.splitCommaSeparatedValues has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c8987eb62f52e6f6eae88d7dbb2139f89e9b0405f22f26c3ef69b44068cf3f"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlParameters.readSubstitutionParameterOccurrence (cognitive 17): sqlParameters.readSubstitutionParameterOccurrence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 4, loops 2 (4 pts), ternaries 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e5598ad039213c4e59beac31ef742ac51113bab3523f8822a6ec3f92004ccb"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlFormatter.keepFromClauseAndFirstSourceOnSameLine (cognitive 17): sqlFormatter.keepFromClauseAndFirstSourceOnSameLine has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"b592604dbe836677cca6f29228c12e20eec72c206a43ab5f137de3607f752c67"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlNavigation.matchSqlObject (cognitive 17): sqlNavigation.matchSqlObject has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 pts) (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 5 belong to 6 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"9879ee0e50efb7e69902052f938637665f80c130a20ba71e9465be1e9e945016"}},{"ruleId":"D2","level":"warning","message":{"text":"objectBrowserRows.buildObjectBrowserRows.rows (cognitive 17): objectBrowserRows.buildObjectBrowserRows.rows has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 5, if/else 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":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b4c530b418b83383a3d2f17d8317592868c9bc46fdc85183d6a0aeded8f195"}},{"ruleId":"D2","level":"warning","message":{"text":"objectRenameSql.supportsObjectRename (cognitive 17): objectRenameSql.supportsObjectRename has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectRenameSql.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aa4dfcd149975c8a9872cc14f409fe8cf6fac4baa26a21986b8b85f6917b11"}},{"ruleId":"D2","level":"warning","message":{"text":"postgresDataTypeHelp.gaussdbMTypeDisplayName (cognitive 17): postgresDataTypeHelp.gaussdbMTypeDisplayName has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/postgresDataTypeHelp.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04552e8497325b35a0897874dd84a28c03fc5cd73d330e1fe94ac63523607ae"}},{"ruleId":"D2","level":"warning","message":{"text":"starrocksPhysicalOptions.buildStarRocksDialectOptions (cognitive 17): starrocksPhysicalOptions.buildStarRocksDialectOptions has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 3, if/else 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksPhysicalOptions.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a204b8be8820c448f3d3b297f8d11b995fdaa8c9df78251c34c26fb1036c1557"}},{"ruleId":"D2","level":"warning","message":{"text":"tableTree.buildPrefixSortIndex (cognitive 17): tableTree.buildPrefixSortIndex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (resolve). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d605cf84f9201b3fdd49115cc795c7323449cea4f2a99bf98f34159a0fca2331"}},{"ruleId":"D2","level":"warning","message":{"text":"tableVGroup.findTableVGroupHostContainer::walk (cognitive 17): tableVGroup.findTableVGroupHostContainer::walk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"353c8b73d1ec9a2ffa3ae27751b2e875ab830f2a773311608f4ac54a157977cc"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.tabColorStyle (cognitive 17): tabPresentation.tabColorStyle has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7e98fadc6abb0883ce247e0801af9d04f31eff204b5aae18c52cb506f9b186"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.reloadConnectionDatabaseChildren (cognitive 17): connectionStore.useConnectionStore.reloadConnectionDatabaseChildren has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5417}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ab61ff3c5f6e929b65c628be103d1c5f6fd9e8c08c0922a95aaa70603b2a24"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.invalidateCompletionTableCache (cognitive 17): connectionStore.useConnectionStore.invalidateCompletionTableCache has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 5 (7 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c688dd7de5a30f83b9b34247a10a1f88dd2b786f1e14f2eaa4ea8c7d6870594"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.textMatchScore (cognitive 17): connectionStore.useConnectionStore.textMatchScore has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9812}}}],"partialFingerprints":{"codehealthFindingId/v1":"2303ff8c34cd33a6b25624b1bb4cd7345d11ac5c486219ef5b7fb366adeac6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugStore.usePlDebugStore.refreshStack (cognitive 17): plDebugStore.usePlDebugStore.refreshStack has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b167923d3565040a7f34b95ae0da48e3e4efcf504610238adbf9500c0b1bca"}},{"ruleId":"D2","level":"warning","message":{"text":"savedSqlStore.useSavedSqlStore.reorderFolders (cognitive 17): savedSqlStore.useSavedSqlStore.reorderFolders has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 13, if/else 2, ternaries 2. Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1026, 1022, 1008). 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de7529ea2d9aa22a5ef7055f1ab0a77d8438ed070d5bda7fc39a532135b78da"}},{"ruleId":"D2","level":"warning","message":{"text":"settingsStore.useSettingsStore.deleteCustomColumnFormatter (cognitive 17): settingsStore.useSettingsStore.deleteCustomColumnFormatter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, loops 1 (2 pts), error handling 1 (nesting depth added 7). None of this is in the body itself: all 17 points belong to 3 function literals inside it that branch (lines 3575, 3586, 3591). 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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":3574}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afd42d7718998b69a6818eb77d8bafecd75ec7fd0a6f65263498d3618a7af62"}},{"ruleId":"D2","level":"warning","message":{"text":"transferTaskStore.normalizePackageDrafts (cognitive 17): transferTaskStore.normalizePackageDrafts has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (9 pts), boolean chains 4, if/else 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab479079467e9aaaa39636a55c34434baa8623397a5287364f33e100230cd200"}},{"ruleId":"D2","level":"warning","message":{"text":"transferTaskStore.useTransferTaskStore.reorderFolders (cognitive 17): transferTaskStore.useTransferTaskStore.reorderFolders has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 13, if/else 2, ternaries 2. Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 445, 441, 431). 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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bb085542bd43fe31f9ccad3b40add90e41e6207a1eb5df948c5e61d30b6137"}},{"ruleId":"D2","level":"warning","message":{"text":"Starfield.Starfield (cognitive 17): Starfield.Starfield has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 4). None of this is in the body itself: all 17 points belong to 6 function literals inside it that branch (lines 127, 169, 111, \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":"docs/components/landing/Starfield.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"42162daf1da4ff8d5268503a0ff10b74035c840b51197fbd61b9e8f3e1253f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostics.query (cognitive 17): Diagnostics.query has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), ternaries 2, loops 1 (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/diagnostics.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cd65d06892c1c6ed0c3f5790c41cc93e5a093f64c922bdf376db760981fa14"}},{"ruleId":"D2","level":"warning","message":{"text":"pushMedia (cognitive 17): pushMedia has cognitive complexity 17 (threshold 15). Drivers by points: error handling 3 (7 pts), loops 3 (5 pts), if/else 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/publish.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"30315572e1ef661dc9dade347470459a8ff4c8a19c8e5a7c06fc4671679cee95"}},{"ruleId":"D2","level":"warning","message":{"text":"redact::visit (cognitive 17): redact::visit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/diagnostics.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9e2505e3a350eb89a97dabc52de1bc264e1a64f66508f5c6b0a0d137335263"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingToolCallAccumulator::process (cognitive 16): StreamingToolCallAccumulator::process has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4363}}}],"partialFingerprints":{"codehealthFindingId/v1":"88883346fff448d62822905ba75da4b849900fa7a966a1139d804c9520161113"}},{"ruleId":"D2","level":"warning","message":{"text":"NacosOpenApiAdmin::list_configs_by_client_filters (cognitive 16): NacosOpenApiAdmin::list_configs_by_client_filters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af690b0517779eb24fd864c0d62f2ac4cf611d15ff034f4a55d138e8542cbdd"}},{"ruleId":"D2","level":"warning","message":{"text":"Nb3ExportWriter::handle_statement (cognitive 16): Nb3ExportWriter::handle_statement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"116702eefa45056845597b3956326ec3213d0313eab57ae6586b96fbc956524b"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::prune_tab_runtime_cache (cognitive 16): Storage::prune_tab_runtime_cache has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":9438}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07a562dc794e79c9887013b2a209aafcc0b3d23b64c99ff62dd6f08590a2456"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::agent_kv::normalize_agent_kv_error (cognitive 16): dbx_core::ai::agent_kv::normalize_agent_kv_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2830d260a865c0eb124217aab033936763965a346c83189c6ddef989011535"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::ai::plugin_tools::plugin_prefixes (cognitive 16): dbx_core::ai::plugin_tools::plugin_prefixes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_tools.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51870eb329a1fa1af4d4729abc7007eb206cd41fb951a236f13289fef84f759"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::connection::connection_configs_session_credentials_compatible::normalize (cognitive 16): dbx_core::connection::connection_configs_session_credentials_compatible::normalize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (4 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8531}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9dd48a6d50f818b8c96ebc512a42adb73768702e06e9993175eceb9c9cb04a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::connection::driver_runtime::collect_runtime_seeds (cognitive 16): dbx_core::connection::driver_runtime::collect_runtime_seeds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/driver_runtime.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab9eb75f889b83f23222bde322ed4321ef91641ac2f7cc320e2dea59c7c45f8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::correction::build_joint_correction_plan (cognitive 16): dbx_core::data::correction::build_joint_correction_plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/correction.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fb2bba42d6430ca516544fef47a2be8800a76733cf273855e4be55007a1f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::format_mysql_bit_literal (cognitive 16): dbx_core::data::database_export::format_mysql_bit_literal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3b35dbb99bc84c17979ba5c96403928c278dcd79679ea536d17011b3c0c7ad"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::build_database_sql_export (cognitive 16): dbx_core::data::database_export::build_database_sql_export has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59722e5bfba0e21a69080b1745dff5f47616d5ecf31558c7569c9b1577b0804"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::split_postgres_export_table_ddl (cognitive 16): dbx_core::data::database_export::split_postgres_export_table_ddl has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd11000f84f480c4455470076a98222cf27a2e43e27be5ee98fabd39dd757af"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::database_export::write_database_export_rows_with_mode (cognitive 16): dbx_core::data::database_export::write_database_export_rows_with_mode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"808a2ec4d1aadf55f9db7794d5fe150db72b226d31440c56655733eb0bbdb7cd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::set_at_segments (cognitive 16): dbx_core::data::mongodb_import_export::set_at_segments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f1f208e076735331154d789235eefe69de075780ceed58b24ee23a635d4e13"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::mongodb_import_export::collect_csv_fields_at (cognitive 16): dbx_core::data::mongodb_import_export::collect_csv_fields_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 2 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d25b7a7eedd91d555d7fbc959f072b579b4277383980032abee2ade24a9bcf8"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::navicat_nb3::classify_insert (cognitive 16): dbx_core::data::navicat_nb3::classify_insert has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d22c5568ce12e4c88fbe53be0a7d6a29a9c794940dd5c94a40edd5d3b0f6bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::script_generator::apply_idempotent_strategy (cognitive 16): dbx_core::data::script_generator::apply_idempotent_strategy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d189fea51828d313aecbc7a934a535b104e9b9ba541e35bbeaad3963b7a39a49"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::script_generator::split_sql_statements (cognitive 16): dbx_core::data::script_generator::split_sql_statements has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ba4e3519e7537b3d829dd98ba90fb537554c8d044c12e9a5f0d89909b3ef84"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::data::sql_file_import::execute_sql_file_paths_with_options (cognitive 16): dbx_core::data::sql_file_import::execute_sql_file_paths_with_options has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf7c0b5ad1ded5e6c72aed23302bea37fa14abb16af8513264a40c5dfe9598e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::pl_debug::inspection::submit_metadata_before (cognitive 16): dbx_core::query::pl_debug::inspection::submit_metadata_before has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/inspection.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1b525e8b50d07f861deb294a3dce324afd4756398d719f91c19497e4647dfa"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::query::sqlserver_manual_transaction::begin (cognitive 16): dbx_core::query::sqlserver_manual_transaction::begin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/sqlserver_manual_transaction.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a14b1baa9755a767d7af588795f1d0f248d750394e8cbed746d775f400bde93"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::next_mysql_ddl_comment_literal (cognitive 16): dbx_core::schema::next_mysql_ddl_comment_literal has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 2 (5 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":17756}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d13bc77a33c5f0eb26413693710f1f25c755d175be327ec9a255839526d5ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::native_jobs::validate_catalog_identity (cognitive 16): dbx_core::schema::native_jobs::validate_catalog_identity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/mod.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7fbc43b12ce91ec0be05b9d32cf155c8f4b1f4790343593245ae9d832f37aa"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_ddl_indexes::protected_target_indexes (cognitive 16): dbx_core::schema::oracle_ddl_indexes::protected_target_indexes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"589799607a6f09b6037468e24415284ffd916e0233da5df354e5272d25ef01e3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_core::schema::oracle_routines::plan::prepare_built_plan (cognitive 16): dbx_core::schema::oracle_routines::plan::prepare_built_plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"3533a87a0435a8e4bc7ac2fd9b9433814b6a4aa05e4759c943c0cdbee10906e7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_offline_export::snapshot_driver_source (cognitive 16): dbx_driver_agent::agent_offline_export::snapshot_driver_source has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, match/switch 2 (3 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":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"c628d8bfaf5da7e1d2b90490b50712330cfbda4c3307762aca8fb07e06859984"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::agent_service::open_download_response (cognitive 16): dbx_driver_agent::agent_service::open_download_response has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e93c187f5fa9188dfde0325f2f75e2e8b67100e75a38d1b7a3a5cd34bb5ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_agent::backend_error::structured_entry (cognitive 16): dbx_driver_agent::backend_error::structured_entry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/backend_error.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbef48d0b0214943640978cf1e7e6214ed03b36f5e78b44e842fa7add30ae27c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mongodb::mongo_shell::transform_shell_constructors (cognitive 16): dbx_driver_mongodb::mongo_shell::transform_shell_constructors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"082562e263a5ed11c4068851d1a1162fe82d38dcac0a7c8c743373d82f9e1950"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::verify_pool_connection_with_setup_fallback (cognitive 16): dbx_driver_mysql::mysql::verify_pool_connection_with_setup_fallback has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff21dc18fac2c65b70348659376a411d654dfe6ea2dce39da193b7f98f562412"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_mysql::mysql::mysql_tls_url (cognitive 16): dbx_driver_mysql::mysql::mysql_tls_url has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"051dcc6814cc683e7352c73d9932a96c6be13d0181a3778a58dc3d116f2293dd"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::decode_tsvector_bytes (cognitive 16): dbx_driver_postgres::postgres::decode_tsvector_bytes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c288f8dd969d9d4a7ccc6996b38b6592fa3ca63fb137e4cc3507b060737e605"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::stream_select_query_text (cognitive 16): dbx_driver_postgres::postgres::stream_select_query_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcd58212562f55c2ecf23054fd66db1a83f87790d38ecf865ca286ab787823c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::list_opengauss_constraints (cognitive 16): dbx_driver_postgres::postgres::list_opengauss_constraints has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":6007}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c739dea4d493f9b256fc18793537c685618a42444f7c80d49bf753db4e1b310"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_postgres::postgres::list_opengauss_foreign_keys (cognitive 16): dbx_driver_postgres::postgres::list_opengauss_foreign_keys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":10505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d41991e1c1d77336e89093a24f7f36b7dcea32589f00f9c0735bcc4cea29c9"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::scan_cluster_keys_batch_on_session (cognitive 16): dbx_driver_redis::scan_cluster_keys_batch_on_session has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea1e5af43353b07dfc30064c6c67a31d08b7b944a81ce55f467f68e829cd225"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_redis::load_more_collection_scoped (cognitive 16): dbx_driver_redis::load_more_collection_scoped has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5050}}}],"partialFingerprints":{"codehealthFindingId/v1":"b414e09cd291d03135e27720f9f363abda1d2c52b43b391e7e1d37f22a4ba0a3"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::collect_first_result_limited (cognitive 16): dbx_driver_sqlserver::sqlserver::collect_first_result_limited has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaea34ad19eb7f7299d5c3abd1c698b3b972e494ae68aae929f318515c61346"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_sqlserver::sqlserver::describe_sqlserver_result_set_with_mode (cognitive 16): dbx_driver_sqlserver::sqlserver::describe_sqlserver_result_set_with_mode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d64ad28a85730519f81a10c8e5d1b7c9a509f2efd7f631d99015e1dbd09e97"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_driver_support::db::parse_connect_timeout_with_fallback (cognitive 16): dbx_driver_support::db::parse_connect_timeout_with_fallback has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/db.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2091ffe915228734b5a57b51c69f29c71b857ef2e7cea5aa72b75cbf27f65e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::clickhouse_driver::stream_query_once (cognitive 16): dbx_drivers::db::clickhouse_driver::stream_query_once has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 6 (7 pts), loops 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/clickhouse_driver.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6b1843e223d1937672d849566d69b17709b6723160c843406a3c4232feb42f"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_drivers::db::influxdb_driver::render_v1_measurement_description (cognitive 16): dbx_drivers::db::influxdb_driver::render_v1_measurement_description has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/influxdb_driver.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b07455811e0fd8f4ec2cecd9c6fe3d26d0f873496cddacb27f0cc2642c9f2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginHost::watch_session (cognitive 16): PluginHost::watch_session has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/host.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0d1ed78063f657a7d37bae298414d836eb13f496997e34719e3aa6864ce620"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_plugin_runtime::plugins::host::plugin_connection_action_result (cognitive 16): dbx_plugin_runtime::plugins::host::plugin_connection_action_result has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/host.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f243c45a833c8e2eb43a41f7d831187d29377cc37fec07c3ebb71fe40319a7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::mysql_event_sql::build_event_sql (cognitive 16): dbx_sql_core::mysql_event_sql::build_event_sql has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/mysql_event_sql.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d06cdc9975a81c1798085c36f578dbd958ae5f3e6cdc3b96fc5f2ebe23db7c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::parse_object_source_kind (cognitive 16): dbx_sql_core::object_source_sql::parse_object_source_kind has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":2408}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28e5ea898c0cb21886308d513b91d9b171146b3766676335b6623438e30296a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_indexes::oracle_trigger_definitions_match (cognitive 16): dbx_sql_core::object_source_sql::oracle_indexes::oracle_trigger_definitions_match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd92339d9e40ffdd75f7362985b9e56bf7a85ac35dd1267d07d35fe3bf92beae"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::object_source_sql::oracle_routines::prepare_oracle_routine_definition (cognitive 16): dbx_sql_core::object_source_sql::oracle_routines::prepare_oracle_routine_definition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, 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":"crates/dbx-sql-core/src/object_source_sql/oracle_routines.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8183423fa5abf1e27eb47c7c7f797b1b9fdbb53eef346d6fb482ae2109ca5e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::split_sql_batch_ranges (cognitive 16): dbx_sql_core::sql::split_sql_batch_ranges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a16161a74074cc481afaaa7ef9d4409eafce6ad9f44d54bd21338372c61598"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql::insert_value_tuple_ranges (cognitive 16): dbx_sql_core::sql::insert_value_tuple_ranges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebef1a209df7ddcb26cd1a4f5ba9ab56243eff23ba434fde02d5c8aad6f38c7"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_analysis::is_postgres_create_procedure_parser_gap (cognitive 16): dbx_sql_core::sql_analysis::is_postgres_create_procedure_parser_gap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d654e725db15ab806129f94a89d4f8fdf7bc44f7172ba3770ef479ad4bee9a"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_editability::read_identifier (cognitive 16): dbx_sql_core::sql_editability::read_identifier has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9e59af4d695279e4b46ee902eea8f7e1e8a784bb0c3fa27eb1b27f51620b98"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_core::sql_risk::classify_sql_risk_with_database (cognitive 16): dbx_sql_core::sql_risk::classify_sql_risk_with_database has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, loops 1 (2 pts), match/switch 2 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_risk.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b257bb3756a297d7260f797b6b375069ea07b75be64b0773e0609a229bc7f4"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_extractors::sql::sql_selected_data (cognitive 16): dbx_sql_data::data_grid_extractors::sql::sql_selected_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"3502195394795905aa3a9c2a2f357a25007dc318673b12e9649180841f992f18"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_neo4j_sql::build_neo4j_data_grid_save_statements (cognitive 16): dbx_sql_data::data_grid_neo4j_sql::build_neo4j_data_grid_save_statements has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_neo4j_sql.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3acda2a47ee9ac2295f6060cb9dd4367dae18755d52f5742c34b8f35f0420d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_sql::oceanbase_lob_predicate (cognitive 16): dbx_sql_data::data_grid_sql::oceanbase_lob_predicate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":4092}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab9c5ba60bf997c4e0b1eeb9cdc2f9f8587e9acbeac4022a3b41c03a19455db"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::data_grid_tdengine_sql::validate_tdengine_existing_rows (cognitive 16): dbx_sql_data::data_grid_tdengine_sql::validate_tdengine_existing_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_tdengine_sql.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ee0bb4c081f62fb654bf3905f1d95326ac782807e3b85e10808376777697ae"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::add_sql_server_offset_fetch (cognitive 16): dbx_sql_data::query_result_sql::add_sql_server_offset_fetch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"088a90aca6141e29fbe036d4772cb73969bf42070b9755ec28064ae0cf302adc"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_data::query_result_sql::add_standard_limit (cognitive 16): dbx_sql_data::query_result_sql::add_standard_limit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ecbb507d552631c117db5e1a9577a2a6dd0738a44e91a5fc9cfedfa4f27f62"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_dialect::sql_dialect::identifiers::qualified_table_name (cognitive 16): dbx_sql_dialect::sql_dialect::identifiers::qualified_table_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/identifiers.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"17eebcc9e61f492b1e9955f0cc6171e3c6bfb26d1fd9f2ac7d027a281cdf4565"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_arguments::normalize_number (cognitive 16): dbx_sql_schema::native_job_arguments::normalize_number has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_arguments.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b6c41ac87e1b0e000dd454ffd8a2947162f1061264e1f385fa90805e0f7d60"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::legacy_changes (cognitive 16): dbx_sql_schema::native_job_changes::legacy_changes has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 4 (6 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8034af08d4ab05faffa2cc1accd52f93cba03502d71ba84661414271b3ee9ee"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::rename_changes (cognitive 16): dbx_sql_schema::native_job_changes::dameng::rename_changes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdd785017a3129aefd4f99984843556d339942f51c94b97714e418bfb1f6bff"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::native_job_changes::dameng::parts::step_definition (cognitive 16): dbx_sql_schema::native_job_changes::dameng::parts::step_definition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng/parts.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a333196ae0bffe00682d11531464acd642e8ba997d558f5d97ed5392807c09"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::schema_diff::mysql_defaults::decode_metadata_expression (cognitive 16): dbx_sql_schema::schema_diff::mysql_defaults::decode_metadata_expression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/mysql_defaults.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1935e8fe308b35ed1a8efe6b1356d4607e2c4249cbff0ba754fca915ccc058"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_sql_schema::table_structure_sql::triggers::create_sqlserver_trigger_sql (cognitive 16): dbx_sql_schema::table_structure_sql::triggers::create_sqlserver_trigger_sql has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a7828a2e0341985d2de5165f150130295fb5f4eab7a70fcb0c861b65191aad"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_types::models::connection::as400_jdbc_properties (cognitive 16): dbx_types::models::connection::as400_jdbc_properties has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"8775184ce48882ee6c0668df897af45767bb023b853d0b8229a8a86cdd3262ea"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx_web::routes::transfer::start_transfer (cognitive 16): dbx_web::routes::transfer::start_transfer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/transfer.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb01b1e56c9dbabd8ce30bb8ccd81698e1d9a28263da706f7bf29adc65326689"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginServer::serve_framed (cognitive 16): PluginServer::serve_framed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/rust/dbx-plugin-sdk/src/lib.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7feedbc341450cb90967ca4bc88d01b934808c7acf2c6f8535aa24af1cad9c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::fs_open::validate_database_backup_file (cognitive 16): dbx::commands::fs_open::validate_database_backup_file has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/fs_open.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c194c9b234c86ebe13cf8c409413ab493438f0b50e413834626d7629eda016fc"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::commands::mcp_bridge::read_bridge_request (cognitive 16): dbx::commands::mcp_bridge::read_bridge_request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f842604e78919972c765c39ea0420c4aa59e8da108c048c1ba1c6fb41cc89c"}},{"ruleId":"D2","level":"warning","message":{"text":"dbx::plugin_ui_protocol::serve_plugin_media (cognitive 16): dbx::plugin_ui_protocol::serve_plugin_media has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 3 (4 pts), boolean chains 2 (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":"src-tauri/src/plugin_ui_protocol.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1738ca2cf4cef4732b7eb83c64fb083794077a3a39f77e57d22dbf5c7beabd15"}},{"ruleId":"D2","level":"warning","message":{"text":"BlobBoundExecutor.executeAll (cognitive 16): BlobBoundExecutor.executeAll has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (7 pts), loops 3 (5 pts), if/else 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/BlobBoundExecutor.java"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7389961c3e2054837d58f941c99a43758b370370522e5161a9242d11bbc122f3"}},{"ruleId":"D2","level":"warning","message":{"text":"DedicatedOwner.closeUnreturnedConnectionsUntil (cognitive 16): DedicatedOwner.closeUnreturnedConnectionsUntil has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcf37e704a4e402ff6ba2f3dbcb68bf2fdef1d612beb7074e4bce96f1cfa4be"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.getColumns (cognitive 16): DbxJdbcPlugin.getColumns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3690}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0091e6ef7bbd4ce66c801d63bb97f67f2e27e285b25f37ba9b5489ee2d3f1ee"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.postgresDatabaseUrl (cognitive 16): DbxJdbcPlugin.postgresDatabaseUrl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, error handling 1, loops 1, 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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5065}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7404bf9a9891e87029303870f0bc5e51f211fc4b1286180874af5465203cf34"}},{"ruleId":"D2","level":"warning","message":{"text":"DbxJdbcPlugin.serve (cognitive 16): DbxJdbcPlugin.serve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78ef3e636d3f36b54f1ddaaf986a4dbfdfd4e8bcc8e00e35384f554dabd88e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Gbase8sAgent.loadColumnDefaultsFromSource (cognitive 16): Gbase8sAgent.loadColumnDefaultsFromSource has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d94b466ec1863c9a99f4b4ddcb02ffd8859c88c375a313458b59181c26c003"}},{"ruleId":"D2","level":"warning","message":{"text":"H2Agent.getTableDdl (cognitive 16): H2Agent.getTableDdl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c006cba4549c37c6fa8951445482f517d9f61d4d30369c89315680b92a3c416b"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.collectLatestPeekRange (cognitive 16): KafkaAgent.collectLatestPeekRange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c509d36e71b67871c19f5994639107585b59bf028f625ef2a58be836e0a77cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaAgent.collectLatestPeekedMessages (cognitive 16): KafkaAgent.collectLatestPeekedMessages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d8af8005a0fc517fefb1c7a6a6f16c2a68342b3a4aef04a0fbe60d334d4546"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeServer.handleRuntimeRequest (cognitive 16): RuntimeServer.handleRuntimeRequest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, ternaries 3 (5 pts), boolean chains 1, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"9202dceb67bf7096d82e7e94b06688245a9cddf240c87a4fcfd331ed51d437ab"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseOracleAgent.getTableDdl (cognitive 16): OceanBaseOracleAgent.getTableDdl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, loops 3, error handling 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"0190ea52df9894b4e717dbcad2f2de228f85c7d9b8599c5eadf8599bfd10d934"}},{"ruleId":"D2","level":"warning","message":{"text":"OceanBaseOracleAgent.listForeignKeys (cognitive 16): OceanBaseOracleAgent.listForeignKeys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, loops 2, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30293270be4e54a1591c015d26c548f5ff0dd8d63254c59101f84471e2a7b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugBreakpointRegistry.mutate (cognitive 16): PlDebugBreakpointRegistry.mutate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, ternaries 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugBreakpointRegistry.java"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c273a6ac348f70736ed2d04cfefc50f1c6667701425b1d97fc887c6e5d7259"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugCompositeInput.nationalChunks (cognitive 16): PlDebugCompositeInput.nationalChunks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e1835e3e71fbeda19fbb1e626c0385b28987a4b48aa3e57e3eff031f4cb2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope.cleanup (cognitive 16): Scope.cleanup has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 2 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugMetadataInspection.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a50ce97e91952917c9176dbad84856e3f8b9633087e66c2789b86f9929c1e2"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugResultCache.page (cognitive 16): PlDebugResultCache.page has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugResultCache.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4383fc85fc6e259c5fb2166543ab9f2761e956413788b68d806264652aaa0d13"}},{"ruleId":"D2","level":"warning","message":{"text":"PlDebugSession.stack (cognitive 16): PlDebugSession.stack has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc730a0a65afad27a3fe38089bf2c92d90156fe26f1258cdf874a827ca3ddf5"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan.slots (cognitive 16): Plan.slots has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a7c0ecfd4e349d0f12db6054cf077ad43f6bae355e60d109e03719b04faa1f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseHiveServerRegistration (cognitive 16): main.parseHiveServerRegistration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4ca0c5655b817992d41a19173d9123d6b470d1a716a781841c10b70cd1f18f"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listObjects (cognitive 16): server.listObjects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b4ac95978386aaf35b7b1734b5c05797c9cb57efed0dcd45f9593e77c1e8da"}},{"ruleId":"D2","level":"warning","message":{"text":"protocolZooKeeperClient.authenticateSASL (cognitive 16): protocolZooKeeperClient.authenticateSASL has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c525374e75fdf4589cf235df731ec0db9ad528aa22e3216605e68873368794"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseCassandraConfig (cognitive 16): main.parseCassandraConfig has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a441121e92a927ee661f14b28960a4b0509a43a6006c52b53a16bcdcc4cc14b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.applyNativeHOCON (cognitive 16): main.applyNativeHOCON has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (15 pts), loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config_file.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"81753bb364ec95b7c135c3c32e406a80c0d182e06dedd0955405bc7b14f8bd94"}},{"ruleId":"D2","level":"warning","message":{"text":"main.tableDDLFromMetadata (cognitive 16): main.tableDDLFromMetadata has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"448206f043159ef0dbbb34e3e482c8132f96df02758d66fc80ce332bab260d61"}},{"ruleId":"D2","level":"warning","message":{"text":"server.executeQuery (cognitive 16): server.executeQuery has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/query.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c5aeca9bc0da59e829573fa2417642c59a7aab2cd7dc02c4d23bfd235807c1"}},{"ruleId":"D2","level":"warning","message":{"text":"etcdSession.authRolePermission (cognitive 16): etcdSession.authRolePermission has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf6a8e0aac48627ac04fa14e2b691997602a30f85bb6aa56b154879ce398352"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseHiveServerRegistration (cognitive 16): main.parseHiveServerRegistration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/discovery.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2634b02c99b7f90b98d9495c2abe45c4334ec1e6b036d4d7a0a77cf2a17f633c"}},{"ruleId":"D2","level":"warning","message":{"text":"server.listObjects (cognitive 16): server.listObjects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/metadata.go"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b1e0e0cf9f780d239c11c798c36992c857b14482741e4f84b53f4bfd762ea3"}},{"ruleId":"D2","level":"warning","message":{"text":"protocolZooKeeperClient.authenticateSASL (cognitive 16): protocolZooKeeperClient.authenticateSASL has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/zookeeper_protocol.go"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e204558d2f5d6c7d0c4a2179d73b19aaf925263535cb8acc9ae1e0966750aa"}},{"ruleId":"D2","level":"warning","message":{"text":"main.datasetRow (cognitive 16): main.datasetRow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/query.go"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7cd4129cb9da5f5bf98e026dc87158866c785289ddaa46a80dc6bea679345c"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getTreeDialectDDL (cognitive 16): server.getTreeDialectDDL has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/metadata.go"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd8edef1dea7b917b1474d9a271525d7390c9533228094adff3c4ed21393cb1"}},{"ruleId":"D2","level":"warning","message":{"text":"main.takeParenGroup (cognitive 16): main.takeParenGroup has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0e3fb1e9a42857f5f88ad8ab937a6e85deb7dd4bbf60a242df82e660dccfcc"}},{"ruleId":"D2","level":"warning","message":{"text":"server.dispatch (cognitive 16): server.dispatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f7169417dcd03f95854461b7d84058349c46b601be044292d885d0f062a089"}},{"ruleId":"D2","level":"warning","message":{"text":"server.getLegacyRoutineSource (cognitive 16): server.getLegacyRoutineSource has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 1 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/routine_metadata.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe55c2ab505dee06b21838aa203b7d7eb576b188fcc53cab3037f313fa60492"}},{"ruleId":"D2","level":"warning","message":{"text":"main.appendGraphValue (cognitive 16): main.appendGraphValue has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), boolean chains 2, if/else 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/graph.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2713ed3bcf11b406bdac5a0d0c2d00e502b0dc681d81154fcf0102177b7688"}},{"ruleId":"D2","level":"warning","message":{"text":"main.normalizeNestedValue (cognitive 16): main.normalizeNestedValue has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), boolean chains 2, if/else 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/query.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7eb1955a628ff0ef77cce4fd8a59ea45b311f7adf9ae23997952046e50abb2"}},{"ruleId":"D2","level":"warning","message":{"text":"main.normalizeNonFiniteQueryRows (cognitive 16): main.normalizeNonFiniteQueryRows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"98660aa066dbf1f2456bd2c14ab4ae51cd4b55271c01a372384bb69111b1ce70"}},{"ruleId":"D2","level":"warning","message":{"text":"main.oracleCompletionArgumentDataType (cognitive 16): main.oracleCompletionArgumentDataType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2764}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbf8cf3b442941414c611a787f5e32d369991fc4cb47bc20ea667906bc8c899"}},{"ruleId":"D2","level":"warning","message":{"text":"main.oracleTriggerBody (cognitive 16): main.oracleTriggerBody has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3669}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ea1e86e42244283c7f01a251bde5fb7756140d86fa464230c04e0587d71e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.terminateOracleViewDDL (cognitive 16): main.terminateOracleViewDDL has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fc4c80b57e8979e80c943740fd629e30410f9e615add06bd4c3e7db3f09eed"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugMergeStructuredBacktrace (cognitive 16): main.plDebugMergeStructuredBacktrace has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":3501}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fc7d8aeebb31f7295309b8434e6f1e8a49eabc402eb62523069cdf43b6761a"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeFrameSourceMatches (cognitive 16): main.plDebugNativeFrameSourceMatches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_anonymous_source.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9765e851e1806eeaa9d9fb1ed36820f78d6681d4873fd0785ce26b97866a297b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugPreviewNativeTarget (cognitive 16): main.plDebugPreviewNativeTarget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"031d7e921fd8bb1ae3791862f53210e0824e6b34b8a65108906d1150deee46fb"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeDecimal (cognitive 16): main.plDebugNativeDecimal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"51efad54551cc697021bb18e2f5c52330810a67c2536aeb47e6c2afc316dcbed"}},{"ruleId":"D2","level":"warning","message":{"text":"main.plDebugNativeArgumentDetailsMatch (cognitive 16): main.plDebugNativeArgumentDetailsMatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_typed_signature.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"beff360e612549bb4f94620a0b5d11cfc473c1d663b5ece256a22e1dafd5411f"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeServer.startNativeDebug (cognitive 16): runtimeServer.startNativeDebug has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c413c06d62a5310be9b16cd9c9af6930f0a0151527c636e4712f3fbd8a8f8dde"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugSession.frameScalarValues (cognitive 16): plDebugSession.frameScalarValues has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3f053afb803cb1920901c0e864bfccb4f67735156bf10e08c37274e764b17a"}},{"ruleId":"D2","level":"warning","message":{"text":"plDebugSession.snapshot (cognitive 16): plDebugSession.snapshot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":5419}}}],"partialFingerprints":{"codehealthFindingId/v1":"f081aa113b0f1f8044b58b9b55f6ac1cc2168f9877220a08aa3b970d85e1e516"}},{"ruleId":"D2","level":"warning","message":{"text":"main.classifyRPCError (cognitive 16): main.classifyRPCError has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/protocol_error.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8c6a034afa0461ff2c8d9ddf1a472c880bfbf50eb86443271cee457a2aab7b"}},{"ruleId":"D2","level":"warning","message":{"text":"server.applyPostgresIdentityMetadata (cognitive 16): server.applyPostgresIdentityMetadata has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5224341be13622f86f5212fb9fbf9fea900a0e7d7505c4bc5efce8076285dfa5"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseXuguPackageMembers (cognitive 16): main.parseXuguPackageMembers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/package_members.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a4f1c6f03cfd6fa692248a13bb325a623f55a7ce89a70a3ec4669d9f4ad9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"main.detectServerVersion (cognitive 16): main.detectServerVersion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"44841d792c928868d5b2392d3583be77288f2adab1a2f9e005a400dfd291736f"}},{"ruleId":"D2","level":"warning","message":{"text":"gosasl.negotiateToken (cognitive 16): gosasl.negotiateToken has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/gosasl/http_spnego.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b490cf8c6daa51b87b0b19a45cb077cbb3299a49fd623a4194544225a4affd"}},{"ruleId":"D2","level":"warning","message":{"text":"build_offline_jdbc_payload.validateAndCopyBundle (cognitive 16): build_offline_jdbc_payload.validateAndCopyBundle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/build_offline_jdbc_payload.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4a834b1227c13540b6b53f8be06eecdca90db8e65a0708afa9ae6586dcbf1d"}},{"ruleId":"D2","level":"warning","message":{"text":"verify_offline_jdbc_release.validatePayload (cognitive 16): verify_offline_jdbc_release.validatePayload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/verify_offline_jdbc_release.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcda4a7894e29541f8f6b7e8659b87d31c6798b37f5d93d97094606ef9002ef3"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorDiagnostics.useQueryEditorDiagnostics.enrichSemanticDiagnosticTables (cognitive 16): useQueryEditorDiagnostics.useQueryEditorDiagnostics.enrichSemanticDiagnosticTables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1255c45f92e31be51a96c57b904f5bcf42a8dc1889a0daf4448946c62e63d128"}},{"ruleId":"D2","level":"warning","message":{"text":"useQueryEditorDiagnostics.useQueryEditorDiagnostics.ensureColumnsForSemanticDiagnostics (cognitive 16): useQueryEditorDiagnostics.useQueryEditorDiagnostics.ensureColumnsForSemanticDiagnostics has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 6). Of this number, 13 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":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e301198adac9f1a4e082f9434147a08cf2c11544be29920092a6daff1e554087"}},{"ruleId":"D2","level":"warning","message":{"text":"queryResultTransferValues.normalizeSourceType (cognitive 16): queryResultTransferValues.normalizeSourceType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c415c7a4f0129bb7eacb638f269587012cf67a9fed6720c8bd8c5623457d6aba"}},{"ruleId":"D2","level":"warning","message":{"text":"useBackgroundImage.useBackgroundImage (cognitive 16): useBackgroundImage.useBackgroundImage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2, error handling 1 (nesting depth added 4). None of this is in the body itself: all 16 points belong to 3 function literals inside it that branch (lines 102, 45, 98). 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":"apps/desktop/src/composables/useBackgroundImage.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17ded9221697c3cdc57e6313b09f19ef3252213a7e97cc7b91f8471576965f1"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridColumnFormatter.useDataGridColumnFormatter.currentFormatterDraft (cognitive 16): useDataGridColumnFormatter.useDataGridColumnFormatter.currentFormatterDraft has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2868d1fd23332be062f2de5e6720504354abed0cbc16429ddb15f8d041dbfe2"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridColumnLayout.useDataGridColumnLayout.onColumnHeaderPointerMove (cognitive 16): useDataGridColumnLayout.useDataGridColumnLayout.onColumnHeaderPointerMove has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"471bf36aefe0fb56973018aaeee487965b3a33513da921b84d9506a6188b980a"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.applyQueuedAutoSaveChanges (cognitive 16): useDataGridEditor.useDataGridEditor.applyQueuedAutoSaveChanges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dfda56bc01873ab11758dbc1f41c52b6e710e607d09d841f8a8b375c9a774f"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.prepareAddedRows (cognitive 16): useDataGridEditor.useDataGridEditor.prepareAddedRows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, loops 1 (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e463f28aca5c8c26c7fd9e26270f0532c914ab6aba111a52942d3714c86d0fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridEditor.useDataGridEditor.clearPersistedPendingChangesForSave (cognitive 16): useDataGridEditor.useDataGridEditor.clearPersistedPendingChangesForSave has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (7 pts), boolean chains 6, if/else 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c97f5ef3642b3960154cf6a97c59bb41385f5314d27c1aaedb43420ac9afbd"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridLargeValues.useDataGridLargeValues.hydrateLargeValueCell (cognitive 16): useDataGridLargeValues.useDataGridLargeValues.hydrateLargeValueCell has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 690). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02d69a085d4ba01b22a253ff422aca2b96eff7c3f909713b9ae551602f66849"}},{"ruleId":"D2","level":"warning","message":{"text":"useDataGridSearch.useDataGridSearch.matchState (cognitive 16): useDataGridSearch.useDataGridSearch.matchState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, ternaries 3 (4 pts) (nesting depth added 2). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 80, includes, a function literal at line 75). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSearch.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"819a3847e32fce9c06becb5584da14d99ae81ea74855a042f2bcd0f01231228f"}},{"ruleId":"D2","level":"warning","message":{"text":"useNativeJobExecution.useNativeJobExecution.prepare (cognitive 16): useNativeJobExecution.useNativeJobExecution.prepare has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), error handling 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNativeJobExecution.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ec9ad44addcd6075d3cbd741c8764cf7aee95117861db971745f2a8c4f235d"}},{"ruleId":"D2","level":"warning","message":{"text":"useSidebarTableMutationRuntime.useSidebarTableMutationRuntime.runDangerOperation (cognitive 16): useSidebarTableMutationRuntime.useSidebarTableMutationRuntime.runDangerOperation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTableMutationRuntime.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f39825d278b471ba37fc5b8e40128df582a456675c4e03917125204cc00d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"useSqlExecution.isDangerousSql (cognitive 16): useSqlExecution.isDangerousSql has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (12 pts), if/else 2 (3 pts), boolean chains 1 (nesting depth added 10). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 137). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e39aefbc91047f3b4b818e260e0ef1fbda90a47b83c1bc0b201eb9256e782b"}},{"ruleId":"D2","level":"warning","message":{"text":"useSqlExecution.useSqlExecution.tryExecute (cognitive 16): useSqlExecution.useSqlExecution.tryExecute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"001a0bcd2a1e32afc454a963e375ca32695be60bc97e7bacdb6f6420d480c36c"}},{"ruleId":"D2","level":"warning","message":{"text":"aiSqlTargetTab.resolveAiSqlTargetTabId (cognitive 16): aiSqlTargetTab.resolveAiSqlTargetTabId has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiSqlTargetTab.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b4399aa58716e1ced8c388af6ef19733cfdaa06c20c12db85e053d6b90ce1e"}},{"ruleId":"D2","level":"warning","message":{"text":"pinnedItems.migrateLegacyPinnedTreeNodeOrder (cognitive 16): pinnedItems.migrateLegacyPinnedTreeNodeOrder has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 6). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (visit, a function literal at line 159). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/pinnedItems.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de1d8a2c785c8972b6385dcaf6c7981cdb9dfc1a25c2d327bcb04d7d8c2c516"}},{"ruleId":"D2","level":"warning","message":{"text":"errorUtils.jsonObjectEnd (cognitive 16): errorUtils.jsonObjectEnd has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb6f6f7c8b02b5fb50e651b29fa58ff078b0f21ea0604b960bd0dcc12649405"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduledDatabaseBackup.normalizeDatabaseBackupRun (cognitive 16): scheduledDatabaseBackup.normalizeDatabaseBackupRun has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, ternaries 6, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a428c2e9eb0fd77794a0354a22e02b5bb732c3e71bbaeaf5be9d3e6eaae74bf"}},{"ruleId":"D2","level":"warning","message":{"text":"safeJsonFormat.diffText (cognitive 16): safeJsonFormat.diffText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3ef62375104eb4f814112c0c59eccb2e1b45fccbefb1f0f1c7bed6d18227fb"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionParameterCatalog.connectionParameterCatalog (cognitive 16): connectionParameterCatalog.connectionParameterCatalog has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 6). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 92). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionParameterCatalog.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bfac626b7cbc9618b873528acf4227a4f20159af729da12b684121091daada"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrl.parseZooKeeperUrl (cognitive 16): connectionUrl.parseZooKeeperUrl has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8, boolean chains 4, if/else 3, error handling 1. Of this number, 10 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7502a1baab752990cf47d4e4065b10a14704375878d5874d3c74fb5afc528935"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrl.parseJdbcDremioUrl (cognitive 16): connectionUrl.parseJdbcDremioUrl has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d151c6cf46ac7711c8889e5248a61474fedafba2e5a1b90bbfd453a5ddef9c"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionUrlBuilder.jdbcQuery (cognitive 16): connectionUrlBuilder.jdbcQuery has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7298ed72eb3cba76ba81413d1dea66fe68d49d4265bbbe0a47320f98535e301"}},{"ruleId":"D2","level":"warning","message":{"text":"columnFormatter.formatNumber (cognitive 16): columnFormatter.formatNumber has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 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":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf4adc1477d7fda16e1abfaa28c77bbe6d6002f1728174ad4ec7d7c9582c965"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridColumnFilter.parseFilterValue (cognitive 16): dataGridColumnFilter.parseFilterValue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"db46ae32c0e1c35048230497c3d68ef179cae99e1a87747ba50a996d554860a6"}},{"ruleId":"D2","level":"warning","message":{"text":"dataGridReplace.findDataGridReplacementMatches (cognitive 16): dataGridReplace.findDataGridReplacementMatches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 1 (nesting depth added 5). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 41). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridReplace.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e59944ab927aa402a8a34c0973f8f67bdc43aa4db3dbd7d80b9ae2b31b6a4d1"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseObjectCapabilities.normalizeSidebarObjectKind (cognitive 16): databaseObjectCapabilities.normalizeSidebarObjectKind 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":"apps/desktop/src/lib/database/databaseObjectCapabilities.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"502a3062825b19c36bdd6c2e2cc089dac2e057e1f2e825c8fbffe9a98587d4d1"}},{"ruleId":"D2","level":"warning","message":{"text":"databaseUserAdmin.splitMySqlIdentifierPath (cognitive 16): databaseUserAdmin.splitMySqlIdentifierPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseUserAdmin.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3ffb33bea1a5c1414c0a4507e38dfd0893b49a6bb3e30334e0d994aa71b373"}},{"ruleId":"D2","level":"warning","message":{"text":"jdbcDialect.connectionObjectTreeNodeSchema (cognitive 16): jdbcDialect.connectionObjectTreeNodeSchema has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/jdbcDialect.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb33cf4d198d52ec26d0b88c643e622bf44bc07f565efed9c10454d912a34df7"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleSecurity.readDictionary (cognitive 16): oracleSecurity.readDictionary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSecurity.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb9e5507dc01ebd820b7887a3d82602c708947d5db5966cccf5f85daed6b9ac"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleSessionDiagnostics.captureOracleDiagnosticTarget (cognitive 16): oracleSessionDiagnostics.captureOracleDiagnosticTarget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionDiagnostics.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f0bc5cfa62b21f4f348c26e4c227eee8486d4457f301e7f1c1df21fe9a9df0"}},{"ruleId":"D2","level":"warning","message":{"text":"draft-storage.saveFocusedDiagramState (cognitive 16): draft-storage.saveFocusedDiagramState has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (5 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 2). Of this number, 8 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/draft-storage.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1010c3eb14cdec9843c805ec6be1d10ff32182281acad7ae44c46ff9f8be70d3"}},{"ruleId":"D2","level":"warning","message":{"text":"elk-layout.computeLayoutWithLayers (cognitive 16): elk-layout.computeLayoutWithLayers has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/elk-layout.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"313f4102b110e9df5b2422758236b18b72dc895d28ca167c608e67c9e891c30d"}},{"ruleId":"D2","level":"warning","message":{"text":"elk-layout.extractLayoutResult (cognitive 16): elk-layout.extractLayoutResult has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/elk-layout.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"507518887a970f8253cc991dbc9f9b1942fcb305707c281f4fcb60245473e285"}},{"ruleId":"D2","level":"warning","message":{"text":"queryEditorTableDrop.quoteColumnReferenceName (cognitive 16): queryEditorTableDrop.quoteColumnReferenceName has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 4, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorTableDrop.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"453829a3fa210d2f79fc8a8a760227a2dc3bb0cea7b86dd50bd020ff31c99642"}},{"ruleId":"D2","level":"warning","message":{"text":"queryEditorTextEdits.blankLineDeletionChanges (cognitive 16): queryEditorTextEdits.blankLineDeletionChanges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), ternaries 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorTextEdits.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ce552bcb03477e9695765a6a4eb7138f6999ad9b60e1cc390836ebbf68f661"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlSemanticSelectionRanges.collectExpressionRanges (cognitive 16): sqlSemanticSelectionRanges.collectExpressionRanges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2, ternaries 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":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a952cbe5d468cb299c8abb6091626f5f4865638621a3a74ed726efa5ff1b78"}},{"ruleId":"D2","level":"warning","message":{"text":"datagripImport.inferProfile (cognitive 16): datagripImport.inferProfile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36390f6c109176349391879fcf398487c01753a0eaf3c200a24727f61632e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"datagripImport.parseDataSourcesXml (cognitive 16): datagripImport.parseDataSourcesXml has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6c7495a55c165b2ea7fef4b1f73f5566d721444f44455c0b93196120a7eda7"}},{"ruleId":"D2","level":"warning","message":{"text":"kvValueFormat.detectKvValueFormat (cognitive 16): kvValueFormat.detectKvValueFormat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/kvValueFormat.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db7b7c9a28aa5b1fcc7559b19fc32047cbf19ab090b86fdfa3765c0fa621112"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoCompletion.classifyGroup (cognitive 16): mongoCompletion.classifyGroup has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"af64b1bfc0f31ed282c62644ba6995c80364977b6e5a2d5929d673eedf70e5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoShellCommand.mongoFilterContainsOpaqueLogic (cognitive 16): mongoShellCommand.mongoFilterContainsOpaqueLogic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7 (nesting depth added 3). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 2007). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41a2db2a34e4fab859f4f15a1d98581bd80ab5585322784d39fcfa3711b3130"}},{"ruleId":"D2","level":"warning","message":{"text":"mongoSql.groupStage (cognitive 16): mongoSql.groupStage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c1c45702d6f203df3b34d0d57fbf85381865215881059eade23615e2d991b6"}},{"ruleId":"D2","level":"warning","message":{"text":"FrontendPluginRegistry.listToolbarMenuCommands (cognitive 16): FrontendPluginRegistry.listToolbarMenuCommands has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 8). Of this number, 13 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97773f18076a963fd6e6abd80d0ea59138e38ae69a0191dcfec20af6a65fed8"}},{"ruleId":"D2","level":"warning","message":{"text":"pluginFloatingWindow.endFloatingWindowDrag (cognitive 16): pluginFloatingWindow.endFloatingWindowDrag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2cb4692906bb49c104aae2845a11e46c61a591e0533ea1565ba5b2272110a1"}},{"ruleId":"D2","level":"warning","message":{"text":"redisValuePresentation.parseRedisJsonDetail (cognitive 16): redisValuePresentation.parseRedisJsonDetail has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (3 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a19953898a0e9696f15b213f20b490f1d2a3e404aaa8de6d5757e747e2380e8"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCommandDocs.parseRedisCommandCatalog::collect (cognitive 16): redisCommandDocs.parseRedisCommandCatalog::collect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandDocs.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5503a798154492c4d6b8699b58a41fe44715891b01d172fe1f07c74024a93b"}},{"ruleId":"D2","level":"warning","message":{"text":"redisCommandSafety.firstRedisCommandToken (cognitive 16): redisCommandSafety.firstRedisCommandToken has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandSafety.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9001c9fb64c83a0187dd676a2dde72f1d364e75ab86922356e890632d647ec"}},{"ruleId":"D2","level":"warning","message":{"text":"redisKeyTree.flattenVisibleRedisKeyTreeCooperatively (cognitive 16): redisKeyTree.flattenVisibleRedisKeyTreeCooperatively has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyTree.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c29dc2a5950e4dd1e580c1c2ff7e35747d8898b6ad54c4342671b7952971b6"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineDeploy.acceptOracleRoutineDeploymentOperation (cognitive 16): oracleRoutineDeploy.acceptOracleRoutineDeploymentOperation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab354232b500252ef2bfa5780303b8a03cde665473c9cfdc45bcb77c1e8f564"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDiff.buildDeploySqlForObjects (cognitive 16): schemaDiff.buildDeploySqlForObjects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"99957ee468c22db36625ba8d650fb6d83e67e1025e7fb7c98219708b87e9d011"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarDatabaseStorage.applySidebarTableStorage (cognitive 16): sidebarDatabaseStorage.applySidebarTableStorage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 1 (nesting depth added 5). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (visit, a function literal at line 55). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarDatabaseStorage.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"037aaa2e06f83ee08a779c57cd307c61919674a4faeedc414bcc45ea5a47a491"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarLayoutMonitor.captureRows (cognitive 16): sidebarLayoutMonitor.captureRows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bca40583a9f3cde8a5982b81a8eab2207a9561c392ab2333e202e9cf3554c4"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarLayoutMonitor.buildAnomalyDigest (cognitive 16): sidebarLayoutMonitor.buildAnomalyDigest has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 4, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad8435d38da6757ca8122c1ef7964acb4a3d9cab8f4b8048ff6dbe0ad9a5243"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarRemoteSearch.collectSidebarRemoteSearchResults::visit (cognitive 16): sidebarRemoteSearch.collectSidebarRemoteSearchResults::visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarRemoteSearch.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d332ca5c9d92672f1910b04d6b4d8a0abb6cfdbe9aafa88d72a1e090007c7fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarSearch.matchesWordPrefixConcatenation (cognitive 16): sidebarSearch.matchesWordPrefixConcatenation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearch.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e251b84ed36682f767a4579a544316915a670feb1b9c0820648e786617b6de9a"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarSearchTree.filterSidebarTreeToConnectedConnections (cognitive 16): sidebarSearchTree.filterSidebarTreeToConnectedConnections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfa0816ada968ba808a38c3087d4ae490166d286d0a80c5722b84ed30a5ebd6"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebarVisibleFilterSummary.sidebarVisibleFilterSummary (cognitive 16): sidebarVisibleFilterSummary.sidebarVisibleFilterSummary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 6, boolean chains 2, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarVisibleFilterSummary.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4659815ffda75fce68d54b9ea1d9ae46ed4495248b28f7eb73aeed168b75bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"ddlDisplay.findColumnAttributePositions (cognitive 16): ddlDisplay.findColumnAttributePositions has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, ternaries 7, if/else 2. Of this number, 12 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"992f2f8b16be88db723e409cd16b9c40d549c633b459d2e2aaa287f6b75d5d13"}},{"ruleId":"D2","level":"warning","message":{"text":"completion.mutationTargetIntroducer (cognitive 16): completion.mutationTargetIntroducer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eab83d35d82d80e84ca3fdb562eadab021e3c36beed280aea04e0257f6e269"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlAnalysis.lastTopLevelWhitespaceStart (cognitive 16): sqlAnalysis.lastTopLevelWhitespaceStart has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"88305f07f341f31c7b9d7bf1beb9d334f30ce3622626bc40bbfd624e849e8036"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.extractSubqueryReferences (cognitive 16): sqlCompletion.extractSubqueryReferences has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4769}}}],"partialFingerprints":{"codehealthFindingId/v1":"1080809973f0387c9f73e62f51f220222361ffcc50af94abf243262e461b27ae"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlCompletion.findMatchingOpenParen (cognitive 16): sqlCompletion.findMatchingOpenParen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7303}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf38cd7997979ec4c3c9146797b9203a05b68121f84824de76d10301c3f9772"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlServerRoutineSyntaxDiagnostics.missingDeclareDataTypeTokens (cognitive 16): sqlServerRoutineSyntaxDiagnostics.missingDeclareDataTypeTokens has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlServerRoutineSyntaxDiagnostics.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2086b02863d1f72abf749359fc2e304f8dacbffc356ba62392c32930f4055fc"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineRename.readSource (cognitive 16): oracleRoutineRename.readSource has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (5 pts), boolean chains 4, 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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fcc6924a726f0378244bd80ae84115635fa7687c6f02512550062f143a58db"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleRoutineWrite.prepareOracleRoutineSourceSave::execute (cognitive 16): oracleRoutineWrite.prepareOracleRoutineSourceSave::execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (oracleRoutineWrite.prepareOracleRoutineSourceSave) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineWrite.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a439b662a4082ec9b5ff471baa723843ee64ffd7d6a630575806bae7a869deac"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTableRename.readSource (cognitive 16): oracleTableRename.readSource has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (5 pts), boolean chains 4, 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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc05bbfb98e6a316001ae74c69201b5c8008188eebd28c633e46361e5420e019"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleTableRename.orderDependents (cognitive 16): oracleTableRename.orderDependents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfadc1f63076726bfe34b74e625432333f4b51c4393370c260720da6506eb6c0"}},{"ruleId":"D2","level":"warning","message":{"text":"oracleViewRename.prepareOracleViewRename.walk (cognitive 16): oracleViewRename.prepareOracleViewRename.walk has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 4 (5 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 6). Of this number, 11 points are the body\u0027s own statements and 5 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":"apps/desktop/src/lib/table/oracleViewRename.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2476a959d12a728d97ba763e3a12707029ebd94294575e6fc87a35f196ccbbc"}},{"ruleId":"D2","level":"warning","message":{"text":"tableColumnTemplates.mergeTableColumnTemplateFields (cognitive 16): tableColumnTemplates.mergeTableColumnTemplateFields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnTemplates.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17fec0937fc37058a4438e5998ad684459aac80e4c21ba60d881d53969e960c"}},{"ruleId":"D2","level":"warning","message":{"text":"tableVGroup.findTableVGroupHolderContainer::walk (cognitive 16): tableVGroup.findTableVGroupHolderContainer::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09d5e5b58b9232caf0956f21c64e1da521e1a31066b091992fc55a9d76e2bef"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.tabConnectionGeneratedColor (cognitive 16): tabPresentation.tabConnectionGeneratedColor has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (15 pts), loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6552095b4cf80a67ab6603284907b96507224b1f99fc376632b2b913abb93210"}},{"ruleId":"D2","level":"warning","message":{"text":"tabPresentation.connectionNameSuffixTabIds (cognitive 16): tabPresentation.connectionNameSuffixTabIds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f58202d07c7b1c351f2b4d438fc70bb0950605a0a2a8f37cb1e6b06af42af7"}},{"ruleId":"D2","level":"warning","message":{"text":"tabResultCache.selectResultCachePruneKeys (cognitive 16): tabResultCache.selectResultCachePruneKeys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe30ce37f99065b57eb418abf11f2b5b84acab180ec979e7daddc292f6cdc58"}},{"ruleId":"D2","level":"warning","message":{"text":"tabUiState.sanitizeTabUiState (cognitive 16): tabUiState.sanitizeTabUiState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabUiState.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ecf54d03748b25ddcd62e91d6a1d6f6809e9f2bd3970a968a4424453f732a3"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadCachedMetadataListPage (cognitive 16): connectionStore.useConnectionStore.loadCachedMetadataListPage has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 4 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"8669343d6358086dfdd858f868a396ec7dab20a61d2f5adc08a9968d43c55051"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadPagedTableGroupChildren (cognitive 16): connectionStore.useConnectionStore.loadPagedTableGroupChildren has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8 (10 pts), boolean chains 4, if/else 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"364c672f810e4eebfde1e245401fda493feb687997ffe1c3f59fa74df22dd9c1"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.loadXuguTypeMembers (cognitive 16): connectionStore.useConnectionStore.loadXuguTypeMembers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, error handling 1 (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9502}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8d015a410413670c0a29b7714323fb20b1fc750da8718344221e03b4166e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionStore.useConnectionStore.toSqlCompletionObject (cognitive 16): connectionStore.useConnectionStore.toSqlCompletionObject has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10617}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7048a40874a57a59f1cc7ed0b8d610c4d913b9bca83a54b111239e93715fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.removeMultiDbExecutionWorker (cognitive 16): queryStore.useQueryStore.removeMultiDbExecutionWorker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"70088d4e19691d3c5213320f7b42f10f88ae730d22565468bc296dda16449a98"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.localizePluginTabTitles (cognitive 16): queryStore.useQueryStore.localizePluginTabTitles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4639}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b678f182bc16a69732122baef97c3c3dccb4ecda4d63fb396564c322c510a7"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.openPluginConnection (cognitive 16): queryStore.useQueryStore.openPluginConnection has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 5, boolean chains 4 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4712}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ce03251594bdfbc32927bd251b7b4d92511a7130e48a0cbc2114638b9ad6d3"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.openTableStructure (cognitive 16): queryStore.useQueryStore.openTableStructure has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, ternaries 4, if/else 2 (3 pts) (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 6 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4800}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcfb6be130570e0468e153a72d8c234db2b80a78c17f94b806602909a3d04fb"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.closeTabsWhere (cognitive 16): queryStore.useQueryStore.closeTabsWhere has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 1. Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5805}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e23815117d492df7380aad9631552c399edb519971a7789dbbf4a6ddd61f4c0"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.detachConnectionTabsForDelete (cognitive 16): queryStore.useQueryStore.detachConnectionTabsForDelete has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 3 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6131}}}],"partialFingerprints":{"codehealthFindingId/v1":"abde0e4dc93f56e10792943aa20789d3cc7bd1ece00f1b2d43258aad05a16d33"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.executeCurrentSql (cognitive 16): queryStore.useQueryStore.executeCurrentSql has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4945ed271d02d67ad7c40fa95337778e15249efc35efd43e786b968d19c689f4"}},{"ruleId":"D2","level":"warning","message":{"text":"queryStore.useQueryStore.captureResultLegacyValuesForExport (cognitive 16): queryStore.useQueryStore.captureResultLegacyValuesForExport has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 5, ternaries 4 (5 pts) (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10858}}}],"partialFingerprints":{"codehealthFindingId/v1":"8686e18af932bcc652111c86a4b94fcd14f3f3325350c498dc70939321c297f0"}},{"ruleId":"D2","level":"warning","message":{"text":"savedSqlStore.useSavedSqlStore.reorderFiles (cognitive 16): savedSqlStore.useSavedSqlStore.reorderFiles has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, ternaries 2, if/else 1. Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1155, 1153, 1136). 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a263399d7af874c154d8d862a2bc6511ed26d06e53314c7e098f895c13019466"}},{"ruleId":"D2","level":"warning","message":{"text":"settingsStore.inferAiProviderFromConfig (cognitive 16): settingsStore.inferAiProviderFromConfig has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5a66d95fa3d9c8514414ab39c4690e8cf92f25e52ce335e4852c02ef084213"}},{"ruleId":"D2","level":"warning","message":{"text":"transferTaskStore.useTransferTaskStore.moveTaskToFolder (cognitive 16): transferTaskStore.useTransferTaskStore.moveTaskToFolder has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 14, if/else 2. Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 396, 390, 391). 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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d31ae32ad59cc8b390a8c5b53f39d6fa5e477d2c11f76c8c007f5132e41690"}},{"ruleId":"D2","level":"warning","message":{"text":"transferTaskStore.useTransferTaskStore.reorderTasks (cognitive 16): transferTaskStore.useTransferTaskStore.reorderTasks has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, ternaries 2, if/else 1. Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 467, 465, 455). 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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e84611fe149cb1babf93bdace27d8b15b03d2fb8fce2c82ee5c918f69b35648"}},{"ruleId":"D2","level":"warning","message":{"text":"meilisearchManagement.formatMeilisearchTaskDuration (cognitive 16): meilisearchManagement.formatMeilisearchTaskDuration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 3 (5 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/meilisearchManagement.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9519280a77d5074ada54fec1f84ba5d9a83bff2b268fc57ec3b058aedcb0c4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"migrate-archive.buildArchive (cognitive 16): migrate-archive.buildArchive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/migrate-archive.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"acded99f68252d056cfcc1e85becfbde09167e3dc32da760f22867f3ff1a848a"}},{"ruleId":"D2","level":"warning","message":{"text":"platformDetection.detectPlatformId (cognitive 16): platformDetection.detectPlatformId has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/lib/platformDetection.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"511870287d71329c8d692b2b523b8d28d39315855f5b3b71ba51393f62f7d7ad"}},{"ruleId":"D2","level":"warning","message":{"text":"verifyArchive (cognitive 16): verifyArchive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), boolean chains 1, other 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/migrate-archive.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e40cc345b0f9a0f3a59b82edd8c2c85f22b3ffd02235d0f51f0f40d8da3f09b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridExport.useDataGridExport: FunctionTooLong \u2014 useDataGridExport runs 2228 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2128 over it, 22.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"41889671aaf7ad74986233ea7fe2a16838bb833fd0086b4b40aca0d6c2e52587"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/transfer.rs: FileTooLong \u2014 10584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 449 free functions. The bar is 500 significant lines; this is 10084 over it, 21.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b9da4796284bd26f67835d064864f471d7c23e90adcdde8cf8676e40954157"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridEditor.useDataGridEditor: FunctionTooLong \u2014 useDataGridEditor runs 1944 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1844 over it, 19.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77ea794536a2359ef3c4b2598e354341fa5f440566d2b03b9c9dd77bef0ad97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stores/queryStore.ts: FileTooLong \u2014 9074 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: useQueryStore (1189-12278). The bar is 500 significant lines; this is 8574 over it, 18.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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c612f128de145fae5d2605a2ae4829a723edb52d655cd592aeda9d8572aca055"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stores/connectionStore.ts: FileTooLong \u2014 8909 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: useConnectionStore (487-12305). The bar is 500 significant lines; this is 8409 over it, 17.82\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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e895601c463248952ab44f642c6828f7e8317d47c0a2fb71740bf5ac7d0b057d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/mod.rs: FileTooLong \u2014 8802 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 408 free functions. The bar is 500 significant lines; this is 8302 over it, 17.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"900a5eb1424faa51ec13665cc08467441211dc748bb9816dc797727f0d6facdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/postgres.rs: FileTooLong \u2014 8125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 436 free functions. The bar is 500 significant lines; this is 7625 over it, 16.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"784ad8897c42fbcfb3997675ef4de259257d34b9c18941e6a90b4037b9e7caf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: persistence/storage.rs: FileTooLong \u2014 7794 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: Storage (16 blocks, 266-9725), declaring 149 free functions. The bar is 500 significant lines; this is 7294 over it, 15.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":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4839a205efa31b1507223d40792d15e32314d140a27855e5d7daee47e3c290"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/table_import.rs: FileTooLong \u2014 6910 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 237 free functions. The bar is 500 significant lines; this is 6410 over it, 13.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"690facf9e27aa856351e158944cc4d2f806e8b87e4d9493fa1571890ffac900b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx::run: FunctionTooLong \u2014 dbx::run runs 1323 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1223 over it, 13.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lib.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b57c6baa3af2bb11940beda6c96ff60787343d8f24ab4cb4a1665cb00bfd76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorCompletion.useQueryEditorCompletion: FunctionTooLong \u2014 useQueryEditorCompletion runs 1304 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1204 over it, 13.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f68c0e576a9746419271b56e3d675277ce82f9f4e16c20366bf17093f0e3105"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: connection/mod.rs: FileTooLong \u2014 6317 significant 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 69% of them inside a single declaration: AppState (2 blocks, 491-7860), declaring 112 free functions. The bar is 500 significant lines; this is 5817 over it, 12.63\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc35cb225747c1aa2fe066d9c724a525a8f6ba67448938e9437d4f6f6d9d3c0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::table_import::import_table_file_core: FunctionTooLong \u2014 dbx_core::data::table_import::import_table_file_core runs 1204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1104 over it, 12.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":7844}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fadbf35936c6d2251e07282d378cff701a5a5de4bd8d8a249a90d86e7080ce3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DbxJdbcPlugin: ClassTooLong \u2014 4813 significant lines (blank, comment-only and punctuation-only lines excluded), 324 methods. The bar is 400 significant lines; this is 4413 over it, 12.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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d62cba1b805d74266afee16ca4ab02de32f2fae0b6075c946bb97439370db9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mysql.rs: FileTooLong \u2014 5838 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 325 free functions. The bar is 500 significant lines; this is 5338 over it, 11.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af2ed93b042fd9572cfb37aafcea8e5492291a811c6fca6a94f66fef36c87ee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Storage: ClassTooLong \u2014 4647 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 237 methods, 16 blocks, lines 266-9725. The bar is 400 significant lines; this is 4247 over it, 11.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":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"327ba123a6b648cc14cfe091c6306a3b704474669a615e77c737f28eb7e42444"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/mod.rs: FileTooLong \u2014 5722 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 215 free functions. The bar is 500 significant lines; this is 5222 over it, 11.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bd2e711087967b462bdcc34b9111805247454aca8a67b90d3bef89b3d5b928"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppState: ClassTooLong \u2014 4352 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 182 methods, 2 blocks, lines 491-7860. The bar is 400 significant lines; this is 3952 over it, 10.88\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"041f144d968414e65fa14f78697c077e9abfb9f59d37fa56481d5f8efb92d2d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DbxJdbcPlugin: TooManyMethods \u2014 324 methods. The bar is 30 methods; this is 294 over it, 10.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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9206ba6da0e8147719ed24c0632797f284e8e02c981a299d5d1c4ad96db628a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 5278 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: DbxMcpServer (5 blocks, 951-6031), declaring 78 free functions. The bar is 500 significant lines; this is 4778 over it, 10.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"848cf7e7bcec0adb31d5e1c007e580d4fe639328b10fd413e708056b428a898e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_web::serve: FunctionTooLong \u2014 dbx_web::serve runs 1048 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 948 over it, 10.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db242e22d15190e30ba4ff101cc2faaa69c172676f2d5b43f438e58179589db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/schema_diff.rs: FileTooLong \u2014 5171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 148 free functions. The bar is 500 significant lines; this is 4671 over it, 10.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50422f5857fd31ec30ca5024c36186eb0c318672f1972423d4fe881ac14c53e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jdbc/DbxJdbcPlugin.java: FileTooLong \u2014 4873 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: DbxJdbcPlugin (64-6804). The bar is 500 significant lines; this is 4373 over it, 9.75\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa622a23b120094974f2ffae7d8da11753bc19f21d54f6b3e0b6133ba7936c02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::database_export::export_database_sql_core_inner_with_phases: FunctionTooLong \u2014 dbx_core::data::database_export::export_database_sql_core_inner_with_phases runs 972 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 872 over it, 9.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e45f3ec742025583d579a31b3c5c1698348442b8d8873ac93e8d05945378570"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/tauri.ts: FileTooLong \u2014 4736 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4236 over it, 9.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60294114485156a6d82d5b280dd92f1e6e0c6f97be099dc974f5a279806f892b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/sqlCompletion.ts: FileTooLong \u2014 4637 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4137 over it, 9.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a5a1c5d2f068e885c4cfa8977eb959d1a085654d85acdc9dab658ece2d68c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSidebarDatabaseSpecificMutationRuntime.useSidebarDatabaseSpecificMutationRuntime: FunctionTooLong \u2014 useSidebarDatabaseSpecificMutationRuntime runs 913 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 813 over it, 9.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"549b26f296393a8eef60b1fb73265ccd89a1e1e0234f7d1d786a532b0cb538cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/database_export.rs: FileTooLong \u2014 4466 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 170 free functions. The bar is 500 significant lines; this is 3966 over it, 8.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5c2d6ad178a47107fb832fd5dfca5324e8c74d8f1321bf47a90d34af2e1dbf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DbxMcpServer: ClassTooLong \u2014 3566 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 97 methods, 5 blocks, lines 951-6031. The bar is 400 significant lines; this is 3166 over it, 8.92\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5aa22b58882dc6e495ed70fdf948bf6ac65eab941c2a6f5c48705043d3ea42c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: settingsStore.useSettingsStore: FunctionTooLong \u2014 useSettingsStore runs 878 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 778 over it, 8.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0b3530589bce45171f48723c2c9ff192557d9f9d913ab970419c267b838a75"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oracle-go/main.go: FileTooLong \u2014 4388 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3888 over it, 8.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50e2ad53d9d238ac35ab8b3baea8f6dbc3281e043a5421c77c47de1acd87517"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: xugu/main.go: FileTooLong \u2014 4053 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3553 over it, 8.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48605563fe398f73cd5ccc193540c6d7b614da72090300bc0df3a7fdf860bc09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 3956 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 229 free functions. The bar is 500 significant lines; this is 3456 over it, 7.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d178e7fa8896347f03ce263c9f984a9a1a0cbf487e9976ae38836efd840e0fef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Storage: TooManyMethods \u2014 237 methods, declared across 3 files: persistence/storage.rs (229), persistence/credential_reset.rs (5), storage/type_execution_receipts.rs (3). The bar is 30 methods; this is 207 over it, 7.90\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"964a3d060562ad0dcd832215b9f90ea72c17525a3008c742b466df10694e917d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: savedSqlStore.useSavedSqlStore: FunctionTooLong \u2014 useSavedSqlStore runs 788 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 688 over it, 7.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da0c97cff36dc77a2239850b76896ce6cfadfb19c1f3ede0bb3b870faa48bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/http.ts: FileTooLong \u2014 3879 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3379 over it, 7.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d355fb31470636e335182935851800a11b526a2ef7b02c72eae648c2509c62a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSqlExecution.useSqlExecution: FunctionTooLong \u2014 useSqlExecution runs 757 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 657 over it, 7.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43c7622f81d5f45dc8daefd3340181a7ae43fb2dc4fe5f12de7f2c2adc29f72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::transfer_table_inner: FunctionTooLong \u2014 dbx_core::data::transfer::transfer_table_inner runs 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 635 over it, 7.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":13155}}}],"partialFingerprints":{"codehealthFindingId/v1":"15757d91dfcfa041e30a93f7fb5083f5bf52a81b6eba8af7226ec6da9dfb582b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/data_grid_sql.rs: FileTooLong \u2014 3611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 197 free functions. The bar is 500 significant lines; this is 3111 over it, 7.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ccbd4414c567aaa6d7f544f28803a6f75c4384bd3eadcbd43814a588bbdca6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ai.rs: FileTooLong \u2014 3525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 150 free functions. The bar is 500 significant lines; this is 3025 over it, 7.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6971cf116b71a53e932817f0b7278c72c5151bb27d84a55d66b9fb9132dca3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSidebarTreeExportRuntime.useSidebarTreeExportRuntime: FunctionTooLong \u2014 useSidebarTreeExportRuntime runs 705 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 605 over it, 7.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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc51ff7691b0f0950e42f6e1bd2dd34d1be3ecb1aac07dba24f218136c16e91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nacos/http.rs: FileTooLong \u2014 3332 significant 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 69% of them inside a single declaration: NacosOpenApiAdmin (3 blocks, 167-3436), declaring 69 free functions. The bar is 500 significant lines; this is 2832 over it, 6.66\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8097a69cd7840f6e704de47245afe106a11903f769f855235662f3dabc279f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sqlserver.rs: FileTooLong \u2014 3282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 195 free functions. The bar is 500 significant lines; this is 2782 over it, 6.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0b19c777a5f30d9b76a7864a0902a15576bfd06d862be93910734fe3cbbf5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::table_export::export_table_data_core_inner: FunctionTooLong \u2014 dbx_core::data::table_export::export_table_data_core_inner runs 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 554 over it, 6.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d3dda204a56f3d516c13fc437736896f100394f69a37fe4f940a78ed7df072"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DamengAgent: TooManyMethods \u2014 194 methods. The bar is 30 methods; this is 164 over it, 6.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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0253fc080739866d5db5a0e5f8bedd67071a69ace0f2a7ed43471bededa8394"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent_driver.rs: FileTooLong \u2014 3207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 80 free functions. The bar is 500 significant lines; this is 2707 over it, 6.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fedd7f262c93dc234f47cf4aca3a43cf4dee32e8e74a48d6f70470cf929ced"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridActions.useDataGridActions: FunctionTooLong \u2014 useDataGridActions runs 640 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 540 over it, 6.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4359d80d7199fbe6864ba4ac5a4c31294be65dbb3f83b73da81aa6a95dc4550"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.get_or_create_pool_for_session_inner_with_receipt: MethodTooLong \u2014 get_or_create_pool_for_session_inner_with_receipt runs 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 531 over it, 6.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b7dd2508ca33bf76cb9067ece6ecc79e72017ed0ba2db36df3794b7cb8dba6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer_runner::run_transfer: FunctionTooLong \u2014 dbx_core::data::transfer_runner::run_transfer runs 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 520 over it, 6.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa87b91ab4babf264b6b4e50defcf418033327bf3532d04b882a17e0eebfedf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sql.rs: FileTooLong \u2014 3080 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 129 free functions. The bar is 500 significant lines; this is 2580 over it, 6.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e06f6f443a0a2e04d23a725ffcf9768626fcb6c560c676a9c57da13810a350f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DamengAgent: ClassTooLong \u2014 2458 significant lines (blank, comment-only and punctuation-only lines excluded), 194 methods. The bar is 400 significant lines; this is 2058 over it, 6.15\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4026a1f68e00f01ecaab15f1483a3256f87b5511e24b175dbba4a0ea6aaee8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQuickOpen.useQuickOpen: FunctionTooLong \u2014 useQuickOpen runs 610 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 510 over it, 6.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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c11f90ee3901bb2e7419804e1850bbb4285430de5b3c0fe7d10b7c8725362b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppState: TooManyMethods \u2014 182 methods, declared across 2 files: connection/mod.rs (181), connection/parameters.rs (1). The bar is 30 methods; this is 152 over it, 6.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"880e66244d0d944fee927898f9078ac6880fe92b8e9bfc0ff49559e17ab029d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DriversClient.DriversClient: FunctionTooLong \u2014 DriversClient runs 593 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 493 over it, 5.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df2a605f5fa01483a7520c78e2c4e12216c3a91b8ebce6d4b4f301d79a60ca5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stores/settingsStore.ts: FileTooLong \u2014 2945 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2445 over it, 5.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba5fc0e966b72f00184d9a6dcdce3a9f2185dd9699a78f1402db0b9c642a6ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent_service.rs: FileTooLong \u2014 2915 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 162 free functions. The bar is 500 significant lines; this is 2415 over it, 5.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0a26aafe4483e3ded374fca0bf798bb8c88004ddf4836bc917bc9ce886ff43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::schema_diff::generate_schema_sync_sql_inner_with_oracle_ddl: FunctionTooLong \u2014 dbx_sql_schema::schema_diff::generate_schema_sync_sql_inner_with_oracle_ddl runs 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 474 over it, 5.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6688}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ec63697baf3546f74b3766e27854502f5196536000ba7620f27fef36a915d4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NacosOpenApiAdmin: ClassTooLong \u2014 2289 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 66 methods, 3 blocks, lines 167-3436. The bar is 400 significant lines; this is 1889 over it, 5.72\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"73654d2ee85178859671c2388cba475032ffb6165c20e95416f0214783744ca5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useDataGridExport: ClassTooLong \u2014 2228 significant lines (blank, comment-only and punctuation-only lines excluded), 138 methods. The bar is 400 significant lines; this is 1828 over it, 5.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5745a60e9e3eaf7a2cdf382956570e0a4c1f0649c7424226928b23e4e164dc43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridLargeValues.useDataGridLargeValues: FunctionTooLong \u2014 useDataGridLargeValues runs 556 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 456 over it, 5.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac38231037f8347790335bce662a73b4b4ae73d0484119bd50e1bf8cc6801829"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: KafkaAgent: ClassTooLong \u2014 2183 significant lines (blank, comment-only and punctuation-only lines excluded), 140 methods. The bar is 400 significant lines; this is 1783 over it, 5.46\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4360460df2a0de5cd16168cf1e164af56f619688283de2aedc3543b1f93f1184"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OceanBaseOracleAgent: TooManyMethods \u2014 163 methods. The bar is 30 methods; this is 133 over it, 5.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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7de38073819504a1e7c5e15050a940be341bc7bf055a138e9feb49ab089ad0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useExportTracker.useExportTracker: FunctionTooLong \u2014 useExportTracker runs 538 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 438 over it, 5.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2f871a19391073ae267548a4e17d80829e24252ea9364207b7276757517e1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: server.createMockHost: FunctionTooLong \u2014 createMockHost runs 538 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 438 over it, 5.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fdf660c579d0381d7b9110fd81f8a72f1567a9b595c8ee858302cb9f722cff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridSelection.useDataGridSelection: FunctionTooLong \u2014 useDataGridSelection runs 533 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 433 over it, 5.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff9c41d698d71eabaec1552d1c8f33ca35fd0a0ab9a469f264a839156820cf8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MongoAgent: TooManyMethods \u2014 156 methods. The bar is 30 methods; this is 126 over it, 5.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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e550ecd578f2bad5e71c1f06e56229c056963eaee6f16dae039e371c68fd565e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oracle-go/pldebug.go: FileTooLong \u2014 2596 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2096 over it, 5.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c38ccaea211df13df8baeab7ed73871f23e0fec0c2a05e01a2772dae01b4d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dameng/DamengAgent.java: FileTooLong \u2014 2523 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: DamengAgent (68-3633). The bar is 500 significant lines; this is 2023 over it, 5.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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d854694718236a32578ce63bff2b3718a908dbb5fa060558c54a9d1d6d6d85a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::do_execute_typed: FunctionTooLong \u2014 dbx_core::query::do_execute_typed runs 500 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 400 over it, 5.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f5e6e00f4aff58e39413c405b40aac71c927db3ea2ed39a8358998fb5dc3d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useDataGridExport.ts: FileTooLong \u2014 2487 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: useDataGridExport (232-3113). The bar is 500 significant lines; this is 1987 over it, 4.97\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f047452df99cbd6abfc78e0b77785464588bbf8866f93378fac5dac5b46d731"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx::commands::connection::test_connection_with_info_impl: FunctionTooLong \u2014 dbx::commands::connection::test_connection_with_info_impl runs 494 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 394 over it, 4.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/connection.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffc7f7c9a122705379f85741e7c474028425a086395d1f3cc356b3db07235f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: persistence/cloud_sync.rs: FileTooLong \u2014 2456 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 122 free functions. The bar is 500 significant lines; this is 1956 over it, 4.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74621ac3f5d164e842ed2959e7c641ac632eb1817f622447dde740589d29af77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/mongodb_import_export.rs: FileTooLong \u2014 2439 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 109 free functions. The bar is 500 significant lines; this is 1939 over it, 4.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ccf1a70d34b8fa147bc395617260eadc28ebde190d73dcd1fb62a58720c53b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mongo_driver.rs: FileTooLong \u2014 2433 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 180 free functions. The bar is 500 significant lines; this is 1933 over it, 4.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67705b9430eb7ba8a3a0e9e734b89478279b91d3e0d6a62c3e1054fdcad6577b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useDataGridEditor: ClassTooLong \u2014 1944 significant lines (blank, comment-only and punctuation-only lines excluded), 166 methods. The bar is 400 significant lines; this is 1544 over it, 4.86\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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3913cc0ff0ec83dec56f218a36ee84c09de1119b9c399967c5fc974d530132"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/backend.rs: FileTooLong \u2014 2419 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 1919 over it, 4.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edcd7d66b3cb6ff1537a566509ce5043e901fc1d805ff8a34f446e16beaa6a3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MongoAgent: ClassTooLong \u2014 1913 significant lines (blank, comment-only and punctuation-only lines excluded), 156 methods. The bar is 400 significant lines; this is 1513 over it, 4.78\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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fb6a576cc3bc5fadcdfdce2cb10907fb1803bf422d0f40a0623c8817152f62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kingbase-go/kingbase_metadata.go: FileTooLong \u2014 2388 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: server (62 blocks, 277-3372). The bar is 500 significant lines; this is 1888 over it, 4.78\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fcb4cb012d2b10dd00969ab7ffa845f7fd02a5ed75ed8e2be6afa2913cec89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorCompletionMetadata.useQueryEditorCompletionMetadata: FunctionTooLong \u2014 useQueryEditorCompletionMetadata runs 477 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 377 over it, 4.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"219429cbde91257f653fd4f282032baef6a54b25273bfad529854079291adc0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorBatchSelection.useQueryEditorBatchSelection: FunctionTooLong \u2014 useQueryEditorBatchSelection runs 473 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 373 over it, 4.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c05567bd2e3952cce830e71709886d227809c717d0b1c840618b2fee672a133"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: server: ClassTooLong \u2014 1886 significant lines (blank, comment-only and punctuation-only lines excluded), 134 methods, 97 blocks, lines 647-6437. The bar is 400 significant lines; this is 1486 over it, 4.72\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"29af4a9c623e4752773e388626f3c73db566cad81537a938789a456a91c81b79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: KafkaAgent: TooManyMethods \u2014 140 methods. The bar is 30 methods; this is 110 over it, 4.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c28b1e0a9b09fc240ce8def393f766d9a27e00d6eb1add5a57356059be8a721"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorDiagnostics.useQueryEditorDiagnostics: FunctionTooLong \u2014 useQueryEditorDiagnostics runs 461 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 361 over it, 4.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd0f8892053965ad367d302b917a42352fcb418be47671213a7a5f5fc10fc26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/sql_file_import.rs: FileTooLong \u2014 2278 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 60 free functions. The bar is 500 significant lines; this is 1778 over it, 4.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20e6125b56684f8b031d838a7928f12d45b539bb6bfcb83a71a7620a50893af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/connection.rs: FileTooLong \u2014 2239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 90 free functions. The bar is 500 significant lines; this is 1739 over it, 4.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"700756c81233b6203b61c459db2abf1233e7f5b7454f8f5afa50204a527e6645"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridColumnFormatter.useDataGridColumnFormatter: FunctionTooLong \u2014 useDataGridColumnFormatter runs 447 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 347 over it, 4.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"892cd5580814744986a9d989deb2f8f875af18437ec5cd13b5647965caeb3022"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: server: TooManyMethods \u2014 134 methods, declared across 14 files: oracle-go/main.go (96), oracle-go/dbms_output.go (10), oracle-go/trigger_metadata.go (6), oracle-go/native_jobs.go (4), \u002B10 more file(s). The bar is 30 methods; this is 104 over it, 4.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7280b26f14e8752e5be1d942183efaf6d67804507e1e5ca3283a9388074026c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kafka/KafkaAgent.java: FileTooLong \u2014 2216 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: KafkaAgent (42-3160). The bar is 500 significant lines; this is 1716 over it, 4.43\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"149d568c2292e19a8244042796fec20412c2b7569b8db9be99cc436de093ee41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDialogSources.useDialogSources: FunctionTooLong \u2014 useDialogSources runs 443 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 343 over it, 4.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"345e04d054f4956c83920048e8d9b8e4bef28c24205f35aa5bbcb30442829561"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 128 free functions. The bar is 500 significant lines; this is 1705 over it, 4.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb33a8c55e58588aca4bb0b901311cf9c03815e2f51845768f116a79e4b5d19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useDataGridEditor.ts: FileTooLong \u2014 2200 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: useDataGridEditor (394-3077). The bar is 500 significant lines; this is 1700 over it, 4.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3dccd889e7ec900d885b3b48723cbb3c15a7b0d98602dc1f155fe8718b0be3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentDriverClient: TooManyMethods \u2014 131 methods. The bar is 30 methods; this is 101 over it, 4.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b1e04dd6983a1833a2d87efadf622a4a73dff25403e62d3ac9f651e860ba9c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: server: ClassTooLong \u2014 1745 significant lines (blank, comment-only and punctuation-only lines excluded), 89 methods, 82 blocks, lines 663-5470. The bar is 400 significant lines; this is 1345 over it, 4.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77df09588f8049d2663996512556a2f96428b798054ad2770e97d18bb0ee9bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 62 free functions. The bar is 500 significant lines; this is 1671 over it, 4.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc618d6d48930087fd472acc702a72046af3d68fbc5c3c9784faee4fa914c960"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::native_job_changes::transitions::native_job_scheduler_edit_plan: FunctionTooLong \u2014 dbx_sql_schema::native_job_changes::transitions::native_job_scheduler_edit_plan runs 423 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 323 over it, 4.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/transitions.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"641e572564ad8b510d52b8ce13243fe4b7f77ec2e1c8465d9d3300f4264f85ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/database.ts: FileTooLong \u2014 2107 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1607 over it, 4.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65ceab915374f4b171c6277f2e3824f2d3eb1786d0f35f659bf0c0f8e45ff22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oceanbaseoracle/OceanBaseOracleAgent.java: FileTooLong \u2014 2089 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1589 over it, 4.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee2b578bfe3abfe4e0b5fa776069855ea28c7c7cbf07a88eecd6c74187865b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridColumnLayout.useDataGridColumnLayout: FunctionTooLong \u2014 useDataGridColumnLayout runs 417 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 317 over it, 4.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"274c6c3b2f22a25a71c3fd6e48dbf10c2ff5daa3950fd954fd2dfbee1f506e8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::ai::agent_loop::run_agent_loop_inner: FunctionTooLong \u2014 dbx_core::ai::agent_loop::run_agent_loop_inner runs 417 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 317 over it, 4.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_loop.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"deba03d1d54b9eae3e55a3e46de7c5b26e036281cc226715aff793e3881e760a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useAppUpdater.useAppUpdater: FunctionTooLong \u2014 useAppUpdater runs 413 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 313 over it, 4.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"256827058be43cc02ee0096ca8ceaa21900840aaff8398d135a2b5e8a6fecb2d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PlDebugSession: ClassTooLong \u2014 1648 significant lines (blank, comment-only and punctuation-only lines excluded), 120 methods. The bar is 400 significant lines; this is 1248 over it, 4.12\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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c6dc62246e33799f5bd223ec08f26306852d10e1f89e0ca1fadc5ff8de8a52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/query_result_sql.rs: FileTooLong \u2014 2035 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 132 free functions. The bar is 500 significant lines; this is 1535 over it, 4.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9027528ec2f2038e250e52e4cf76c972deb428b29c5ec19ee18f77cade28edb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx::commands::connection::connect_db_inner: FunctionTooLong \u2014 dbx::commands::connection::connect_db_inner runs 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 307 over it, 4.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/connection.rs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e2e6887d704010b525f185300bf366988468cb665cd1ef8025aa8b55ee9574"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/sqlStatementRanges.ts: FileTooLong \u2014 2030 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1530 over it, 4.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28831d758cdc4410722b845d70678dc2ed02e20e52f35a1bdefa8781d2ced3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mongodb/MongoAgent.java: FileTooLong \u2014 2012 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: MongoAgent (102-2907). The bar is 500 significant lines; this is 1512 over it, 4.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3458aab0a28aa8ea3774fe5c2dfbf99b09aea7517bc3087c530a39a80d9f6997"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebBackend.execute_mongo_command: MethodTooLong \u2014 execute_mongo_command runs 402 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 302 over it, 4.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5dbd6e91a16037de781e2210a39e5c08e4134ee4643cfe14248727742278fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlDebugSession: TooManyMethods \u2014 120 methods. The bar is 30 methods; this is 90 over it, 4.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fddd4301919d3b05a5d258a66bd8cc66c2d770ccf8abafd27222680209e42d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queryEditorSqlExtensions.configureQueryEditorSqlExtensions: FunctionTooLong \u2014 configureQueryEditorSqlExtensions runs 398 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 298 over it, 3.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a528f6a4846e6faf81e00e2ae473d403f463aaa7c73e41e5cf39eeaa81b15fe5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JdbcConnectionPoolRegistry: ClassTooLong \u2014 1576 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 1176 over it, 3.94\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":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"478b29414601499f301902c0261507bea3a29361a78a99e1c7ef3c23ea4cf9b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/table_export.rs: FileTooLong \u2014 1944 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 1444 over it, 3.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df728564dd36f2393fe1a08443e90802b96fa43b727306631687ead86cc3bef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeMappingMatrix.build_rules: MethodTooLong \u2014 build_rules runs 386 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 286 over it, 3.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae117677de5b3a6d805436b99134e1a87e758daf40918bacc557344337549053"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSidebarConnectionMutationRuntime.useSidebarConnectionMutationRuntime: FunctionTooLong \u2014 useSidebarConnectionMutationRuntime runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8188ca9a0b73079f351db634c93aa052c41e14270e89092374370c19859500d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/query_result_export.rs: FileTooLong \u2014 1892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 1392 over it, 3.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b253de477b57589a83d5b6c7c222be0cbf1f7bd64be371340a25110353620c3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: canvasDataGridRenderer.drawCanvasDataGrid: FunctionTooLong \u2014 drawCanvasDataGrid runs 378 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 278 over it, 3.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b9c73cfbc18e29aaca4ea36292067616ace14e379219dc6534af033d3ebc37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSidebarDataOpenRuntime.useSidebarDataOpenRuntime: FunctionTooLong \u2014 useSidebarDataOpenRuntime runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDataOpenRuntime.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df8dfa7a3c4e3dc9799c62e7f9a97b834092b7f87ed799852e0a2b0ccbf0b96"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridExtractor.useDataGridExtractor: FunctionTooLong \u2014 useDataGridExtractor runs 373 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 273 over it, 3.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79433c16b4ab082d31c41347cac9e33ab5eadbcb9478ff8c45d1095903ed284"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSidebarDataOpenRuntime.useSidebarDataOpenRuntime.openData: FunctionTooLong \u2014 useSidebarDataOpenRuntime.openData runs 371 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 271 over it, 3.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDataOpenRuntime.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae6e909105a1e1927802926d33ca966243c19a5ab684d035ccf9fd094903de7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::list_tables_once: FunctionTooLong \u2014 dbx_core::schema::list_tables_once runs 370 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 270 over it, 3.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"75adbbba6796b1089b8cbbdd8f5297216eb8d7dd73b6e62a9a10227cda5de855"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: settingsStore.normalizeEditorSettings: FunctionTooLong \u2014 normalizeEditorSettings runs 369 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 269 over it, 3.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6ccc0765fd10bffa133def4afebbd52ea5668a41ddfa4bd2439036e62084af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DialectCapabilityDescriptor.for_dialect: MethodTooLong \u2014 for_dialect runs 366 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 266 over it, 3.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"469d759e5baf5de80b9f15b1e20bebabad7fd9b00c253ed6c69a7785a724869d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mongo/mongoCompletion.ts: FileTooLong \u2014 1751 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1251 over it, 3.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f95e40024d7de0ccebae102e15088ad9957a368a28c73c8634616c03e256fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSidebarTableMutationRuntime.useSidebarTableMutationRuntime: FunctionTooLong \u2014 useSidebarTableMutationRuntime runs 350 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 250 over it, 3.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTableMutationRuntime.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbce5910253296a0d2dcb51ee1efab667ab2151245171d2edb7681128e51af0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/object_source_sql.rs: FileTooLong \u2014 1719 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 100 free functions. The bar is 500 significant lines; this is 1219 over it, 3.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"768e1da8a1169c60af80bd789ca28240a74f86914399ce583f1b1664d63ff873"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::query_result_export::export_query_result_core_inner: FunctionTooLong \u2014 dbx_core::data::query_result_export::export_query_result_core_inner runs 341 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 241 over it, 3.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e820be38d78e20bdc1c8b45b4e33c94ea2452fd905e4a1a0bfbfd5fe426c360d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::table_export::try_export_native_table_stream: FunctionTooLong \u2014 dbx_core::data::table_export::try_export_native_table_stream runs 339 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 239 over it, 3.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e490f6a2d780404d4d01fe4a3f6b0dc0337bf883c02bb9c2042cb8704702d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/mcp_bridge.rs: FileTooLong \u2014 1694 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 82 free functions. The bar is 500 significant lines; this is 1194 over it, 3.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea3c4ae32959cb88a9603388d9f505abb3d0065fcc0a7e2702d2751c04b8136"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oceanbaseoracle/PlDebugSession.java: FileTooLong \u2014 1679 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: PlDebugSession (52-2518). The bar is 500 significant lines; this is 1179 over it, 3.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6795341663bead3f16b7f8f583ebae66300b1d7ca016155fa3b8e802243e8d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonRpcServer.dispatch: MethodTooLong \u2014 dispatch runs 335 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 235 over it, 3.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9886f9386ff8d2c25a229b3e0a9be27e013080875a1c364cd6c82e2f166684e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_mongodb::mongo_shell::parse: FunctionTooLong \u2014 dbx_driver_mongodb::mongo_shell::parse runs 328 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 228 over it, 3.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eaade008beaba3a6e1fc06c861d116bc05708b4121e2310c2b8792788f16523"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::create_table::build_create_table_sql_impl: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::create_table::build_create_table_sql_impl runs 327 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 227 over it, 3.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/create_table.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c0cf1a8fbf8b8aedf48fe3f6db25cbf8d644c12cee11427e0ec69bddd3bad4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/data_compare.rs: FileTooLong \u2014 1634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 60 free functions. The bar is 500 significant lines; this is 1134 over it, 3.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2640a4f9e64ab9a406e5fe2d52551cac52a486379b77e13652bd9671d807f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: server: TooManyMethods \u2014 98 methods, declared across 3 files: kingbase-go/kingbase_metadata.go (62), kingbase-go/main.go (29), kingbase-go/routine_metadata.go (7). The bar is 30 methods; this is 68 over it, 3.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0636f5b18729883d6dbcf01a2e99552d0bc8ae4350a776495c030d6a4418c4a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useQueryEditorCompletion: ClassTooLong \u2014 1304 significant lines (blank, comment-only and punctuation-only lines excluded), 56 methods. The bar is 400 significant lines; this is 904 over it, 3.26\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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efc4c8d1c769882caeb07fd96880ca77c9cc616d8494505a7e52d05aa88711b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginHostBridge.dispatch: MethodTooLong \u2014 dispatch runs 326 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 226 over it, 3.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"efff9ff6b96e6c1fd1dc4163a017806a4d7703777eb0e31e83539865399b42b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DbxMcpServer: TooManyMethods \u2014 97 methods. The bar is 30 methods; this is 67 over it, 3.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7b6c0c717d5ff8821d31df546b198777fffb57e2e2b7dfa785114b803af527"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/JdbcConnectionPoolRegistry.java: FileTooLong \u2014 1614 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: JdbcConnectionPoolRegistry (42-2228). The bar is 500 significant lines; this is 1114 over it, 3.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce26dd9e247f4e583c9e1c4df2636cf856037e4e627b25062d3242f3b656acf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kingbase-go/main.go: FileTooLong \u2014 1614 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1114 over it, 3.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad3688762f3827f0a7919220ec1f74bdc09ede2967b046a4c9579936f8adadc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataGrid/dataGenerate.ts: FileTooLong \u2014 1612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1112 over it, 3.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cc92a9228ce01254538237cebfc0eabaf516decd973e525bbe1bd2fe8be1e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stores/plDebugStore.ts: FileTooLong \u2014 1587 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1087 over it, 3.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ec26a077a04c256a8d28d0e295f6cc742d40cb40d3c618811f7cf7a1eac595"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/sqlite.rs: FileTooLong \u2014 1580 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 85 free functions. The bar is 500 significant lines; this is 1080 over it, 3.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a16294bcf2fc4d2b197dcd8b4b40862af9f81ba26c95bef9a7ade65b1efb5e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentDriverClient: ClassTooLong \u2014 1256 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 131 methods, 4 blocks, lines 1165-4397. The bar is 400 significant lines; this is 856 over it, 3.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9624b552bd2244ffd99194f9da4dd72e1564c58543f984bc7e507fb11aa11b60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/ssh_tunnel.rs: FileTooLong \u2014 1570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 1070 over it, 3.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee8680fb51589094e7e335fbaf27e8247b5a0b4b877bfb0c40d7a1ac2442f5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridColumnLayout.useDataGridColumnLayoutState: FunctionTooLong \u2014 useDataGridColumnLayoutState runs 314 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 214 over it, 3.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"939a10fcdf7a61117286e5ac28bb88a40382de5903aa21407335f7a8855b53e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/connection.rs: FileTooLong \u2014 1559 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 57 free functions. The bar is 500 significant lines; this is 1059 over it, 3.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80295368fff0fe093dc14ae9911e03e5ce9377cf3a2c11b4fb393ae67f1c5fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sql_analysis.rs: FileTooLong \u2014 1541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 52 free functions. The bar is 500 significant lines; this is 1041 over it, 3.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6b46d501610d1546c254aa95cb1b063971d8e931323eb76d5cc8f666de4935"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridColumnFilters.useDataGridColumnFilters: FunctionTooLong \u2014 useDataGridColumnFilters runs 307 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 207 over it, 3.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnFilters.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d49935bdaac66923ab09a47630310870237a0c7cd3ffb4de10f72e1f0ad9146"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PlDebugTarget: ClassTooLong \u2014 1219 significant lines (blank, comment-only and punctuation-only lines excluded), 60 methods. The bar is 400 significant lines; this is 819 over it, 3.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"73de8e55a2e47231ccee4013c4ab2f7fad8a136a30b44c19e80025cc4f2aa2d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mongo/mongoShellCommand.ts: FileTooLong \u2014 1523 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1023 over it, 3.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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e86757d8227b9f0d586d78c180a329291a54a64200cb9a480eb247d13d99ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/sqlParameters.ts: FileTooLong \u2014 1519 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1019 over it, 3.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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b011fdfeb9cabac6bfd88d2a5662e56ef23516f90413a4684e6658acb603cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: plDebugNativePlan.render: MethodTooLong \u2014 render runs 298 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 198 over it, 2.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6746ccfa242d1d932d116a65d43a4d3d3ba0dc3fa59d2c8284bb9878341f2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: settingsStore.useSettingsStore.applyEditorSettingsPatch: FunctionTooLong \u2014 useSettingsStore.applyEditorSettingsPatch runs 298 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 198 over it, 2.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"74376ed1e37b900efdefe317845d421fd084bc55c33e0f09403ccc526bb167c7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: server: TooManyMethods \u2014 89 methods, declared across 3 files: xugu/main.go (81), xugu/type_members.go (6), xugu/package_members.go (2). The bar is 30 methods; this is 59 over it, 2.97\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c388f4c6b5ccd695802834d5bce1bdaf0ee2305bba51bb607863b507be193f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: KvPrometheusMetrics: TooManyFields \u2014 89 stored fields. The bar is 30 stored fields; this is 59 over it, 2.97\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"25483e4b8c732a0619a4a0cedc96814a2c9017299e8e8d7412b52a7af5164291"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object_source_sql/oracle_indexes.rs: FileTooLong \u2014 1472 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 972 over it, 2.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b32336312db82cc50044292bab7aab4774990a4271da12f6d81b9e1cf23dd53"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queryStore.useQueryStore.explainTabSql: FunctionTooLong \u2014 useQueryStore.explainTabSql runs 294 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 194 over it, 2.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96f9747646f47bd78917768e03e6034759d7cb503709d9f25b88c10e6a77c81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/meilisearch_driver.rs: FileTooLong \u2014 1468 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 74 free functions. The bar is 500 significant lines; this is 968 over it, 2.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/meilisearch_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ca0dae335df89db899aedd858524a72fa27fc28804080e39bd84ae6d6f772f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.plDebugSelectNativeTarget: FunctionTooLong \u2014 plDebugSelectNativeTarget runs 293 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"db145ff537010c40dae998f5b7f66d46703170d13e07c769495615dfaea73cc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/manifest.rs: FileTooLong \u2014 1445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 945 over it, 2.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5c0448e37364f229c10ad902e4f6b5f70a7dcd55e7f2f254743b82f7f599d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::schema_diff::diff_schema: FunctionTooLong \u2014 dbx_sql_schema::schema_diff::diff_schema runs 289 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 189 over it, 2.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7723e3d0b4213b8248fb1d1222c0cec2581d8a0c99639dd1ad54109445a8174"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/useQueryEditorCompletion.ts: FileTooLong \u2014 1439 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: useQueryEditorCompletion (175-2044). The bar is 500 significant lines; this is 939 over it, 2.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce16e9dc4e5f3d6efc342d4f3abe75a888f13402d77f0246fb040073503ad7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::transfer_postgres_schema_objects: FunctionTooLong \u2014 dbx_core::data::transfer::transfer_postgres_schema_objects runs 287 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 187 over it, 2.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14830}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e51a19f26b973ec85f53365506f590b69ef4c72e8fc5f9479b76073f94f8fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/pl_debug.rs: FileTooLong \u2014 1417 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 917 over it, 2.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d235d2a88e331fce089bb148473eefdcc1bae1a967a9b101526fcf738123d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Gbase8sAgent: TooManyMethods \u2014 85 methods. The bar is 30 methods; this is 55 over it, 2.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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b30cdd855b948e57a4d5cdc325945db146dddb9057bc1b4a3926ae16aa7dbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorObjectNavigation.useQueryEditorObjectNavigation: FunctionTooLong \u2014 useQueryEditorObjectNavigation runs 283 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 183 over it, 2.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ad8761ab699d6cef960aca5fc177b51aca86be4bc8cea067e981e89fca4e8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PluginDetailClient.PluginDetailClient: FunctionTooLong \u2014 PluginDetailClient runs 283 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 183 over it, 2.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/plugins/[id]/PluginDetailClient.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a4f273169241fbfb6fdea83645a8bca99a893a281cd837ebce2bf4c89ac512"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ai/agent_kv.rs: FileTooLong \u2014 1413 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 71 free functions. The bar is 500 significant lines; this is 913 over it, 2.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dfce4b11e1f4101f1f731b5fe927b6a10131d17de6943acc1cc0f542823fb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mongo_shell.rs: FileTooLong \u2014 1406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 57 free functions. The bar is 500 significant lines; this is 906 over it, 2.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad67931feb4cb82da9a23cbe9fee3a82415fef53e6cb5e69d9aab44d998d007"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::dialect::capabilities_for: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::dialect::capabilities_for runs 281 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 181 over it, 2.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/dialect.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb150519f0f89fed6529d5b20a6c4d8f51ecb7e26018cabed65237d77b1931fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 1398 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 898 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"119c375ea0e0135786c10caa55decf02a3992351edbebc90c669c8b29313b538"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_core::object_source_sql::oracle_indexes::split_oracle_table_ddl_with_retained: FunctionTooLong \u2014 dbx_sql_core::object_source_sql::oracle_indexes::split_oracle_table_ddl_with_retained runs 279 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 179 over it, 2.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfbbeb4b4b127366632b468e630ee54c5230a65e4143a4fd99f96958e814d3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::persistence::cloud_sync::apply_sync_snapshot_with_selection: FunctionTooLong \u2014 dbx_core::persistence::cloud_sync::apply_sync_snapshot_with_selection runs 277 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 177 over it, 2.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"34068d6df54ca66bd228346f2f4a9a9032aa34441b59fbc396d0d4429a799ae8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queryEditorCodeMirrorRuntime.createQueryEditorCodeMirrorRuntime: FunctionTooLong \u2014 createQueryEditorCodeMirrorRuntime runs 272 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 172 over it, 2.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorCodeMirrorRuntime.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fddd85b6fa4218aac487ef9ca52f1f7f8e3927bd301a13d43903bfa4dd43ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridEditor.useDataGridEditor.saveChanges: FunctionTooLong \u2014 useDataGridEditor.saveChanges runs 272 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 172 over it, 2.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c681687e6487654367b3829728b44a9bd269e17f91c64f87bab11fbdf620c345"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useCellDetailEditor.useCellDetailEditor: FunctionTooLong \u2014 useCellDetailEditor runs 271 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 171 over it, 2.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useCellDetailEditor.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"968102bf9dbbeea0c5f755585f1c7210634679ef93cac47b94dff03914357e79"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::columns::build_column_sql: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::columns::build_column_sql runs 271 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 171 over it, 2.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/columns.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"048e712c711ab911391214c3cfacc612affbfd76cc097975bcd5717fc2fe59dd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: plDebugSession: ClassTooLong \u2014 1073 significant lines (blank, comment-only and punctuation-only lines excluded), 63 methods, 58 blocks, lines 831-5740. The bar is 400 significant lines; this is 673 over it, 2.68\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":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e17db25c285879cc23c4e40beb81a38b43b6509ca61e7293b9050b24c693075"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::sql_file_import::execute_sql_file_paths_inner: FunctionTooLong \u2014 dbx_core::data::sql_file_import::execute_sql_file_paths_inner runs 262 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 162 over it, 2.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9d025ea6784ac44b292ff78c5be32f26d4e75cff469dc37e63f433f8bb9315"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pluginHostBridge.pluginSdkSource: FunctionTooLong \u2014 pluginSdkSource runs 261 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f7d87eda0434b75a006dfc99294792604fa3aec344d6deb588fe1c1898f82d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AbstractJdbcAgent: TooManyMethods \u2014 78 methods. The bar is 30 methods; this is 48 over it, 2.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0477ac1382ae4061441d349a4932101910dc9aba4fba86b85875e5d7072816e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlStatementRanges.splitSqlStatementRanges: FunctionTooLong \u2014 splitSqlStatementRanges runs 259 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"7603ad4fed73881b4cd726c2da19e79cbe2ebfe129fd89fc11113c47069a731b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DbxMcpServer.execute_query: MethodTooLong \u2014 execute_query runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc4952792321b356a5f8b7f06cfdf97547ee8c478b61e0224f21a1720cc6986"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WebBackend: ClassTooLong \u2014 1027 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 4 blocks, lines 615-2855. The bar is 400 significant lines; this is 627 over it, 2.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eead84760233fe91c49114adbcb40569bc98f258400c5ecb2271dff1e4fc0d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JdbcExecutor: TooManyMethods \u2014 77 methods. The bar is 30 methods; this is 47 over it, 2.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f362a14d4ab441e6e08299965206f9baf40b2d2660a726e7276791a788025f5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlStatementSplitter.push_chunk_with_control: MethodTooLong \u2014 push_chunk_with_control runs 256 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 156 over it, 2.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"3174a87a1195dd753f82ce8395be69e838e22a1a82c1a9c0deb9f21a072b7614"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.LandingPage: FunctionTooLong \u2014 LandingPage runs 256 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 156 over it, 2.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/page.tsx"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9bce83d3c6c64bb6d2818ff4a3f2466f7dd459aa379edc0a77dccfd1da411c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.remove_stale_connection_pool: MethodTooLong \u2014 remove_stale_connection_pool runs 255 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 155 over it, 2.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":5555}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8e973f38339f8a8dcd166604cb2f297c7ecf932390038bec2d2a74e4a2e8e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 1267 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 767 over it, 2.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"295dd5a0449bcf6c0698a7fafdf9f1f4e2ee3d3e890b20658c0de055a7807f6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/dynamodb_driver.rs: FileTooLong \u2014 1265 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 765 over it, 2.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ddd997a8870b7f6d66921fe1f1776c09d5d9d5733ffa31fb164b78b150367e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/mq.rs: FileTooLong \u2014 1264 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 77 free functions. The bar is 500 significant lines; this is 764 over it, 2.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f11ff13882e4689ce28906138edbbc7b1e3b646dd051521097ec7baa82681f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/pluginHostBridge.ts: FileTooLong \u2014 1262 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 762 over it, 2.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dcdac64fa806d5ffc94ee6b28e5a9dee46b44d495feafe0da2a401e5b5993d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DbxMcpServer.execute_batch_request: MethodTooLong \u2014 execute_batch_request runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"577cdf6d07e61b45bc94de5c6c741e221d926194dae608e94ed21d9ea371701b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/mongo_ops.rs: FileTooLong \u2014 1250 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 54 free functions. The bar is 500 significant lines; this is 750 over it, 2.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b0a24b92036a25d7fd4021aeae34d0c88cf6d9d31fdec1e36df7d730a7e810"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::list_objects_once: FunctionTooLong \u2014 dbx_core::schema::list_objects_once runs 250 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 150 over it, 2.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8934}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5fce20e77b8e48210f7644ff08d11feac64d9815b1d3c03cb76ac2c423f6d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oceanbaseoracle/PlDebugTarget.java: FileTooLong \u2014 1247 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: PlDebugTarget (33-1535). The bar is 500 significant lines; this is 747 over it, 2.49\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"819c54ece59c82a8d69709d8fee218d031cdfd3a31816a643011d98edc0442bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/query.rs: FileTooLong \u2014 1228 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 97 free functions. The bar is 500 significant lines; this is 728 over it, 2.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"314e99b4c3f5d6a991e040cbb317ee0edae7c10fbe415953fb726dbabb7591c9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JdbcExecutor: ClassTooLong \u2014 980 significant lines (blank, comment-only and punctuation-only lines excluded), 77 methods. The bar is 400 significant lines; this is 580 over it, 2.45\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":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9b1d4833bf25670a8e26f320c39732c5629100962c2947eb82fae0344337d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::transfer_mongodb_table: FunctionTooLong \u2014 dbx_core::data::transfer::transfer_mongodb_table runs 245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 145 over it, 2.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":11933}}}],"partialFingerprints":{"codehealthFindingId/v1":"72297d8ed4eabc8889f8e987baf4f6fab6aa73a7d0736b34d989d705308c7b98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 68 free functions. The bar is 500 significant lines; this is 723 over it, 2.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/cli/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a478ae70e6392f7b0f1215b1a0eb191146a14a5f5156b5080ac44eec85ce7e29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::get_columns_core_for_session_inner_with_pool: FunctionTooLong \u2014 dbx_core::schema::get_columns_core_for_session_inner_with_pool runs 244 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":9821}}}],"partialFingerprints":{"codehealthFindingId/v1":"83561af51cac1ac91ebaf4864cd8b0f2f379d493bbba3c1fbd8d9e620eb7503a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_jobs/operations.rs: FileTooLong \u2014 1218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 718 over it, 2.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daec41e80f4340c0bc1a852f54d35d08716e87bf11d0668ff898827eab4c552c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Gbase8sAgent: ClassTooLong \u2014 973 significant lines (blank, comment-only and punctuation-only lines excluded), 85 methods. The bar is 400 significant lines; this is 573 over it, 2.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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a49e05a9d86bdb67e93286d84799069cecaa20e02e3612d7f75a6cb811c3065"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: IssueSubmissionClient.IssueSubmissionClient: FunctionTooLong \u2014 IssueSubmissionClient runs 243 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/issues/IssueSubmissionClient.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a453b1eb4851cd3404ccdebad5e81ae345eaf58ea4c2f76721fcc0cb63b7c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ai/agent_tools.rs: FileTooLong \u2014 1211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 711 over it, 2.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d329766427ee79ecf6c65f663d5d1dd08a7f14e34c8f5634fd4ff9cebdda457"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: transferTaskStore.useTransferTaskStore: FunctionTooLong \u2014 useTransferTaskStore runs 242 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"15670980d1f73357668d40940f0349088fa04a6c2b370727e99677773ff8d8f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/tableStructureEditorState.ts: FileTooLong \u2014 1209 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 709 over it, 2.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcbda4e40f4fdb2614d451e6683bbb2d7facdcac1edd55936daa232981557ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ConnectionConfig: TooManyFields \u2014 72 stored fields beside 38 methods. The bar is 30 stored fields; this is 42 over it, 2.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"acadfed50f7dea84bc2664d05d756b6add4beacdede73266a071235604d087d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ConnectionConfigData: TooManyFields \u2014 72 stored fields. The bar is 30 stored fields; this is 42 over it, 2.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3d80d8f720e339e2de31010c85e90a9b30d34f840eefba5704cfe9cfcedb0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/consul.rs: FileTooLong \u2014 1199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 103 free functions. The bar is 500 significant lines; this is 699 over it, 2.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a89a0c586de82a4d0443ab8241e84d4baf308c048874d02b94aa67a3dcc636b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/api.ts: FileTooLong \u2014 1194 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 694 over it, 2.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b66fa03fff3954a8f976040c8ee6769742b6433067ce38d2b642c989fe29ed1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqlServerLegacyAgent: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc8da5947256f1357ec3129823fba50e9319706c71466c76d75ddffb44390dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorObjectNavigation.useQueryEditorObjectNavigation.onEditorMouseDown: FunctionTooLong \u2014 useQueryEditorObjectNavigation.onEditorMouseDown runs 236 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff9344eef0f155be7fefd1f70c8ea35c14ef6afa1299129fecafca5bd492739"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useNavigationTargets.openTableTarget: FunctionTooLong \u2014 openTableTarget runs 236 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2816dc8d1805d97efe3fcc7f432c168e222f6fe73c7209ae0539a6fc2303eab3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSqlExecution.useSqlExecution.executeTargetSql: FunctionTooLong \u2014 useSqlExecution.executeTargetSql runs 236 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"be422772be371d7c59bdc2c585201482ab126eb39de6df43d44e87f30087e000"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::oracle_routines::plan::build_plan_with_tables: FunctionTooLong \u2014 dbx_core::schema::oracle_routines::plan::build_plan_with_tables runs 236 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8b0f385097b1d4df0fedb0e4d6b0d478d113d117545fbb8b8d4d0c4baab341"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridColumnResize.useDataGridColumnResize: FunctionTooLong \u2014 useDataGridColumnResize runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnResize.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af8342dcbabd17f4b5c271d6116eb383e4c24cc8d1bdd9dfea953a655b1b30d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::query_result_export::try_export_mysql_query_result_stream: FunctionTooLong \u2014 dbx_core::data::query_result_export::try_export_mysql_query_result_stream runs 233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04c00457df2e931220f6452bfc2d15571a485e0dee138e167bf027c9d77752e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BackupService.export_job: MethodTooLong \u2014 export_job runs 233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/engine.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca99eedc6cf29c3404526d39c5b8be85ef5ec84979180212fd0ca01b762220a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/mcp.rs: FileTooLong \u2014 1162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 102 free functions. The bar is 500 significant lines; this is 662 over it, 2.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7eaef876e3dc834b924b0edafc9883b6f5fd60fa9372c43d654f6c49588b6a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ai/agent_loop.rs: FileTooLong \u2014 1159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 659 over it, 2.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eab42f905dba8fb284ba9a567b98ddfc3ba6cb1dbea37e0e9a6e22777370c92"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tableStructureEditorState.mysqlEnumDataType: FunctionTooLong \u2014 mysqlEnumDataType runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc2a3f06b39528acefe2c78f8c3769faaca85bfe09cb17f0bb65fb407980550"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridTableMetadataLoaders.useDataGridTableMetadataLoaders: FunctionTooLong \u2014 useDataGridTableMetadataLoaders runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridTableMetadataLoaders.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5cb0be4085e62f10c6a445ba1c7a45bc25d78f8441f35d6a8d1e81531c4083"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_formats::text_export::format_html: FunctionTooLong \u2014 dbx_formats::text_export::format_html runs 229 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/text_export.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0d17cc85e322b073501bd5c8ed76c0aa3a7f6a3865e8fe2bc5ef6464f2661c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useSidebarDatabaseSpecificMutationRuntime: ClassTooLong \u2014 913 significant lines (blank, comment-only and punctuation-only lines excluded), 91 methods. The bar is 400 significant lines; this is 513 over it, 2.28\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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf12cd317b23b124c54dd30f031374a69a266f1f7697ddeb56de91f78ac7ca5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorDocumentState.useQueryEditorDocumentState: FunctionTooLong \u2014 useQueryEditorDocumentState runs 228 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 128 over it, 2.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDocumentState.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"481ba547d3b8d736b4c480d75ffaece8c200e8c38295a5ea31d61cf0c66146c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::rename_tables_to_backup: FunctionTooLong \u2014 dbx_core::data::transfer::rename_tables_to_backup runs 228 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 128 over it, 2.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":12689}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e73531c70bed905e6fd720c954a7b6d8b73c048b190ab4ea20120f675c4474"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mqtt/client.rs: FileTooLong \u2014 1136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 636 over it, 2.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb375a805e4e81e4413f2ec950bf890e00da2a45c7dabd0f86fe90d7cdec8da3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: server: TooManyMethods \u2014 68 methods, declared across 4 files: vastbase-go/vastbase_metadata.go (41), vastbase-go/main.go (22), vastbase-go/connection_state.go (3), vastbase-go/runtime_pool.go (2). The bar is 30 methods; this is 38 over it, 2.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"73229c846192291865c62cf0b1a78960fc2f58eb35f0430989006c6d72fcca23"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DialectYaml.from_descriptor_with_caps: MethodTooLong \u2014 from_descriptor_with_caps runs 224 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/dialect_yaml.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"479c8feadf7b04f9e6eced7e18d75d68a828afbe3519884029cbce37b47337e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vastbase-go/main.go: FileTooLong \u2014 1116 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 616 over it, 2.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e0daa03caeec2986024b23beea51295f221b514c33b7c38b09d03c18bbb289"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorCompletion.useQueryEditorCompletion.performAsyncCompletionWithResult: FunctionTooLong \u2014 useQueryEditorCompletion.performAsyncCompletionWithResult runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ac44a2d74adf6305d416eea54553e366bc6f59c621126c08f897f0e691a267"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_plugin_runtime::plugins::manifest::validate_contributions: FunctionTooLong \u2014 dbx_plugin_runtime::plugins::manifest::validate_contributions runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e8b601351849de096f39304562b45094dd144d07207f737b9a1d25a219d7e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: plDebugNativeEntry.mutateNativeBreakpoint: MethodTooLong \u2014 mutateNativeBreakpoint runs 222 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 122 over it, 2.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint_write.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88e2543cdcfb555613fb9bb4fe507956e97743182722580f59f596b4f503d37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/navicat_nb3.rs: FileTooLong \u2014 1109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 609 over it, 2.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/navicat_nb3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4371b3437245e1c7eb6812ab4fb4ba4dbb0311ee4589a4981791f3f0e903536"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorHover.useQueryEditorHover: FunctionTooLong \u2014 useQueryEditorHover runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.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":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e31886f9da448b64c56ed3b65400bb85a1e9de70c84d5ffff9594d8f37640c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/redis_ops.rs: FileTooLong \u2014 1104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 604 over it, 2.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f570dbad0d445349a00eed41f0170e61b46365f12a48daf7853c898d8ce6ebed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConsulClient: TooManyMethods \u2014 66 methods, declared across 9 files: consul/agent.rs (17), consul/client.rs (17), consul/kv.rs (10), consul/session.rs (8), \u002B5 more file(s). The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/client.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"937e646e3b3aae3727128403a82711f6b866f55b15a92a66f952fa075258a7fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NacosOpenApiAdmin: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7969b72ca5bbf289c5491a945ea9a122be731e295c3a5095a235c06761b8725d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: plDebugNativeEntry: TooManyFields \u2014 66 stored fields beside 45 methods. The bar is 30 stored fields; this is 36 over it, 2.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5737e00974135ccef79a63d69f3dda2adda91e38c260a7aa8d80ada118d430f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorCompletion.useQueryEditorCompletion.provideSqlCompletions: FunctionTooLong \u2014 useQueryEditorCompletion.provideSqlCompletions runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ca5c07ce367185b18e21d051f385fa9827dd0893a05041928b70552029e77c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::render_postgres_table_ddl_with_constraints_and_partition_info: FunctionTooLong \u2014 dbx_core::schema::render_postgres_table_ddl_with_constraints_and_partition_info runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":18743}}}],"partialFingerprints":{"codehealthFindingId/v1":"db99e7e417600bd9885c189efec6126badcaf24f95c58587a5e7dc9c7b3c45ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_core::sql::split_sql_statement_ranges_with_options: FunctionTooLong \u2014 dbx_sql_core::sql::split_sql_statement_ranges_with_options runs 219 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 119 over it, 2.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ec8ea4a244226f13a9829e2a941467f7631512157e7f6517d36c183f71ccc8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.refresh_connections: MethodTooLong \u2014 refresh_connections runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":7165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2568b5c7c3dfbc1fd6ad6c54644cc17e688fabde54b885c32cf0569035b68a04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridActions.useDataGridActions.onReloadData: FunctionTooLong \u2014 useDataGridActions.onReloadData runs 217 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d619248ed7e71106e172fe878d694ef61a43199f769814667ac83d7e4963ae1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table_structure_sql/sqlite_rebuild.rs: FileTooLong \u2014 1082 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 582 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f8daeb77c0f29ce597c7c2dc94bc648eb880408c1a0f867f61b0173e5669e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorTextActions.useQueryEditorTextActions: FunctionTooLong \u2014 useQueryEditorTextActions runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorTextActions.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bf6eb605cecd34c8dbe0c462988339f1faa6feb7c1b66c02154557370d2bf1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nacos/types.rs: FileTooLong \u2014 1079 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 579 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51cf48b87bf6e9e645b14c5656b5024f331dd1da1bb2633cbb49d0c36bcf807"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/schema.rs: FileTooLong \u2014 1077 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 65 free functions. The bar is 500 significant lines; this is 577 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d38a4e0469a4f3fa3866086b2f7a7d70cfff3f354c2e1e7c012671d325efd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/schemaDiff.ts: FileTooLong \u2014 1076 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 576 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fa1cf88dcae35ea0e6b9b89dec98c4c4ec5eb2e65fa97203864db3c6c39224"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::execute_in_manual_transaction_with_options: FunctionTooLong \u2014 dbx_core::query::execute_in_manual_transaction_with_options runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":7085}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e98979be388a41228d20c725bd28bff36bb0b653bd37b26aee05878caeff66"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PostgresLikeAgent: ClassTooLong \u2014 855 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 455 over it, 2.14\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"688492992c3142b97fd73f7c32a092690d6e66716fcc786529b232c39bd68274"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Storage.inspect_data_migration_with_error_cache: MethodTooLong \u2014 inspect_data_migration_with_error_cache runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4555958c447a3b7674aced05b6870ee98010bd67e4d94bc83c6513eacbabef5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_drivers::db::ssh_tunnel::connect_and_authenticate: FunctionTooLong \u2014 dbx_drivers::db::ssh_tunnel::connect_and_authenticate runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe330c72630e6439d758f84d2c9a2e6152895265e98c428df20204400dcd429"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::oracle_constraints::build_changes: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::oracle_constraints::build_changes runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd0685e3cbfffccb28f8d4cd13a095d87639512e375229c0bb59f3b7b17dbe0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/query.rs: FileTooLong \u2014 1060 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 102 free functions. The bar is 500 significant lines; this is 560 over it, 2.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d889a66ef010dd982c737f46b3690d6a347c7d390f4eaf29f9cd048b92d51fea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: plDebugSession: TooManyMethods \u2014 63 methods, declared across 2 files: oracle-go/pldebug.go (61), oracle-go/pldebug_native_bridge.go (2). The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c81310335799bcbfa288c65490c0f0a5343bfaca72a3c8cf7b7ab30e94e20e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sidebarLayoutMonitor.createSidebarLayoutMonitor: FunctionTooLong \u2014 createSidebarLayoutMonitor runs 210 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"384fae94589ed191722ceebe683840d3ccf669098169006984edfbe483a425a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/session.go: FileTooLong \u2014 1048 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: Session (56 blocks, 74-1691). The bar is 500 significant lines; this is 548 over it, 2.10\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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9b88fa8828c0dd0d460dede21aeb6f13531a8080f35f82c8c4cb6766f953de"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::native_jobs::operations::dameng::run_steps: FunctionTooLong \u2014 dbx_core::schema::native_jobs::operations::dameng::run_steps runs 208 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daf474529de25f4deff35f9d3fbcc09dba755f534110a9cd7e036770db7d9be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql_dialect/descriptor.rs: FileTooLong \u2014 1037 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 537 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cd48a9a0a75e33f7f347369044f95e1964d9a0297f94ed39022a548a5dddd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useComponentUpdates.useComponentUpdates: FunctionTooLong \u2014 useComponentUpdates runs 207 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useComponentUpdates.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbc39a81eebeb131c2134c61fd431338005ddda6ceb045203032796aaf22de9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IoTDBRpcDataSet: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7f8dde8e3a14505e6ce5c2fe0a049a299f0c761d5faf8ff85b2335d27bd718"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::ddl_plan::prepare_table_ddl: FunctionTooLong \u2014 dbx_core::data::transfer::ddl_plan::prepare_table_ddl runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/ddl_plan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4e6194ee9009c9ed7155441520a8687858980f106796daeabdffc7e5b168ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::get_object_source_once: FunctionTooLong \u2014 dbx_core::schema::get_object_source_once runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":13800}}}],"partialFingerprints":{"codehealthFindingId/v1":"3185bfe65bc40c3c8ae29432a5cc85175bb3cbbf983c28978b4465f97badd9e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useSidebarDatabaseSpecificMutationRuntime.ts: FileTooLong \u2014 1023 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: useSidebarDatabaseSpecificMutationRuntime (117-1363). The bar is 500 significant lines; this is 523 over it, 2.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d67d2a991fc4f61d60a4152bf1c89a2fab58e27ec768181fcbfc38cb95d6f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: plDebugNativeEntry: ClassTooLong \u2014 818 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods, 16 blocks, lines 32-1246. The bar is 400 significant lines; this is 418 over it, 2.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91b8d801c183a0582f914106e79c98605cd4b3c8dcd46f2ab82992be1ed7646"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Session: ClassTooLong \u2014 817 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods, 56 blocks, lines 74-1691. The bar is 400 significant lines; this is 417 over it, 2.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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb1fedf0eacd5625e9541412e718c9fa3500e0f72288a339db3620ee62dc5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rabbitmq/operations.go: FileTooLong \u2014 1019 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: server (34 blocks, 27-1422). The bar is 500 significant lines; this is 519 over it, 2.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ffab1b7ef7d14342e606345d475c6b8a222afc575b98ed1b4967885bebb0ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/connection.rs: FileTooLong \u2014 1018 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 518 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d138b3fdf426354ac64e76058b5eee01425465af28ec31f150d604a397716d30"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentManager: 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":"crates/dbx-driver-agent/src/agent_manager.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"5850114b9e3cc4bd023d13b09f5ab0cc9de539a638cf7ff457d44b7c1a5785f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/db_admin_sql.rs: FileTooLong \u2014 1012 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 57 free functions. The bar is 500 significant lines; this is 512 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/db_admin_sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb32d9da46e79a81b8a5886f23bfb22a307ef019b4632c0164bf72e2c70eea8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridConditionEditor.useDataGridConditionEditor: FunctionTooLong \u2014 useDataGridConditionEditor runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d655f6ade9da3b2be9b8df8ec9e5972ae595acd288d76fa41e4432f001e252f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gbase8s/Gbase8sAgent.java: FileTooLong \u2014 1006 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: Gbase8sAgent (36-1498). The bar is 500 significant lines; this is 506 over it, 2.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3400e7ca555e36383198ed16b489a44c47edd2f90def511647a3c38af76dff76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::table_import::execute_import_rows_batch: FunctionTooLong \u2014 dbx_core::data::table_import::execute_import_rows_batch runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":6580}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ae4b68d6742f67f00f75c9f9c6bf158b038717a9c9288bd1b19c0262600507"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_dialect::sql_dialect::table_select::build_table_data_select_sql_with_database: FunctionTooLong \u2014 dbx_sql_dialect::sql_dialect::table_select::build_table_data_select_sql_with_database runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1612eef62ff0576b44332c884ced528c7e0a351a4fc3963543a2bbfa850bf598"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/JdbcExecutor.java: FileTooLong \u2014 1002 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: JdbcExecutor (25-1391). The bar is 500 significant lines; this is 502 over it, 2.00\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":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03da6f5e574b87f58656a96b1bdbce4c46641996ea7aea6e5e15c9787087d84b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlDebugTarget: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea75d3af43e1eda57784565e9e60f62472cc19952f12f6d8a076d5882fbaa28"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorPointer.useQueryEditorPointer: FunctionTooLong \u2014 useQueryEditorPointer runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorPointer.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3073004752210d099dfb2ba4db95885f0fa2cd8ea0f529006a145d142e8a88ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::table_import::parse_xlsx_preview_file_with_options: FunctionTooLong \u2014 dbx_core::data::table_import::parse_xlsx_preview_file_with_options runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3631}}}],"partialFingerprints":{"codehealthFindingId/v1":"3318e539ab58bf7ce2af53558695d42ec95c829408ba09bd7b2c62b030938c0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_mysql::mysql::execute_result_sets_with_text_protocol_on_conn: FunctionTooLong \u2014 dbx_driver_mysql::mysql::execute_result_sets_with_text_protocol_on_conn runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6280}}}],"partialFingerprints":{"codehealthFindingId/v1":"15878eec85132d50a44a927ed574c43e1638ebcbfa642268b088229baa8fcbef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oracle-go/pldebug_manager.go: FileTooLong \u2014 999 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: plDebugNativeEntry (16 blocks, 32-1246). The bar is 500 significant lines; this is 499 over it, 2.00\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":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3eba8355db0db48795511f5903cbea49a3e4870a28d10742d1095a2af0ddc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/script_generator.rs: FileTooLong \u2014 994 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 494 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"400ccf22dc8c8c90fc16edbab6eef6f011df92c1f87b5f65db07303f76691109"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::execute_multi_core_with_options_for_client_and_progress_typed_inner: FunctionTooLong \u2014 dbx_core::query::execute_multi_core_with_options_for_client_and_progress_typed_inner runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":4038}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0773263b69bb85e06dd996a580c7134d2fa169645d6bbc36400105d0c05471"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSchemaDiffSession.runSchemaDiffSession: FunctionTooLong \u2014 runSchemaDiffSession runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSchemaDiffSession.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c5a22854ed4cc2a3e324cab97789a7b9ca09f4c7269821e382e5bdc0f0c0f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_data::data_grid_sql::build_data_grid_save_statements: FunctionTooLong \u2014 dbx_sql_data::data_grid_sql::build_data_grid_save_statements runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f3e43d93b21167bd4df0b98f910308b13286860a0f5082809126f6774a9b1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/rabbitmq.rs: FileTooLong \u2014 975 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 475 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa92a2393494f389aa87c1ec0dc1746d5b671c6d021e296bd9007f7eafd50a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlDebugCompositeOutput.helperDeclarations: MethodTooLong \u2014 helperDeclarations runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeOutput.java"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfa0d51d7e356a2116691088dbc3949f2426ec3425b169c0d2065f79e243867"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useMultiDbTargetSelection.useMultiDbTargetSelection: FunctionTooLong \u2014 useMultiDbTargetSelection runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useMultiDbTargetSelection.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdfdf7a23afdf5a98dec7f78b982bdbd9684410227e548ccb24e0cebb84a0e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/editorThemes.ts: FileTooLong \u2014 973 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 473 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/editorThemes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9676b19d7b56e32f6bfebb76000ff261a1f4c46d2cc749d4727b04ff21624e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/query_execution_sql.rs: FileTooLong \u2014 972 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 64 free functions. The bar is 500 significant lines; this is 472 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e868fb13facf42599e083d102e8238673f6d9e3c12d1a4a8393f797faa69cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::database_export::export_postgres_all_schemas_sql_core: FunctionTooLong \u2014 dbx_core::data::database_export::export_postgres_all_schemas_sql_core runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":4870}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d08331c35c96201c4a766d85b383a711d35767d1a3f4b64f72846ee3101933"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table_structure_sql/column_alter.rs: FileTooLong \u2014 959 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 459 over it, 1.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b366efc9395809f0b168f502ee7fb76b393e1d0807f90c51097f5e8e3340197"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::native_jobs::operations::scheduler::transition::run: FunctionTooLong \u2014 dbx_core::schema::native_jobs::operations::scheduler::transition::run runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"2234c4dccdc5bbbde397a448cade80ed69546ddfde3219fa02e652ca50d3675e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useSqlExecution: ClassTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 357 over it, 1.89\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":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5932d74637fb6305a490737bce1e4b48a1381dd52e284659c308441f8c22b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDatabaseTableEmpty.useDatabaseTableEmpty: FunctionTooLong \u2014 useDatabaseTableEmpty runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDatabaseTableEmpty.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3f511080905c7d8ba52269220be39428384d37f8b703da1eab3f98c769869b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JsonRpcServer: ClassTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 354 over it, 1.89\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":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3397ea0e4ec78024428eb009d2d1df033ffa7741e50bebc889dec23419dcffbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::table_export::fetch_table_export_batch: FunctionTooLong \u2014 dbx_core::data::table_export::fetch_table_export_batch runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7c0351aa124cbbf4d108ce1e640cb3f39ed0b134cdcdd64af4c53ec54b2f59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: plDebugNativeEntry.start: MethodTooLong \u2014 start runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"853b488b234fd5146aff45f95b96b3d4d03a26f02e8fcc378433a8d190c0716e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridCellDetailEdit.useDataGridCellDetailEdit: FunctionTooLong \u2014 useDataGridCellDetailEdit runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridCellDetailEdit.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca5218124304d663bf7a60b708b633619c010f8bd11721c07cbf0e776be555b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PickleUnpickler.dispatch: MethodTooLong \u2014 dispatch runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/codec/pickle.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e322ed5959ce77538622d7a05af680d36063e5c3d8e6018a572cd005f6e1fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stores/savedSqlStore.ts: FileTooLong \u2014 930 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: useSavedSqlStore (219-1273). The bar is 500 significant lines; this is 430 over it, 1.86\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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4548fd4d09a8833671720170d59e77635f08b93d3c366004d2a99a9e9cae6ab4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: connection/jdbc.rs: FileTooLong \u2014 927 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 427 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"442004230353597a71179e1bc5e3d311e905c6aaf272881c54b6fc3d104e999c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/document_ops.rs: FileTooLong \u2014 926 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 58 free functions. The bar is 500 significant lines; this is 426 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb8c655ec9dba6d03a148d808434c4669f29bd7eedb12f4d6ddd1bb2c70e5e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::database_export::build_export_insert_statements_excluding_with_dialect: FunctionTooLong \u2014 dbx_core::data::database_export::build_export_insert_statements_excluding_with_dialect runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04b9a4664a4914fe95524686719ba33f72db8d2b8733674b87b60cc6b599c8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_mysql::mysql::execute_result_set_with_text_protocol_on_conn: FunctionTooLong \u2014 dbx_driver_mysql::mysql::execute_result_set_with_text_protocol_on_conn runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6063}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ed8b1926d932a20e28a7e02f5130ffd509d2342425a027bece08f29142bf41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive-go/config.go: FileTooLong \u2014 924 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 424 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30a0906559864d2bffb2e69c6a1109361f4f4a011bf073035012d1787e20151"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SqlServerLegacyAgent: ClassTooLong \u2014 739 significant lines (blank, comment-only and punctuation-only lines excluded), 71 methods. The bar is 400 significant lines; this is 339 over it, 1.85\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":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fce1934cefce6b1cdff7736006786714b8ea2f5ea9a389022ff82665fd8a40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: server.dispatch: MethodTooLong \u2014 dispatch runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"942d6f1d8c8cb63c175817dcef9565cc79587d3834be413efa92c5d74eee6486"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorHover.useQueryEditorHover.resolveSqlHoverTooltip: FunctionTooLong \u2014 useQueryEditorHover.resolveSqlHoverTooltip runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc88836a062557d4e42ada4e5fbee03c8ea3c20c60966a8a0ee22ec365360316"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useMultiDbExecution.useMultiDbExecution: FunctionTooLong \u2014 useMultiDbExecution runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useMultiDbExecution.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfb4a8529f2dc79107c1853425b2db2edf5ef292fa81467043483dac70aa1b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::mongo_ops::execute_mongo_command_core: FunctionTooLong \u2014 dbx_core::query::mongo_ops::execute_mongo_command_core runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9f492698cb09299634a1fcd5523457b8baa7fceb3627e76867224ed61f6f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: 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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ac99f6cf5fdb0994be4357f4dfd30e1cfcd2736adc39e57661ac420c1a60cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDatabaseTableEmpty.useDatabaseTableEmpty.requestDatabaseTables: FunctionTooLong \u2014 useDatabaseTableEmpty.requestDatabaseTables runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDatabaseTableEmpty.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed507db813b8a0cdc3b8f2f5266dc57a65bac31b325c6add1170c190bfa41e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/installer.rs: FileTooLong \u2014 911 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 411 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce36f4b03f30038285d3a31c8390386b83684fddcf634dee8f037bd7e8e0d50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useSqlExecution.ts: FileTooLong \u2014 901 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: useSqlExecution (175-1205). The bar is 500 significant lines; this is 401 over it, 1.80\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":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7989fc25516902f278b49bb7c8e0de62653a7f429ff156ff56219c3bb8ef92a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/xlsx_export.rs: FileTooLong \u2014 899 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 399 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/xlsx_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef69fe98a6629922fd1dc35c81f52a3d0343b765a98bcc52aae39f28965c680c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useExportTracker.ts: FileTooLong \u2014 897 significant lines (blank, comment-only and punctuation-only lines excluded), about 60% of them inside a single declaration: useExportTracker (478-1145). The bar is 500 significant lines; this is 397 over it, 1.79\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":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c2031910ac54598727163ca793e87eb6b4659243fbc96990212601a1ef6c5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: argo-go/config.go: FileTooLong \u2014 896 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 396 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9016faed20de8978d353c3290db2c1911a0b50dc811101833f51b4f80979517c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::oracle_ddl_indexes::prepare_schema_sync_oracle_ddl_core: FunctionTooLong \u2014 dbx_core::schema::oracle_ddl_indexes::prepare_schema_sync_oracle_ddl_core runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a9dbac0da344e47552994d27f92446646cd41a4106b38b7bb662f1ed8ed6df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sql_editability.rs: FileTooLong \u2014 893 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 41 free functions. The bar is 500 significant lines; this is 393 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b780415462f08ecdb6f70d3a8b02602bdc47c7e6209d8222260323204512b7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/rocketmq.rs: FileTooLong \u2014 885 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 385 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rocketmq.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3821377293f70d717f6069695a3918c02bd1fdcb576e762fd7f3cd3b1336659"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_agent::agent_service::download_with_progress: FunctionTooLong \u2014 dbx_driver_agent::agent_service::download_with_progress runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8f12c754dd1fbc0b09241a0a8316ac2076b1a9fd331d8c126f5a47c1885d22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_postgres::postgres::completion_assistant_search_inner: FunctionTooLong \u2014 dbx_driver_postgres::postgres::completion_assistant_search_inner runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b8d7ec74053333e60e411f96a77b0577bde8e1f5dcb05b79fc5a435c5ba2a0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StandardJdbcMetadata: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc6dc9bda1a9a5afd575ef14c7a6734d4752bbdd79c49a3421121d80c819700"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useSidebarTreeExportRuntime: ClassTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 305 over it, 1.76\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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03015c7c58d0c202aaea8ec5b157c857534b413deaa71763c7a10db0e11e0445"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: oracleTypeManagement.prepareOracleTypeManagement: FunctionTooLong \u2014 prepareOracleTypeManagement runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a859e3256fce881ae393e57d9bba433cef22fac15bd7e3d58fc59439d9ff771"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verify-schema-objects.main: FunctionTooLong \u2014 main runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"250807ae95d2af583f155f9e8103ec58dfde522cf8d1bfe1e8883b496f9d64da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent_offline_export.rs: FileTooLong \u2014 873 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 373 over it, 1.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eba489107712bc6462c2e42eeb342221db4a080f1b413e97b4a031ee96d824"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridSearch.useDataGridSearch: FunctionTooLong \u2014 useDataGridSearch runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSearch.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb4ac86c6c6a3c82c67618a91a467790b925e726a8859277f5c77374b769a14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_redis::hash_field_update: FunctionTooLong \u2014 dbx_driver_redis::hash_field_update runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":4365}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b00da50ca14a12529e3be5e73bfabecef583174eb82783e5173c46c807a9e10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: etcdSession: TooManyMethods \u2014 52 methods, declared across 9 files: etcd-go/auth.go (14), etcd-go/client.go (8), etcd-go/main.go (8), etcd-go/kv.go (7), \u002B5 more file(s). The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35566dd731a9423e237edc1dab34d5f75ed0e9746391857f98b83ad6216e09e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/PostgresLikeAgent.java: FileTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: PostgresLikeAgent (13-1189). The bar is 500 significant lines; this is 365 over it, 1.73\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cbe974fa8eb07afdc660571f67dc0565aa54cfc535fd4c372fa2e5f3540bdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::sqlserver_manual_transaction::execute: FunctionTooLong \u2014 dbx_core::query::sqlserver_manual_transaction::execute runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/sqlserver_manual_transaction.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e5f95bf1900a0c9ff3d47be47d0306a592d166aa38c3ca6499cb1c44a0b175"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_agent::agent_service::import_offline_zip: FunctionTooLong \u2014 dbx_driver_agent::agent_service::import_offline_zip runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":3186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d089836ba8bdf2c43cf21f2c3d772aaa2dd5ae708c0cf1d2c167474d9b8511c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/backend_error.rs: FileTooLong \u2014 863 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 363 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/backend_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f98b69a05dbe4a601c77c4518d77e90adc8259050742f98dd5405d0c169e9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nacos/access_control.rs: FileTooLong \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 360 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ee9bc956b2b6f339464773d07f1621e37f7cf500800383694729bc74e5a8e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::query_result_export::try_export_clickhouse_query_result_stream: FunctionTooLong \u2014 dbx_core::data::query_result_export::try_export_clickhouse_query_result_stream runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":2144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb5a8cec8a7117bd2cb5d96f82ad382d784b7229828a41249e2b9314e6c6ce7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::transfer_mysql_schema_objects: FunctionTooLong \u2014 dbx_core::data::transfer::transfer_mysql_schema_objects runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0030b3c15b7233e0f54dd3c62a462048f067d8f3d12caad74e454aef190c1e3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_core::object_source_sql::oracle_indexes::rebase_oracle_table_ddl: FunctionTooLong \u2014 dbx_sql_core::object_source_sql::oracle_indexes::rebase_oracle_table_ddl runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c87fa4f7cca042ccfd4ee216b9238931849c63ebdbcc748bcdbc6ca4536d7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/runtime.rs: FileTooLong \u2014 857 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 357 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfde87430892f51b1bcb3c0cd96c84ec3629add486814f4c0ac02e4614c753db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/tableTree.ts: FileTooLong \u2014 856 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 356 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5b7f94c8b1c23a4764b55090022ef80c3b6991fea5116a033330d53dec60e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.rs: FileTooLong \u2014 856 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 70 free functions. The bar is 500 significant lines; this is 356 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-tauri-schema/src/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b992d7dcbbe56bcd3983611b7ab341bd203e3658a4440a8ebe78eaaf2e18df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::map_column_type: FunctionTooLong \u2014 dbx_core::data::transfer::map_column_type runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":4743}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fed6dddcfb33a3bebba26ae2a056af95149880fdbaa2998e01ffdbb7b3091e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_data::data_grid_sql::build_data_grid_copy_insert_statements_with_formatters: FunctionTooLong \u2014 dbx_sql_data::data_grid_sql::build_data_grid_copy_insert_statements_with_formatters runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51405aa484c7a1eaed5c33907c8628d7badf376d77f5c5ac6aaf0a989714b30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/settingsSearch.ts: FileTooLong \u2014 854 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 354 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/settingsSearch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1824d45e2d3b935160b62db461d98148e7cd6f54f67892e6c35973c38a781976"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oracle_routines/plan.rs: FileTooLong \u2014 853 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 353 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"320393f155c93395ff5dd674a51f27f54a8f3d429bc578245cb9cbaf3d0c2f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::schema_diff::prepare_schema_diff: FunctionTooLong \u2014 dbx_sql_schema::schema_diff::prepare_schema_diff runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"672c2c71f756d1cdab0f2afee2ee51258aa2ff016c0b11e709f39736f1727946"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mongo/mongoSql.ts: FileTooLong \u2014 845 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 345 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ec481394c99725ac61a4348d81d723f07dd8d6ab77f412e98b8abe7a631aee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSidebarTreeToolRuntime.useSidebarTreeToolRuntime: FunctionTooLong \u2014 useSidebarTreeToolRuntime runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeToolRuntime.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0420c9d65f737cbc2b8a6d31bb887de2494a1e5bae49827552e967bdb5078bd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::oracle_routines::references::resolve_draft_with_tables: FunctionTooLong \u2014 dbx_core::schema::oracle_routines::references::resolve_draft_with_tables runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/references.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"9492edd35a1704786827995ee10a591066831ad9ba32a64e70f4278c313396f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql_dialect/table_select.rs: FileTooLong \u2014 841 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 341 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f22bc2c8950021e22f485521d2a38bfc27b076ad04b984a5c8ce5c5a3ded30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mq/types.rs: FileTooLong \u2014 840 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 340 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bcbfec50b253abfbf9d359b40d33a98020b07fd56bc703dfd2dc24c93b1735"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/mongo.rs: FileTooLong \u2014 840 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 340 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0908708c055f692c41cdc12f124da7abc5ffb82975002ed9d4a9663983e34a9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tableCopyTaskStore.useTableCopyTaskStore: FunctionTooLong \u2014 useTableCopyTaskStore runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/tableCopyTaskStore.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9ec9044e2a9ff124a105b776441486e524ecd6489fb164375ba950d27124e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::admin::nacos::access_control::plan_operation: FunctionTooLong \u2014 dbx_core::admin::nacos::access_control::plan_operation runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"790bd2ccfcc84a50be46f9121042195b5d869f5037c2838a7f64854c9da55d12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.rs: FileTooLong \u2014 836 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 104 free functions. The bar is 500 significant lines; this is 336 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-tauri-consul/src/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb5be02483f4633f194f1b9c619297c0267dd068b2296476c925f5e33785b28"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/redis.rs: FileTooLong \u2014 836 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 336 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0b394d95e6b69bf7877da52c434ccf1118b9913f7d8477b2cedeabdd00d91d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.applyCassandraURLParams: FunctionTooLong \u2014 applyCassandraURLParams runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e60c88dca0828b4964bdadf187cfb3f42fb77248a6074b54c2bfde8e1d7efe7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PostgresLikeAgent: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"78565256de8a28e1214bfb3d1ec58187dc798e2bf92e1e73ec9ca85ecd0eca8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useQuickOpen.ts: FileTooLong \u2014 830 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: useQuickOpen (320-1194). The bar is 500 significant lines; this is 330 over it, 1.66\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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc48792847a00ea94f51ec83dd333891fee0c268679dcf67c20da148f0f25b64"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::query_result_export::try_export_postgres_query_result_stream: FunctionTooLong \u2014 dbx_core::data::query_result_export::try_export_postgres_query_result_stream runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc04f8e19b55bdb15ec2be13575a77203d7e3d9dc3b5cb8f8008046606d6570"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ai/ai.ts: FileTooLong \u2014 826 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 326 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5782eede775a856475a0e50fc9af4ff109a7aca7c4b262fa1854d483891c1e20"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalBackend: ClassTooLong \u2014 660 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 4 blocks, lines 602-1769. The bar is 400 significant lines; this is 260 over it, 1.65\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8176d4cfd40484fd6f374989d05712cd826fc900830a87ed5166a5e4704c38"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_agent::agent_offline_export::append_jre_tree_with_limits: FunctionTooLong \u2014 dbx_driver_agent::agent_offline_export::append_jre_tree_with_limits runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0da27fd35b3e857b31692bbb36cf8dc6760925dcd20a0b5f09472e4cdd05874"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::native_job_changes::creation::native_job_scheduler_create_plan: FunctionTooLong \u2014 dbx_sql_schema::native_job_changes::creation::native_job_scheduler_create_plan runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/creation.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d4310055fe7d933786acb56164bf582db70d606df9aabcd7c8542632003c2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/update.rs: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 324 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"821ee3403cc382e71a3e09f9c4fe29111b0361c10a55dc4093f27d6505825d8d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MqttClient: ClassTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 36 methods, 3 blocks, lines 303-1241. The bar is 400 significant lines; this is 256 over it, 1.64\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2890cf52288ec8e52ca6238a732192598aa54fd56daf68a8d7e2b836f1abb48"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: server.dispatch: MethodTooLong \u2014 dispatch runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a7f4297a46e26b26b149e724f7b5692534378d3fee44f353aa1504d51828a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::generate_upsert_typed_for_transfer: FunctionTooLong \u2014 dbx_core::data::transfer::generate_upsert_typed_for_transfer runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5823}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd72a4395315b122c5905c1af7f76a2ec48781a8626e5cb2a1384932599dcf37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::transfer_postgres_schema_dependencies: FunctionTooLong \u2014 dbx_core::data::transfer::transfer_postgres_schema_dependencies runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14631}}}],"partialFingerprints":{"codehealthFindingId/v1":"910c14af295e79ee7d1624ee781e4c57f158643dbc449779502ea8044bfc9c0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantic/model.ts: FileTooLong \u2014 819 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 319 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76244e8a1befbf92540bfb1ed3b0a7bffe09c9401e4a0a0be58e4d2894a52161"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Db2Agent: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bb29d6ff5b681de71a16a86c87edc2aa0049e9452bb1c5314a63f10dfed1d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: treeNodeIcon.getTreeNodeIconInfo: FunctionTooLong \u2014 getTreeNodeIconInfo runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeIcon.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4991c7ca394ee5f9debb0a61c115ec48f1ffca5fe05f7bca0f653ebbb9ba3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: connectionStore.useConnectionStore.loadMoreObjectGroupChildren: FunctionTooLong \u2014 useConnectionStore.loadMoreObjectGroupChildren runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7988}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0da285ec70f7e2098085ef76a7b0f654e78befdc136035886f1224b71c0b56"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DbxMcpServer.run_product_tool: MethodTooLong \u2014 run_product_tool runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfa75135509bee3f51a062282241a264a1d20147c2bdc8914aec23f03ffb39f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql_dialect/dialect_yaml.rs: FileTooLong \u2014 812 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 312 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/dialect_yaml.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9766aac0e613e1bb683990402b3f3cccb5cdddf459b758e0472e16cf0c12518"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useDataGridColumnLayout.ts: FileTooLong \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 310 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6afd29c15c2ac986ce4c7b1278055a7aa70a0961359c479230f32894a502b8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: connectionStore.useConnectionStore.loadDatabases: FunctionTooLong \u2014 useConnectionStore.loadDatabases runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6373}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdcba3035d34709f879e37db387dfa25ecfbe6971524becd0c4e5d722a9f60e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::oracle_ddl_indexes::capture_table_ddl_indexes: FunctionTooLong \u2014 dbx_core::schema::oracle_ddl_indexes::capture_table_ddl_indexes runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e8cb926936eb7b624c58753d192985ddaf7df92ac0b58c59d921b0c3b9f3a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useSidebarTreeExportRuntime.ts: FileTooLong \u2014 809 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: useSidebarTreeExportRuntime (128-1031). The bar is 500 significant lines; this is 309 over it, 1.62\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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01af64f4dbf61e52957cfe87631121c407e4c3624896b824a3240ec92450ae32"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AbstractJdbcAgent: ClassTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded), 78 methods. The bar is 400 significant lines; this is 247 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":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b214e21656cd5c4e64bf42ac7769546578928fba31443105c98bb4801341b7f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queryStore.useQueryStore.buildQueryMetadataPatch: FunctionTooLong \u2014 useQueryStore.buildQueryMetadataPatch runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7971}}}],"partialFingerprints":{"codehealthFindingId/v1":"598acf4aaafd7180255c80fb61a7a592de27543671e843d44a3fbb605219c621"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::get_table_ddl_core_with_options: FunctionTooLong \u2014 dbx_core::schema::get_table_ddl_core_with_options runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":11397}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb16b42d0e7362272aaacec78db084be3592817ed38c0c9837f872fd07ec31c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_data::data_grid_sql::build_data_grid_rollback_statements: FunctionTooLong \u2014 dbx_sql_data::data_grid_sql::build_data_grid_rollback_statements runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7705598f44e715fe5ef321267ca95cc9b561363dc40942ab1784a363cdb9105"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/documentStoreProvider.ts: FileTooLong \u2014 803 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 303 over it, 1.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5483dd40998f656e986ed6f43fe91244f4ca9e0b53c393516ba23d1c60caafa0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: dbx_core::admin::nacos::service: TooManyFunctions \u2014 48 free functions. The bar is 30 free functions; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/service.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ca7934ee6aa979edebc14e6e17f19ac3420a721afa487a2689adc5bb8a409b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useDataGridActions: ClassTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 240 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33538dd291addfa1dc97b2a4eff8da6bb5ce9e7acaf2e99de4729d6e3618034"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DdlDialectProfile: TooManyFields \u2014 48 stored fields beside 6 methods. The bar is 30 stored fields; this is 18 over it, 1.60\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb3eb1c6454b931cbedce13bcb95e4f468e2fe4cee062024efa161ae2ef7c03"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editorThemes.buildEditorFontThemeRules: FunctionTooLong \u2014 buildEditorFontThemeRules runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/editorThemes.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b27d2e8b932a163535ef2d12cae3957842ae725c8f6e8cf4c824db0db49180a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ai_cli_agent.rs: FileTooLong \u2014 799 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 299 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61996e87093dffd9faeec03d06ac01f650bd91eb7d2589a27c9892f681ce0874"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent_manager.rs: FileTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 297 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"733d3d9b62c81632f0042bc16fa6c08f0e02713f0dad870a68770791ca568705"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorCompletionKeys.useQueryEditorCompletionKeys: FunctionTooLong \u2014 useQueryEditorCompletionKeys runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e25cdb0e752923c1655e4689d4e151903f9eca2a0b1b6af23880afaf272d75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridExport.useDataGridExport.exportMemoryResultSheetsXlsx: FunctionTooLong \u2014 useDataGridExport.exportMemoryResultSheetsXlsx runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d2ed719a405589d79d0867c936446dcdbb6e6678085e940bf0a360b77697da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/driver.rs: FileTooLong \u2014 790 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 290 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/tdengine/src/driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a443ff0764bd47c7e47cd81b85568de2593e1c72d701498d35e4d29d26fd4576"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::query_result_export::try_export_sqlserver_query_result_stream: FunctionTooLong \u2014 dbx_core::data::query_result_export::try_export_sqlserver_query_result_stream runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac87a2c0cc2b4773095df5a7d5265083ed59e408bd858be513ce04580e11e78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_data::query_result_sql::build_sorted_query_sql: FunctionTooLong \u2014 dbx_sql_data::query_result_sql::build_sorted_query_sql runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6a049be6d2ab006b5f0858bece6b9d7dfbfad9b239e910b98c16d05118c9a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: plDebugSession: TooManyFields \u2014 47 stored fields beside 63 methods. The bar is 30 stored fields; this is 17 over it, 1.57\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeea55269b589e79074d30440ca99ecc9180d0ddb105540c98e50c9aa9c6a24"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SpannerAgent: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d32940d8a123fe05fadb618ceef207594f3be6520fb38ac915e700a59790c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_ai_provider::ai::stream_claude_with_tools: FunctionTooLong \u2014 dbx_ai_provider::ai::stream_claude_with_tools runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56cee4c28e5e013bad33f862701d0c8ce9d5d09823ec7940757cbb2afe6d8ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::data_compare::prepare_data_compare_from_tables: FunctionTooLong \u2014 dbx_core::data::data_compare::prepare_data_compare_from_tables runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a3a3d03f4073428001e201f2bc343026bd9e32bf1c463bdb2b75aede7abda9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::table_import::stream_xlsx_rows_to_channel_with_control: FunctionTooLong \u2014 dbx_core::data::table_import::stream_xlsx_rows_to_channel_with_control runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":4353}}}],"partialFingerprints":{"codehealthFindingId/v1":"403cccc172d5f97f3aee640a61aec2e9308b20198a5fbbb6c55edb89e5bd0cf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/sqlAnalysis.ts: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 278 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8e4a062821bd58f90fb025f3f338e366e8a145c6e6b934980f1cfafc4389fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.plDebugLoadNativeTypeGraphOnLoader: FunctionTooLong \u2014 plDebugLoadNativeTypeGraphOnLoader runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_type_graph.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"479519aace796f0f963c838ee768fcc107e7ea558c2ff5eceb5d5b9cdf324e8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/JsonRpcServer.java: FileTooLong \u2014 774 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: JsonRpcServer (24-1032). The bar is 500 significant lines; this is 274 over it, 1.55\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":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bccd3fa358a13dcca940a41045072f54002f184381d625b1720aa44c128863"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drivers/DriversClient.tsx: FileTooLong \u2014 771 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: DriversClient (216-902). The bar is 500 significant lines; this is 271 over it, 1.54\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":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"317092712b09b2bf1db232613136a555a3a458d49259a77fe9ee95d6fd0bce50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/salesforce_driver.rs: FileTooLong \u2014 770 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 270 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/salesforce_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b34e437495bb96ca60b7394864ea8cb22f63d1cec16d8a0cd57373b90844b16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editorThemes.buildSqlCompletionThemeRules: FunctionTooLong \u2014 buildSqlCompletionThemeRules runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/editorThemes.ts"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af5337c0f68bad5231f9385586b3d8f579c920863b0d4a069d72adf4aa54a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::schema_diff::generate_create_table_sql: FunctionTooLong \u2014 dbx_sql_schema::schema_diff::generate_create_table_sql runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5877}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c327f59a50f25d92d70af3255aaba1c44b75b35eb3c57c19de52e1257811dac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlserverlegacy/SqlServerLegacyAgent.java: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: SqlServerLegacyAgent (34-1136). The bar is 500 significant lines; this is 269 over it, 1.54\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":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12316fe74129f10666bf96f532495cd11ef7fb3192a3de53eac16bdc59bd62d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ai_codex_cli.rs: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 58 free functions. The bar is 500 significant lines; this is 269 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6bc64f7fe8863caea1c9cabaa21d06f0d70e1783c1c133eb77aac43321fced"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorStatementBoundaries.useQueryEditorStatementBoundaries: FunctionTooLong \u2014 useQueryEditorStatementBoundaries runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorStatementBoundaries.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5448065cff0bd573904774f4e2691c35da144177e99b4ab3d6a9d5c2be4570"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useQuickOpen: ClassTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 210 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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a05f02290349329b00eeba0fb0bc9a7a392a2a00988c17f735fc5f179d1655"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/databaseUserAdmin.ts: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 261 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":"apps/desktop/src/lib/database/databaseUserAdmin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7760cb46d3a7fb2821f3c1d3fd349e2359f3952632dd4365d5a47b637ecfca2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oracle-go/pldebug_target.go: 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":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0e2c810ab0f6989d35fc1588f25046dcdbdc93601387c1cf3fcc75395a65fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/solr_driver.rs: FileTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 258 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/solr_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2beb00d1155be644c7ca276156c0d20ac0111f44032d4ef47b4740432fbaf0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/nacos.rs: FileTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 258 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/nacos.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80797766118ce8cc899f4b795b584a39afb82e3d9f44cfb50200bb3b760ed325"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StandardJdbcMetadata: ClassTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded), 53 methods. The bar is 400 significant lines; this is 204 over it, 1.51\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":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e69f3aa12a543d00bfd47655daa02e251aac3dc8e6279c8b2ac557c2e1e1b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: oracleRoutineRename.prepareOracleRoutineRename: FunctionTooLong \u2014 prepareOracleRoutineRename runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56766583be0844a757bc0e597579564135c440021714d586771efe6b37bc829"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::pl_debug::pl_debug_operate_submission_core: FunctionTooLong \u2014 dbx_core::query::pl_debug::pl_debug_operate_submission_core runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33cfd535070b9812f1efc27a2c6a90c91c8b10fffb3fc6c54c7bd208e5f6565"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive-go/metadata.go: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 254 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/metadata.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a661420c1f90963ee2d9a57cda0e30adc9d8cba45f6a6690d1bbec2c73fc4eb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/consul.ts: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 254 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/consul.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b008f32d9595f3a42d9944845c3abcca22813ccd2c28ee39ea987e0d57ba92"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: plDebugNativeEntry: TooManyMethods \u2014 45 methods, declared across 15 files: oracle-go/pldebug_manager.go (15), oracle-go/pldebug_entry.go (5), oracle-go/pldebug_lease.go (3), oracle-go/pldebug_stack.go (3), \u002B11 more file(s). The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_manager.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"82696c4613ac35b1b89c5bfc72989172069ee150a513f6605a794da909f28a1a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4cc7cba5cd8fb321a9dfdf013494d76dcd341ce43eea8a63d57648a08272f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: dbx::commands::nacos_cmd: TooManyFunctions \u2014 45 free functions. The bar is 30 free functions; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/nacos_cmd.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b7b654945a93fa7e7f86b3731c5a6295067bf1d21b8ba46fca5c05197be071"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlHoverSearch.createHoverSearch: FunctionTooLong \u2014 createHoverSearch runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlHoverSearch.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5565185801fccd3ba41f8e397295b13d6dc7d194ee68d81b26af872cefd4a759"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: migrationStore.useMigrationStore: FunctionTooLong \u2014 useMigrationStore runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/migrationStore.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6a6385b2b25ce6c4df1e84311302a48063a2e8bbd21b7b45d548a64e0bbf54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::get_oracle_type_management_snapshot_with_objects_core: FunctionTooLong \u2014 dbx_core::schema::get_oracle_type_management_snapshot_with_objects_core runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":13166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e636e203e701064c83bfbb97d881b078a1de196ce0a6c2d593973e51fba3198c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/sqlFormatter.ts: FileTooLong \u2014 748 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 248 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35ea9618419277ea166a3c28b8c54449ee6939a0352d2eb2d0c8f4b4b4e84b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/webview2_preflight.rs: FileTooLong \u2014 748 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 248 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/webview2_preflight.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4017dbd016aba69eb88d543ee0c033d08e6bc2efd9dad65f1577a9308e50a880"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/oracleTableRename.ts: FileTooLong \u2014 745 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 245 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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91bfdd7dbb03741e4e011cc0351254bb3ead9de5309e5af199e8fa62b1e1bc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: connection/connectionUrl.ts: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"323d712c88fca57aaecf3d0bc587aff586d82f35b00e4442e1fe21db3a179758"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: safety/production_safety.rs: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 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":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff08f3c9846e4224e1ef69fdaee47d5d86583ebfd495500dd68b5e60c85c3f72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: argo-go/metadata.go: FileTooLong \u2014 742 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 242 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f849d114ac0db6c664ef4cf2f2be8d52f5d54ad7d2949b3f7c1395adfc5691"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DriversClient: ClassTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 193 over it, 1.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":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9ebd0f6167c07f424ea8fc31ba217ff4288c886a242d283651bcbcf35f1f78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: consul/agent.rs: FileTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 240 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5d2a51f23ec0b9e4516b5fcf1a11e3ec6bc498c6dfcb79af39e3b949f4ca90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.plDebugScanNativeRoutinesMode: FunctionTooLong \u2014 plDebugScanNativeRoutinesMode runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf6277298b24ce8dfedf9b70f406c2c290c316d0132c04d12681012b78fb7e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::stream_rows_in_manual_transaction_with_cancel: FunctionTooLong \u2014 dbx_core::query::stream_rows_in_manual_transaction_with_cancel runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":7416}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d7709c5d5d056d75c76024b6da68a55af5aaf46db02a82251c2be2967fabae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::oracle_routines::collect_snapshot_with_options: FunctionTooLong \u2014 dbx_core::schema::oracle_routines::collect_snapshot_with_options runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b6db17f35ea1bcb46d0f48c4552c1ec7e24bc277b99d191dfe7d70ec7c65cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sql_risk.rs: FileTooLong \u2014 738 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 52 free functions. The bar is 500 significant lines; this is 238 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_risk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f33511412e0f7f39a14b74c0c413e7391d604e994c088a503766418ab22971"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/document_store.rs: FileTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 41 free functions. The bar is 500 significant lines; this is 237 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/document_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9300e181bf80da7f8c47f3a07f711c5d0c866a407f43082f64e3d1b9675c3c2e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MysqlDumpBinaryLiteralNormalizer.normalize: MethodTooLong \u2014 normalize runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cccd4398e2e1faecf2c2ce2fd5559c59db4ee9adbd050604ab2fe6571fd7d7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConnectParams: 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":"agents/common/src/main/java/com/dbx/agent/ConnectParams.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aa7df09b9b3b331e527ec42d39ef58ab864a96b30b7e12f44bfecea2ef846e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: server: TooManyMethods \u2014 44 methods, declared across 3 files: rabbitmq/operations.go (34), rabbitmq/main.go (7), rabbitmq/helpers.go (3). The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/main.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"274c88856d0e24fd3f9f6ef82548e9dbff82f3fd5868c7a3285e5e89f6d37d9b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PulsarApiProfile: 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":"crates/dbx-core/src/admin/mq/adapters/pulsar_version.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd40d8b27ca099f2a584aad76447b7b790ddfff26386a44448a595a95edb5428"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagram/explainPlan.ts: FileTooLong \u2014 730 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 230 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea611872e632dae3125d94b50bc5eb7c6b587c48f7cd8f3006f77196af6ac6ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useExternalSqlFileChanges.useExternalSqlFileChanges: FunctionTooLong \u2014 useExternalSqlFileChanges runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExternalSqlFileChanges.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9e4088edead1d7f3b48641a245d763b4a607f7d10b92e7b88e876d2239677d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PluginHostBridge: ClassTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 183 over it, 1.46\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":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd96761cf8179dada52623bb14b4e0f157664e0b5141677065bd5970abb7eb20"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.plDebugParseNativeConstructors: FunctionTooLong \u2014 plDebugParseNativeConstructors runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_object_constructors.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f2495c73aeea198a27f43d32266d2de1c0a73014a6191734f7ffd5ed1a363c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: connectionStore.useConnectionStore.loadObjectGroupFirstPage: FunctionTooLong \u2014 useConnectionStore.loadObjectGroupFirstPage runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7768}}}],"partialFingerprints":{"codehealthFindingId/v1":"024dbfdd2e0677ff06417e608ee18c1fb1c313f55b9a455dd926c7ebe6369d52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::begin_transaction_session: FunctionTooLong \u2014 dbx_core::query::begin_transaction_session runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":6754}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e7d968dcad1735e5455b091aae4dc5170d9e8a11570774edb2d99ca2cca7ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::native_jobs::operations::run_claimed: FunctionTooLong \u2014 dbx_core::schema::native_jobs::operations::run_claimed runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db4715cb06159e8512b5228d6410e42d96424662117447e9ad3a50e662b35c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::indexes::build_create_index_statements: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::indexes::build_create_index_statements runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/indexes.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51ae9d3fea791bde31423743170bde6ead74b94ee1caeaa2e278639ab51803a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/host.rs: FileTooLong \u2014 724 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 224 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d144452c15bbd91fb90af0ee37af68bf52da2a2858d459d18047c824c737cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/oracle_ddl_indexes.rs: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 222 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfa1000ed96a645ee5bc08ac56ca6dca439761f04dd0f486dd4047dc3d6a9e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useScheduledDatabaseBackups.useScheduledDatabaseBackups: FunctionTooLong \u2014 useScheduledDatabaseBackups runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useScheduledDatabaseBackups.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3919ab2074a130c16bf3ae299813c320983aa7591458fe58a5168640d4d67b06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: doltVersionControl.doltSqlLiteral: FunctionTooLong \u2014 doltSqlLiteral runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dolt/doltVersionControl.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b66242a2585a6c8999ea47b861016c30fcdfb2a1205d1cb56f6ce489c1b1a3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tabs/tabResultCache.ts: FileTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 218 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe65ffe88530b4aa0ebcf422ff2cf0433ab0d6af843ad3ea0eb1f91a7aab38e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/pulsar.rs: FileTooLong \u2014 717 significant 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 73% of them inside a single declaration: PulsarAdmin (4 blocks, 27-817). The bar is 500 significant lines; this is 217 over it, 1.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/pulsar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"789851cfbf69811457b1eec03347a838b98f303d9df2f0905aa2fea1ae3de466"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InformixAgent: TooManyMethods \u2014 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":"agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0f2a39073b90bd7b0d2b6bb3685d2da24b79f3df1d5c7cbc488e4f29bafc49"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: connectionStore.useConnectionStore.loadTables: FunctionTooLong \u2014 useConnectionStore.loadTables runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7588}}}],"partialFingerprints":{"codehealthFindingId/v1":"4901846ded9861cba7f9e247ec635e309f77d809ef36f9f77a7197d45d3c1270"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: historyStore.useHistoryStore: FunctionTooLong \u2014 useHistoryStore runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/historyStore.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"80064c98b428439e56f97c9d118c3693d33413dc0a77993808bd8741a4d2d410"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::docs::collector::collect_snapshot_with_concurrency: FunctionTooLong \u2014 dbx_core::data::docs::collector::collect_snapshot_with_concurrency runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/docs/collector.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"103f6df878cba8a7c4ca826d3e67f9fb117e7c8ef703aafe34df3c7352f13b17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 709 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 209 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8128906c201513f3797b12b7f59db4568ad3d23a0e5cc0d4600b0774714656"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/transfer_rebuild.rs: FileTooLong \u2014 709 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 209 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_rebuild.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1430e1610966e5c4d0d80f1a9d03d650a07c1f19c7982cd087589260090638ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSqlFileFailureLog.useSqlFileFailureLog: FunctionTooLong \u2014 useSqlFileFailureLog runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlFileFailureLog.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e8beebcafbec1d1f273afb4a860bc60572d1ff10542428686f7e91b6c4c084"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useTauriEvents.useTauriEvents: FunctionTooLong \u2014 useTauriEvents runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"363bf98e976c8ce58c1523d4291c7340e729b0ca2876e01d8fc9d874d79be5bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.prepare_connection_transport_with_claimant: MethodTooLong \u2014 prepare_connection_transport_with_claimant runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":4553}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8f136eae72286a326de788230b0bb3bf0b03dc6b60c0c9f63a3195f8502eee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::persistence::cloud_sync::describe_sync_snapshot: FunctionTooLong \u2014 dbx_core::persistence::cloud_sync::describe_sync_snapshot runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3c71aa0bb2f4833e3274ff02d9ff27a0895654a42b1e3285e6477eefb077c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::table_structure_sql::sqlite_rebuild::build_change_plan: FunctionTooLong \u2014 dbx_core::schema::table_structure_sql::sqlite_rebuild::build_change_plan runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9bd091c2fd1d05fb90e2f958fb4d8f1d2076c2ba881093a15c2ef48daa3dd9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentRuntimeClient.call_typed_with_policy: MethodTooLong \u2014 call_typed_with_policy runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b7fd94daa80508462a072ce66b9583e397a72a04102ea356dbb5b60ed84398"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_agent::backend_error::catalog_entry: FunctionTooLong \u2014 dbx_driver_agent::backend_error::catalog_entry runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/backend_error.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"1290fa9feb494500020ae5b827ceb55204f7dfa565d9f1c06232911c1c0caf98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: connection/connection_secrets.rs: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 60 free functions. The bar is 500 significant lines; this is 203 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"630a12dcdc2c145166421a106dc544b12fd4363e5f04ef55d7a40c47e20a18d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataGrid/canvasDataGridRenderer.ts: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 202 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8513f704115bfc1986197393fd5f1711fbf64d251188f31d3521e1f3253a1aa5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: rocketMQAgent: TooManyMethods \u2014 42 methods, declared across 8 files: rocketmq/topics.go (13), rocketmq/consumers.go (11), rocketmq/messages.go (8), rocketmq/acl.go (3), \u002B4 more file(s). The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/server.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f787ddff29cc9eaf76fa73c7b4fa3ac92c003cd004dbedf54b77f79b1995d722"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: etcdSession.history: MethodTooLong \u2014 history runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/history.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3a28bd940b14c7a59307a366a36f5cbd7aa97e11915f5aa73610bbcbdf1a8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridExtractor.useDataGridExtractor.buildRequest: FunctionTooLong \u2014 useDataGridExtractor.buildRequest runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70bf624c13e5e78192a47a002d5141b726d5ef82b951d551ba5ba33b1ec20b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSchemaDiffConfig.useSchemaDiffConfig: FunctionTooLong \u2014 useSchemaDiffConfig runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSchemaDiffConfig.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2284cb1b366e5959727d9109ee86390c26fea7f31a46b221bc55d0913c7be39"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::ai::agent_kv::parse_etcd_prometheus_metrics: FunctionTooLong \u2014 dbx_core::ai::agent_kv::parse_etcd_prometheus_metrics runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f027772d369438081389056daf8c442671dd380c67a2cfc8e448474b6010bfae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::dameng_dump::run_dameng_dump_task: FunctionTooLong \u2014 dbx_core::data::dameng_dump::run_dameng_dump_task runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/dameng_dump.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ed98d11b07c065863c0164105cb9d2d14384ea85426d8c04c5894b7917b0bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::native_jobs::operations::observation::compare: FunctionTooLong \u2014 dbx_core::schema::native_jobs::operations::observation::compare runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/observation.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e10a058ece17563c03c2238d77c2b0426148fea45709e0be0569b2885f4146b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentDriverClient.call_typed_with_timeout_and_cancel: MethodTooLong \u2014 call_typed_with_timeout_and_cancel runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6755455da8a5e2a8f3c3901daefbeccdd972bdf2ab4befb73ed4f55c1a87bbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mongo/mongoCompletionTables.ts: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 199 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletionTables.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecf29200a626cba95c7570d079a70d7a50620f76f7dd9c016933be59df5164c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/oracleConstraints.ts: FileTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 198 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09996b65226f179af64357b615f0eddc9e06fdcde99cc3153fdcda1935e028ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/sqlite_worker.rs: FileTooLong \u2014 696 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 50 free functions. The bar is 500 significant lines; this is 196 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite_worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbc6aacee0299fbd57cc9a54aa6175303f5ebac2d4988b5f0bcf3cc01dc3bc4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useDataGridLargeValues: ClassTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 156 over it, 1.39\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":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0216071925ff759bcf55db09578dc0687c4272c3bf4ca69d66d9f3c91f2dfd1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/shortcutRegistry.ts: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 195 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/shortcutRegistry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d58231bcb38e56dca00601dff79876d174609d1e00b45363b1f43d2757d286"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.SponsorsPage: FunctionTooLong \u2014 SponsorsPage runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/sponsors/page.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2762dbd17e90b1f1a791ca9929fc67c9467b49d40b40077c56e91234cf58bcfe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/influxdb_driver.rs: FileTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 191 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/influxdb_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32711e0b58e31e04d023ae4f864ef56a1ebeabebbc31497c6c9ff11936b7b7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::structure_plan::build_structure_preview: FunctionTooLong \u2014 dbx_core::data::transfer::structure_plan::build_structure_preview runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/structure_plan.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e1a3a71fa497e2d821417b5a986a7e3695a702d99247949249db90b8122ec7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::native_jobs::references::native_job_reference_queries: FunctionTooLong \u2014 dbx_sql_schema::native_jobs::references::native_job_reference_queries runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_jobs/references.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e326fb4b476697e3a603dcaac932d8793ec9606f6a0cd4d5111b9c5ac96ac6df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: persistence/task_history.rs: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 186 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/task_history.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f852cc0b473d72f91a47f3752dc0d56534bab5f9a458e39ce2cf6fef54989d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorCompletion.useQueryEditorCompletion.buildLocalSqlCompletionResult: FunctionTooLong \u2014 useQueryEditorCompletion.buildLocalSqlCompletionResult runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"126e9e9a46189c0cbbe40b46a5eab58304addf9ddb9b523ecc289acf30c91931"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::generate_create_table_ddl_with_source_profile: FunctionTooLong \u2014 dbx_core::data::transfer::generate_create_table_ddl_with_source_profile runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e618449df399d14df0b5c1b938910733edc7f9b2c09905e231d1a89188baa7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oracle-go/pldebug_target_invoke.go: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded), about 69% of them inside a single declaration: plDebugNativePlan (9 blocks, 42-700). The bar is 500 significant lines; this is 184 over it, 1.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad95b4611c2c4b2ce9da6bb4b6af1d3899c4c5ae889aca71ef04a2b7497714fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsonRpcServer: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8691931262845eef89effda370fd21ac1ef3e34cc824b6a792c7a1fcd71a3d17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: dbx_formats::csv_export: TooManyFunctions \u2014 41 free functions. The bar is 30 free functions; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/csv_export.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3655affbcaaea009fa0064c0cfc14eec34d4241833d8cd44bc94d4f5d8f2d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useDataGridActions.ts: FileTooLong \u2014 680 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: useDataGridActions (47-905). The bar is 500 significant lines; this is 180 over it, 1.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1462e00f228310d19387307f8ee4b662e76e3503290aacb3b93aab1c11510e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mq/service.rs: FileTooLong \u2014 680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 80 free functions. The bar is 500 significant lines; this is 180 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5254587550e052e7550ba8fec04dbcf2b5e74ac9940a1e45136c43b470e9bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data_grid_extractors/sql.rs: FileTooLong \u2014 680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 180 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a192dbed32d9bb0845db69b05285ae73aa6a6d4f169b2ba791381a9c7c24c82"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KafkaAgent.peekMessages: MethodTooLong \u2014 peekMessages runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93d1f8cb2db38be95fae31fca7732133941b2253cb51429d58579ffe3acebb0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Plan.render: MethodTooLong \u2014 render runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1decdbdebcac6a1bb3fee43b7a4a4b4b2022aed4f5a1343750d739c11a012c01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::oracle_routines::plan::recovery::package_recovery::prepare_package_recovery: FunctionTooLong \u2014 dbx_core::schema::oracle_routines::plan::recovery::package_recovery::prepare_package_recovery runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan/recovery/package_recovery.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbba5c4ca331a8cd7c24d82d83b668153dfc79ca1ced97b9855c2305b799796"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/transfer_runner.rs: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 175 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bd154b2c86d4078080192ee42a2425b350640ae562d7a18cf400c9851b9d35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridDistinctValueLoader.useDataGridDistinctValueLoader: FunctionTooLong \u2014 useDataGridDistinctValueLoader runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridDistinctValueLoader.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3156844cde2882a3e077dc4807a566aedb0f0727e50ad2a76b7f40ea402e1341"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tableColumnDefinitionPaste.parseColumn: FunctionTooLong \u2014 parseColumn runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5ccaea4128f958ee6fbf3c44c29c86d7adef81cd0e21a08495fc1666ccef2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_data::data_grid_sql::build_data_grid_context_filter_condition: FunctionTooLong \u2014 dbx_sql_data::data_grid_sql::build_data_grid_context_filter_condition runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"111ec9daa8afb84fa5b84d9ee15edfea3392e8e29974052589ee7daa45600013"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::schema_diff::diff_columns_with_identifier_options: FunctionTooLong \u2014 dbx_sql_schema::schema_diff::diff_columns_with_identifier_options runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f923ac3311b4c4f00b8c639176a5e70b5a024765daabd177ecf231091ab8f624"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sidebar/sidebarLayoutMonitor.ts: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 174 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87aee7b4c76b7d63e186a3e8964c94ad6c46bf6c5f41307f4e8d1efccd525dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/mq_cmd.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 76 free functions. The bar is 500 significant lines; this is 174 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mq_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67cb12e0cd112d86053adf7d27851651e41caf97870ce7e1c57bfbb8d730c6d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useExportTracker: ClassTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded), 61 methods. The bar is 400 significant lines; this is 138 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"306c4b5a46a789a46ae9f6caa4a881ea4e025a18ae674ea27fd500232164ff03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ai_codebuddy_cli.rs: FileTooLong \u2014 671 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 171 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb4bd756d45c2528d5166a0fb01c62587f664e92981a7190f0831f03e15a376"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/mongo_cmd.rs: FileTooLong \u2014 671 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 171 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mongo_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa658ad79a65639c216b28123b739be1fae1ccd10ffe5f2f5aaed686b824920"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DdlBuilder.buildTableDdl: MethodTooLong \u2014 buildTableDdl runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce52b427e3f7d69f5de241fdba4cda22f0871500dcfa83eecdd3434f8327e1f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: McpAccessPolicy.to_v1: MethodTooLong \u2014 to_v1 runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/mcp_access.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d18aae1dd7c0eab4ab9432d28b6ad076517fcbdd70778ae0b8157fec0ca96a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/clickhouse_driver.rs: FileTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 41 free functions. The bar is 500 significant lines; this is 168 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/clickhouse_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4757537733ac6dc0712267924a0d53d40c7a2bd76e6129247262990bb70fd9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: dbx::commands::document_cmd: TooManyFunctions \u2014 40 free functions. The bar is 30 free functions; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/document_cmd.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9996c44ff0d027c9a4156d419cf1dfb36d5d04b50ffd446c44b152b7cc4622"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: connectionConfig: TooManyFields \u2014 40 stored fields beside 1 method. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e229dc3302634331cf2222dd4acbac49aad11132a29c4d3d1cceb4deff152c98"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: connectionConfig: TooManyFields \u2014 40 stored fields. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e085a7f30c8578031ccf318aeff2e0b3d25567fddd72856997ff900edf11c7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useDataGridSelection: ClassTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded), 62 methods. The bar is 400 significant lines; this is 133 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":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7386d48458f73548fe404341721b890f135b5f6904c60ca052e2f327e063c6f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ai/plugin_tools.rs: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecc278fae27acc38730ae18819cd96aeeb6171c1d85f8c76c7eb5004839ecf4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/package.rs: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6b7de1cd02d1d8f4e618c495452a5110ca47f028d14b9b23c3b750c0dc2598"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oracle_routines/analysis.rs: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: Analysis (2 blocks, 142-775). The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a536a50c184350f2916c81d46bd98246d774be3e8237cbd8a10a650069e6a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::pl_debug::lifecycle::drain_connection_inner: FunctionTooLong \u2014 dbx_core::query::pl_debug::lifecycle::drain_connection_inner runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/lifecycle.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"691c5cb16a245b3e313675b3285d0e996bf7cbaa4d1656b2eeccaed7df80e170"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/AbstractJdbcAgent.java: FileTooLong \u2014 663 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: AbstractJdbcAgent (19-953). The bar is 500 significant lines; this is 163 over it, 1.33\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":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df4df092bcbe2d22cb6674e7dfcd14cef3b1f15dc3993ee7577d8070c25e4c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/oracleForeignKeys.ts: FileTooLong \u2014 660 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 160 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3065a14b66d7b40786cfc21efaba8afd19921a1c5dbf70e8740481bd3a3530db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: plDebugNativeNamedCall.result: MethodTooLong \u2014 result runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"f104441f659bd916ab31c7c09aeb7408130e8da40d510fb531cc904f95a26c72"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DbxJdbcPlugin.handle: MethodTooLong \u2014 handle runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bb85c28642482d7b9e7aa7f2eb67e6be378ec141ed1f9692e77e100253431a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorDiagnostics.useQueryEditorDiagnostics.refreshSemanticDiagnostics: FunctionTooLong \u2014 useQueryEditorDiagnostics.refreshSemanticDiagnostics runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9dc3f90c8fc4f481bc7d9c1033deabdfb0d1ffc9fcf8ebb89797a917960b3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useNativeJobExecution.useNativeJobExecution: FunctionTooLong \u2014 useNativeJobExecution runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNativeJobExecution.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b129b5fcedc7a92052b713f3d20e132efec5113ed51be8165431f0f377759e48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_web::routes::mongodb_dump::receive_source: FunctionTooLong \u2014 dbx_web::routes::mongodb_dump::receive_source runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_dump.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ed4588bb2076115a60767e4211f4288db6c7ae379a8a9669771fdfc043a76e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useDataGridLargeValues.ts: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: useDataGridLargeValues (115-840). The bar is 500 significant lines; this is 159 over it, 1.32\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6955469fb1befa1414f41f705ef917bbaa1dced0295556ff26ad2de9ddfe44d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PulsarAdmin: ClassTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 4 blocks, lines 27-817. The bar is 400 significant lines; this is 125 over it, 1.31\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/pulsar.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"74474f6c0ae0fcdf36adf1df8e906cf0ac60c79a088fd6498b24377b5ba35f0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/oracle_view_rename.rs: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc194202e4fd21e5048093566a9df8daeb1b8eed4e2cb87720f97e6374ba9a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQueryEditorExecution.useQueryEditorExecution: FunctionTooLong \u2014 useQueryEditorExecution runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorExecution.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"842596b803415e693757050d34f98edeccee6f1654b46f7c70446d80d8f98809"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::execute_multi_mysql: FunctionTooLong \u2014 dbx_core::query::execute_multi_mysql runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"15010a835c69d15942f9b2409453d9108357fc26977b9dea6829cfa7b659f115"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginPackageInstaller.install_bytes_locked: MethodTooLong \u2014 install_bytes_locked runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba831feb5051a6a06120ab949ba194e7ad46476f6a71d89dc4761dcd7fef970e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/oracle_routines.rs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5865eaf6debd5f8e9773f0f8756919d4017899a8bf6cdb5ec7b7ae7f5e32f1ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/duckdb_worker_process.rs: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: DuckDbWorkerClient (2 blocks, 63-788). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_worker_process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b85981d0ab17c050c9618f9ed456ef17abe8ed2bd7407713222cf671f7e8a6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: server: ClassTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded), 98 methods, 30 blocks, lines 137-2351. The bar is 400 significant lines; this is 122 over it, 1.31\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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f91f0e452b44472a43ed42a815df36b16ce45e5c2978664967bf76a45f49bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/oracle_type_data.rs: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 151 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae59e1ccc197421019f43a32333cb399d2849f6483d52f370965b838779db9c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: server: TooManyFields \u2014 39 stored fields beside 134 methods. The bar is 30 stored fields; this is 9 over it, 1.30\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffc5b7fda71b36e3d3e0357826f63675555ef7fe7fed8421825ca68360c5e91"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlDebugBreakpoint: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/PlDebugBreakpoint.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f0a3b89f40ee63885df79e4997b80c2914943ca07afe7d12aa7d5d27e717f3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: dbx_ai_provider::ai_opencode_cli: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_opencode_cli.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6801ac7f8188c6cb82a8e8486ed641488d20f55b365c7aa0b58f9031ad179216"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tabs/tabPresentation.ts: FileTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 146 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c7ec71c65a4289ece8138c2e0105d26d0af1bb96fb645805fec99b5bac9ae0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::indexes::build_index_sql: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::indexes::build_index_sql runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/indexes.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc5f3870ca4aadd8a32f08be6544b72214c78acbd80a44f55de39aefcab6737"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_ai_provider::ai::stream_openai_with_tools: FunctionTooLong \u2014 dbx_ai_provider::ai::stream_openai_with_tools runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4658}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab494dd5c23c122169920e478c82195a8c0ddeea8fc0d15d37c64b16a351ae5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::sqlserver_manual_transaction::begin: FunctionTooLong \u2014 dbx_core::query::sqlserver_manual_transaction::begin runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/sqlserver_manual_transaction.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67e84edf5e7fad8eace4a7d2c05142bde3c55f4b237e52aea0b356f272091cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::native_job_changes::scheduler_attribute_steps: FunctionTooLong \u2014 dbx_sql_schema::native_job_changes::scheduler_attribute_steps runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb8170d4c4e27451a743cd373cca1912d94edf6baaa957447fa84dd0d45fd20"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::starrocks_layout::build: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::starrocks_layout::build runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/starrocks_layout.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26d246595687fe6b806c34cd3db9303a2d0ebc82dc9b7c52bd52dcbe598078d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: InstallTabs.InstallTabs: FunctionTooLong \u2014 InstallTabs runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/landing/InstallTabs.tsx"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a400aa7c6c550ca06c6efa9d7ffd6c3967de31868256ecfb9fc653866494fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx::commands::mcp_bridge::handle_sql_approval: FunctionTooLong \u2014 dbx::commands::mcp_bridge::handle_sql_approval runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"6715efc014a3b082479b9bd84eaa22844e970a54011dcc3983aede9279c735d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridActions.useDataGridActions.onPaginate: FunctionTooLong \u2014 useDataGridActions.onPaginate runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88588f9cf7b74b54cd36e8a657e99a65807c61fec502a130d1d6472f6485f75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQuickOpen.useQuickOpen.processDatabaseTreeNodes: FunctionTooLong \u2014 useQuickOpen.processDatabaseTreeNodes runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"254e10c0e75f9dd193fd716eeaa9b3d23128617e623ca3974ec9d5581a5875e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: doltVersionControl.layoutDoltCommitGraph: FunctionTooLong \u2014 layoutDoltCommitGraph runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dolt/doltVersionControl.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bbc851e5c2a596be66d0e6ee6a90a033eaae13e0a81d7becf8a0d0b8bb2106"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::sql_file_import::execute_statement_with_progress: FunctionTooLong \u2014 dbx_core::data::sql_file_import::execute_statement_with_progress runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"318d4d0e52584855ada7818ca58557b3dfb086b7867639d10ad90459b0a05da2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: H2Agent: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"74218a1c389b86cbe4a8c5a5ce9f6ff7153a6ec2228349ac4afd7f4b79c652a9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlDebugNative: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugNative.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"097b62fd8753e52a54cd870bc4267f808202d36bf6a475f10a55805a1b081a6f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConnectionConfig: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"523b10fda3d0ea8ce165c0ab17be09f95b0792cb2a9fbf43c754eed8479b72f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: QueryResultExportRequest: TooManyFields \u2014 38 stored fields. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b730ca4c74232df88a7c9c7c3ba2f90bd56e050340f7e1df94f26f03a079b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oracle_routines/references.rs: FileTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 130 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/references.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a04d644cb4773cb7f8eb0db879a2afa2dd4f3fa7df3fffdcd62b2b3103275e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSqlExecution.useSqlExecution.doExecute: FunctionTooLong \u2014 useSqlExecution.doExecute runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac714cfc7a5d62637fc81e7e1f52b59f81316b943a57cafa44a8eb34de60912"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: redis/redisValuePresentation.ts: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ade02f29e774879033aea5db55a0021a2443b8383f748e922321400c623b36f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::request_large_value_internal: FunctionTooLong \u2014 dbx_core::query::request_large_value_internal runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":3540}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bea42cd999693e32ae6cd87f9faedf68daffb85442458ca58b7b3283a8076db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::postgres_object_source_sql_inner: FunctionTooLong \u2014 dbx_core::schema::postgres_object_source_sql_inner runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e85bc0564c2cf180005d3b989dcf347c33588038ac83426458852ad156d9b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_drivers::db::transport_layer_tunnel::start_transport_layers_internal: FunctionTooLong \u2014 dbx_drivers::db::transport_layer_tunnel::start_transport_layers_internal runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/transport_layer_tunnel.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25eafd03f007108fb85b8d7b641bb9110c0489d1bc03ab107da7311bf7d7b4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql_dialect/ddl_profile.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fdf79342eb77f401ac9b840b15173b17473e06cff119f01b141e3bdcb8ae3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: persistence/state_persistence.rs: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 123 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/state_persistence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2eb51fb3c591422ec5d8fa9b36498cc928e66a8d591d6ee9f1d2a218373e4bc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PlDebugManager: ClassTooLong \u2014 498 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 98 over it, 1.25\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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddae397c06b9e9cdec591c9643fd114909aa9a05226a9537ef112185fa072b3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SpannerAgent: ClassTooLong \u2014 497 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 400 significant lines; this is 97 over it, 1.24\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":"agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f274568655d9b7354942670233c179a7983852c7475d169d0c209e1317d7a39"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DuckDbWorkerClient: ClassTooLong \u2014 497 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 36 methods, 2 blocks, lines 63-788. The bar is 400 significant lines; this is 97 over it, 1.24\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_worker_process.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dab33d68d17a3769889d707e6e30519a8e82a928d1acb7b92b9264c30f3866"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/oracleTypeManagement.ts: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4bbf7b293f29e660d07b06cabd01e97f7ccf1961cfd5cfb04b356b6682564d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ai_pi_agent_cli.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_pi_agent_cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14d8c65d435c131f9be5095af51f9ca57a932c5c583adc39e6307811a0ddd7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_data::data_grid_extractors::sql::write_sql_deletes_inserts: FunctionTooLong \u2014 dbx_sql_data::data_grid_extractors::sql::write_sql_deletes_inserts runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b5f41bbf9258687c6ded3ccdb08fd7aee4debe2ae8c8f8e3de3eacd8cb4de5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_data::query_result_sql::build_query_pagination_execution_plan: FunctionTooLong \u2014 dbx_sql_data::query_result_sql::build_query_pagination_execution_plan runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3861ed0d3f9e2de880547f080b58441d87fa941ece67fcab7ed77e128e6488"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/StandardJdbcMetadata.java: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: StandardJdbcMetadata (16-935). The bar is 500 significant lines; this is 117 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7458ea4810198c5fc3d467a7f6f76b6d68ae6768fdf4303fee3cf9a18206d33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table_structure_sql/columns.rs: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/columns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01b94f6ea07068d4c23f9fa2edafb52c9ebb7fab7b6501790612289b8004e10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColumnInfo: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/ColumnInfo.java"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4f671fb3d3c057c3baafe27c7a88a47273a9b7527ab5b0934a5c89a7b35c60"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IndexInfo: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/IndexInfo.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb2f83414b85a80eaa918f4b4dba6ac6151bfe64ead7ab380e7249f045d25d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: server: TooManyMethods \u2014 37 methods, declared across 3 files: hive-go/metadata.go (17), hive-go/query.go (12), hive-go/main.go (8). The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/main.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1142b451104e38acd601061231ed4fd5202933e515b5e94128635583221edf5e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Analysis: ClassTooLong \u2014 493 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 2 blocks, lines 142-775. The bar is 400 significant lines; this is 93 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e364fffd97000b5a9ad6d94815f6538f18e27ced7bb32d60d398e8192185891d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EwkbWktDecoder: ClassTooLong \u2014 492 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 92 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbc52070b76ec8cfe95ce132ec085b4fd60fffa50a09d74678c5a75a744057f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridLargeValues.useDataGridLargeValues.hydrateVisibleLargeValuePreviews: FunctionTooLong \u2014 useDataGridLargeValues.hydrateVisibleLargeValuePreviews runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4928c5e2b9f2f94bb50c6b482ff26bfa87eba0df6aa8df864d0b08f0cf68aa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: oracleRoutineRename.executeOracleRoutineRename: FunctionTooLong \u2014 executeOracleRoutineRename runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1581575f230b1f5e99164217762fb2ef90fc1e9f528e77ed46f5b9f317ff84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_mysql::mysql::execute_result_set_with_prepared_protocol_on_conn: FunctionTooLong \u2014 dbx_driver_mysql::mysql::execute_result_set_with_prepared_protocol_on_conn runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6544}}}],"partialFingerprints":{"codehealthFindingId/v1":"848a1977556d3bae200d7a702f42c7f0d24ed6a11810b48e654429802637af75"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DbxMcpServer.execute_redis_command: MethodTooLong \u2014 execute_redis_command runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b350cfa0e63dc0728540929ae16fbf7ff15e2acef8bb029d5e94c2aab99ae25"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::native_job_changes::native_job_mutation_plan: FunctionTooLong \u2014 dbx_sql_schema::native_job_changes::native_job_mutation_plan runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cc58c7e635754163bf59e7dd66f84f16bd7ef084fdc1cb83e35f56f154b81f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StarRocksAlter.build: MethodTooLong \u2014 build runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/alter_dialect.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe67620016fb4d9dc05d47351fd375ea2907312f0336f73b740b032d3654150"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::column_alter::build_single_column_alter_sql: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::column_alter::build_single_column_alter_sql runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdba9d3a4f73034324bdbc51e11f370793de7eee12c2d7b86222523f49214009"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: [lang]/page.tsx: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 111 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d879f31961f4051abd18df5a7d7e1d39a8f1c96b74813d4b69cf549e00123f1b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Db2Agent: ClassTooLong \u2014 488 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 400 significant lines; this is 88 over it, 1.22\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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c9f798b7f5dde0acc8b934005d2662d581352b743c6ca044b02bba24d6a621"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queryResultTransferDdl.rewriteCreateTableName: FunctionTooLong \u2014 rewriteCreateTableName runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d754bb5176897d11f9146045d66b297232bc167270f6beb70bb949087124b6cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlStatementRanges.topLevelSoftStatementLineStarts: FunctionTooLong \u2014 topLevelSoftStatementLineStarts runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"314e255b66b4dddabb3a48c2fa93cbf31c9a83bdf39d213a60ad7bffdba8a042"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.connection_database_info: MethodTooLong \u2014 connection_database_info runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":6753}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9f00df3454a0a326d0f4c347ded4ecdf29afa95f513198a6ad571157ba7c99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlDebugRegistry.register: MethodTooLong \u2014 register runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a57ac71313d9c1591663499adb0ea7eb5affc5cb7f61b102ea8e7a4064e6760"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/sqlserver_manual_transaction.rs: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 108 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/sqlserver_manual_transaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"024968335355153392c9ff3afcd72bf4cb3f35f9d1376fa25962c9a6b8978d08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dev-host/server.mjs: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 89% of them inside a single declaration: createMockHost (77-731). The bar is 500 significant lines; this is 105 over it, 1.21\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":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7cd438176711746b951eb11d1645222189146a0ebd225e7e47786660501433"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/kafka.rs: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: KafkaAdmin (3 blocks, 62-646). The bar is 500 significant lines; this is 105 over it, 1.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbe085944e64ec8b5c2708f31d415446f31a322a80f7fa053b09de1236aae39"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: server.dispatch: MethodTooLong \u2014 dispatch 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":"agents/drivers/rabbitmq/main.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"acad033cebc8176d554cca5525a818f9b5bb903cda1de0f91c87b5db4fdfaac3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlStatementRanges.topLevelWordsInRange: FunctionTooLong \u2014 topLevelWordsInRange 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"826cb4982589d2f8111c1fae72f73b21794235dfe1e5dc82d2fbd2d67570168e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: server.createMockHost.server: FunctionTooLong \u2014 createMockHost.server 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":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08cb11a818e6ea4118e23b360b6d9381f115a0cda82c5a0c04216925643fe16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useDataGridSelection.ts: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: useDataGridSelection (52-761). The bar is 500 significant lines; this is 101 over it, 1.20\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":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54ace4e9fa04b913398026301339a057151adc9acad465a75b137988bd729bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/oracleTriggerPlan.ts: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"addff8425a819d58ae38dfac2a52bdbfd52e281be21c3a2346adf0e37130d6ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/mongodb_dump.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff83caf08de5e26407c6da9633b2d9e387c0d57b79dac54d8c7a8f3f4187dbb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AppState: TooManyFields \u2014 36 stored fields beside 182 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dba03fe108666a705ff687abd8d438da929703f9c0046303084941d1e3d3497"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IoTDBRpcDataSet: ClassTooLong \u2014 480 significant lines (blank, comment-only and punctuation-only lines excluded), 62 methods, 63 blocks, lines 15-856. The bar is 400 significant lines; this is 80 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b49975f2fbf26ae3586649edd4580fbcd074f522560b25ffb7dc9d8197a4426"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: QueryPageResult: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/QueryPageResult.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d363eb00909545118533cf8888c32c528114725314eb0523b33f9b30ca98864"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: server: TooManyMethods \u2014 36 methods, declared across 4 files: iotdb/metadata.go (17), iotdb/query.go (12), iotdb/main.go (5), iotdb/driver.go (2). The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/main.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7c8fac46fa3a56dc178f82c08d93194a07a2835de5c29170e57d253d02ff7e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MqttClient: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"788e04f73a8a753ad33a603b51dff67d2c5734ec051866b03687cda8d0f2fee4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DuckDbWorkerClient: TooManyMethods \u2014 36 methods, declared across 2 files: db/duckdb_worker_process.rs (32), db/duckdb_query_sessions.rs (4). The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_worker_process.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"190cb4d0d807fcb3046687daaed6aba2ace41b6abe8228769dfe2d204c97d689"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: cassandraConfig: TooManyFields \u2014 36 stored fields beside 2 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf16c5ab72555b1afb5d4e8dd68d456389b5c743b906c888ebf9063cc81bdfa5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: etcd2Session.status: MethodTooLong \u2014 status 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":"agents/drivers/etcd2-go/status.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"39139e27e9928fd8517a77945e1d8f62855d5309bcb147ba28b8787ba10b3d45"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: plDebugNativeEntry.executeStatement: MethodTooLong \u2014 executeStatement 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":"agents/drivers/oracle-go/pldebug_execute.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dfafcb730c11eded6d46390ccc2ceb5ac5b575f577b1c519a23395e5fa7a6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useTauriEvents.useTauriEvents.setupTauriListeners: FunctionTooLong \u2014 useTauriEvents.setupTauriListeners 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":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e527d18b9daed915a0ba318b7495ab75c489d47ed345f052441796b62d2e1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useVerticalOverlayScrollbar.useVerticalOverlayScrollbar: FunctionTooLong \u2014 useVerticalOverlayScrollbar 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":"apps/desktop/src/composables/useVerticalOverlayScrollbar.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d676e3af359887d83fc5eb9363ba46afb33c589fdfeed11e818943bcf5e0c68"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_ai_provider::ai::stream_responses_with_tools: FunctionTooLong \u2014 dbx_ai_provider::ai::stream_responses_with_tools runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4842}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c62c37417831bbe5904900e58384b4b9831d14b9ec25262f24d8d74d3ca2a53"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::data_compare::build_sampling_select_sql: FunctionTooLong \u2014 dbx_core::data::data_compare::build_sampling_select_sql runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaa0da3dced98837079e3d86c6acd8a558f34894a6737b37953e2a57c418d5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::execute_schema_diff_deploy: FunctionTooLong \u2014 dbx_core::query::execute_schema_diff_deploy runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5681}}}],"partialFingerprints":{"codehealthFindingId/v1":"675b735f7d64ac3a7004c87508b4637260d0b7dfe364a8c0bbb867ab3f23b7db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::external_driver_gaussdb_m_indexes: FunctionTooLong \u2014 dbx_core::schema::external_driver_gaussdb_m_indexes runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eea2663d36de327f322a04d683bebd0a7bec7d93f26585d1c6c830fc3a7d858"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::render_sqlserver_table_ddl_details: FunctionTooLong \u2014 dbx_core::schema::render_sqlserver_table_ddl_details runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":19243}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b96825b8ff8838c96580ce3f173b236024443337cd1167efe026dae8760323"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_mcp::transaction::handle_command: FunctionTooLong \u2014 dbx_mcp::transaction::handle_command runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/transaction.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cb4554cba58e7db0dc9444ab3138b5e4eb22c557edc9a76c90b9a2be052045"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginManifest.compatibility: MethodTooLong \u2014 compatibility runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d9b899541de5614a8071e35ca4d3f81fb20e5c2c17c30b50f2c67449ea865a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: krb5/krb5.go: FileTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: Krb5Mech (21 blocks, 122-1010). The bar is 500 significant lines; this is 99 over it, 1.20\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":"agents/go-common/go-gssapi/krb5/krb5.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8d6d6f0284eb6f3bc26dff98d55f93f7d41b6e65a46d619cdce366a701ba50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scheduler/transition.rs: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 98 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd4639f01e2ddf24646d700e062f54911452cdffb7bd445696b22eff1b3ab05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/app_settings.rs: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 68 free functions. The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/app_settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59047caf15bced072359cc32fa5aa634a194eb011a8a9412cc62647c2e975360"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useQueryEditorCompletionMetadata: ClassTooLong \u2014 477 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 77 over it, 1.19\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":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f0d1221760afa96fc82edd8f472ad3a985161b31c3dcd0b96091812c9b9680"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PluginSidecarSession: ClassTooLong \u2014 476 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 34 methods, 2 blocks, lines 178-964. The bar is 400 significant lines; this is 76 over it, 1.19\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/runtime.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5834612b3a77e08ad7219a4ae5c8fc0914550f64be3e3a79991d16013957f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JdbcExecutor.executePage: MethodTooLong \u2014 executePage runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1d77511cf217838048e72b1f6c752790e8fca26aec7d151b0dee007c965f21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.applyHiveParameters: FunctionTooLong \u2014 applyHiveParameters runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db8261b388172be6efb2b366316655e7985a5880bbfe8f98bc43bb1b3b5de79"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.applyHiveParameters: FunctionTooLong \u2014 applyHiveParameters runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c185b973f15b14eec5ed6bea0efaf7e2afb778c173b53e8bb876e19aead814"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: server.dispatch: MethodTooLong \u2014 dispatch runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5979c7dc0eb56946241c7473086c55d9c4ce4e6bf76b0359358e3a2b2e10dba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::get_table_ddl_once: FunctionTooLong \u2014 dbx_core::schema::get_table_ddl_once runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":11735}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d811a8c32447a10573e12df304d6f3b999147846ba6131ed3061b51f6efbe4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native_job_changes.rs: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f006fbe2a2058eb68a6cae46f2f5917502b5b435d500cdaa04d592032356546e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useQueryEditorBatchSelection: ClassTooLong \u2014 473 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 73 over it, 1.18\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":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f8115c476fd32125dec4705139b33a59d5ce48ed280fff4cfe308906c1b033"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useDialogSources.ts: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded), about 75% of them inside a single declaration: useDialogSources (165-738). The bar is 500 significant lines; this is 91 over it, 1.18\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":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60239567f389da5c8c25080bae5c21b80d77c487006b699c535731f09eb3c5c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlStatementRanges.trimRangeEndBeforeNextBoundary: FunctionTooLong \u2014 trimRangeEndBeforeNextBoundary runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"9593076ac436900486228f7bb3014b1dc7828e0cd4b59a05b2ae4f2458f12c7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: oracleViewRename.prepareOracleViewRename: FunctionTooLong \u2014 prepareOracleViewRename runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleViewRename.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c8b4b5f57fe75b7c30b06f21f7f956c2b012a9fcdaebe0c4d8063e6a05e037"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_core::object_source_sql::validate_oracle_object_source: FunctionTooLong \u2014 dbx_sql_core::object_source_sql::validate_oracle_object_source runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bb75e11e0bd7718bf9bb4c6701101697e9d27728cddc51bee37e3b0f4619bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/marketplace.rs: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 89 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/marketplace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf2c3478db03e2a9ecbdfa81b0a52df88f24ad81dff54408b2014f35fb5ff06"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dameng/parts.rs: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 89 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng/parts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c116b759d10d76b99c80f64cd2862b157012f3293cb1102e744bb43dc361d931"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentManager: ClassTooLong \u2014 470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 61 methods, 3 blocks, lines 881-1613. The bar is 400 significant lines; this is 70 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_manager.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cba1186852efd087237a0e16688d33ab130409537b3d3af638b43dd138d34ee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: H2Agent: ClassTooLong \u2014 469 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 69 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1511e4e125a65c91cf5fef0e574d89d3a389667a3bb954a2a396d73fac55bfc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transfer/packages.rs: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8cadfda62d1638c6baa0a0b2c148db5f386ebc513d621d4eb471b152fa016e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: connectionStore.useConnectionStore.loadTableGroups: FunctionTooLong \u2014 useConnectionStore.loadTableGroups runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8514}}}],"partialFingerprints":{"codehealthFindingId/v1":"370c8a97839567205bc4112c39911f49ef90651e974abf789704c26553db97df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_ai_provider::ai::test_connection_core: FunctionTooLong \u2014 dbx_ai_provider::ai::test_connection_core runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ead36eecfa4cc0392ca79f2634fc4d25fdbced5357210e5e6195dda05f893ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::native_jobs::operations::scheduler::run_create: FunctionTooLong \u2014 dbx_core::schema::native_jobs::operations::scheduler::run_create runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"89704299fd3f920011ad15223fb194cce5c825a29934713237fc0e88538f6886"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_core::object_source_sql::oracle_routines::analysis::package::body_pass: FunctionTooLong \u2014 dbx_sql_core::object_source_sql::oracle_routines::analysis::package::body_pass runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce67b826e3a7cae0c5904b32a9e7a90116f7931adbf3473c518c0836732fcb06"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OracleSchemaSyncTableDdl.render_triggers: MethodTooLong \u2014 render_triggers runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff/oracle_indexes.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2e0f7656314b886866f8df4994ec49618861aa28b320afaa7be200baca5658"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ContributorsExperience.ContributorsExperience: FunctionTooLong \u2014 ContributorsExperience runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/contributors/ContributorsExperience.tsx"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d838fa34a2c1d9de13bc2829dcb9f64b84624736fa07f692ba9d9abe558900"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/oracleRoutineDeploy.ts: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 84 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f230293a4f376abf77b9f3e27a37274ffa74245b3a0043098339114ef058cbd5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MultiSessionJsonRpcServer: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4405717f1a9077b08c88087d553b1b928a4fc2bc9a3dc1cca89724b4c122f6a8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: server: TooManyMethods \u2014 35 methods, declared across 3 files: argo-go/metadata.go (16), argo-go/query.go (11), argo-go/main.go (8). The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9c11e896fd872b20774ebeb85e3d2f78b54aa189de82a5a506a5d8e9f8ba49"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SchemaDiffPreparationOptions: TooManyFields \u2014 35 stored fields beside 10 methods. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"1694ef9b527071d3dee99ffa4039ceca9fb4a88837b2f926deea5af7138e1fa3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: persistence/secret_codec.rs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/secret_codec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7420d545f1baaa77114cd95343fc3bf18bf6939756f843404474713d733a83ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: plDebugNativeEntry.inspectNativeCurrentProgram: MethodTooLong \u2014 inspectNativeCurrentProgram 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":"agents/drivers/oracle-go/pldebug_entry.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2778b16d6bb3ef6854f510de21c8c489f46e05abec7581fb3eec1ff18e56fc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::structure_plan::plan_table_structure: FunctionTooLong \u2014 dbx_core::data::transfer::structure_plan::plan_table_structure runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/structure_plan.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"45233f60a91cbece822397cb6dbecec5787e5703b7ea297155c1a51375c85b84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_mysql::mysql::execute_query_on_conn_with_limits_progress_resolved: FunctionTooLong \u2014 dbx_driver_mysql::mysql::execute_query_on_conn_with_limits_progress_resolved runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7321}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafdc22e067604868aa83678cde6deac9b0e4cb4d39a1ca17bba48bb92cf6773"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_data::data_grid_sql::format_grid_sql_literal_with_spatial: FunctionTooLong \u2014 dbx_sql_data::data_grid_sql::format_grid_sql_literal_with_spatial runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2899}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84ab7a7eb9252c6eda0c4cfcbf279f57c542037bfc235b96086aad4b927bc71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ai/mcp_access.rs: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: McpAccessPolicy (6 blocks, 212-935). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/mcp_access.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a844874e1af518d6b67352cea4e938f6b1bec1e7855caefbb00335690574014"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useQueryEditorDiagnostics: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 61 over it, 1.15\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":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee51d4960b3c50b2a6d47b7279fa0f179bc0365c2878e9f7550e3e9964013f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usePluginShortcutHeight.usePluginShortcutHeight: FunctionTooLong \u2014 usePluginShortcutHeight runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/usePluginShortcutHeight.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0e6dd1db0dcd04e204b3e43af920f89c935c58bc296cf4da86e1e793b45a20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.insert_connection_pool_inner: MethodTooLong \u2014 insert_connection_pool_inner runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca360458f4223b96cf5825a85ca7ad2797ad831d6a9374b0b2470aa007ec39ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_agent::agent_service::install_agent_driver_from_registry: FunctionTooLong \u2014 dbx_driver_agent::agent_service::install_agent_driver_from_registry runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa90b1b2a479c5f43acad4a2b5e783433a94bc44297727dc5f5e394874960d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Analysis.select: MethodTooLong \u2014 select runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"0537905974af0eef7e9ad9c94633411ff267af4ce9fc3d89d0c55225ab98d49e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_jobs/service.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa228af9bd73a6b44774398d68b09d05a0968e18bd4a2e253960ee1aa9e3242"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataGrid/columnFormatter.ts: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 70 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"289b44370bfc666bbbfb31975c137a6ecd19fb85cb54619382feded834520c27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: etcdSession.status: MethodTooLong \u2014 status runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"agents/drivers/etcd-go/status.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"657023f70521345ca28922f94cd674c4b54b0802fbe96d5a8838e04f8025c864"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verify-partition-ddl.main: FunctionTooLong \u2014 main runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"agents/drivers/oceanbase-oracle/scripts/verify-partition-ddl.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0c6c16a3bd9e547e89ccd41a5dc3137626a686365594104f41dafa1c94a90a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridExport.useDataGridExport.submitBackendExport: FunctionTooLong \u2014 useDataGridExport.submitBackendExport runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d60c48fa5065efd630f83632253158ed845bb388939593076abfe4a15e65fcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportTableData: FunctionTooLong \u2014 useSidebarTreeExportRuntime.exportTableData runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"3580d59497557d2cf44323803f08d0374614294bc095d77bda9d98009fb0def8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sidebarActiveTabTarget.activeTabSidebarTarget: FunctionTooLong \u2014 activeTabSidebarTarget runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f264100e0f5294482c958936b6dd18419bba359969f7458cef7fb7e99e8a395"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: connectionStore.useConnectionStore.normalizeConnection: FunctionTooLong \u2014 useConnectionStore.normalizeConnection runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46dfd600c0d1107bc987f592d8fa99f887c423691cbb96ea3b452f978de83d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queryStore.useQueryStore.duplicateTab: FunctionTooLong \u2014 useQueryStore.duplicateTab runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d440088f3b1ffef6bd930b9525b138a7b8f08d55969b2f2f0a79f8f3b2ee2f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/rpcdataset.go: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: IoTDBRpcDataSet (63 blocks, 15-856). The bar is 500 significant lines; this is 69 over it, 1.14\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":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6dda064e12a3df2d9292f5f657d844bce6dc30f5ecde1e0b5eea653af34650"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TrinoAgent: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be50eb2da426c6f3baff0db3b63d5798a5ba7cd6e0e7b4bafbe4030c1c5ecf7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PluginSidecarSession: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/runtime.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff784d33599845d4f50aa1c031bc09a6d2270861133043b400aeffff57d4df2c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: dbx_web::routes::app_settings: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/app_settings.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8f7b4249a47d3367eb460e5c4b2a3d1fa1c7bbd7013018fcc82433512b9d7b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AiConfig: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"98903e3ea6c6b205e4997045493c9bc00ea0f8cf9d5a91f7195b4fcc7c308a6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent_connection.rs: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 57 free functions. The bar is 500 significant lines; this is 66 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"645a873cfa6b89e9f69e4893e0e3a8634b04ef4e13a686ded9cef7a3c6b76027"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/oracle_type_migration_sql.rs: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"928647a1e9e61d0fc1ccef88baaef9db7963b945ecf9103eab4526926622fb35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.plDebugNativeDeclarations: FunctionTooLong \u2014 plDebugNativeDeclarations runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_variables.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d782034a6f5019bf37222d3025be46556cc60dfa9c8a4e42961b8f6b4093e90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_postgres::postgres::build_custom_type_ddl: FunctionTooLong \u2014 dbx_driver_postgres::postgres::build_custom_type_ddl runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":7984}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f47868becee59382fccdf79ec829e9e909a31cd23059681a1bb429a8b1bc7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LandingSelect.LandingSelect: FunctionTooLong \u2014 LandingSelect runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/landing/LandingSelect.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"04df93d1d1bbafc9057e406d3502d8c0097c026ed7f6116fbf8ffdb36e161db0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/sql_file.rs: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 64 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/sql_file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"869d3a01105c01194b58fd6b4ae386063feb7d1091d31a9dd25e9d22ba5df5e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: server.plDebugProbeOnConnection: MethodTooLong \u2014 plDebugProbeOnConnection 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":"agents/drivers/oracle-go/pldebug_probe.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6befb4271aa5390c46e1d133d0dee37983dcee18d54d34634d4b0d3c2be35286"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.plDebugLoadNativeTargets: FunctionTooLong \u2014 plDebugLoadNativeTargets 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":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb3dec6741796692c7959eb018b9759c1f6e1bbe4f0f2cae63a44596a46ea5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datagripImport.parseJdbcUrl: FunctionTooLong \u2014 parseJdbcUrl 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":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"120f70089853b15a3dcf7c9a65dbb03708826604aa1751dfd365e9913f5122e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pi-mcp-bridge.registerDbxMcpBridge: FunctionTooLong \u2014 registerDbxMcpBridge 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":"crates/dbx-ai-provider/assets/pi-mcp-bridge.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0691104d67bdd42e2de2fb12de7ae916dfefe99db8e90339106eeaa1bd16b5d9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useDataGridColumnFormatter: ClassTooLong \u2014 447 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 47 over it, 1.12\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":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e298c977917d05c5848c37e00edaeb111dc77d8676083931a493e24dd33258"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/databaseAuthorizationPlan.ts: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5756511c5c71192da308fb7aa97c1cdc4add2c08f8604fcef70c34bcdd99bf0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/nacos.ts: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/nacos.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"795271fcbea76ae9bd51f2de904fa420024b519b9f06b361e153d67aee14eff2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DiffHunkBuilder.buildHunks: FunctionTooLong \u2014 buildHunks runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DiffHunkBuilder.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b44f217a62ea2484022033c2a571d1ed487be5210c333b66cded8170d939ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useTabScroll.useTabScroll: FunctionTooLong \u2014 useTabScroll runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTabScroll.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c45f4edc91f890a3d9a5810835b3cc0d099eb264ceba6a13913c3d2853b30e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dataGridContextMenu.createDataGridColumnContextMenuItems: FunctionTooLong \u2014 createDataGridColumnContextMenuItems runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea95b5a1c8501989596cb6a5be670093451d16e239403ac94d68ff523b44f795"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcpAccessTree.buildMcpAccessTreeRows: FunctionTooLong \u2014 buildMcpAccessTreeRows runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mcp/mcpAccessTree.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6ef711ff8e3e3ee2357fdca2db834d7444788bb8a48003a298a39a5d419ce1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: connectionStore.useConnectionStore.loadTableForLocate: FunctionTooLong \u2014 useConnectionStore.loadTableForLocate runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec9259eed54b48a771162b57ba4a8f9dbdabb9ba74ffa69e6361bb02972e04d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::list_completion_objects_once: FunctionTooLong \u2014 dbx_core::schema::list_completion_objects_once runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":9269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ad3041fb2441a083a091a912a64628748bda7fbfa75c3ac3834a8ae1dc1ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui-preview/record.mjs: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6470f9d5de52792d313a51dd1dca3400de45d18eb1fd1864d8e8775e5e752917"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ai_grok_cli.rs: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_grok_cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3986254d923a2502c1d7d333d665e39d16e0e2a02c1ee35694a93b9345196eaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table_structure_sql/triggers.rs: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b231046bb74567c4fc33e55e8c6b7a5d59b9974bf1d30aa97b1a02a4bdfa5a2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: server: ClassTooLong \u2014 443 significant lines (blank, comment-only and punctuation-only lines excluded), 68 methods, 23 blocks, lines 144-1099. The bar is 400 significant lines; this is 43 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":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2892d57a8c2966b4596c23fbdf6f562e99c3b40b17f728e3fa315008b3ae0a58"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useDialogSources: ClassTooLong \u2014 443 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 43 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":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b709472257eebf8c4f27dee0082bb0e384d08e0a9a535c3ed4494da879a246"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transfer/mysql_xugu.rs: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 52 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f04801130024e79386ef3d7662ad806421dade74d015d12942956264e8ecb1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentProtocol: ClassTooLong \u2014 441 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 41 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":"agents/common/src/main/java/com/dbx/agent/AgentProtocol.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc935437eab6f1e358c2a29e50c5bded26af83ccdcd74459620de9563afa352"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/oracle_triggers.rs: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_triggers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8829f6f4f47e7db93b83e20903a782e817fbba09db7e8f84737371e74e1b54"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: etcd2Session: TooManyMethods \u2014 33 methods, declared across 6 files: etcd2-go/auth.go (11), etcd2-go/watch.go (6), etcd2-go/client.go (5), etcd2-go/kv.go (5), \u002B2 more file(s). The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/main.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"60513d5a2b98fd75c1f3d892b73bba4e7e7c3ecbab6c5e5bd571ba9d5198e6c6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TdengineDriver: 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":"agents/drivers/tdengine/src/driver.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9613c1b1c9a8d844a7b60a60981c486648535ca3cbe7e69397bf9ab545a8d01"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PluginHost: TooManyMethods \u2014 33 methods, declared across 2 files: plugins/host.rs (25), plugins/filesystem.rs (8). The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/host.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cd952ea90ed8448154d1785e57d6d28e710fac0210fcbaa82ce6efc686e8e3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Analyzer: ClassTooLong \u2014 440 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 2 blocks, lines 185-2152. The bar is 400 significant lines; this is 40 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef186fc80d35497edad0a1fd6d56c96272e55848f6789465da47f6169293901f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DdlCapabilitiesYaml: TooManyFields \u2014 33 stored fields beside 1 method. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/dialect_yaml.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"650deebafe20904e52b763b68f6e3e99ab6e8c200160fdf64e83716504248d54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rocketmq/consumers.go: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2167306a8ad5f76d27be00e1c3a6e75249f1052114cae6e64a7f8b395a91d668"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: oracleTypeManagement.executeOracleTypeManagement: FunctionTooLong \u2014 executeOracleTypeManagement runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdec0d77065ef4e2d875d14a016ec92d4488add1de43d5454af8364510c1483"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cassandra-go/config.go: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e95913f346e93d4dc3363b2f7c132168ac0396577c5cb0cac9fb17ff6ff0ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nacos/nacosAdmin.ts: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e20d87798d342d3e599795ed8a9a964f2634e19d79ac6239f4633141d8511cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useCellDetailEditor.useCellDetailEditor.create: FunctionTooLong \u2014 useCellDetailEditor.create runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useCellDetailEditor.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fdcea69dd448614ed8c39931fb45c23ea69e68d9a2fd65b881d89b3ade3c33"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queryStore.useQueryStore.exportQuerySqlDirect: FunctionTooLong \u2014 useQueryStore.exportQuerySqlDirect runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11920}}}],"partialFingerprints":{"codehealthFindingId/v1":"edad8c4b314ecdd1c079fcdaa29adbdd825061c9363675fc6f2ac25e6fb7ec94"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeJobRegistry.remember: MethodTooLong \u2014 remember runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/service.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b84b0c6fef4b9bca3951033aa0cc3c8effb5313c9af5a766ec712260ed88ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::oracle_table_triggers::enrich: FunctionTooLong \u2014 dbx_core::schema::oracle_table_triggers::enrich runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_table_triggers.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9195c580f191b00ba3c3c54a11776698d72fb0e293c0075bf69c5964e269271"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::existing_primary_key::build_existing_primary_key_change: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::existing_primary_key::build_existing_primary_key_change runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/existing_primary_key.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b25a345b0c13494a94ec2dbd877ad8abf104e0a193d1fe687306636911adbee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::triggers::build_exact_trigger_operations: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::triggers::build_exact_trigger_operations runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cee92412cfdd2fddc71fc89898fefa631ac90c6ee9f1789ee4881dffd7bcfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: InstallTabs.BrowserStaticDialog: FunctionTooLong \u2014 BrowserStaticDialog runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/landing/InstallTabs.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fc00a1c46368429c03160858d69b62f45422e7ec00333535c03db624cb3bdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/tableVGroup.ts: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2cef45f13c5d4f67d52a212074fd71f35a74e90c1a4fc7e8087776a103a6c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/json.ts: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0409c9716e7fca1010c711d6e5c26368b3fed6834cc411cebbe349c5b4636f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::mysql_xugu::prepare: FunctionTooLong \u2014 dbx_core::data::transfer::mysql_xugu::prepare runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"768622aaf8ce59231dd220db140b5f043273fed6a0b5d239472233b8c7c1e711"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::persistence::cloud_sync::build_sync_snapshot_with_selection: FunctionTooLong \u2014 dbx_core::persistence::cloud_sync::build_sync_snapshot_with_selection runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"932bc0215ad176bd690fcbb402989ca4d3dcabb17476b1845dac62990944a944"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_postgres::postgres::list_object_routines_sql: FunctionTooLong \u2014 dbx_driver_postgres::postgres::list_object_routines_sql runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":6631}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfd453fc84d5bbee702b16fec71bbc573842389c7ff3061f81c021d43690720"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DuckDbWorkerClient.execute_query_page: MethodTooLong \u2014 execute_query_page runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_query_sessions.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"707d3eda1860cc72676f04960f5f9bed0259fbcc9a6c1f511e37fb6d97cb41db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_core::object_source_sql::rewrite_oracle_routine_references: FunctionTooLong \u2014 dbx_sql_core::object_source_sql::rewrite_oracle_routine_references runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3eafc09232a1b8617499c666b983c279dc5da780f3cddb67b45dab258d95ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LandingNav.LandingNav: FunctionTooLong \u2014 LandingNav runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/landing/LandingNav.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5665c4109810b3350212b730c40a8b117d9ae27b4a90e9e68821efd25c4f20bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: spanner/SpannerAgent.java: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: SpannerAgent (59-870). The bar is 500 significant lines; this is 39 over it, 1.08\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":"agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73de3850041a8448c737233781c5f261e556e91a5c831cff9d9df578020513d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/oracleRoutineRename.ts: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"814b3297763869417015ecafb15526876b95549543c56e7552c2638961675d05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_job_changes/transitions.rs: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/transitions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84de1ebfa2c44ca7b5169522d089f887fcbdf093575a9bee34ccb177b61ad946"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TdengineDriver: ClassTooLong \u2014 431 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 2 blocks, lines 48-646. The bar is 400 significant lines; this is 31 over it, 1.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":"agents/drivers/tdengine/src/driver.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5efebeaeb0209a1b9e567f9b0fddd82b2841cd348a1ced8e359e5e27e78ca6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/pluginFloatingWindow.ts: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37729ab5b337004147438ab91228979be52619a58352d8bae60a8d6d9d116440"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/useQueryEditorDiagnostics.ts: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: useQueryEditorDiagnostics (84-712). The bar is 500 significant lines; this is 36 over it, 1.07\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":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1cdd4c071716ac4d554eba56305c7fb0a904f283405782529d5ba827dc0cca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: routineBlockLayout.indentRoutineBlocks: FunctionTooLong \u2014 indentRoutineBlocks runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/routineBlockLayout.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1801323d72eb4cd79102acddf87ba67504871566f858c320ac465bdc325c50e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MqttClient.spawn_v5_event_loop: MethodTooLong \u2014 spawn_v5_event_loop runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a1638e64ddbc9d2bd1827a7707a811e4df08b18b575a1558a097d296efbbd5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.start_keepalive_task: MethodTooLong \u2014 start_keepalive_task runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7b534fc959e6301309f43b81879834f2b60e0e51ea95157f33bb7cf7f7fbe5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SnippetSyncClient.put_snapshot_with_expected_remote_hash: MethodTooLong \u2014 put_snapshot_with_expected_remote_hash runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a16cf84c916f93f8c504ac2bf131fa0e92b53d24bf3f4f6c3808054194a87c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RoutineOperationRegistry.prepare_batch: MethodTooLong \u2014 prepare_batch runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/operations/retention.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e1a6f4b66b20cf1cd801612a299e8c9221523def2f3f9a2c9e02ee9430477c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::native_job_changes::dameng::metadata_changes: FunctionTooLong \u2014 dbx_sql_schema::native_job_changes::dameng::metadata_changes runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2feccb20f611072d9b04d56082c6669adbcb4704d36866752b887761f8460683"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: QueryResult: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/QueryResult.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"439c9c84fef57f529158ba868fd36f3c84b4fb1d393dd5e1b3e4f0a038a1b56e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: dbx_core::admin::nacos::namespace_access: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/namespace_access.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c260dafaf2e26dfa82c0ae11d80682df31b49af65fda804eafa4d91aa5e866"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MqCapabilities: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/types.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25c16bcbc898ff95137f92c150615ba1884d934efd2efc60d644d4294aa193e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RedisKeyGroupIndex.project: MethodTooLong \u2014 project runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyGroupIndex.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ac2260255af52415416001f89a87513fad9ab78aa5726f3b538cfdac6d817a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_ai_provider::ai::stream_openai: FunctionTooLong \u2014 dbx_ai_provider::ai::stream_openai runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f71b80565aed9f4e6d5a1601267dab0e06d26e565b2c5bf57202ad54d2c7fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: McpGlobalPolicy.normalized: MethodTooLong \u2014 normalized runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd946a860181afc0eca36835d6395ab73dfe295fddb6cde5c5b51f28779481"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx::commands::query::execute_multi: FunctionTooLong \u2014 dbx::commands::query::execute_multi runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/query.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da6898ad6d9fa7ec5e7f7fb8896e48418b8798722a8cd9b1b61a17d389dfe26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/xuguUserPermissions.ts: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f351ad715b0e1595ecff9832f4afc668d10bbb2d5bf1ae2ff60687e631664d3f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InformixAgent: ClassTooLong \u2014 421 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 21 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f256cd32438c8f762a028c40271a1cf21e401720716ed79821e3f6f7b55ddd87"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DialectCapabilityDescriptor: ClassTooLong \u2014 421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 3 blocks, lines 162-607. The bar is 400 significant lines; this is 21 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea88dd886abf8007ee6f19f01d482ecd1f99dd765a84d204a7a9385ebdc0ee9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/oracle_type_evolution.rs: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 26 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_evolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83dae8e8671c6d546c1a876fdf4c1336035e3f02684dbf1eeb68244094b1e90"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Plan.read: MethodTooLong \u2014 read 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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d9a4a64b140a11e5d3bc8a51ff1dbbe8a1dbdfa2f9bdd9972b356d7782b117"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDataGridActions.useDataGridActions.onSort: FunctionTooLong \u2014 useDataGridActions.onSort 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":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b23fca8eefb4a867c16343147ac3bd6a5550097f138d558e8693689dd2de1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useFileDrop.useFileDrop: FunctionTooLong \u2014 useFileDrop 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":"apps/desktop/src/composables/useFileDrop.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d127adb7caabd15bae8e40f3c996c439584cb4188554b2dc0e38867cc0cb6495"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: settingsTransfer.parseSettingsTransferFile: FunctionTooLong \u2014 parseSettingsTransferFile 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":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65750d00432c95ec11729346a6c68a9406b6c8717182ef232020e56071c8673"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: connectionStore.useConnectionStore.ensureConnected: FunctionTooLong \u2014 useConnectionStore.ensureConnected 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5992}}}],"partialFingerprints":{"codehealthFindingId/v1":"255806670a0cb73dffe4825be25cd621ff615c6c7c61a9fda45ccf3217500d90"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LegacyReader.list_objects: MethodTooLong \u2014 list_objects runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_triggers.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"83af1774a9307976807de77c35d7db31905d89b45ab6176526d5512c00502fea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_core::object_source_sql::oracle_indexes::oracle_trigger_metadata_matches: FunctionTooLong \u2014 dbx_sql_core::object_source_sql::oracle_indexes::oracle_trigger_metadata_matches runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f72460bd1a557edb2fff157af1d2f8bbe9fe34b07b1c48eb37aec3b0eadeec5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_schema::table_structure_sql::column_alter::build_postgres_like_existing_column_sql: FunctionTooLong \u2014 dbx_sql_schema::table_structure_sql::column_alter::build_postgres_like_existing_column_sql runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee7b61d5f9bea2c710a589c1c3550a1015bc5feb12cde948e33103626df2ee0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.PrivacyPage: FunctionTooLong \u2014 PrivacyPage 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":"docs/app/[lang]/privacy/page.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a166aa41c3f8b52604def4aa70a101fa34dde6cfbf89cc10ff3cc03dddb7a45b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table_structure_sql/indexes.rs: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/indexes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"767ea16532e9d424759894df71480dd109a759fa964487b739045cf69b6c1753"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useDataGridConditionEditor.ts: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fd3a2c7789c3a094a269e67f6131d2212e6994fc77e0bc10f488aafaeb6e91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/couchdb_driver.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6d85c6658b6a4fac30ea8c9d531a83f7c6f28a8b3d3a9997265f23fce15d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useDataGridColumnLayout: ClassTooLong \u2014 417 significant lines (blank, comment-only and punctuation-only lines excluded), 97 methods. The bar is 400 significant lines; this is 17 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":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6ade9e39c3241a88b0694061d14bc3a62f7e0838131cb2c5938d10a7fcd8eb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RabbitMqAdmin: ClassTooLong \u2014 417 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 3 blocks, lines 62-738. The bar is 400 significant lines; this is 17 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":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba0f370503fd0e5a71f7e47620e865b82fd37e0dacce5d609638a7a09f60dbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oceanbaseoracle/PlDebugManager.java: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: PlDebugManager (27-700). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab780188a6109b8fa79b300ef3c3b23c7077225abb1bb342c46e2e2d60499db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/turso_driver.rs: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/turso_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"343c7224689d3a0933dc104676884366848091641da31db33106609a8297be0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/plugins.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), declaring 32 free functions. The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/plugins.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c82dc43123929312d9d9cae22b15c2afb7833901b3a4856c19ba6defe2e5bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: plDebugNativeEntry.readNativeValues: MethodTooLong \u2014 readNativeValues runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_frame_value.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"52207522915da3c2348890499e17c1f830cd61adfe81a60ece849e57f616c0d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useNavigationTargets.useNavigationTargets: FunctionTooLong \u2014 useNavigationTargets runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"22538bc4ceeafe4e0d93bd2a938bd743aaaa37784ffc662eff691a02456de7f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSqlFileReorder.useSqlFileReorder: FunctionTooLong \u2014 useSqlFileReorder runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlFileReorder.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"199949ac649f8ee5be35da02fa0e7629bfa1f4e828b553a1fd37750941c320f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editorThemes.buildCustomTheme: FunctionTooLong \u2014 buildCustomTheme runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/editorThemes.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec1514895c029eb50436de25d643b37eedefab62ffa93746abcbe91136c2bb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tableTree.buildGroupedObjectTreeNodes: FunctionTooLong \u2014 buildGroupedObjectTreeNodes runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"569c19c1c2508a0de319d77cc95ed5508d80ace12b1877cc8cb8e2e55994d5c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queryStore.useQueryStore.countQueryTotalRowsInBackground: FunctionTooLong \u2014 useQueryStore.countQueryTotalRowsInBackground runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97be039e1587feeba55837a89e230ef3a7eeb45c31bf21e985dd0e48bba2eca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_core::oracle_view_rename::rewrite_hints: FunctionTooLong \u2014 dbx_sql_core::oracle_view_rename::rewrite_hints runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_view_rename.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd483682ac0d4c1c86a4388f5e576d3f1f9b96c73fdb8bd81667774ef94ca4ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PluginsClient.PluginsClient: FunctionTooLong \u2014 PluginsClient runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/plugins/PluginsClient.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f9efbef936be4cb73a60ffed23ce38a70c247e100567376aa8167a73c19d02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db2/Db2Agent.java: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: Db2Agent (34-729). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec1521e00fafcb6139fefb85533f91afb08495e2b7df0938a2d6f0736676b6d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: IoTDBRpcDataSet: TooManyFields \u2014 31 stored fields beside 62 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"206acedc7cb0cbe737a1e6d1c70740acc3ba8cb7811cfb3a89e0fc81756a3d84"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FirebirdAgent: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdAgent.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce43e1cc71c469561015f9c92fa9b27e5616e8aeccaca306791cef761be88f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SparkAgent: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"225a137596a1d1ea85fda82bfd3d930dc8faba7d429a87d94f34ca970e7bf846"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: dbx::commands::agents: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/agents.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1642fca87373f102e1fdbbfef7d9004505c7b6294ef6c39d03780fa577c0f79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TableExportRequest: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b992052abd734bac25363eb6809f9abebc3739b7bca76c1c20f788b5c96d2bec"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useAppUpdater: ClassTooLong \u2014 413 significant lines (blank, comment-only and punctuation-only lines excluded), 57 methods. The bar is 400 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fb0ac899686db377c96b7e9007ae4f3b1f09ec65230964e4c2a83594e2eaa6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/useQueryEditorCompletionMetadata.ts: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: useQueryEditorCompletionMetadata (44-708). The bar is 500 significant lines; this is 15 over it, 1.03\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":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e8e9f308998c641f2adb1f37b4ebe385153da340ad30c37bb790a67e00632a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useAppUpdater.ts: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: useAppUpdater (169-703). The bar is 500 significant lines; this is 15 over it, 1.03\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":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"637ec0fd80692e9be267ebdc68dc17d4609a7db666b09156fedd9ed2a7136cf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/list_sql_files.rs: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/list_sql_files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3370c818360f694d7b211059aec50ba88dc8529874ffb558901060f3890b44"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: plDebugNativeEntry.writeValue: MethodTooLong \u2014 writeValue runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_frame_write.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e9307bb63b6e45a2bb58d88cb2d0427c4c884c80f592b812d2aa798ae608f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queryStore.useQueryStore.refreshDataTabInternal: FunctionTooLong \u2014 useQueryStore.refreshDataTabInternal runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5930}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b53d15759d4775b0a05c5856a58ca54cc21da398c428cd077539e6003766f81"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::data::transfer::mysql_xugu::preflight: FunctionTooLong \u2014 dbx_core::data::transfer::mysql_xugu::preflight runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdd1f7eda575df47def74fcd212b585c911289175dcbf019a238da6ce7b1075"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::execute_statements_inner: FunctionTooLong \u2014 dbx_core::query::execute_statements_inner runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9985cbb491dfef62764dddc67fc7114bdbb1b1f4cacf83a961769feb4757ba58"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::oracle_routines::transfer::packages::prepare_pending_tables: FunctionTooLong \u2014 dbx_core::schema::oracle_routines::transfer::packages::prepare_pending_tables runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ec66717cb4cd949872e8860ce361ddfb83e999c97c84165e2c170f9beb1d4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_agent::agent_offline_export::export_agents_offline_unlocked: FunctionTooLong \u2014 dbx_driver_agent::agent_offline_export::export_agents_offline_unlocked runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eb094a08c5beecb9470403ca27f3112b629f8d4c55e72984e81197f0d9cbcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: codec/pickle.ts: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/codec/pickle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b367865edb869f9308ff6e417b4c3fa72e1c3f8d015b2e4bb8c8cab0e1c42aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/plugins.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/plugins.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd099fdecfff8b7332ba85f30cb913fe20b15a5bab51fb14aedb12ec2bbb006"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RocketMqAdmin: ClassTooLong \u2014 411 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 3 blocks, lines 78-889. The bar is 400 significant lines; this is 11 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rocketmq.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8f9c7f565e87a91ced7b847a55ff5c5048566aa3ea986f0b34979081f70d37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/redis_cmd.rs: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/redis_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"867db7dc255cb5030a29693dda1f2a8e9c2fea9e61a38abcc9887c782f979fff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/useQueryEditorBatchSelection.ts: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: useQueryEditorBatchSelection (52-672). The bar is 500 significant lines; this is 12 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05521b371e984b9e0f930e0f803fa9538534c8ea7a698b8726dafb6ddf81312b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: docs/worker.ts: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e309b7edf586e4bc5c8581326fce5b4dad85ceeb0990c8ccc6581485ded4ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composables/useDataGridColumnFormatter.ts: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: useDataGridColumnFormatter (76-610). The bar is 500 significant lines; this is 10 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd22b8d9b7e7d697c1f308d59d87f27e74c80f289e03c14f0836d08f3ccec21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::exec_tx_sqlite_inner: FunctionTooLong \u2014 dbx_core::query::exec_tx_sqlite_inner runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":6254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c750deb055dae7b2c7ad5ac7275f31cadbcd0b900cf7a3c4ac10512f9cc3db8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::schema::table_structure_sql::sqlite_rebuild::build_rebuild_statements: FunctionTooLong \u2014 dbx_core::schema::table_structure_sql::sqlite_rebuild::build_rebuild_statements runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14e3b91f1fbbb9b206b15d43d404556261dcc35f7a4fd9953ac4eeec83dccb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DbxMcpServer.ensure_plugin_tool_policy: MethodTooLong \u2014 ensure_plugin_tool_policy runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4933}}}],"partialFingerprints":{"codehealthFindingId/v1":"638babae8159ced0675b15e88547a385236f7fdc1743bed000360909230f0444"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_core::object_source_sql::oracle_indexes::parse_oracle_table_ddl: FunctionTooLong \u2014 dbx_sql_core::object_source_sql::oracle_indexes::parse_oracle_table_ddl runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"356bda87455d88a13997cef5825d352e051302abb5e14366b8d42ad6411b2254"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/packager/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5ae67e46813ec802e1e26947e0bde0f0f9b167673d16ff4f928b3eb6b24af5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeMappingMatrix: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 2 blocks, lines 618-1128. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa17307644fa07445327c5e70022d8947a7ebb7b1ecd8808e6a31751e90ff66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/insertValueHints.ts: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4452996b1afbe83d7c8106c1b18b667299c4226ef7c3855e5989d31b2d0f5a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: operations/dameng.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bde7e27f6b80f663c77705b3716311fea1b852e9dafaf3ba855405913dd5f1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDatabaseOptions.useDatabaseOptions: FunctionTooLong \u2014 useDatabaseOptions runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDatabaseOptions.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c981efed0889336807163579b7517464cb609e6495b842c2b95ffa10a18f9d13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usePluginShortcutSort.usePluginShortcutSort: FunctionTooLong \u2014 usePluginShortcutSort runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/usePluginShortcutSort.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6302fed4b90064d83ab9738f4de4ebc608edff7d61f2ed49e5e65f0205534fcf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Storage.load_connections: MethodTooLong \u2014 load_connections runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8131}}}],"partialFingerprints":{"codehealthFindingId/v1":"635e005861a3d8453357e99455a662b675e0ae14b19812b6bc0dcac9ef1081b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_core::query::execute_manual_txn_mysql_statement: FunctionTooLong \u2014 dbx_core::query::execute_manual_txn_mysql_statement runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":7940}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fc5bacf3aff556b9182801553b46248a63e206f6920a209bafb364f4f92571"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_driver_mysql::mysql::completion_assistant_search: FunctionTooLong \u2014 dbx_driver_mysql::mysql::completion_assistant_search runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3869}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7c0c47d1a6151dd9fccc63950654f6f4235240a509bf6041644f6405435d5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dbx_sql_core::object_source_sql::oracle_routines::analysis::package::parse_specification: FunctionTooLong \u2014 dbx_sql_core::object_source_sql::oracle_routines::analysis::package::parse_specification runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5c552bc0947e728bbe164a47ffca4318493a4cc3ca65968841a5e96740c729"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pl_debug/inspection.rs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/inspection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf511855d75b2e056baf43b8b8256b5f4d638a9b79c9312aa5650c2d082d10a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 33 shared lines): agents/drivers/argo-go/main.go:175-237 | agents/drivers/cassandra-go/main.go:173-240 | agents/drivers/hive-go/main.go:175-237 | agents/drivers/iotdb/main.go:179-241 | agents/drivers/kingbase-go/main.go:237-300 | agents/drivers/neo4j-go/main.go:207-268 | agents/drivers/vastbase-go/main.go:233-306 \u2014 These 7 members are variants of one another: a block of 33 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"748659e5d0aa96137e94f8c3e0c7c8c8189ac53879118df3ef6abf863695bb87"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 64 shared lines): crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:786-869 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:871-950 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:1036-1119 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:1214-1293 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:1360-1440 \u2014 These 5 members are variants of one another: a block of 64 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fc94d8809c929b0cb7357625e5a167baa372a5936eee52524e35c751efd8a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 37 shared lines): agents/drivers/argo-go/main.go:390-475 | agents/drivers/hive-go/main.go:390-475 | agents/drivers/iotdb/main.go:326-396 | agents/drivers/kingbase-go/main.go:372-499 | agents/drivers/vastbase-go/main.go:386-489 \u2014 These 5 members are variants of one another: a block of 37 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a42f9aab40170b92f3c47228fe2820538b6cf957d71b48d93b078afc7791750"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 27 shared lines): agents/drivers/argo-go/main.go:390-475 | agents/drivers/cassandra-go/main.go:324-405 | agents/drivers/hive-go/main.go:390-475 | agents/drivers/iotdb/main.go:326-396 | agents/drivers/vastbase-go/main.go:386-489 \u2014 These 5 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7469fea7fe50f3bcd55263eb2ba5d6e11de37cef52796d137fdd412bf8e5ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 25 shared lines): agents/drivers/argo-go/main.go:390-475 | agents/drivers/hive-go/main.go:390-475 | agents/drivers/iotdb/main.go:326-396 | agents/drivers/neo4j-go/main.go:428-499 | agents/drivers/vastbase-go/main.go:386-489 \u2014 These 5 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8146c01428ea8960583a70005069b0e29e940d8535991149cfe5e263b3e5ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 111 shared lines): crates/dbx-core/src/connection/mod.rs:3534-4305 | src-tauri/src/commands/connection.rs:1639-2245 | src-tauri/src/commands/connection.rs:2316-2804 \u2014 These 3 members are variants of one another: a block of 111 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05e4038e2e4d571b448a539921a2d448262fc465aab94e7f2560bc664df4f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 35 shared lines): crates/dbx-driver-mysql/src/mysql.rs:6074-6278 | crates/dbx-driver-mysql/src/mysql.rs:6291-6530 | crates/dbx-driver-mysql/src/mysql.rs:6555-6688 \u2014 These 3 members are variants of one another: a block of 35 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6074}}}],"partialFingerprints":{"codehealthFindingId/v1":"b023071c96e233073b0f5c3ed47384c6ef9f239166015daf91d9e7e2245a6439"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 17 shared lines): crates/dbx-web/src/routes/database_export.rs:176-203 | crates/dbx-web/src/routes/query_result_export.rs:156-181 | crates/dbx-web/src/routes/table_export.rs:141-169 \u2014 These 3 members are variants of one another: a block of 17 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/database_export.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"260733e5b057263a3ac46d24d9cdf50b78ee47963768492765778f02f7d6cbdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 9 shared lines): crates/dbx-driver-mongodb/src/mongo_shell.rs:493-506 | crates/dbx-web/src/routes/mcp_policy.rs:175-188 | src-tauri/src/commands/mcp_bridge.rs:1683-1696 \u2014 These 3 members are variants of one another: a block of 9 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"567eba6209c5ea92cbdac3ec47e02827a84488c52ef0e2ff4d24df7d4f6496af"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 7 shared lines): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:560-639 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:668-720 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:734-772 \u2014 These 3 members are variants of one another: a block of 7 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a73ae4adaa97eb4171692c59cedddee9004956300d381a139ff2ae742ea6fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (88 shared lines): agents/drivers/kingbase-go/kingbase_metadata.go:1093-1202 | agents/drivers/vastbase-go/vastbase_metadata.go:918-1027 \u2014 These two members are variants of one another: 88 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f90a9a8fca207f126b6f25a7a77bb3e4ec254407ef3e61a04a77210e5ac943"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (63 shared lines): crates/dbx-core/src/data/table_import.rs:3635-3893 | crates/dbx-core/src/data/table_import.rs:4362-4541 \u2014 These two members are variants of one another: 63 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3635}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94ab3368fa1db908369f19947ec1dc88bb1969b37d3205aa2b80dcf7144b532"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): agents/drivers/kingbase-go/kingbase_metadata.go:670-763 | agents/drivers/vastbase-go/vastbase_metadata.go:495-588 \u2014 These two members are variants of one another: 58 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f9842cce7797b073cff14de82ea0fa2bb5b399dfb81a42b5427fde4b249b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (56 shared lines): crates/dbx-web/src/routes/mongodb_import_export.rs:115-208 | crates/dbx-web/src/routes/table_import.rs:117-222 \u2014 These two members are variants of one another: 56 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5db341c4ddd201b029bb57e831c2727017cc61e1f1da7b44761b5bff08913ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (48 shared lines): crates/dbx-sql-data/src/data_grid_extractors/sql.rs:238-326 | crates/dbx-sql-data/src/data_grid_extractors/sql.rs:331-490 \u2014 These two members are variants of one another: 48 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a74f241c33e6c1a952640cc22caac3c28e6859c6b8a3975676b56e0a888af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (46 shared lines): crates/dbx-web/src/routes/query_result_export.rs:40-128 | crates/dbx-web/src/routes/table_export.rs:37-116 \u2014 These two members are variants of one another: 46 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query_result_export.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98e8e176ccd00be7e34672daaf1a66c89ccb1932f55cba227782521b62e9235"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (46 shared lines): agents/drivers/oracle-go/main.go:1107-1311 | agents/drivers/xugu/main.go:1051-1239 \u2014 These two members are variants of one another: 46 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc06e77437dffd22e1c7b300d1cd6d217cf9fbd9aaf250439da8df42be094fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): crates/dbx-core/src/persistence/storage.rs:8495-8552 | crates/dbx-core/src/persistence/storage.rs:8590-8647 \u2014 These two members are variants of one another: 44 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8495}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6fd761cca400e824f2e0cfb895c5122f19054247e0fbca4742cc4aa2f53bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): crates/dbx-core/src/admin/mqtt/client.rs:437-548 | crates/dbx-core/src/admin/mqtt/client.rs:555-690 \u2014 These two members are variants of one another: 37 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"740912fd7f8f4956aa226da6834129024e5883b4f069d70ff9707e24300e7ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): crates/dbx-ai-provider/src/ai.rs:4132-4218 | crates/dbx-ai-provider/src/ai.rs:4226-4312 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db1cede5edf8dc987357ec54e89b49cdc778ef4604713468141fabbfbcd4efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (28 shared lines): agents/go-common/iotdb-client-go/client/session.go:618-655 | agents/go-common/iotdb-client-go/client/session.go:665-704 \u2014 These two members are variants of one another: 28 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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"94548878beb11340cb19dced699dfe36bd82496f26efef88ec0706c39530fd70"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (23 shared lines): crates/dbx-core/src/data/table_import.rs:1340-1369 | crates/dbx-core/src/data/table_import.rs:1444-1473 \u2014 These two members are variants of one another: 23 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a941bdc55241b6bd6d04837a7e8bae8dda47e956910a0f08ff75626f3fc79b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/dbx-web/src/routes/tunnel_profiles.rs:81-105 | src-tauri/src/commands/tunnel_profiles.rs:51-75 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/tunnel_profiles.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"101c41f2a68901ee8683d4293c2160f9383eacb1ac3628753189f67af3765acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-web/src/routes/mongodb_import_export.rs:249-271 | crates/dbx-web/src/routes/table_import.rs:269-294 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a218e323a7298ce563d5bbe1bf93ef822843119befcf15191ec9a444330adad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/dbx-sql-core/src/sql.rs:3686-3732 | crates/dbx-sql-core/src/sql.rs:3738-3792 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3686}}}],"partialFingerprints":{"codehealthFindingId/v1":"59559e3acf867a96a335a438468614568087398bc0db4471400bd0014b2ff1b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/query/mongo_ops.rs:1534-1552 | crates/dbx-mcp/src/backend.rs:3025-3041 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"fceec083a4a97d3fb2580dc307865f31bc196e5e2f79832451120743b372992b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1181-1231 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:97-130 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd68a3b429630760ccae87aa29dcd75c3ef0844d6f4f85d203ebcd11c8f5181b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-web/src/routes/schema.rs:732-747 | crates/dbx-web/src/routes/schema.rs:752-767 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"592f6a83e7b97d348b2a628eb087457399b1653fbd6e50d081dda8a0624ff5ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:3132-3158 | crates/dbx-core/src/persistence/cloud_sync.rs:3160-3175 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":3132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43aec9e10bd6cc997ad1de1f0b0573cd28ceeb78b2f72080dca7c31c9871495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-driver-agent/src/agent_driver.rs:2716-2735 | crates/dbx-driver-agent/src/agent_driver.rs:2779-2796 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc83a3217a1dd6c936907c4aa90d15430904f3b979e050555bd98af4caca9c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (23 members, 50\u002B identical tokens): crates/dbx-core/src/query/redis_ops.rs:221-242 | crates/dbx-core/src/query/redis_ops.rs:251-272 | crates/dbx-core/src/query/redis_ops.rs:280-301 | crates/dbx-core/src/query/redis_ops.rs:308-329 | crates/dbx-core/src/query/redis_ops.rs:411-432 | crates/dbx-core/src/query/redis_ops.rs:443-464 | crates/dbx-core/src/query/redis_ops.rs:516-537 | crates/dbx-core/src/query/redis_ops.rs:549-570 | crates/dbx-core/src/query/redis_ops.rs:586-607 | crates/dbx-core/src/query/redis_ops.rs:616-637 | crates/dbx-core/src/query/redis_ops.rs:646-667 | crates/dbx-core/src/query/redis_ops.rs:688-709 | crates/dbx-core/src/query/redis_ops.rs:718-739 | crates/dbx-core/src/query/redis_ops.rs:756-777 | crates/dbx-core/src/query/redis_ops.rs:796-817 | crates/dbx-core/src/query/redis_ops.rs:834-855 | crates/dbx-core/src/query/redis_ops.rs:865-886 | crates/dbx-core/src/query/redis_ops.rs:894-915 | crates/dbx-core/src/query/redis_ops.rs:926-947 | crates/dbx-core/src/query/redis_ops.rs:957-978 | crates/dbx-core/src/query/redis_ops.rs:987-1008 | crates/dbx-core/src/query/redis_ops.rs:1040-1061 | crates/dbx-core/src/query/redis_ops.rs:1069-1090 \u2014 These 23 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 23 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 23 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9145c7d1b05967664839c914a8bc97919a0d89855c1a6526d60e6fc4ff6d262b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (13 members, 50\u002B identical tokens): src-tauri/src/commands/mcp_bridge.rs:2534-2551 | src-tauri/src/commands/mcp_bridge.rs:2553-2583 | src-tauri/src/commands/mcp_bridge.rs:2585-2611 | src-tauri/src/commands/mcp_bridge.rs:2613-2630 | src-tauri/src/commands/mcp_bridge.rs:2632-2651 | src-tauri/src/commands/mcp_bridge.rs:2653-2685 | src-tauri/src/commands/mcp_bridge.rs:2687-2713 | src-tauri/src/commands/mcp_bridge.rs:2715-2745 | src-tauri/src/commands/mcp_bridge.rs:2747-2777 | src-tauri/src/commands/mcp_bridge.rs:2779-2801 | src-tauri/src/commands/mcp_bridge.rs:2803-2832 | src-tauri/src/commands/mcp_bridge.rs:2834-2871 | src-tauri/src/commands/mcp_bridge.rs:2873-2908 \u2014 These 13 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 13 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 13 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3e39c4d20fe76993c1a357ca617e3d93c8479652a48f1126b8e2ade8e6ebc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): crates/dbx-core/src/persistence/storage.rs:2863-2917 | crates/dbx-core/src/persistence/storage.rs:3023-3110 | crates/dbx-core/src/persistence/storage.rs:3484-3536 | crates/dbx-core/src/persistence/storage.rs:4792-4842 | crates/dbx-core/src/persistence/storage.rs:5058-5082 | crates/dbx-core/src/persistence/storage.rs:5342-5359 | crates/dbx-core/src/persistence/storage.rs:7374-7402 | crates/dbx-core/src/persistence/storage.rs:8086-8129 | crates/dbx-core/src/persistence/storage.rs:8131-8261 | crates/dbx-core/src/persistence/storage.rs:9016-9036 | crates/dbx-core/src/persistence/storage.rs:9836-9910 | crates/dbx-core/src/persistence/storage.rs:9928-9988 \u2014 These 12 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 12 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e61907205fa8ebfd9ee3389f874e092a3f2a5dda7a535ebd8e5243b9c8861e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): agents/drivers/argo-go/main.go:106-142 | agents/drivers/cassandra-go/main.go:114-149 | agents/drivers/etcd-go/main.go:127-165 | agents/drivers/etcd2-go/main.go:97-135 | agents/drivers/hive-go/main.go:106-142 | agents/drivers/iotdb/main.go:110-146 | agents/drivers/kingbase-go/main.go:185-220 | agents/drivers/nebula-go/main.go:66-104 | agents/drivers/neo4j-go/main.go:134-170 | agents/drivers/oracle-go/main.go:710-784 | agents/drivers/vastbase-go/main.go:181-216 | agents/drivers/xugu/main.go:708-750 \u2014 These 12 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 12 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"30202f62e3ce789604be1cfb71376746a5cd8951f7cfddc7549e903b24b852ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:95-124 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:205-244 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:103-123 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:163-199 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:225-246 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:288-328 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:307-349 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:107-131 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:173-213 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:111-135 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c872528b072afcce33fad42c2a6221c437dc3575686f7a9cadf4b545f7c3bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): agents/drivers/argo-go/main.go:160-173 | agents/drivers/cassandra-go/main.go:158-171 | agents/drivers/etcd-go/main.go:184-197 | agents/drivers/etcd2-go/main.go:154-167 | agents/drivers/hive-go/main.go:160-173 | agents/drivers/iotdb/main.go:164-177 | agents/drivers/neo4j-go/main.go:192-205 | agents/drivers/vastbase-go/main.go:218-231 | agents/drivers/xugu/main.go:760-773 | agents/drivers/xugu/main.go:1036-1049 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df9361a175393423c4b074f6f13e844124d5b4f4c0784ab8a9e9ef09e0395b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): crates/dbx-driver-elasticsearch/src/lib.rs:749-763 | crates/dbx-driver-elasticsearch/src/lib.rs:1002-1016 | crates/dbx-driver-elasticsearch/src/lib.rs:1018-1031 | crates/dbx-driver-elasticsearch/src/lib.rs:1520-1538 | crates/dbx-driver-elasticsearch/src/lib.rs:1558-1566 | crates/dbx-driver-elasticsearch/src/lib.rs:1605-1623 | crates/dbx-driver-elasticsearch/src/lib.rs:1905-1919 | crates/dbx-driver-elasticsearch/src/lib.rs:1927-1939 | crates/dbx-driver-elasticsearch/src/lib.rs:1991-2001 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c6d3aca31c144048b9d9c146a15a2df49ccc347563cc90f05b7f61e073a7d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java:10-16 | agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:87-93 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:205-242 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:169-187 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:126-145 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:249-270 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:278-289 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:134-155 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"376ddc5ea96954be01922cbc3638b2776a6287d145b8e8ef2a2800a78f6bffc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): agents/drivers/argo-go/metadata.go:16-73 | agents/drivers/cassandra-go/metadata.go:12-58 | agents/drivers/hive-go/metadata.go:16-73 | agents/drivers/iotdb/metadata.go:14-65 | agents/drivers/kingbase-go/kingbase_metadata.go:67-172 | agents/drivers/neo4j-go/metadata.go:13-98 | agents/drivers/vastbase-go/vastbase_metadata.go:17-98 | agents/drivers/xugu/main.go:405-507 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f1c17a825487883cb940eb6c3749027a71de390ce8075fa9a1935a8029615d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/dbx-core/src/admin/mq/adapters/pulsar.rs:524-540 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:542-560 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:575-600 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:602-621 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:669-687 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:689-706 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:708-734 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/pulsar.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e766005643b099af270184eb799103b2a49cc06d9ed320d96fcd70388a31ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): agents/drivers/argo-go/protocol_error.go:103-122 | agents/drivers/cassandra-go/protocol_error.go:119-143 | agents/drivers/etcd-go/protocol_error.go:69-90 | agents/drivers/etcd2-go/protocol_error.go:64-82 | agents/drivers/hive-go/protocol_error.go:103-122 | agents/drivers/neo4j-go/protocol_error.go:120-138 | agents/drivers/vastbase-go/protocol_error.go:117-141 \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":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"222b392ee71fc6e2fc5798ca627d2912e6f4f961b5f9f30651801c59e2806ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): agents/drivers/cassandra-go/main.go:242-272 | agents/drivers/iotdb/main.go:243-272 | agents/drivers/kingbase-go/main.go:302-326 | agents/drivers/neo4j-go/main.go:270-300 | agents/drivers/oracle-go/main.go:925-970 | agents/drivers/vastbase-go/main.go:308-335 | agents/drivers/xugu/main.go:847-905 \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":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fff9bfcd3cfe0a4d5e691432868044f8c2f71681a39951acc14268cdc9cbf79"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/dbx-core/src/query/redis_ops.rs:1014-1032 | crates/dbx-core/src/query/redis_ops.rs:1198-1246 | crates/dbx-core/src/query/redis_ops.rs:1248-1265 | crates/dbx-core/src/query/redis_ops.rs:1273-1295 | crates/dbx-core/src/query/redis_ops.rs:1379-1397 | crates/dbx-core/src/query/redis_ops.rs:1441-1464 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df8a890c2c67cc4b206505a8a0ee2d38758e38f4f384b2f2e224aa0b68b153"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:131-144 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:88-101 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:210-223 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:238-251 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:92-105 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:96-109 \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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ff4875b098441d18f1aa1b3ab791be1fd71f4f9327f1d7babe6bfa79813c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): agents/drivers/argo-go/protocol_error.go:34-70 | agents/drivers/cassandra-go/protocol_error.go:32-84 | agents/drivers/hive-go/protocol_error.go:34-70 | agents/drivers/iotdb/protocol_error.go:33-70 | agents/drivers/neo4j-go/protocol_error.go:37-85 | agents/drivers/vastbase-go/protocol_error.go:33-82 \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":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27be64860e01dfc8c12781dbed9a29ac97fedceddd89e6ad11fb474c59f925e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): agents/go-common/iotdb-client-go/client/column.go:227-246 | agents/go-common/iotdb-client-go/client/column.go:299-318 | agents/go-common/iotdb-client-go/client/column.go:371-390 | agents/go-common/iotdb-client-go/client/column.go:443-462 | agents/go-common/iotdb-client-go/client/column.go:515-534 | agents/go-common/iotdb-client-go/client/column.go:587-606 \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":"agents/go-common/iotdb-client-go/client/column.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a636028b7f66f907af1fc56017a2980d066a8d6ffd6cabdc4935d3ed01ac9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:441-468 | crates/dbx-ai-provider/src/ai_codex_cli.rs:975-999 | crates/dbx-ai-provider/src/ai_grok_cli.rs:650-688 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:533-543 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:574-584 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6c6ca4db6df97cc946d420a9268e8d5296b75a26706ee3062cb179672622d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/dbx-core/src/connection/mod.rs:6553-6613 | crates/dbx-core/src/connection/mod.rs:7736-7765 | crates/dbx-core/src/connection/mod.rs:7768-7796 | crates/dbx-core/src/connection/mod.rs:7798-7826 | crates/dbx-core/src/connection/mod.rs:7828-7854 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":6553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1cd0c1a7e287f011c39b7ba8b78019d071019cd71f43e7293cab934923bda8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/dbx-core/src/data/query_result_export.rs:1176-1641 | crates/dbx-core/src/data/query_result_export.rs:1650-1843 | crates/dbx-core/src/data/query_result_export.rs:1852-2142 | crates/dbx-core/src/data/query_result_export.rs:2151-2351 | crates/dbx-core/src/data/query_result_export.rs:2360-2550 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1227b98c78f265a66a7a1b338aa6f51205e91e354722658e37632dcd27c2f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/dbx-core/src/persistence/storage.rs:5674-5707 | crates/dbx-core/src/persistence/storage.rs:6544-6565 | crates/dbx-core/src/persistence/storage.rs:6567-6588 | crates/dbx-core/src/persistence/storage.rs:6590-6610 | crates/dbx-core/src/persistence/storage.rs:6621-6643 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":5674}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f1d4873293961806828330952136d8d3a58e4a0150d04564c1484b066912f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/dbx-core/src/query/mod.rs:5061-5081 | crates/dbx-driver-elasticsearch/src/lib.rs:2580-2600 | crates/dbx-drivers/src/db/couchdb_driver.rs:626-646 | crates/dbx-drivers/src/db/solr_driver.rs:1003-1023 | crates/dbx-drivers/src/db/vector_driver.rs:943-1000 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5061}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedd7bdb2e402babc246527a5b0c7069f40f68b5cc350299cf81d8593c44d8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/dbx-core/src/schema/mod.rs:447-477 | crates/dbx-core/src/schema/mod.rs:517-530 | crates/dbx-core/src/schema/mod.rs:552-565 | crates/dbx-core/src/schema/mod.rs:587-599 | crates/dbx-core/src/schema/mod.rs:621-633 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b06c4c8406e0618250d403d8184e7fd683b1dc523af4a0aa757ba3893061826"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/dbx-core/src/schema/mod.rs:1179-1195 | crates/dbx-core/src/schema/mod.rs:1203-1219 | crates/dbx-core/src/schema/mod.rs:1221-1231 | crates/dbx-core/src/schema/mod.rs:1238-1248 | crates/dbx-core/src/schema/mod.rs:1256-1266 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c1114741776d6a553306d41a46aba78c5545c05f3cb897bf764471d5237981"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/dbx-driver-sqlserver/src/sqlserver.rs:1887-1899 | crates/dbx-driver-sqlserver/src/sqlserver.rs:1901-1913 | crates/dbx-sql-data/src/query_result_sql.rs:2284-2299 | crates/dbx-sql-data/src/query_result_sql.rs:2301-2319 | crates/dbx-sql-data/src/query_result_sql.rs:3037-3049 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f1e335af2a95b949fb310411a934a1241815983f2ca96acb41646fde82e834"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:707-741 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:748-804 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:806-853 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:886-918 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:931-976 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"01878cf2ca92a9dadfc3b75d1b330f4328f1e9a8ae4eac8e17b0600c2a71459e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:34-45 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:43-54 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:38-50 | agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:95-113 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:44-55 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b97c41c82251b992533241766e2f9cd7629487bf0b30aa3798a755ca29c1c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:190-203 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:148-161 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:273-286 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:292-305 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:158-171 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"accf57aceb7cb64cd5f45cc610a4a071ac1223a5bf8bfd312b48a036e0405344"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): agents/drivers/argo-go/main.go:19-104 | agents/drivers/cassandra-go/main.go:15-112 | agents/drivers/hive-go/main.go:19-104 | agents/drivers/iotdb/main.go:18-108 | agents/drivers/neo4j-go/main.go:20-132 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fa26dad644e68b762f90992e088cc770076a617c6b1e248079278569cf349f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): agents/drivers/argo-go/metadata.go:233-257 | agents/drivers/argo-go/metadata.go:259-272 | agents/drivers/hive-go/metadata.go:239-263 | agents/drivers/hive-go/metadata.go:265-278 | agents/drivers/iotdb/metadata.go:165-182 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5fbeffe0178ed2c31e3d11219853a880e37498608881eaddd203bb4f6f9fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): agents/drivers/iotdb/main.go:298-312 | agents/drivers/kingbase-go/main.go:352-366 | agents/drivers/neo4j-go/main.go:328-351 | agents/drivers/oracle-go/main.go:1052-1082 | agents/drivers/vastbase-go/main.go:363-380 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/main.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aa27ca232a87fd10a0a015516f5115fc7871256b33b9e04fb612e89e0f70dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): agents/drivers/oracle-go/main.go:4556-4592 | agents/drivers/oracle-go/main.go:5461-5505 | agents/drivers/oracle-go/main.go:6006-6042 | agents/drivers/oracle-go/main.go:6044-6073 | agents/drivers/oracle-go/main.go:6075-6101 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4556}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0ed69e5ccede8f013cd0563c2e0f932218db924aa59b6d6d7f023a487a43e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:84-93 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:161-170 | crates/dbx-ai-provider/src/ai_codex_cli.rs:372-387 | crates/dbx-ai-provider/src/ai_grok_cli.rs:131-140 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"629cabf43c0c3b910984e0d611b92d4c6a47b14d43e5679d0d889e29c045c7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:95-118 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:172-195 | crates/dbx-ai-provider/src/ai_codex_cli.rs:342-365 | crates/dbx-ai-provider/src/ai_grok_cli.rs:142-168 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd45361d9f14daa8c231b8a2091b38fe99ddf7a0d137b33a299996012d2e09e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:152-158 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:232-238 | crates/dbx-ai-provider/src/ai_grok_cli.rs:202-208 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:84-90 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0ac8cb7cad865758cca78a1ab4dde5648e81ecd3a7cd1ec60e841ffa2c41aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:260-297 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:334-372 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:751-798 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:222-262 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3c5b5ff01af2bdf3cc0fff14f42b9ef5890ce8b6ae46e2b6b75c30ddaaa163"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:259-271 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:336-355 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:369-381 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:387-403 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c768ba46f87294a39bd808aab297bcb0c3507b7d01b2b663570d63d83f7f74d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-core/src/connection/jdbc.rs:914-947 | crates/dbx-core/src/connection/jdbc.rs:986-1004 | crates/dbx-core/src/connection/jdbc.rs:1066-1084 | crates/dbx-plugin-runtime/src/plugins.rs:197-255 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef65d62d2fcffd9dc60de1963ae31624f0d99eb6c0ea3e2b3519b846196f7bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-core/src/data/transfer.rs:10192-10423 | crates/dbx-core/src/data/transfer.rs:10444-10548 | crates/dbx-core/src/data/transfer.rs:10591-10652 | crates/dbx-core/src/data/transfer.rs:10666-10779 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea35e1edc77e2ed026edb0e337b5209a595df234516a830e730e748f233d347"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-core/src/query/mod.rs:5396-5519 | crates/dbx-core/src/query/mod.rs:6183-6225 | crates/dbx-core/src/query/mod.rs:6495-6560 | crates/dbx-driver-postgres/src/postgres.rs:10058-10112 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5396}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaf08557bced0222d22ab5b2e0a56b105f356d09067c841f1cb03a3184d2821"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-core/src/query/mod.rs:6183-6225 | crates/dbx-core/src/query/mod.rs:6495-6560 | crates/dbx-core/src/query/mod.rs:8057-8117 | crates/dbx-core/src/query/mod.rs:8120-8153 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":6183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4662f36c89251e6519f9f4df598ddd43e438369a82f0aa3b6ba13e0bfc41b45d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-core/src/schema/mod.rs:950-1049 | crates/dbx-core/src/schema/mod.rs:2741-3193 | crates/dbx-core/src/schema/mod.rs:8946-9267 | crates/dbx-core/src/schema/mod.rs:9832-10169 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"444bbd0437bdd0cbf0a4b5ef84d331b51146179a76aca6571a8e5057765c5a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-core/src/schema/mod.rs:10848-10866 | crates/dbx-core/src/schema/mod.rs:11079-11090 | crates/dbx-core/src/schema/mod.rs:11204-11215 | crates/dbx-core/src/schema/mod.rs:11223-11234 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10848}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a2f7879179fbfae183229a3259e656effe674049b0a03c3e934eb1197ff43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-driver-elasticsearch/src/lib.rs:2017-2031 | crates/dbx-drivers/src/db/couchdb_driver.rs:491-505 | crates/dbx-drivers/src/db/solr_driver.rs:855-869 | crates/dbx-sql-core/src/query_execution_sql.rs:801-815 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfd32bcbb3af5306954c6df1538978a3c9b04efd554a7dda3b88b455750c624"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-driver-mysql/src/mysql.rs:6937-6980 | crates/dbx-driver-mysql/src/mysql.rs:6991-7034 | crates/dbx-driver-postgres/src/postgres.rs:2671-2707 | crates/dbx-driver-postgres/src/postgres.rs:2716-2751 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6937}}}],"partialFingerprints":{"codehealthFindingId/v1":"93009fb86c33aece392db82c338159d307d0640d8a43a3f65da98983bb83e7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-drivers/src/db/clickhouse_driver.rs:50-72 | crates/dbx-drivers/src/db/influxdb3_driver.rs:74-86 | crates/dbx-drivers/src/db/influxdb_driver.rs:99-111 | crates/dbx-drivers/src/db/victoriametrics_driver.rs:138-150 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/clickhouse_driver.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f265dc244ce3e756ee0891a47523d771ce8f7e211ee08554745ac861fcd94e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-drivers/src/db/clickhouse_driver.rs:96-119 | crates/dbx-drivers/src/db/influxdb3_driver.rs:88-111 | crates/dbx-drivers/src/db/influxdb_driver.rs:129-152 | crates/dbx-drivers/src/db/victoriametrics_driver.rs:152-175 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/clickhouse_driver.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7599c814ce70950cfb353afeb1b812df4e2dc8ce6b18c724392c0302823da819"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:287-322 | crates/dbx-drivers/src/db/rqlite_driver.rs:155-195 | crates/dbx-drivers/src/db/sqlite.rs:2496-2602 | crates/dbx-drivers/src/db/turso_driver.rs:216-256 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c2db9a48fca2af61b52f5442a5e5bd101d15e286c692a7b646db5aac2e90e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-drivers/src/db/sqlite.rs:1508-1560 | crates/dbx-drivers/src/db/sqlite.rs:1562-1637 | crates/dbx-drivers/src/db/sqlite.rs:2604-2649 | crates/dbx-drivers/src/db/sqlite.rs:2651-2746 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8722375bfe5817cbdf3f8b1336706907080ab1d544edda756ead3e348b7dc838"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-sql-core/src/object_source_sql.rs:211-367 | crates/dbx-sql-core/src/object_source_sql.rs:369-496 | crates/dbx-sql-core/src/object_source_sql.rs:742-892 | crates/dbx-sql-core/src/object_source_sql.rs:2173-2292 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aed2c657f1bdf87d9af32f0c48cab5befd90237251fa0ca387f247eff072260"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-sql-data/src/query_result_sql.rs:1673-1719 | crates/dbx-sql-data/src/query_result_sql.rs:1726-1824 | crates/dbx-sql-data/src/query_result_sql.rs:1826-1879 | crates/dbx-sql-data/src/query_result_sql.rs:1938-2048 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"972bf844d8efc31d3d0ca5d29c1fff69049a0143c6d20652a7736d89bbeb5258"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-sql-schema/src/schema_diff.rs:3784-3880 | crates/dbx-sql-schema/src/schema_diff.rs:4095-4145 | crates/dbx-sql-schema/src/schema_diff.rs:4220-4287 | crates/dbx-sql-schema/src/schema_diff.rs:4289-4334 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":3784}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a04fa602824a1f03da8e92a594bfc21369b84142a65c575effe597741a69111"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:561-705 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:748-804 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:931-976 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:1146-1195 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da81d2d3bd913f9a3cb4fc2c3c6b9767cfdd704fb0ad216f07a2aadecf0ec9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:806-853 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:931-976 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:1146-1195 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:1201-1257 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c061adc69aa0ca9b08986e1a73a6bfde1f4a4cc2afc2435e40172b41dd4ff00"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src-tauri/src/commands/mcp_bridge.rs:2479-2505 | src-tauri/src/commands/mcp_bridge.rs:2507-2532 | src-tauri/src/commands/mcp_bridge.rs:2910-2964 | src-tauri/src/commands/mcp_bridge.rs:2966-3033 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"38178de849bdc627b4ebd9550b48209f04ea22d46a2e467ce04f328303004963"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java:29-55 | agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java:132-159 | agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:129-152 | agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java:197-230 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da7831d9483e2a783a0c3b2659eb0480239efbf31953cc1d03992cec9849e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:276-284 | agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:935-946 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3041-3052 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6611-6619 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfe81febcc98084b493845b52a27b129d9bd3f0b0ce85e6dbd454a2441ec22b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:198-244 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:122-144 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2644-2678 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2777-2822 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b86abb768e4518de8bb4f82ecc6b44a3d6367ddd91a0235d2b2bc859742131"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:1379-1390 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:2972-2983 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3359-3370 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4802-4813 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbebfd92cfe7b7c996b353ea511bdbbc91481ca17de591cc4ba48ce8da2b97e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agents/drivers/argo-go/config.go:295-372 | agents/drivers/argo-go/config.go:455-472 | agents/drivers/hive-go/config.go:301-378 | agents/drivers/hive-go/config.go:462-479 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5fb2b9e21e2989067a4f47a07aeb9340ac152a4d3f91c072c11bdc3d9f9241"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agents/drivers/argo-go/metadata.go:595-647 | agents/drivers/argo-go/metadata.go:649-676 | agents/drivers/hive-go/metadata.go:606-658 | agents/drivers/hive-go/metadata.go:660-687 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c37ad4de36127dde176fc65fc6ae7accf881bc89723f57e0abed4a4691417a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agents/drivers/cassandra-go/metadata.go:536-594 | agents/drivers/iotdb/metadata.go:486-544 | agents/drivers/kingbase-go/kingbase_metadata.go:1771-1831 | agents/drivers/vastbase-go/vastbase_metadata.go:1091-1151 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa1e231e4564e1288c62663bb3bcfc3929aaeb1461dfe15adc12457259ea781"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agents/drivers/etcd-go/auth.go:228-247 | agents/drivers/etcd-go/auth.go:266-285 | agents/drivers/etcd2-go/auth.go:103-127 | agents/drivers/etcd2-go/auth.go:148-168 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6bb2bbc7c8acb2e48dbbb067bfd17acbf6d5869134fc2fa9b510b5a880bf99"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agents/drivers/oracle-go/main.go:375-397 | agents/drivers/oracle-go/main.go:411-433 | agents/drivers/xugu/main.go:362-375 | agents/drivers/xugu/main.go:390-403 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42877bd972094c61b2630b82bbc1d72c85f673ddfb831701d976b4458711faf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agents/go-common/iotdb-client-go/client/session.go:756-785 | agents/go-common/iotdb-client-go/client/session.go:790-818 | agents/go-common/iotdb-client-go/client/session.go:823-852 | agents/go-common/iotdb-client-go/client/session.go:854-884 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d5be66b9cc99521debbb3425732c949eff4f3abf2ad8c01c4ce5cc735a1993"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (121 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:2524-2645 | agents/drivers/vastbase-go/vastbase_metadata.go:1525-1645 \u2014 These two members are one piece of code written twice and then edited apart: 121 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8a77ad53a257cdbb34877a5a5ecdf76077f843bedbbaf2863e0ff5a6fc9561"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (109 corresponding lines): agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java:78-186 | plugins/jdbc/src/main/java/app/dbx/jdbc/NativeLegacyJobSession.java:139-254 \u2014 These two members are one piece of code written twice and then edited apart: 109 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"70aee417d0c418f7742cf129319d692536d259868264034388c1ec42d764f6a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (124 corresponding lines): agents/drivers/argo-go/config.go:142-265 | agents/drivers/hive-go/config.go:145-271 \u2014 These two members are one piece of code written twice and then edited apart: 124 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0171a23def38ac6a0a5788cb6acdf5f74d47756cc08691e06c892d35ead936d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): agents/drivers/argo-go/metadata.go:296-375 | agents/drivers/hive-go/metadata.go:302-381 \u2014 These two members are one piece of code written twice and then edited apart: 80 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"62618e3a2587416159927a4d1d1392e8a356fba5c434fd786891373c5dd64f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java:152-220 | plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java:222-276 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d869a2ea4225c7ef5d256b2f18f01107d5f48507ae50baa0ca2fe0f8558626"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:5479-5521 | crates/dbx-driver-postgres/src/postgres.rs:10320-10365 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":5479}}}],"partialFingerprints":{"codehealthFindingId/v1":"349a6182e95dfbc7010aeafa0ab66a1a7e0f1534fe720261388c2dfcea5003fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:1402-1469 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1640-1706 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"970286105570867969b49a10dbeebf86dbbbe3dd82132609e5493926ff6a89fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): crates/dbx-mcp/src/server.rs:5506-5587 | crates/dbx-mcp/src/server.rs:5726-5792 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9830d9b8d9a1c91d0c81c388370039b42b9eaab08317ba8e19643c2ab83c437"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): crates/dbx-driver-redis/src/lib.rs:5320-5380 | crates/dbx-driver-redis/src/lib.rs:5392-5452 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d069e87b43848465c08526df3d75bde324983f23e5edc10524a25503904635c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): agents/drivers/argo-go/connector.go:27-99 | agents/drivers/hive-go/connector.go:27-100 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3813907ffee313363cfe9225c8375b2ce60f27c3fd1469d65ec9d0df52af565"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): agents/drivers/oracle-go/main.go:824-908 | agents/drivers/xugu/main.go:775-834 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a51e6de71e5f55f39479938cf6cd69df2726b6eeb52a972535d647645b082c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/dbx-core/src/admin/consul/blocking.rs:119-167 | crates/dbx-core/src/admin/consul/blocking.rs:174-220 \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":"crates/dbx-core/src/admin/consul/blocking.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfd7ad982aec88ef1b6d7c0d9e65e5d327c9568bf700a3c15e3fcbbb23f2c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3559-3625 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:2341-2429 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3559}}}],"partialFingerprints":{"codehealthFindingId/v1":"56636c0bbf94084c1711fe3fec0ec74bc6277e157f452c23d63c07a80f1ac06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/dbx-drivers/src/db/dynamodb_driver.rs:844-896 | crates/dbx-drivers/src/db/dynamodb_driver.rs:898-955 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"53df943a47d1652c65fc457a3b4bb25a84cc2cdc2a386d43714eceba426a150c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): crates/dbx-web/src/routes/redis_pubsub_ws.rs:119-178 | src-tauri/src/commands/redis_pubsub_server.rs:150-209 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis_pubsub_ws.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b8fc7bed077d8116038139d62ce55090a706f566006582c9e8d755b53f81e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (161 corresponding lines): agents/drivers/kingbase-go/main.go:22-183 | agents/drivers/vastbase-go/main.go:19-179 \u2014 These two members are one piece of code written twice and then edited apart: 161 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4a019b3f322839796406177312339c227ce2f526aa9ee922a6dba906aef7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/dbx-core/src/admin/mq/adapters/kafka.rs:587-619 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:829-862 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"6820ff6111c2807cc47ebc345ca373bacf0b4adfb40d998cac5e4ba9af46b54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): crates/dbx-mcp/src/server.rs:2434-2500 | crates/dbx-mcp/src/server.rs:2507-2567 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cd4b1b3a94b89e298335ef112c28c4315611e35014b790db264627b731c542"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): crates/dbx-driver-sqlserver/src/sqlserver.rs:1820-1885 | crates/dbx-sql-data/src/query_result_sql.rs:3064-3148 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e042fcfece9d6449508977a4bb1ac1ce6be0582d739d401519737ead8da990"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:5633-5677 | crates/dbx-driver-mysql/src/mysql_compatible.rs:177-231 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5336480c4daae0929731420d43b3ffb98880a874f06d1697b4e14f3a1c5f4cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/dbx-web/src/routes/query.rs:492-549 | crates/dbx-web/src/routes/query.rs:660-720 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50a527f306f980de94689d364d46c117d606f7a069fe0f32322c3aeb4cccd72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:8094-8149 | crates/dbx-driver-mysql/src/mysql.rs:8157-8207 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":8094}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed7bc6f3c25772e01c0fa8c411e16cb4c37ab0b959682464becda54223e418b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/dbx-core/src/data/transfer.rs:6955-7067 | crates/dbx-core/src/data/transfer.rs:7173-7230 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6955}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfd823dd56fbdb9f51168345c48d1fc31fe49444b3472ef51a09e5af2721a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/dbx-core/src/connection/jdbc.rs:634-680 | crates/dbx-driver-agent/src/agent_service.rs:102-142 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1b78b48ac5137af1a67fd2158f90ebe642c458daa0fe3b5d57c19efeeee786"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/dbx-core/src/data/database_export.rs:1337-1378 | crates/dbx-core/src/data/transfer.rs:4486-4529 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5497628a9bc133fde400ccada7395fef9edef08c010632d33413ad37390b781"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/dbx-core/src/admin/mq/adapters/kafka.rs:756-793 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:1350-1379 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"347d3822f3ed5463192e3bdc85d01fa8635a575d87277b95125b04971be67fcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/dbx-core/src/data/transfer.rs:7436-7479 | crates/dbx-core/src/data/transfer.rs:7519-7572 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":7436}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca95cb4b13fe2268b1c2371f70a32d3721c7057191eb099bf10404ee8c81331"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): agents/drivers/argo-go/query.go:297-353 | agents/drivers/hive-go/query.go:297-356 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2357d47c9439e49ed3d7d6c56b135d9c84eea229b4417bbd8467c0e775a715a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 42\u002B corresponding lines): crates/dbx-core/src/query/document_ops.rs:726-770 | crates/dbx-core/src/query/document_ops.rs:798-845 | crates/dbx-core/src/query/document_ops.rs:866-907 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c3f25ccc48add67393342cbc74f2ef0c487ad6016a954d1097dda5c26591c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:1670-1725 | agents/drivers/vastbase-go/vastbase_metadata.go:1029-1089 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba36c6a8d97aab7237604375de145a7323545b749441aaa36e2055495d95522"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1702-1747 | agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:144-189 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d11dcf5f85058fc489f29a59411ee9cc3d378f16452d0d0155d7cf4c3d8d71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): agents/drivers/etcd-go/main.go:358-435 | agents/drivers/etcd2-go/main.go:325-392 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d3ca843960fa18701140bbc8971877775e7cd4579020b1f11f6cbdb8cad6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:1898-1947 | agents/drivers/vastbase-go/vastbase_metadata.go:1218-1262 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e0ddec587c16eec9161b840a31e9c2b87be87082b8d7a24e8118ea72758988"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): agents/drivers/kingbase-go/main.go:886-935 | agents/drivers/vastbase-go/main.go:777-829 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c59b9189ccd38b8a9f6179d44315c45f8720b5bf35cab09e3fda08196c458a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/dbx-cli/src/main.rs:483-521 | crates/dbx-cli/src/main.rs:523-576 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/main.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf15ce2ed0044e0f6b2b014ec4dd0aba3e53115cf7608d1a3f06e4deccfc25a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): agents/go-common/iotdb-client-go/client/session.go:193-250 | agents/go-common/iotdb-client-go/client/session.go:264-313 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2794a70384c733bd14639157b91a20077b144cfa4ff706bec94a15376f829e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/dbx-ai-provider/src/ai.rs:3626-3675 | crates/dbx-ai-provider/src/ai.rs:3696-3753 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3626}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed855505c0e3dbb8fe926998ff4246e04e6e0ae49e27774001dcfca5fc940c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): agents/drivers/vastbase-go/main.go:875-920 | agents/drivers/xugu/main.go:4089-4130 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7fcb0fdee2892c1ac4906d57ba7dcd1bff31ea4eff03e8e1e9d5ff46b6d6f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:752-785 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:1084-1117 \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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9de20b35e5dd4c9e97b0493acda339e93a1bc358a06a5098551cf41a60909fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2751-2782 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6202-6231 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"916b65ca8a1f94ddf170e70ca5b9eb098a0349930819bf7f67fa668c327213d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:1922-1960 | crates/dbx-driver-postgres/src/postgres.rs:1966-2002 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"333492b370b0afa18f38cfe372cdd29536bfbba5a28198fc95259e0124e60297"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:322-363 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:305-352 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"085a1d7abe6ae7e44426756bfcb79dda3ec7adee2296f013944727e3a330a922"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 40\u002B corresponding lines): crates/dbx-web/src/routes/schema.rs:606-661 | crates/dbx-web/src/routes/schema.rs:688-727 | crates/dbx-web/src/routes/schema.rs:772-812 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 40 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"51231788a2797d75fba108b8d36f03fa30c037a99f843c5a9687f603f45b110f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/dbx-driver-elasticsearch/src/lib.rs:2124-2156 | crates/dbx-drivers/src/db/solr_driver.rs:871-908 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d900d7c54e683aad1f5029a10e73c8b4bae75316571ae1b5ac72e10faffeed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/dbx-core/src/data/database_export.rs:1380-1414 | crates/dbx-sql-data/src/data_grid_sql.rs:3728-3757 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"82141836be8ecaa53a54c11f76464db23313ee7f2a6c1529d72d5bfd755d4cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): agents/drivers/argo-go/config.go:685-717 | agents/drivers/hive-go/config.go:692-729 \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":"agents/drivers/argo-go/config.go"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"886dd2e435d8b26437ccaa7c6505861f3ab4c144fcf1ba4fc0f1bacdadfb156d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:9546-9587 | crates/dbx-driver-postgres/src/postgres.rs:9599-9660 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":9546}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ee51581f0403192434f939092ba1930172be58b91ac50efa801a77be48800a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): agents/drivers/argo-go/metadata.go:516-563 | agents/drivers/hive-go/metadata.go:527-574 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abaf9afa87f398ff33e28d91e1f2c0967f3ba85052bc33cb49a977cae7afce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): agents/drivers/oracle-go/main.go:2237-2283 | agents/drivers/xugu/main.go:2655-2701 \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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db0d49ca805c45de9748c217bf124263bdbbb1a17f81765a2dcd51f73985937"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/dbx-core/src/admin/nacos/search.rs:241-294 | crates/dbx-core/src/admin/nacos/search.rs:311-369 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/search.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ed836a47bcb9434168b109b62e61b8d7892a8936aca68523537de3ad07ed5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:323-349 | crates/dbx-sql-schema/src/table_structure_sql/columns.rs:687-713 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b522506c9f811fc290aad6431adb43e0fa67ac7fa2d1b66c376cb6a529d4fb8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/dbx-web/src/routes/query.rs:858-882 | crates/dbx-web/src/routes/query.rs:907-932 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6eb67d1bcce479dcd21f78ccd859c5ab74a0208bf645a3adbc88cb30cbf9f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): agents/drivers/rabbitmq/operations.go:27-70 | agents/drivers/rabbitmq/operations.go:399-449 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38c172b23fbd1d8e942f41ee6852a901a9c98b126966a0dee4d0ae4e587f92d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-web/src/routes/sql_file.rs:500-533 | src-tauri/src/commands/sql_file.rs:332-358 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/sql_file.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68f3d06886045652472a589d0443e8c3e9812c1d11d1fdefab87da5475b73ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): agents/drivers/kingbase-go/main.go:798-849 | agents/drivers/vastbase-go/main.go:676-712 \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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbd643c1dd6f74bc60106cbcd6d58f015a233a7a67c5abb783f862bb2770642"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-core/src/persistence/storage.rs:4701-4723 | crates/dbx-core/src/persistence/storage.rs:4754-4790 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4701}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7e1aa514a7f1b9af9435b91607c6272396910cfea4c27483866c5ecfea3d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/admin/mq/adapters/kafka.rs:383-405 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:631-646 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd562124843d433811def344b8a82dfd459241e738d1d46683bd41137e311a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/dbx-core/src/connection/mod.rs:4975-5023 | crates/dbx-core/src/connection/mod.rs:5245-5298 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":4975}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c2f026502bc2ad7658e55d2ed6f456358d9d14865149033b12b7e9d795c234"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:2697-2726 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2745-2768 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba99d8ab40812ff229804ec212814e4f1b808c6de70ebdaa3a2f91307de0d286"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): agents/drivers/xugu/main.go:2157-2208 | agents/drivers/xugu/main.go:2385-2424 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2d11131b74d8c5b0d36794f7c18a06b72a2f2ce7ccf7830a9c9fb2b7b48dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): agents/drivers/duckdb/src/schema.rs:421-452 | crates/dbx-drivers/src/db/sqlite.rs:1653-1686 \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":"agents/drivers/duckdb/src/schema.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde015d614e65212581f41b0c76e4687b7f7259b4844cd787b23399214edbf32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): agents/go-common/iotdb-client-go/client/column_decoder.go:91-141 | agents/go-common/iotdb-client-go/client/column_decoder.go:147-195 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/column_decoder.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97e81c06c475a60ba83503a80126ada5a680031fc23e802fca86f9044684c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/dbx-web/src/routes/etcd.rs:399-440 | src-tauri/src/commands/etcd_cmd.rs:264-296 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/etcd.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"545d2704c70c80a834eeb08b903c0742cc511c16c5b59a8035333aff0dbbbf6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): agents/drivers/argo-go/metadata.go:197-231 | agents/drivers/hive-go/metadata.go:197-237 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac40b49a93f5c4036f9ec8ba25cdd68534c04856ab1e21f770a8cf7530396f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): agents/drivers/kingbase-go/main.go:1003-1042 | agents/drivers/oracle-go/main.go:4950-5003 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c233b934c3a6582f77ba9c2d1ca8ddcedb6ccff31f275f114e25269d7bf2c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-plugin-runtime/src/plugins/installer.rs:948-970 | crates/dbx-plugin-runtime/src/plugins/installer.rs:975-997 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5c6719024ce0d8a20805b4a9b3d8b4474c92ab921519eebc6ece7fc02ce852"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/dbx-plugin-runtime/src/plugins.rs:330-353 | crates/dbx-plugin-runtime/src/plugins.rs:385-418 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6047b17f4d909f360181ae409f3ffc2131a1b783e8b90cc85402e909963654"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): agents/go-common/iotdb-client-go/client/session.go:973-1017 | agents/go-common/iotdb-client-go/client/session.go:1019-1064 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc27d239cf5669788b349e2778449960fb44ab397743aea15bc572612c599af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/dbx-core/src/schema/mod.rs:10712-10753 | crates/dbx-core/src/schema/mod.rs:10765-10799 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10712}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b150809c055a12ed2c2ec59345876e00c49f5aaec01a06290dd0dbc22c62b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): agents/drivers/duckdb/src/sql.rs:384-418 | crates/dbx-core/src/data/table_import.rs:2251-2288 | crates/dbx-driver-sqlserver/src/sqlserver.rs:4607-4647 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7829ce78132209d2937f27ecaed82ff5c92769a9d28bce123cbbf606a4c829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/dbx-driver-agent/src/agent_runtime.rs:434-458 | crates/dbx-driver-agent/src/agent_runtime.rs:467-491 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_runtime.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15a228c2aa6117da28b86e7090ce3fd0e40802742d3fccda41fd0a870429736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/dbx-core/src/persistence/storage.rs:8441-8493 | crates/dbx-core/src/persistence/storage.rs:10131-10164 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8441}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe47d763694a0f7424cd62f070aa39605d025d8d90a80942935972473f1beb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-driver-mongodb/src/mongo_oidc.rs:204-230 | crates/dbx-drivers/src/salesforce_oauth.rs:281-307 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d1d7735acd8ae57e925bae2ef865227e7f282f2718fee7e511e8fdb61da6e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:2338-2367 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2807-2834 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2843-2868 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c87832aa6523fe8b794ded521dfdb9e2a1d92b0890762bb6a425172a1d1b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:1727-1769 | agents/drivers/kingbase-go/kingbase_metadata.go:2734-2775 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e40ae8eb996ebeaf98f4d4c6f685b11af7cbaabb1f383c7af543edcc9b3524"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/dbx-driver-mongodb/src/mongo_shell.rs:1508-1550 | crates/dbx-driver-mongodb/src/mongo_shell.rs:1561-1599 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdabfb66a330c2d5facf3aeffb8700c6b8581f7feb8af844ef353e5023c37aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): agents/drivers/kingbase-go/main.go:1117-1160 | agents/drivers/vastbase-go/main.go:989-1023 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"07775cb14de98ef18b1e3ec6a68e5feecce9b3e41b1cd692cadb0981d43aa3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): agents/drivers/oracle-go/dbms_output.go:518-562 | agents/drivers/oracle-go/dbms_output.go:575-628 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/dbms_output.go"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5c01199b91e1f9c289965ae84930192dc6644c77d4b9d0919c361ce5264dd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): agents/drivers/argo-go/metadata.go:755-796 | agents/drivers/hive-go/metadata.go:766-807 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"57136036505dffa4e3abb8df0e44b87ee0ea679a14ae4144c202f576ee34ec5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:7014-7074 | crates/dbx-driver-postgres/src/postgres.rs:7085-7137 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":7014}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1d153d0638304ced90842dce9acbd79b8a076d72824e1c0d717a8e5cb4c92c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-core/src/connection/connection_secrets.rs:495-521 | crates/dbx-core/src/persistence/storage.rs:10170-10198 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4fbbf179a093c012f502c7f5e8d3bc6793381a5dad6c85fdedb9a8ac3e6f55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-core/src/schema/native_jobs/operations/dameng/rename.rs:111-135 | crates/dbx-core/src/schema/native_jobs/operations/observation.rs:69-88 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng/rename.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7104e9daa834708a0fb7fc48173f2b24d7f7fc0d812bc24f3e78752b03115c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/dbx-core/src/persistence/storage.rs:6772-6805 | crates/dbx-core/src/persistence/storage.rs:8554-8588 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6772}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5389ee956c22ef216cde908ca7df16f96134805d18890becb13f00aaedc379a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src-tauri/src/commands/database_export.rs:74-124 | src-tauri/src/commands/table_export.rs:70-107 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/database_export.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82ddf5e0edaec5fa8ec356e5af0c9d84c312cbe2dbc06f0a64675a143fda0ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src-tauri/src/commands/list_sql_files.rs:629-655 | src-tauri/src/commands/list_sql_files.rs:699-726 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/list_sql_files.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdf622261c5f1bc036e0f24b3e882e1c25e6f5e6aecbae5a2fe024e94e3bdcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): agents/drivers/oracle-go/main.go:2820-2876 | agents/drivers/oracle-go/main.go:2931-2967 \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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"128a43b2979b2d8b0909cb27211393373e57a1175c7c082146a5a9148039e1d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/dbx-formats/src/temporal_format.rs:46-91 | crates/dbx-formats/src/xlsx_export.rs:1137-1195 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/temporal_format.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e5bb040f424c3da311272b16f9522b91a17197e09421e94c7df56727d162e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/dbx-drivers/src/db/ssh_tunnel.rs:1826-1870 | crates/dbx-drivers/src/db/ssh_tunnel.rs:1891-1935 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1a85e694f5233e0bbb608b89df1f4e9b2aaadb73e200cf3e5ada8c5401c9a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/dbx-web/src/routes/schema_diff.rs:32-71 | src-tauri/src/commands/schema_diff.rs:66-105 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema_diff.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46b2086da36f8eecce4b0320bdb8a4ebe00e0df664a9abce7f3071726a8b5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): agents/drivers/rocketmq/consumers.go:95-126 | agents/drivers/rocketmq/topics.go:196-232 \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":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bdb0c5f2727d4bbb6122cd09c48f72b127635dc49e6a1dc5a3e190442b13d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-core/src/schema/mod.rs:10187-10217 | crates/dbx-core/src/schema/normalization.rs:98-124 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1672dab7952a2fb1272b31001477be88c6a01a7d742193c39bd5a31c3297d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/dbx-core/src/schema/oracle_ddl_indexes.rs:309-333 | crates/dbx-core/src/schema/oracle_ddl_indexes.rs:340-363 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d093338efa451a38a00e6454a56b9b74571579ea121e71c035c71f3bd0600ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): agents/drivers/xugu/main.go:4549-4579 | agents/drivers/xugu/main.go:4628-4659 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":4549}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e6e3bddb1bd31e55b35a70b28b48d76349f62eeb0468cdc32e3272c5ee2cb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/dbx-core/src/data/mongodb_dump/archive.rs:31-54 | crates/dbx-core/src/data/mongodb_import_export.rs:1368-1404 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/archive.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49b3b33b763accf96bd66e7db3284fb8ddb079e141c8c9483d90138998568b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/dbx-sql-core/src/value_literals.rs:85-114 | crates/dbx-sql-schema/src/db_admin_sql.rs:1399-1432 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/value_literals.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5afb7f15d844ad2f0ff955238f480dbd16c08ff2788ce1f3b76c2648508d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:181-213 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:107-143 \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":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d7738b4e45e23554c4e566dd1919e916530cc0c89a4d61c4a4344a2f950d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): agents/drivers/duckdb/src/sql.rs:127-163 | crates/dbx-drivers/src/db/duckdb_sql.rs:165-201 \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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee9bb960e299fac6d4ecce9c18edda791c6129e8b65b6c2498302d44a9ff0e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/dbx-core/src/query/mongo_ops.rs:1554-1586 | crates/dbx-mcp/src/backend.rs:3043-3073 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"645649cd0a2a3cca51cc58d44525ad4fa615128be2d32c110cdc3db1bd97f704"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-driver-sqlserver/src/sqlserver.rs:2363-2385 | crates/dbx-driver-sqlserver/src/sqlserver.rs:2509-2540 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ee241972bf0643d20e5fb11e07345cd9960d279c1396e12f07d526866b0f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): agents/drivers/kingbase-go/main.go:1362-1398 | agents/drivers/vastbase-go/main.go:1105-1137 \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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"753815b1050500c4c24c2a5bfcff0ba4a1ae483254087f3b042c259b7258ea82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): src-tauri/src/commands/mcp.rs:192-242 | src-tauri/src/commands/mcp.rs:244-292 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffa480f390733673895f4474737ae4458eeb6be0048c3eed599f8755a084577"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:2944-2968 | agents/drivers/vastbase-go/vastbase_metadata.go:1893-1917 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f164152f33d6a549c8f5e69bec9fcc3f5c8db19175700881057315c0c01b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/dbx-mcp/src/server.rs:2574-2602 | crates/dbx-mcp/src/server.rs:2609-2645 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9439f8f154f4defa2055e095680b703a981ed7167b3fd4abaff1be0d99f117"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/dbx-core/src/query/mongo_ops.rs:363-398 | crates/dbx-core/src/query/mongo_ops.rs:540-578 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4a9d3deea78efbf36f8aad06a6855dc7992d09aa12a7390ffb2183b6470e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:818-869 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1087-1128 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d7deed8c0e6e6a0d6eeb4c2f7206b3f3620a2e7398e2cb2db483c9d869fa22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/dbx-core/src/query/mod.rs:1414-1439 | crates/dbx-core/src/query/mod.rs:1446-1472 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f96eb1f1b540b36aa35a34a5c4a313de53fd1b98de8e145d733fd3fa3f8aaf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:225-246 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:305-320 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:197-212 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"563aa851f1c70002cf47763ebaeaef1e703c6e716932e12dd6cb0196f585acd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/dbx-sql-core/src/sql_analysis.rs:578-611 | crates/dbx-sql-core/src/sql_analysis.rs:787-821 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"095ded3d2814fc132c15a5f3490ca1cc0568f9237e7fbee1460a86bff1031fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): agents/drivers/xugu/type_members.go:562-585 | agents/drivers/xugu/type_members.go:587-624 \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":"agents/drivers/xugu/type_members.go"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc7bc0c9d840011db8f45bc5cc3642d355d8e75c3841ab1f8f2aefbfa305fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:394-432 | agents/drivers/vastbase-go/vastbase_metadata.go:245-281 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"94723d06c9a14dc76c71c252903e66620d86d20c3fa175c78206f43c159286b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/dbx-core/src/persistence/storage.rs:9554-9583 | crates/dbx-core/src/persistence/storage.rs:9699-9724 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":9554}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9676b3ad6c48aa8e3003988fa56d85196b05809372bb2e8ddb3af7db1f2305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): agents/go-common/iotdb-client-go/client/session.go:442-478 | agents/go-common/iotdb-client-go/client/session.go:490-523 \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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"88846b5c0c815e18ab65bf27d56dfb5d7137c26ea534a0e168f607c74ed14bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/dbx-web/src/routes/cloud_sync.rs:292-319 | crates/dbx-web/src/routes/cloud_sync.rs:464-496 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/cloud_sync.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"470887eac9d565e60bf1bb58d58332be5bdfe7c16e9783259c81ce22040dcee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): agents/drivers/oracle-go/pldebug_rows.go:80-124 | agents/drivers/oracle-go/pldebug_statement.go:21-56 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_rows.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda8e64299aa458250b27802a13d4abcde31611ee3c051e0a7fde0bba8c40ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4025-4044 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4054-4074 \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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4025}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85de85409679f11592b2eea13f0cd15891916c7a9249272be04c0876c7d2842"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/dbx-ai-provider/src/ai_cli_agent.rs:449-467 | crates/dbx-ai-provider/src/ai_cli_agent.rs:617-645 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df142fd167eb3d94ccc68cef1f87e1dc9f831569753a45a3ef0c7b1c9fc4562"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/dbx-driver-redis/src/lib.rs:5460-5488 | crates/dbx-driver-redis/src/lib.rs:5496-5524 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe8c2d8010351820fc369e2d118cd68eb820b9953a3151c28b5794b72e0dde2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/dbx-sql-core/src/value_literals.rs:18-46 | crates/dbx-sql-core/src/value_literals.rs:56-83 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/value_literals.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c10c0de3528f75edc2a8b9d6cfbcc1910d53c10bc93b08ddb6b5cbabbd7c2f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1969-2000 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2223-2258 \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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1969}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e17cc55fbe817726834e1026124ba75dc759e4b0b1549f32d73dc9a84efa87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): crates/dbx-core/src/query/redis_ops.rs:102-130 | crates/dbx-core/src/query/redis_ops.rs:1119-1151 | crates/dbx-core/src/query/redis_ops.rs:1158-1185 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"471763db1210393513559e9eebb4c8a67c6d19b099e10e84fbe3c6e82a891a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-core/src/schema/mod.rs:13361-13374 | crates/dbx-core/src/schema/oracle_ddl_indexes.rs:599-636 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":13361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8772fda1c1ae5eb190a27889eb50e2eb09e935285acc3d6d838711d093693cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/dbx-core/src/admin/mq/mod.rs:84-118 | crates/dbx-core/src/admin/nacos/mod.rs:84-107 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fa204f8b932127b2d9ce5d942bb9dbf57fe8bf8ce95520df122ba3f23e3cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/dbx-core/src/connection/mod.rs:2436-2474 | crates/dbx-core/src/connection/mod.rs:2482-2515 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ea3c197a8269026cb5ff57612021cc77cc781bdac3fcf3d4705b0644b8655a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): agents/drivers/argo-go/config.go:420-453 | agents/drivers/hive-go/config.go:426-460 \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":"agents/drivers/argo-go/config.go"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a63138512f62df1c11589fa28f2294a25e702758c8d106d04281507474f33de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:3658-3681 | crates/dbx-core/src/admin/nacos/http.rs:3683-3711 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":3658}}}],"partialFingerprints":{"codehealthFindingId/v1":"731d966d8ed6ad48f41650af670342a5a17bc091b3b8363c94664354b8f3a7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-driver-sqlserver/src/sqlserver.rs:3557-3573 | crates/dbx-driver-sqlserver/src/sqlserver.rs:3659-3680 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":3557}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98d7c5ad05f704c9b63903c69de00d98fa41a2344090a5baa388f54c4b34a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/dbx-core/src/query/mongo_ops.rs:486-526 | crates/dbx-core/src/query/mongo_ops.rs:600-632 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1929a4e0095e3a8ca1c86c42fd7b094823182ec24a14e106cb37a17a7e6dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/dbx-driver-elasticsearch/src/lib.rs:1876-1898 | crates/dbx-drivers/src/db/solr_driver.rs:579-600 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5d26096fbcfc7c3cdd31bfb710b94895cfb696903db8d0451b05cd7328218a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/dbx-driver-support/src/http_tunnel.rs:36-66 | crates/dbx-driver-support/src/http_tunnel.rs:78-112 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/http_tunnel.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc32a02ee24ff1c68305ab2ae26327fb345dae2e7a23cc613e3d580480b90b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-core/src/admin/mqtt/client.rs:355-374 | crates/dbx-core/src/admin/mqtt/client.rs:376-392 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3909fd076ccfcf28ce2528513cc8d41fb1e9756634428a45dc9094ae74e3f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:7900-7933 | crates/dbx-sql-core/src/sql.rs:3591-3630 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7900}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c839aa511cc097174f5260e9598fb93df144357c5a5685ab18d237ec37d3ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:2914-2942 | agents/drivers/vastbase-go/vastbase_metadata.go:1863-1891 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2914}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b51c9cd9c3e77d40c8cf249d3490412c3dc520712b6f9772e6add3cd8bf57db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): agents/drivers/rocketmq/consumers.go:530-569 | agents/drivers/rocketmq/topics.go:271-307 \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":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72ed3b1f613ccabe29165c55fe8abf2c69b0dbd2a64271e9c0fbccc8db8f288"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): crates/dbx-core/src/query/redis_ops.rs:189-214 | crates/dbx-core/src/query/redis_ops.rs:337-359 | crates/dbx-core/src/query/redis_ops.rs:369-392 | crates/dbx-core/src/query/redis_ops.rs:1329-1371 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9e940ffdbf7ed314505d7f26d693580a1e8664fbb89189a2aeb9d6c9a3935a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-core/src/admin/mq/adapters/kafka.rs:629-645 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:872-888 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc608ed69bafb8e1ecc4aa5828b173e969b7995508462db9709b9c93a8d8c8ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/dbx-core/src/schema/mod.rs:12170-12201 | crates/dbx-core/src/schema/mod.rs:12208-12232 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12170}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1dbb72a4a935c556d64268ab34c0eabd21047e9e81c39fc4fa56fc45af0134"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/dbx-sql-core/src/sql.rs:4052-4093 | crates/dbx-sql-core/src/sql.rs:4147-4184 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4052}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89bbecf8357986d1e975972d51b56c99433f33be4ea8ab2370dd8bf88da01a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 52\u002B corresponding lines): crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:428-479 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:481-543 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:545-597 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:599-650 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:652-704 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:706-759 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:761-819 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 52 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2269bd03b50e95df1bb2cf1767b8db95308b47538ec97e78df9d80327a002a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): agents/drivers/rabbitmq/operations.go:731-766 | agents/drivers/rabbitmq/operations.go:914-956 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f331848930f35168ef9e80d974ea6b3bab83854de9722e0dc35d7b5b7fdb27c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:2249-2264 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2271-2286 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"58467c4140e6b911ab4439e2ad1e5b5fe1b45ed954a8ce44fba653029567613a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): agents/drivers/kingbase-go/main.go:2088-2142 | agents/drivers/kingbase-go/main.go:2182-2233 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"4414ea6f0ed894e3a11e7e78b16d783ca946b0ecc2d96e81ed343addac49dcb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/dbx-web/src/routes/plugins.rs:351-385 | src-tauri/src/commands/plugins.rs:260-296 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/plugins.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd575afb0dbd2e0b73674c8b2311246b70d6d9ddbb747f9e8a37369bf39e96d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/dbx-web/src/routes/query.rs:1653-1683 | src-tauri/src/commands/query.rs:1274-1303 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76f22aefb92f8a1439a5ec4bf4ff446299295f1836047455216f31d5f6d2abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/dbx-ai-provider/src/ai.rs:3755-3811 | crates/dbx-ai-provider/src/ai.rs:3822-3871 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3755}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb8684cb4575812cc875076709493a8ff76f1ea290d72e69639f9c41e84f7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-web/src/routes/schema.rs:832-846 | crates/dbx-web/src/routes/schema.rs:851-876 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feceb16b7911203cc69e82274badbcbff8de4c8c6a7db3c2ab4dc95c0637d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/dbx-core/src/persistence/state_persistence.rs:360-385 | crates/dbx-core/src/persistence/state_persistence.rs:387-413 | crates/dbx-core/src/persistence/state_persistence.rs:415-437 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/state_persistence.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18c39f7e4199562581cdfc4d5b8acaa0a91624b4446324bab55e5a4fa66ac2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/dbx-plugin-runtime/src/plugins/host.rs:592-624 | src-tauri/src/commands/plugins.rs:147-184 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/host.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b591dde87d5b3831cc805cc278e218f15abe773d9ea15656a7cc512e1e8bbf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-ai-provider/src/ai.rs:2562-2588 | crates/dbx-ai-provider/src/ai.rs:2590-2625 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c75aa4dd6157188842750e045d3484be629828a68e667fdd0de1b4c92aa564d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:7036-7063 | crates/dbx-driver-mysql/src/mysql.rs:7075-7101 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7036}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09ec3527f52c7f9a79794248d5dec2e3c0705bf35a5943d026abef8237022df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:3982-4001 | crates/dbx-driver-postgres/src/postgres.rs:11002-11040 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":3982}}}],"partialFingerprints":{"codehealthFindingId/v1":"63642f94e1e22e251496497777d763007fb20dd2de58fdaec21c39186e39e2f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-plugin-runtime/src/plugins/installer.rs:1131-1146 | crates/dbx-plugin-runtime/src/plugins/marketplace.rs:796-810 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0821387332dee092f6d58f8f225bf214009d5244984a85c8d298a487ff317e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/dbx-core/src/schema/native_jobs/references.rs:121-138 | crates/dbx-core/src/schema/native_jobs/service.rs:644-660 | crates/dbx-core/src/schema/native_jobs/service.rs:665-687 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/references.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ee8de6831a9fb2bb8cc14204f79e17f15e7901f53d9133fdc3891fb72d85b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): agents/drivers/xugu/main.go:3270-3304 | agents/drivers/xugu/main.go:3445-3472 \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":"agents/drivers/xugu/main.go"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb00791918be618f8e55f812a73e4f3312c386feccb794a17e6f5a7719a2ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): agents/drivers/etcd-go/watch.go:89-116 | agents/drivers/etcd2-go/watch.go:91-112 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c34f25033092a3f27b6e57c7a6092eb3e3ef332927c0f4f5ffa71e3e5650245"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): src-tauri/src/commands/connection.rs:115-163 | src-tauri/src/commands/connection.rs:185-223 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/connection.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a101a74ab5ada1fdd8f4f78b54546a36c2c56d249ae2ee4360e3538492d55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/dbx-core/src/admin/consul/blocking.rs:364-387 | crates/dbx-core/src/admin/consul/txn.rs:357-380 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/blocking.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59b1e350db1ca070f7dff4a2682adcc4497b98dbe3da6c35f4c181b155ca07b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/dbx-driver-mongodb/src/mongo_shell.rs:1865-1904 | crates/dbx-driver-mongodb/src/mongo_shell.rs:1907-1941 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbd8a2ca94ca6bf7bdf2392c8430506f252cf21d47f4344de79f7cb30389296"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:2986-3021 | agents/drivers/vastbase-go/vastbase_metadata.go:1935-1970 | agents/drivers/vastbase-go/vastbase_metadata.go:1972-2001 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c19d4590b18d6d43b41c6e9f60d46255cc913dfdfa7e7dff8f2b4fa5464a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): agents/drivers/xugu/package_members.go:96-122 | agents/drivers/xugu/type_members.go:225-253 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/package_members.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f9b46edac266170dc2d5624b4a3c92fb8051213f04ce63f9c045fa830a989a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): crates/dbx-core/src/schema/mod.rs:11044-11072 | crates/dbx-core/src/schema/mod.rs:11097-11126 | crates/dbx-core/src/schema/mod.rs:11132-11161 | crates/dbx-core/src/schema/mod.rs:11167-11197 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":11044}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf13d1fae96c665724a9e2a9981e20c1abf0e7b05aeb639190f7fda6d469fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/dbx-mcp/src/backend.rs:1226-1250 | crates/dbx-mcp/src/backend.rs:1285-1302 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a880eb037972fab727bfa29e80421cc826c5091e30962ea0b1d7ae9eaebc14f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2493-2553 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2555-2596 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bdbd4c6fd6aaa90acae40abda51d085e2c20a9b6e914158c36b8a48753da9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:3343-3372 | agents/drivers/vastbase-go/vastbase_metadata.go:2160-2192 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1beb3687af036be4917fa5107eb635f5c7e25078fc26b2aed0368c0baa78c3fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:123-142 | crates/dbx-types/src/models/connection.rs:2370-2390 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"314a83233905cdb7d19bb0f627c51d810e359dc372f016a86f5df0527f45f1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): agents/drivers/etcd-go/client.go:273-305 | agents/drivers/etcd2-go/client.go:176-202 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/client.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01b5918acb59c286715a0865398480434fad7fee29d543d971a4b26fa1a287c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/dbx-core/src/persistence/secret_codec.rs:571-595 | crates/dbx-core/src/persistence/secret_codec.rs:598-622 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/secret_codec.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e5652f6add33031babf90913f7cb117a2cec895aa549f7036c2803500e5a88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/dbx-plugin-runtime/src/plugins/runtime.rs:1157-1177 | plugins/sdk/rust/dbx-plugin-sdk/src/lib.rs:655-672 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/runtime.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f68d34619737e20a1919b16e1106946b5aa6e3b64a620fa3a4ef702a920e620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): agents/drivers/rabbitmq/thrift_binary.go:306-342 | agents/drivers/rabbitmq/thrift_binary.go:344-380 \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":"agents/drivers/rabbitmq/thrift_binary.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"299e9babb97f05f66786c4771a0837bbdb05d4f906495f07ef7a2d4581233ab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): agents/drivers/etcd-go/main.go:256-278 | agents/drivers/etcd2-go/main.go:226-248 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7a82457b511678e4d45be4208a535fa9f53397ffc32b25c9124d1bf1c90d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-sql-data/src/data_grid_sql.rs:3642-3667 | crates/dbx-sql-data/src/data_grid_sql.rs:3669-3688 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":3642}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8ed9ec4d2167767c7b3cfcb53628d292058232a92578ea304346fe1bf904ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:738-771 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:433-472 \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":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd6e23336af084140661a79a9f2fa32d0634cc266348640aec978cf1e7382b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): agents/drivers/etcd-go/protocol_error.go:36-65 | agents/drivers/etcd2-go/protocol_error.go:33-62 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/protocol_error.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94d9fc7cdb008f4154795d3a4b5f0e42e818f475c039e895062120437b78349"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:614-638 | crates/dbx-core/src/admin/nacos/http.rs:640-664 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6aedc2f422f27a0bc7821d75550b23ff65ff816df4077d6a644ba72be790aee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-core/src/query/mod.rs:1122-1148 | crates/dbx-core/src/query/mod.rs:1150-1176 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0e6f5713d4281abb85747a994e602a4572a405aef1b43f472cf8f0a6eae41f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/dbx-core/src/schema/mod.rs:14287-14317 | crates/dbx-core/src/schema/mod.rs:14330-14347 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":14287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac12e0c90a7b38b4a0a5a86b512241830791cb156281fa1f191d01eefc684ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-core/src/admin/mq/adapters/kafka.rs:437-477 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:688-714 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e665866c37b8f199a4455044d8e4048e2def45eb551eb22c88a354c4d6e97e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/dbx-mcp/src/server.rs:3548-3577 | crates/dbx-mcp/src/server.rs:3592-3621 | crates/dbx-mcp/src/server.rs:3636-3656 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3548}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb57452a351af77d6ef1bae0a8df17841e152b658da4db502f74d47eaaf37d49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/dbx-ai-provider/src/ai_codex_cli.rs:401-417 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:383-399 | src-tauri/src/commands/mcp.rs:1601-1618 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a602ee6788cc104261449ac50fe22e3f068aab144e243ba7325c6e1e0efc3e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): agents/drivers/vastbase-go/main.go:922-948 | agents/drivers/xugu/main.go:4166-4195 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f014b2cf40d3ec532792a677ea13c6b6096c31a73eb01fbcd1c2a4cfeb4936"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/dbx-core/src/persistence/storage.rs:7746-7766 | crates/dbx-core/src/persistence/storage.rs:7775-7796 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":7746}}}],"partialFingerprints":{"codehealthFindingId/v1":"288e92ccc20cb6dcde1cc7803494b2e68009fb270d14a734064f93a39c1c97aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1297-1327 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:418-445 \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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38e20bfb8e4fededa0648eaeb96bb9021100d965f5052657e153a6c87a04b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/dbx-core/src/data/database_export.rs:555-567 | crates/dbx-core/src/data/database_export.rs:2839-2859 | crates/dbx-core/src/data/transfer.rs:9589-9610 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a9b306a4d1da6d6c106e28ec21daf5612d6e6edd39e8afa78b2fb222a98ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java:193-213 | plugins/jdbc/src/main/java/app/dbx/jdbc/NativeLegacyJobSession.java:256-279 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b81cdd9899d07f34806c32455c9ff91f54ac63aa32854ef7915209e4a828fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/dbx-drivers/src/db/proxy_tunnel.rs:379-408 | crates/dbx-drivers/src/db/proxy_tunnel.rs:410-443 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/proxy_tunnel.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5b11a1533e5f188f0de4129bd8c6dc39d544166547d80dd2376c3f63893cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2077-2095 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2190-2207 \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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57fd5e8d3f0c13a0fed0c7fb12f013ce475b3f542f8e18515748415431c472b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): agents/drivers/duckdb/src/sql.rs:81-101 | crates/dbx-drivers/src/db/duckdb_sql.rs:97-117 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e85f564d053f30d6ee46bec1661616cf7f270b1ca0db33592984ca84d47ffa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/dbx-core/src/connection/mod.rs:9050-9072 | crates/dbx-types/src/models/connection.rs:3164-3185 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":9050}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2b3acfb0c60ee4d195b3f4b8cef6d12296deb1f9f6167d9ad46e70b51c3c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src-tauri/src/commands/saved_sql.rs:343-367 | src-tauri/src/commands/saved_sql.rs:369-389 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/saved_sql.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d0cee5198d9f4ad58153436ce93350d36cbac065bf30b5f75013432a59d931"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/dbx-sql-dialect/src/sql_dialect/inference.rs:180-217 | crates/dbx-sql-schema/src/schema_diff.rs:3373-3405 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/inference.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d42b386f20a1340367c824ea2c4e74fed8ec86427c15d03f12bad8ef6de7f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/dbx-core/src/schema/oracle_routines.rs:377-398 | crates/dbx-core/src/schema/oracle_routines/readback.rs:57-81 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"4219159da729225aaffa0e76db8f51f5b29e81595a41a43cb22fdf69a6b4e153"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugBreakpointRegistry.java:140-150 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugBreakpointRegistry.java:152-162 \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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugBreakpointRegistry.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a3b2b2b0af855c2852cbfdc22160c1ff36de286599da25e5f0e3a267bf0f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:420-439 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:710-728 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c0f863657e76e5ddb3d1b6f71f2078d25ac499e8fb097824c5db341ba56a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/dbx-core/src/persistence/storage.rs:6728-6770 | crates/dbx-core/src/persistence/storage.rs:6819-6852 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6728}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0be6e7c0332fc5c2f327049027d7cb08bacfb9b3b7eb45127e04c45b66a245d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:323-350 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:353-379 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"80039257476543f8f66aff9291c530303124d80c0fdbc907923e84fa5bca83d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): agents/go-common/go-gssapi/krb5/krb5.go:582-622 | agents/go-common/go-gssapi/krb5/krb5.go:660-695 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/go-gssapi/krb5/krb5.go"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"036b5a1cb231349acb736851a5497666e058561c43dce39c2bfd5c22efd4881e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:3086-3104 | crates/dbx-core/src/persistence/cloud_sync.rs:3110-3130 | crates/dbx-core/src/persistence/state_persistence.rs:477-494 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":3086}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05860a99a8d062af31256023079b915c21791207b9c15d6bb81b469e7765faa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/dbx-core/src/schema/mod.rs:1138-1171 | crates/dbx-core/src/schema/mod.rs:8272-8311 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7edb465c16d7a4e2c7f5a90d2800eccafe4bb6fa079d806d18744a6dbce4727"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/dbx-driver-redis/src/lib.rs:4573-4602 | crates/dbx-driver-redis/src/lib.rs:4718-4768 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":4573}}}],"partialFingerprints":{"codehealthFindingId/v1":"75586a6e46899495db16c6a011826d3fb9eb8b1a323646371d823db239b6d29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): agents/drivers/neo4j-go/internal/neo4jcompat/modern.go:13-50 | agents/drivers/neo4j-go/internal/neo4jcompat/windows_legacy.go:14-51 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/internal/neo4jcompat/modern.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73b68fbe03c19dda65b69a22151a0b7462b3d83853cda6e07754982323fa5a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-ai-provider/src/ai_codex_cli.rs:106-123 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:247-261 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"103d9cb2cccf1f2bd1e2782991caae742a496512623b05d1db38b97be19f3b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/data/table_import.rs:2886-2898 | crates/dbx-core/src/data/table_import.rs:2965-2978 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b2e14d5d076a0924be410b7e67e13d12b7aa9394c69cb95e1cfc7d834eb0e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/schema/providers/native.rs:222-234 | crates/dbx-core/src/schema/providers/native.rs:240-252 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/providers/native.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd8da895ce5dc5a40d1eae04e9df3c91ba14840d264067eea57bcdb03e4cc9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/dbx-driver-agent/src/agent_service.rs:4357-4378 | crates/dbx-driver-agent/src/agent_service.rs:4380-4406 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":4357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3811d3777ace12a4ca727f55781db7f854765461f31367a92b18b97482f82998"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/admin/nacos/access_control.rs:85-95 | crates/dbx-core/src/ai/agent_tools.rs:74-85 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"30815df0c35b27f58b5618f27d159a376df1359ce8b22568a2a148a66532d35a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-sql-schema/src/table_structure_sql/indexes.rs:417-439 | crates/dbx-sql-schema/src/table_structure_sql/indexes.rs:506-535 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/indexes.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e05ef5a9be1a90af2a91fd514eff0d67ad447bfc5372a15d8601ba0f8d9c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-ai-provider/src/ai.rs:2943-2962 | crates/dbx-ai-provider/src/ai.rs:3109-3131 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":2943}}}],"partialFingerprints":{"codehealthFindingId/v1":"75277dfe42f63e7df255d9fdd810a6893b9f003089b68fa217dab0dbc6feb891"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/data/transfer.rs:9471-9486 | crates/dbx-core/src/data/transfer.rs:9494-9509 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":9471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f674a0fbf7aa2b2f6d8f52f0efc1679932d847505e0427161d462f2f9f160e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:3845-3867 | crates/dbx-types/src/metadata_filter.rs:63-74 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3845}}}],"partialFingerprints":{"codehealthFindingId/v1":"545b8ecf6e8daf1e938e78f4b4405009db2b9a1de6e4b03e85d5fa7b5378584a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-drivers/src/db/couchdb_driver.rs:702-714 | crates/dbx-drivers/src/db/solr_driver.rs:1075-1087 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4b44eceabfb4e15d109e549470030828773e04097ebf94198a950bc578da08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/dbx-web/src/routes/connection.rs:1091-1108 | crates/dbx-web/src/routes/connection.rs:1114-1135 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81580a4aebbf06cc4d4eb9d442da45542b3ab3edd81838ee5b7384bd26eb495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src-tauri/src/commands/app_settings.rs:531-560 | src-tauri/src/commands/app_settings.rs:591-609 \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":"src-tauri/src/commands/app_settings.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed5df3b11d47473bae8427714663dade4137cbff3549f0bb5f0f68806b90b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1224-1242 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:1846-1869 \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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"819363865ac60b1608ee7afb73a62a727f9d265d080f0735df1d50887b24a000"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:146-166 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:213-235 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:253-275 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:458-480 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f3d1712aa48fac9d1624ba70d0b3706cfc384be75bdce81f5574f8bf352000"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/dbx-core/src/admin/mq/adapters/kafka.rs:146-173 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:216-239 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0452344a0be080fc4a4c350cefc8255a575b891d4c126418f594dac0d0d5f963"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/dbx-core/src/persistence/storage.rs:1757-1789 | crates/dbx-core/src/persistence/storage.rs:1791-1818 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d579fc3301688336b288c59157aec9ee46267aa5cf5ba503234e20d9118eeeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-web/src/routes/cloud_sync.rs:277-287 | crates/dbx-web/src/routes/cloud_sync.rs:501-522 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/cloud_sync.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa63ebe68840c53af3246794e5623ae1694aaa13e8582831a38afda188d1b2d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/dbx-core/src/persistence/storage.rs:7607-7624 | crates/dbx-core/src/persistence/storage.rs:7723-7740 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":7607}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a057df41032a76780ab96be9cdbbfff4fa5a0bb6b86e4520fdcfad1b6ecefa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src-tauri/src/commands/mongodb_dump.rs:36-59 | src-tauri/src/commands/mongodb_dump.rs:66-90 \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":"src-tauri/src/commands/mongodb_dump.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c04a83821a7f9ec23dbf64f26439081401286be98a13ebf9229b77a709cbc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): agents/drivers/duckdb/src/schema.rs:19-42 | agents/drivers/duckdb/src/schema.rs:78-93 \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":"agents/drivers/duckdb/src/schema.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6407f2bca095f1fd84f27d07fd0d97a1eb8e562a2ca34ef0e1e702b2c6b63668"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/dbx-core/src/connection/mod.rs:8927-8947 | crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:103-127 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8927}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bd175a9d1da72a2e032e6ac7f44a0908bae480fd457785c3d48bb6c1755e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-core/src/persistence/storage.rs:6997-7019 | crates/dbx-core/src/persistence/storage.rs:9409-9436 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6997}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ed9835db78f0d5e398b45aa07015d55c5517f32cb73b375eebac87ea122782"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:5051-5066 | crates/dbx-driver-postgres/src/postgres.rs:5938-5953 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0122a87cd528a929750573b9213e41e2dd75038f76017c83d847255c730850"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/dbx-core/src/ai/agent_tools.rs:441-489 | crates/dbx-core/src/ai/agent_tools.rs:611-657 \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":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"9375f68e7832cbf06bd9e1aac08f8d0ac3ac0fda6321a26c2a2ab69d92bb15c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:2667-2685 | crates/dbx-core/src/persistence/cloud_sync.rs:2704-2723 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2667}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f75e30ebf8a65d6b588c7cb765ee2608a6bb228673214e4f5eebf0ff440a48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:328-343 | crates/dbx-drivers/src/db/rqlite_driver.rs:201-216 | crates/dbx-drivers/src/db/turso_driver.rs:262-277 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbb47e29740f1a0f0ba949011061a4028ad9c1af8fc92b63b5766336b74dc9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:388-409 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3854-3873 \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":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f750ba65c074516f837bd2220cd5bd4697fbd387fece8e7c876965fd4352446e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-core/src/connection/mod.rs:1232-1254 | crates/dbx-core/src/connection/mod.rs:1256-1272 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1583dfc6df2520685dd43a2def340d25f1bc5c79092eb74bac0344642b2c9d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:757-772 | src-tauri/src/commands/plugin_storage.rs:104-121 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f6f8aea97b974c7f6d6aa82ebef3457404d2068544f5ab15adcc332d685d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-core/src/query/mod.rs:881-897 | crates/dbx-core/src/query/mod.rs:904-925 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5346cad38350c76317b0ad68e2e84f6aaf12a960d410023f298eade08193b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:912-933 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2999-3017 \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":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"799d6c4581cfa3eaf65da28c0ae335cf6a03fa7ad20224e4dcaf2c208b3d7620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1245-1259 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1266-1284 \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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5bfcdaf8de44c8a4b80f8edcd3371c467f3f8f9e019b95126dea1cc5461363"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:2774-2798 | crates/dbx-core/src/persistence/cloud_sync.rs:2823-2847 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2774}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae19767be9098a0bcf9bdabb2342eb18adf193f01686b69275c9624da8034ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/dbx-core/src/schema/mod.rs:13108-13121 | crates/dbx-driver-mysql/src/mysql.rs:8082-8092 | crates/dbx-driver-mysql/src/mysql_compatible.rs:240-250 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":13108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a32fd79b9d9211a48c742e91e830632a32ccc4e36d01a42cfddb661f2bab82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/dbx-driver-redis/src/lib.rs:4031-4054 | crates/dbx-driver-redis/src/lib.rs:5846-5871 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":4031}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ed67a4dd20a2486210044fd3e8e4a4e0f207307392f3ab9054a728a954f75b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/dbx-drivers/src/db/questdb.rs:50-75 | crates/dbx-drivers/src/db/questdb.rs:81-102 | crates/dbx-drivers/src/db/questdb.rs:108-124 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/questdb.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"263272294fad644cdf04d64b52811ee0eae47e37fb13a281af3323bfdc4d3582"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): agents/drivers/etcd2-go/auth.go:51-73 | agents/drivers/etcd2-go/auth.go:75-99 | agents/drivers/etcd2-go/auth.go:195-217 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 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":"agents/drivers/etcd2-go/auth.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec67aeea98a8fe6117ea5a9e510af6c748d255c0ff45a9e395f0cbd711a55bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): crates/dbx-core/src/query/mongo_ops.rs:704-735 | crates/dbx-core/src/query/mongo_ops.rs:743-766 | crates/dbx-core/src/query/mongo_ops.rs:966-990 | crates/dbx-core/src/query/mongo_ops.rs:1101-1122 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd962b4d39293d807f3dc62d17e8d012730369c2776fb151d66eef713c008afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-core/src/schema/exact_metadata.rs:158-178 | crates/dbx-core/src/schema/exact_metadata.rs:191-210 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/exact_metadata.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf01014af2828804ea02d8f3907cec20de7ff8f3c9b9a26edfadae8a2930777"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:5729-5747 | crates/dbx-driver-postgres/src/postgres.rs:5754-5772 | crates/dbx-driver-postgres/src/postgres.rs:5792-5815 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":5729}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca962d8db2df15bc5e74cabd25bb8cd3224cef9bbad24c3406cbcbf0c21a3ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/dbx-sql-data/src/data_grid_iotdb_sql.rs:11-40 | crates/dbx-sql-data/src/data_grid_tdengine_sql.rs:53-86 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_iotdb_sql.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c758d5116bf22a37580e89f1de54c8e143cf38bb81b5e40967b6aa749c3532dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/dbx-core/src/admin/mqtt/client.rs:927-951 | crates/dbx-core/src/admin/mqtt/client.rs:957-974 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b842e5627248c363f043fe78a133e1b1d76b5291334d3a1f0a55214d7739c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): agents/drivers/argo-go/metadata.go:87-136 | agents/drivers/hive-go/metadata.go:87-136 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"86760d293457ac892468ebcc195ed0ca6f77cabbb953d9f7c8f6f974ab5d8682"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1256-1277 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:352-375 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2f87cf59786ae7e8b833c4e7a3c4042ef92948a1e6cbd20f4f12c3304c395a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:642-669 | agents/drivers/yashandb/src/main/java/com/dbx/agent/yashandb/YashandbAgent.java:111-130 \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":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac4cacf3c38a624292f601bbfc74e604abe092f6af52d22b9544fa4f7279233"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/admin/mq/adapters/pulsar.rs:1027-1036 | crates/dbx-core/src/admin/mq/adapters/pulsar_version.rs:438-447 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/pulsar.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"623acc873a9d927292dbb276a039ea1b3dd8aa80881a266de97500a21940ba8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-core/src/connection/jdbc.rs:782-795 | src-tauri/src/commands/app_settings.rs:744-758 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1712bc7c44f1ca0e92ff5f2da5e5e7e1b36ee88262ee41c22f9a4f52faf1614"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): agents/drivers/rabbitmq/operations.go:673-704 | agents/drivers/rabbitmq/operations.go:809-829 | agents/drivers/rabbitmq/operations.go:1398-1422 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"18deb1930a53d217e924ed31fc210ce1d742742793dda72e7c993f3b2e69e54d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-driver-support/src/ddl_scan.rs:21-43 | crates/dbx-sql-data/src/query_result_sql.rs:3166-3188 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/ddl_scan.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c15ceea9014ad16f6025536c5daaa7a18b3ee942687b7d62e9ea158a86b865"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java:218-234 | plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java:276-299 \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":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"216d0af65f0354f4acbd2b6d167294458b5d624c1fe4b9b977fc2d684e7c1a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:205-225 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:337-357 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:289-309 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3fc0763ee76e9ffcc6c7d0d09172d3d4bae704e2197db6adbbf144fa7c2836"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:2387-2418 | agents/drivers/vastbase-go/vastbase_metadata.go:1465-1490 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e454069a94b62b0d486bdccd226e966ec456b054aa10c5ed2f4fdc05dc1b11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/dbx-core/src/data/sqlite_backup.rs:92-110 | crates/dbx-driver-agent/src/agent_service.rs:2772-2792 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sqlite_backup.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a313f5f09098ca81d4311783eff2fc5885e20147013f01828a1c972f3cff3571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java:1482-1511 | agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java:2034-2059 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"a297093573d78804afac739bd999d5384ab42662a903c422ca152afcb85800a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): agents/drivers/argo-go/metadata.go:703-724 | agents/drivers/hive-go/metadata.go:714-735 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad44e44bc08a2159e59d3c5745ba216463dd50d7bd958ba04c07f513f14c1d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): agents/drivers/oracle-go/pldebug_rows.go:132-156 | agents/drivers/oracle-go/pldebug_statement.go:64-87 \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":"agents/drivers/oracle-go/pldebug_rows.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a188f662c7f46ba94aba2750b9cfee0dbb3bcc43c42322e5b26c4621fb85794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:485-512 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:857-876 \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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3ad29459cf5a78606c0c995fb1aada24edf66ebfad893520785a3dcb057ef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): agents/go-common/go-gssapi/krb5/message_token.go:211-250 | agents/go-common/go-gssapi/krb5/message_token.go:440-478 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/go-gssapi/krb5/message_token.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9c85443231d073d4bd9fd88547da6a91911029e931149fd00db5ffe32cb966"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:826-847 | crates/dbx-ai-provider/src/ai_cursor_cli.rs:336-357 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:560-581 \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":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7ba7e5fc4e5f0dd01cd3ca136a2f2ce88b938188f29030dd92489a10d26f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/dbx-core/src/admin/mq/adapters/kafka.rs:795-825 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:1061-1086 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b12bf4704012081fcfde8a0ee78c06c5ac6182b30c00f123a3d1a6be501491"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/dbx-sql-data/src/data_grid_sql.rs:4036-4061 | crates/dbx-sql-data/src/data_grid_sql.rs:4070-4090 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":4036}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e6c467ad6adc4143881b54e6619b08bf74e0d31ccda0a367a9ba21f3af7e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:1379-1401 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:1403-1421 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63a5be896cf840abdae21bab6dceafe0c34e6e555574505be4b68be05a79381"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:2775-2788 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2876-2891 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"d323d628b9a3b7238275bd57426a517cb9da59023729d51aa990085d9e502211"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:327-352 | agents/drivers/vastbase-go/vastbase_metadata.go:178-203 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dadf75dcc6ba967f8fd6eeaf98aee464ac384175ab19992895577602ba6eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/dbx-core/src/schema/agent_pg_sequences.rs:172-190 | crates/dbx-core/src/schema/kingbase.rs:202-220 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/agent_pg_sequences.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75d4548aebd10461d3593320ca0407c7a9bf91b38e6e4c199589fd7f9516d4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-driver-mongodb/src/mongo_oidc.rs:62-77 | crates/dbx-drivers/src/salesforce_oauth.rs:141-156 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3785a7f5ea7a5017fa7bc323fc81c61ce214573e76652c41cea51296e7ff35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-web/src/routes/plugins.rs:234-244 | crates/dbx-web/src/routes/plugins.rs:332-346 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/plugins.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bdc694428e0356c2eaddb23873f170c4955c5214d9b3e90be80b67a99e6547"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): agents/drivers/oracle-go/main.go:1902-1926 | agents/drivers/oracle-go/main.go:1989-2017 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"890f91915885f589173955bb3b09f1ccf57d77f196a4ae3c4aed4f8adc5a5c16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): agents/drivers/oracle-go/pldebug_breakpoint.go:110-130 | agents/drivers/oracle-go/pldebug_stack.go:89-109 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a036883243a3f0cff0f27f2156e4e2ce5bdbe02a6df0848c4a8b50a4979215"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:516-540 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:867-890 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:486-508 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b8f6d8187f88d9248f35dee5d15035534d95fe11c9889facbc00a633cccbc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-sql-data/src/query_result_sql.rs:1470-1502 | crates/dbx-sql-data/src/query_result_sql.rs:1609-1635 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d6fc8db271dec1c413f9d2a6717d2853adbe800b6aa85a2c069c65cc99b818"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-web/src/routes/mongo.rs:413-428 | crates/dbx-web/src/routes/vector.rs:88-103 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdea460a78adc887428cd52c8b19a167770e5a168e90b5022213d1ad62f796a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): crates/dbx-web/src/routes/mongo.rs:682-697 | crates/dbx-web/src/routes/mongo.rs:819-840 | crates/dbx-web/src/routes/mongo.rs:846-866 | crates/dbx-web/src/routes/mongo.rs:902-918 | crates/dbx-web/src/routes/mongo.rs:924-940 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d22e6c846d9e8512912450f11bfd258d2693d73a3b4f29d2b6128ca875190ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/dbx-web/src/routes/mongo.rs:703-717 | crates/dbx-web/src/routes/mongo.rs:780-794 | crates/dbx-web/src/routes/mongo.rs:985-1004 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedc10bb64fbe5325c4fac5c3520700c1df1770ccc2fb62e3d9f8a98df4763ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:2313-2339 | agents/drivers/vastbase-go/vastbase_metadata.go:1704-1719 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df2639d9a77b89e8acbb784ebb7868f63b39dff36d830d4f8ae8837018e16b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): agents/drivers/kingbase-go/main.go:1252-1278 | agents/drivers/oracle-go/main.go:1545-1573 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"beebcf35a099b59b1b52b96851488fea75f2237260188d8d73488b310df7abcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): agents/drivers/xugu/main.go:5730-5765 | agents/drivers/xugu/main.go:5767-5800 \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":"agents/drivers/xugu/main.go"},"region":{"startLine":5730}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6eff3cf76444c688aa2a483bc253a7c6dbb097dba2581d56d77553eebfbc1af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:69-84 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:246-265 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"895b0943f501aac900faba15d038de9661db740cb3fd169090854c414449a1cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:200-220 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:277-297 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc9358aedc6975799be03f1f5d8dbe9ca5e420bcb2e3bc0dce38ed66a108734"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:548-565 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:592-613 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"86269577be51c15e8517ee5ee2b879a96c7c552bd816c926bd1d169ddcd9098e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-web/src/routes/mcp_policy.rs:237-251 | src-tauri/src/commands/mcp_bridge.rs:1284-1298 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mcp_policy.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b02c73e3e02107d0154a1cdd0f71fa82b4091419cf5d02bd9a81450035e4590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/dbx-core/src/admin/nacos/access_control.rs:155-172 | crates/dbx-core/src/admin/nacos/access_control.rs:174-196 | crates/dbx-core/src/admin/nacos/access_control.rs:198-222 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b33c9932f1ecb7fdb3ad62b95969502c4197e27aa6205d17edd050accd79fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/persistence/config/governance.rs:225-237 | crates/dbx-core/src/persistence/config/governance.rs:239-251 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/config/governance.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11f7cfdd9dc32fc294b6032e08a6ea56b8eb106c245ff077af0a9a8e126f7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/schema/mod.rs:10674-10686 | crates/dbx-core/src/schema/mod.rs:10827-10841 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10674}}}],"partialFingerprints":{"codehealthFindingId/v1":"866f220435553409d99162d111b10502d146cddcccabc45fb879ef2eff390b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src-tauri/src/commands/cloud_sync.rs:198-224 | src-tauri/src/commands/cloud_sync.rs:393-411 \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":"src-tauri/src/commands/cloud_sync.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8d3d3edfc6377e86676acc95584bf899a69b999ca272aa1fb4994c8e4e761b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src-tauri/src/commands/plugins.rs:192-206 | src-tauri/src/commands/plugins.rs:241-253 \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":"src-tauri/src/commands/plugins.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7ab19baa3d0a19ea81686d960f7eb3f3807c5d965efa777b92767924fb050f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): agents/drivers/rocketmq/consumers.go:128-153 | agents/drivers/rocketmq/topics.go:145-166 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"634593bf873c18c3655e827524cece1dbd3068f0d0201439a68f5fae74627102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:1665-1687 | crates/dbx-core/src/admin/nacos/http.rs:1692-1714 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"580208f3df6d1b2829e3288abf841a37eb8455b81318866b6dea8c7e90e965a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-core/src/schema/mod.rs:12902-12916 | crates/dbx-drivers/src/metadata.rs:3-16 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12902}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f709a4653f2985f48b3ec7e583a9cd6a7b18ba4d303c4a4cab10be05290464a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:2690-2704 | crates/dbx-driver-mysql/src/mysql.rs:2769-2783 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d59ce1d73a5a0211a77115085199a27e3d3c795094afd31aa1a69a5a1cee9b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-web/src/routes/consul.rs:1320-1331 | crates/dbx-web/src/routes/consul.rs:1520-1537 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f776cb403a01d8d1fd0063bb8a2734af91facb261a19aa6ba68546f163f7f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src-tauri/src/commands/query.rs:448-455 | src-tauri/src/commands/query.rs:479-489 \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":"src-tauri/src/commands/query.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5601e87bbd15a85d9fefbb07b564266c0671477024d5d128530865ffa68f2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/common/src/main/java/com/dbx/agent/QueryPageResult.java:189-204 | agents/common/src/main/java/com/dbx/agent/QueryResult.java:221-234 \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":"agents/common/src/main/java/com/dbx/agent/QueryPageResult.java"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bab84746b20047b59efd144c538992addfd208d7d745288d3d2b22c4677aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2623-2677 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2679-2706 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3df9cf33dcf64627519582fe79ebbe48e2e109a0f5a8f112b5dd6652ccb100"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3303-3320 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3396-3413 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b23b8e55585eac82441bafadbde730f57facddfdf0fb15ad10001e614b7920"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): agents/drivers/oracle-go/main.go:2321-2347 | agents/drivers/oracle-go/main.go:3306-3342 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e73f2222322172192ff6cb40845447e29da064a449d1829616d6cc2ff49a447"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): agents/go-common/iotdb-client-go/client/session.go:1125-1148 | agents/go-common/iotdb-client-go/client/session.go:1150-1173 \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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c86704cb4f8ede7ab20983a57b7bb4d5c584f22720b8db209fcb0d0790d24b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/duckdb/src/schema.rs:102-118 | agents/drivers/duckdb/src/schema.rs:126-138 \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":"agents/drivers/duckdb/src/schema.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3cd8656ec4b1d577436e4ea501dbb261c29e88554e647cc216fd53961a47ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-core/src/data/mongodb_import_export.rs:1284-1303 | crates/dbx-core/src/data/mongodb_import_export.rs:1305-1325 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3083fb2014448152f749fc7cb616aaf952c8cf819b78b4f484852e3d4d3268a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/dbx-core/src/data/table_import.rs:3134-3154 | crates/dbx-core/src/data/table_import.rs:3156-3178 | crates/dbx-core/src/data/table_import.rs:3209-3226 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3134}}}],"partialFingerprints":{"codehealthFindingId/v1":"74525cb4691dae75b1f0dacbda93bab1efe056c32862e1d505153bfe5e508b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-drivers/src/db/couchdb_driver.rs:41-52 | crates/dbx-drivers/src/db/solr_driver.rs:63-74 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de537c8acec30a2da824fad3b00b7cb5e31a54ef181c84f935d1bd337fe3414"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2350-2369 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2381-2400 \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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3b8a0359552b9f936b5e83d9e42797bad1a063d866f53ec14e6dbe4f1a20e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:2168-2207 | crates/dbx-core/src/admin/nacos/http.rs:2245-2281 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a905b160c5aec46533f3e10db5fc09dc3811a0468e206a95b006e5a1458f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/dbx-driver-redis/src/lib.rs:5533-5550 | crates/dbx-driver-redis/src/lib.rs:5559-5576 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c2b2ce750aee4036079bd52470d8e93856a35fc3a8e06e44b9be1579bb15aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-sql-schema/src/schema_diff.rs:915-937 | crates/dbx-sql-schema/src/schema_diff.rs:939-970 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e70b84ac1e9273e246b4c2bdb9aff40e529e9ee3e6abd0cb1c3e67abf905d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java:247-261 | plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java:301-320 \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":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a036b8396ae8140d25c97a8bbe5f41b60e418393fcc90b5817e64fde2b19cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/go-common/iotdb-client-go/client/rpcdataset.go:442-461 | agents/go-common/iotdb-client-go/client/rpcdataset.go:479-502 \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":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ceb6d64fc735efc24168d9b6278d44e836d0fa2d75ede3fa78541da735e780"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-core/src/connection/connection_secrets.rs:737-753 | crates/dbx-core/src/persistence/storage.rs:10366-10393 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"553a887e16568b5125e10410cd925cdd6644287b09b5b6bdaabdf8db628db1e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-web/src/routes/mongo.rs:398-407 | crates/dbx-web/src/routes/vector.rs:73-82 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1450b54257ab0be35bdfdc1bd9efe68f3aeae285c65278c355c6593cdfe75c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:879-892 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1363-1381 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0386524b2c4cc793ab62128193d2c95701525926b401d3a9d53bc3515971eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/drivers/xugu/main.go:4581-4602 | agents/drivers/xugu/main.go:4718-4737 \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":"agents/drivers/xugu/main.go"},"region":{"startLine":4581}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b43fe6e901fa1741761f2773315f6303ce8b745246bd7108553d4c3a8780404"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): agents/go-common/go-gssapi/krb5/message_token.go:160-187 | agents/go-common/go-gssapi/krb5/message_token.go:377-403 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/go-gssapi/krb5/message_token.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fc039463cb52b9cf863a90869b9c418b96801e1db4a133383ee3bbc9d2b54d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/dbx-ai-provider/src/ai_cursor_cli.rs:103-125 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:154-174 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"40068511c6fee644cd67842a536880d7d62f70700a85133324a52c1718e9bbdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-core/src/admin/consul/client.rs:168-184 | crates/dbx-core/src/admin/consul/client.rs:204-217 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/client.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"16be36be73e517a48a9064cac7146f1e2659f9fece2b9310c54565d48212b047"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/dbx-driver-support/src/ddl_scan.rs:70-104 | crates/dbx-driver-support/src/ddl_scan.rs:108-132 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/ddl_scan.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6e7b5042b7749c4cc59d151677acebffa546138316d7c5ba2e5894f995ce8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java:137-156 | agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java:158-177 \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":"agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cb3e817be3313b5f7d6b91f7c36c394a1aaa15a48432b1cc51cdf89d09613d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:174-202 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:300-320 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e52d9f3034e0179c2017ab28c9d8145562d22b3f64a7c2b39ebd71bddbd6079"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): agents/drivers/etcd-go/auth.go:287-311 | agents/drivers/etcd2-go/auth.go:170-193 \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":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"29093ae60d27e39de9642c8b826199707ab99c94571438b2c775feca85527c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/drivers/rocketmq/messages.go:195-214 | agents/drivers/rocketmq/messages.go:287-305 \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":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e970a1ff1b87ddba71253728f18bbe44e14cdbc85735cc2f2a7cca6f9fec38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): agents/drivers/xugu/main.go:3478-3504 | agents/drivers/xugu/main.go:3660-3685 | agents/drivers/xugu/main.go:3818-3847 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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":"agents/drivers/xugu/main.go"},"region":{"startLine":3478}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df665231e3b2e50d0b970d359a96bc6ba2a44ec1ffdbf4d71c85ad0667b1c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-core/src/data/table_import.rs:2570-2593 | crates/dbx-core/src/data/table_import.rs:4852-4868 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fb2ba05c1366fb5595d87ee07444c4cd2ca1df452a9a6787bfc2b4cfd97aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 20\u002B corresponding lines): crates/dbx-core/src/query/mongo_ops.rs:124-143 | crates/dbx-core/src/query/mongo_ops.rs:177-201 | crates/dbx-core/src/query/mongo_ops.rs:209-235 | crates/dbx-core/src/query/mongo_ops.rs:1000-1029 | crates/dbx-core/src/query/mongo_ops.rs:1038-1064 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdef6d30de2d7abe429cec2e6d7c641339503e2c0fa6987e15f7ae6845b42907"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:10744-10769 | crates/dbx-driver-postgres/src/postgres.rs:11195-11211 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":10744}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddb735e3806d4f025e132927e51354f54e92ef4d28f1de8cd32c33163bd4cfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:66-85 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:182-207 \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":"agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52d43a0113c202a0381b9706ae5ca19d4cfe56dedb7a2f95cc1f1df1ef61e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): agents/drivers/kingbase-go/main.go:1058-1080 | agents/drivers/oracle-go/main.go:5147-5171 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"9716cd066ac19eca6eb2acb5afcc19c1c400f03b79c9b6c3259feac9a803a232"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-core/src/connection/connection_secrets.rs:663-682 | crates/dbx-core/src/persistence/storage.rs:10337-10360 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"201cd342549d34e05802108699b0d4fe91699082902180e5db30c53aa2d03722"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-driver-postgres/src/text_encoding.rs:675-681 | crates/dbx-driver-postgres/src/text_encoding.rs:682-688 | crates/dbx-driver-postgres/src/text_encoding.rs:689-695 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/text_encoding.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7490dee8c506de831a612c48adada766eaaa0b2efc7bac039fba820ec18c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-mcp/src/backend.rs:1259-1277 | crates/dbx-mcp/src/backend.rs:1753-1768 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e625df941109234259626a7d33d57fc134614951e93629033b1567d39ab7f22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugNative.java:386-404 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugNative.java:407-425 \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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugNative.java"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48490c767d0c766b6f0147e0ce5c94041e6da6d9d132bf62f9c2ec0cb78211d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/dbx-ai-provider/src/ai_cli_agent.rs:372-392 | crates/dbx-ai-provider/src/ai_cli_agent.rs:530-549 | crates/dbx-ai-provider/src/ai_cli_agent.rs:758-778 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff05d18d43b4872d781daa6ba9de71ef28538d7bac423c880e31003a6275af94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:69-86 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:821-836 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_pi_agent_cli.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c77d9eb054359d4b179cff01a9b90eb0ebf926ca599570cf1c5506c599553a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/dbx-core/src/data/transfer.rs:6425-6449 | crates/dbx-driver-mysql/src/mysql_compatible.rs:462-486 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6425}}}],"partialFingerprints":{"codehealthFindingId/v1":"17374e0986af26dcb467fd64af570d300402f2a2ec751017829e33ebcaf718b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/dbx-core/src/query/mongo_ops.rs:408-434 | crates/dbx-core/src/query/mongo_ops.rs:449-477 | crates/dbx-core/src/query/mongo_ops.rs:818-841 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b11905550976dfb4da201f49fd9fb6da06d805dffd569a41fac60778dd73664"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-drivers/src/db/meilisearch_driver.rs:315-329 | crates/dbx-drivers/src/db/meilisearch_driver.rs:1037-1059 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/meilisearch_driver.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b1da032844d8d9c03a924bc18aeddb1ee1d8e895c67a6fd8794cbb4a45201d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-formats/src/text_export.rs:15-27 | crates/dbx-formats/src/text_export.rs:29-43 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/text_export.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bfc6c73d18c07cce50b8bd7dd5a98de153e5724728a2db97fcd5d5502476c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/dbx-core/src/data/sql_file_import.rs:2730-2751 | crates/dbx-core/src/data/sql_file_import.rs:2753-2774 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b9da30d8f8e3d1b46157de8aa6094a64aa5cd5f8099d79a8e1579de32c859b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/query/mod.rs:145-159 | crates/dbx-core/src/query/mod.rs:161-173 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c7c62eb544715aed5afcb563490746fb608cc0f513e189c56fb7cac4880d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-core/src/query/mod.rs:3059-3085 | crates/dbx-core/src/query/mod.rs:4006-4036 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3383984608c969c6a8fb9053d1405034f6b1907e30c9cd3fba3a9b8cecec182"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/dbx-core/src/query/redis_ops.rs:17-36 | crates/dbx-core/src/query/redis_ops.rs:63-89 | crates/dbx-core/src/query/redis_ops.rs:142-168 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f589a934730675f3571f0b070c39c268048ec2fe42ee4994fea6fcb4c718b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-plugin-runtime/src/plugins/filesystem.rs:154-176 | crates/dbx-plugin-runtime/src/plugins/filesystem.rs:185-208 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/filesystem.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1f6e5f44677e15ccc5e232e732622a85319f8da1aed1e6bda0924c6ef492fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-web/src/routes/mongo.rs:384-392 | crates/dbx-web/src/routes/vector.rs:59-67 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6640aceabdc26dfe7f08b220705b5561e0871e5fe179e7e71127d55051becb53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:565-581 | agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:614-634 \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":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"894dd14017c12a69a609bbf5144b03d15e535d4d23b67b1739df4c152c8a285a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): agents/drivers/argo-go/config.go:22-62 | agents/drivers/hive-go/config.go:22-65 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9709ebef25905718cccc744e71c44cc9cc3a2ac2883693ce66f817af0f0195e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): agents/drivers/etcd-go/main.go:19-65 | agents/drivers/etcd2-go/main.go:16-57 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e71828ea065bc2889fca42dc210cd279eaea607b44ff51960cd312fdf98d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:2341-2361 | agents/drivers/vastbase-go/vastbase_metadata.go:1682-1702 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0ba7cf239375fbbb003378c4bf896e32b3f69fcd04cc13723738a452acdb24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/drivers/rabbitmq/main.go:86-105 | agents/drivers/zookeeper/main.go:48-71 \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":"agents/drivers/rabbitmq/main.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce45d8044c94f9c78dd039e941bec3f059a634b2c51e7dc33f6686e0cac610d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:4003-4018 | crates/dbx-driver-postgres/src/postgres.rs:8324-8338 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":4003}}}],"partialFingerprints":{"codehealthFindingId/v1":"2090fb75cb3fa0332989df7a16d1e6551fe2d7b73e91f859dc7b4d8ff9e43cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/dbx-web/src/routes/connection.rs:844-869 | crates/dbx-web/src/routes/connection.rs:889-909 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0bb6f1e9d3bac804a689a4df90c54e43f55df645c2783c3020ce36c6eed1ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:489-506 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:643-660 \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":"agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ac8490211f768503704255d10a8bfb5de396232067f235953158f3927e9a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:508-525 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:662-679 \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":"agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fe57ed453a5b47048da49ab24cb6c1eaf8059d32fa40b9a0da7f195bf513e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2048-2063 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2421-2434 \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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e63ea0f68d49f3641554adaa3420d90c213174a3d893f20671b168ba7b2f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:193-215 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:173-190 \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":"agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c367709060496d9fbe466e3f7f62fde40e61a13c2f957d156f380289bfbff47b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/dbx-core/src/admin/mq/adapters/pulsar_version.rs:121-159 | crates/dbx-core/src/admin/mq/types.rs:102-137 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/pulsar_version.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"765d8ad2bfc6a6f7fef99483afa5dd476ff995128ccfd56ed37a711b7d7f9391"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-core/src/data/transfer.rs:2073-2081 | crates/dbx-core/src/data/transfer.rs:2087-2097 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46fb17eafe13a29371a12ec0d8e8ebc8b97025023f46c1ba85b8db54e2947cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/dbx-core/src/query/mongo_ops.rs:1132-1148 | crates/dbx-core/src/query/mongo_ops.rs:1158-1181 | crates/dbx-core/src/query/mongo_ops.rs:1190-1204 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b537f786c95bfc1808317de0dfccbc100c7aa63531592d2ead79073a654437"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-drivers/src/db/sqlite.rs:2758-2776 | crates/dbx-sqlite-worker/src/runtime.rs:98-114 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2364905ce568ff8f50938e26bdcdabfba8d28c9ff2aaca6884286c836a846ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/dbx-web/src/routes/mongo.rs:566-576 | crates/dbx-web/src/routes/mongo.rs:582-598 | crates/dbx-web/src/routes/mongo.rs:645-662 | crates/dbx-web/src/routes/mongo.rs:723-735 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecef20e05d4503ee20cfb26686f1d5c316cd129f7732f63abd72bcad4e484ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/dbx-web/src/routes/mongodb_import_export.rs:358-370 | crates/dbx-web/src/routes/sql_file.rs:741-753 | crates/dbx-web/src/routes/table_import.rs:409-422 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"846e7df8648797b7821f9221eef9fc3591939e07ce99c44b8c1bee35042a45f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/kingbase-go/main.go:1162-1177 | agents/drivers/vastbase-go/main.go:1025-1036 \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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b13fa8842287d6495d6ec3864531050e328d33ecbb638b6242c854c6987e583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): agents/drivers/oracle-go/pldebug.go:3865-3888 | agents/drivers/oracle-go/pldebug.go:3903-3934 \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":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5ad7407a581035f7fd1d30f4b720a6a02cb8d8e57e4fa7399c199fb57db0b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/persistence/storage.rs:2805-2817 | crates/dbx-core/src/persistence/storage.rs:3547-3564 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e3cd22fa3b7da3e7caa6b111188577da93ff7f6a99d2331c491888a2419b54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:225-246 | crates/dbx-drivers/src/db/rqlite_driver.rs:104-125 | crates/dbx-drivers/src/db/turso_driver.rs:165-186 \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":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacac4e044185268d98714924e59ae7def87d38a4342ed8ccad7739f07269344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/dbx-web/src/routes/etcd.rs:272-290 | crates/dbx-web/src/routes/etcd.rs:295-313 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/etcd.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bc109ce83a113dcf8e3b76282a8bc27fbb461120b5120149d37f56498c4089"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/argo-go/config.go:997-1006 | agents/drivers/hive-go/config.go:1037-1046 \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":"agents/drivers/argo-go/config.go"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"981b11904408ad62e70d8899bbe0aa609346137587f41cbc6da431ed6020cbb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:465-495 | agents/drivers/vastbase-go/vastbase_metadata.go:301-324 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bf7688e7bed05c0e95e38661e8655c5bc58f8dd72ece39d44460c3db092373"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:157-169 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:648-664 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d746f8be526f731142c1ef1191a4a44204d8c75ddeec65e050aa1623c959b0bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/dbx-core/src/data/database_export.rs:855-876 | crates/dbx-core/src/data/database_export.rs:878-896 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"0093464453cbc5af4709a8340945bacf0bda52977b29c34c3187ce7493c34a00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-core/src/data/database_export.rs:1612-1623 | crates/dbx-sql-data/src/data_grid_sql.rs:3599-3610 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af20c84539e532ee10731ffb01c1a0b99eb2cc8ba3e7797d842646e68240349"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): agents/drivers/rocketmq/routing.go:242-257 | agents/drivers/zookeeper/sasl.go:153-168 \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":"agents/drivers/rocketmq/routing.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19ca0fbddc19c5a6fc9f7b2535ee18ad5c1b6ff2410db261cce7492f4f5237c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/dbx-formats/src/csv_export.rs:206-237 | crates/dbx-formats/src/csv_export.rs:252-269 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/csv_export.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fce0228440c358b2a66b7eae31a7aca09cd214a8e1cbce3cead7cf621830b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1066-1085 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1130-1159 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1262-1286 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da626145ea25a356fc6b3aea172c4c9b01561f5e46f3fe7e38d4bc841cfe662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/kingbase-go/main.go:222-235 | agents/drivers/oracle-go/main.go:1092-1105 \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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"098f1650375a53edd581e0f3c3dec570f8d841da5f9c49f69d2332a95d9b0cef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/dbx-core/src/ai/agent_loop.rs:823-853 | crates/dbx-core/src/ai/agent_loop.rs:879-907 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_loop.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fea3918b503925e0322b2cb11ddcd8be297809ef75ed6920f39e9d5197b2616"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-core/src/persistence/storage.rs:4952-4963 | crates/dbx-core/src/persistence/storage.rs:5019-5033 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4952}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa48679fb53349fa2b0e60c5040e9b11cb30cf9b7ee04ca38af2d8d9e1ef4bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/dbx-ai-provider/src/ai.rs:1657-1670 | crates/dbx-ai-provider/src/ai.rs:1672-1685 | crates/dbx-ai-provider/src/ai.rs:1687-1700 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"93882e6c583b365e0e27aef550b6c29a3840c24e27b3bb8f90b1e8bf15ce9848"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:1006-1021 | crates/dbx-core/src/admin/nacos/http.rs:1074-1096 | crates/dbx-core/src/admin/nacos/http.rs:1103-1125 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2be3cc80fa48d39f3e5299fd7f1d0efc2265a97a44145e248281135451fb6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-driver-mongodb/src/mongo_shell.rs:148-162 | crates/dbx-driver-mongodb/src/mongo_shell.rs:164-178 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f9c7c586537a8f51604afc00e0139d359b2af890ef7d22b02b1b0f84c511f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-driver-sqlserver/src/sqlserver.rs:1435-1447 | crates/dbx-sql-data/src/query_result_sql.rs:2050-2064 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"d184922dbebe76717d2cf2787006d1ffc64183fe9848e0afcc09b2570a5cf8bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-web/src/routes/agents.rs:110-121 | crates/dbx-web/src/routes/agents.rs:127-144 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/agents.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b6cbb027eaed1d8d94d29be6dd9547bcd7fbe25171fc9440c57d2e087e58bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/drivers/etcd-go/lease.go:298-318 | agents/drivers/etcd-go/lease.go:320-339 \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":"agents/drivers/etcd-go/lease.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"74eacb07627f72c1e16082037dbb35208a42d139b68d61ab7d318462e8cbad32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/drivers/rocketmq/consumers.go:380-401 | agents/drivers/rocketmq/routing.go:320-334 \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":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4102292ebbcb54a2374b5b6f10cd91cb3ea9befed75f1e4723905d878ba2a77b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:10645-10676 | crates/dbx-driver-postgres/src/postgres.rs:10978-11000 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":10645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab34688c070d58faeddd9b771630c352ed7b32599c6647a8c8d76757038aec0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-formats/src/sql_file_zip_package.rs:112-125 | src-tauri/src/commands/local_backup.rs:221-232 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/sql_file_zip_package.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"325ac62c22ed5a4ab6e375e25faa470b776db5b8b0671c4181773ae29ebcbdbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-sql-schema/src/sql_parser/git.rs:68-87 | crates/dbx-sql-schema/src/sql_parser/git.rs:178-197 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/sql_parser/git.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"279864cbdc1b978b2dd0a3bfdc5672217bf0c0c7abfc0fc6412b20e7491b9816"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:733-751 | agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:315-339 \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":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c454ae60714d66de654b76f31c3cc3eb86ae908a34d82626a0cd5564ff7e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-ai-provider/src/ai.rs:2218-2233 | crates/dbx-ai-provider/src/ai.rs:2253-2275 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0e4589b14b602582d60a9b4224af7a429f41761e48e03ccdbfa58fa094a7b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): crates/dbx-core/src/connection/connection_secrets.rs:529-540 | crates/dbx-core/src/connection/connection_secrets.rs:761-774 | crates/dbx-core/src/connection/connection_secrets.rs:876-887 | crates/dbx-core/src/persistence/storage.rs:10238-10249 | crates/dbx-core/src/persistence/storage.rs:10402-10414 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a9fbd7178386484a9994c14ae64eba84abda508c6f1f76004a8e711385aec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/query/mongo_ops.rs:301-313 | crates/dbx-core/src/query/mongo_ops.rs:641-658 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba57ec666766c8376bd4ceb009e38b85a77016a02534b1ec9bb9caf12b6cc6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/dbx-driver-mysql/src/manticoresearch.rs:76-92 | crates/dbx-driver-mysql/src/oceanbase_mysql.rs:18-29 | crates/dbx-driver-mysql/src/starrocks.rs:72-84 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/manticoresearch.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cc2c7884c36ef78ada9c33480290a80c6429d7bebaba9e37dad2c66720a2df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs:262-281 | crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs:393-415 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f88247a9f53525ccf640b59be0f1cb6dcfe6ecb9da412024b4716a88de7b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/dbx-sql-schema/src/table_structure_sql/comments.rs:102-131 | crates/dbx-sql-schema/src/table_structure_sql/comments.rs:140-170 | crates/dbx-sql-schema/src/table_structure_sql/comments.rs:189-219 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/comments.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fe83d1d2c439d110a9b2d5ac6ed7a09d8693f857ee6d77b8195751687f52dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1774-1792 | agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:111-137 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae6b7120f9e5fd757b81566eb8a73f04551120bb3486705d1ffecae82e8bee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/drivers/oracle-go/pldebug_statement.go:96-110 | agents/drivers/oracle-go/pldebug_statement.go:120-134 \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":"agents/drivers/oracle-go/pldebug_statement.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"077e9f1c7a9a71d659929abdc557e1747ef43e648dfd3828aeb185591337c6ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-core/src/connection/jdbc.rs:449-457 | crates/dbx-core/src/connection/jdbc.rs:521-530 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5976e1ab862638c4a615a0f318c0066e1a56f0a4e6cc536b5f4f5b6e391cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/data/transfer.rs:965-980 | crates/dbx-core/src/data/transfer.rs:985-1000 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90ecc75d9282f3a48acae9a22bb801092bfecefdd3e098621c6eb28a89e4d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-core/src/schema/mod.rs:1863-1876 | crates/dbx-driver-mysql/src/ob_oracle.rs:205-218 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c77c5b43c8ce13765f041c238a199c5c3871f7b0cb367dae2fe0ffdd40d066"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:813-823 | crates/dbx-driver-mysql/src/mysql.rs:825-834 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf65bb559b3af992eba73c3bad3f36610dcfe73a0fa53125d862c5bf75156207"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-drivers/src/db/cloudberry.rs:146-165 | crates/dbx-drivers/src/db/opentenbase.rs:112-124 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudberry.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4edf954ce9604e23bb9da9e52c3a59a692f1bcba604cc03ee9fa41651091d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): crates/dbx-tauri-schema/src/commands.rs:330-345 | crates/dbx-tauri-schema/src/commands.rs:574-600 | crates/dbx-tauri-schema/src/commands.rs:642-651 | crates/dbx-tauri-schema/src/commands.rs:698-714 | crates/dbx-tauri-schema/src/commands.rs:746-763 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-tauri-schema/src/commands.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adeb614a43ff6ef83f0d0880fe088ecb92dc00e3c1ac119b4a62a3617382283"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1354-1371 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:570-586 \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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fd902218e29a4d2fee3283af59277f16b38fb73a523f60bcb6701698824996"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:1432-1453 | crates/dbx-core/src/admin/nacos/http.rs:1455-1485 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"3898d286b73db0a72ea706c55bebc19fd90d6af30f57615097ee122ab6a42d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-driver-mysql/src/manticoresearch.rs:178-185 | crates/dbx-driver-mysql/src/ob_oracle.rs:77-94 | crates/dbx-driver-mysql/src/ob_oracle.rs:124-131 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/manticoresearch.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0824faf202c601e7f402f3454567d40ac6517c6d636d6dbc520515445f8e8f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src-tauri/src/commands/cloud_sync.rs:239-245 | src-tauri/src/commands/cloud_sync.rs:419-426 \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":"src-tauri/src/commands/cloud_sync.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5758eca2c312ab5579ac35a8cc6be5fc1d4f639dfffd3e0fb2feb79603e7debf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agents/common/src/main/java/com/dbx/agent/QueryPageResult.java:71-83 | agents/common/src/main/java/com/dbx/agent/QueryResult.java:69-79 \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":"agents/common/src/main/java/com/dbx/agent/QueryPageResult.java"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b36a8319b5f6185ed0239e7fb168f4316df0c3fb5ae51eee09070ff197c1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agents/drivers/vastbase-go/spatial.go:151-161 | agents/drivers/xugu/spatial.go:227-237 \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":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1b879638fad1b244f88c12c7da41326374cf1b2154a7a5fc175a5382398da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agents/go-common/iotdb-client-go/client/session.go:1080-1097 | agents/go-common/iotdb-client-go/client/session.go:1101-1118 \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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3167bc90d0c9beb47b60ac60c5d2ef92a4d28f6d18b2f3efe1ab8bc2adcc217"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/connection/session_credentials.rs:123-133 | crates/dbx-core/src/connection/session_credentials.rs:154-164 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/session_credentials.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d232b68493396c70eb79f9334ba0f92bf83b426b27a3be33700cc4c976c443"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-drivers/src/db/couchdb_driver.rs:140-149 | crates/dbx-drivers/src/db/couchdb_driver.rs:383-395 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db7359104ed15feb5d9ba4888528fd1a2a069e59fe8c23f7e67fbab07a3739d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): agents/drivers/oracle-go/main.go:3183-3206 | agents/drivers/xugu/main.go:3707-3729 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84ecb9221b047c7adeaeb981bc13250c012b31009ea2b6f1e6d3b3c8bb01c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/schema/mod.rs:3234-3246 | crates/dbx-core/src/schema/mod.rs:3255-3267 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":3234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc90cf87e22ef6edc38bf8a5ac8e7f7cb27e07423b7003e68c5985e7c108f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-driver-postgres/src/text_encoding.rs:707-716 | crates/dbx-driver-postgres/src/text_encoding.rs:721-733 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/text_encoding.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd6f701010c38dbe1d162a35ee66d25eab8ab2c0d70c6f24095dd3e3ad512ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-drivers/src/db/solr_driver.rs:816-826 | crates/dbx-drivers/src/db/solr_driver.rs:828-838 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/solr_driver.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"21327594cf5f81ef1dd329df8d15d4c72c3d5c2f351cbd9db3e7371d9d0c1407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/dbx-types/src/models/connection.rs:2597-2608 | crates/dbx-types/src/models/connection.rs:2610-2621 | crates/dbx-types/src/models/connection.rs:2623-2645 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf0d3ce215646d09e1f1c076f4dfb619946dcbb3735e36d225a03dd9276d2d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:57-74 | agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:127-156 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:68-89 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:72-93 \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":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97e17bb384dd9c84c945646c5e4e4d65dcfa44f41e02dfea5e38f2601f286b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:174-181 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:183-192 \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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fa720795f8c0dfff6abd4eef201b447ad9eaec9d448202df0afbb14eb2526a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/go-common/go-gssapi/krb5/keyinfo.go:56-75 | agents/go-common/go-gssapi/krb5/keyinfo.go:98-117 \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":"agents/go-common/go-gssapi/krb5/keyinfo.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f849d815e7d209f194982f16e12f5bd79dcacb60ad93a351b6c3e7a8bf8480fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): agents/go-common/iotdb-client-go/client/session.go:1401-1424 | agents/go-common/iotdb-client-go/client/session.go:1426-1450 | agents/go-common/iotdb-client-go/client/session.go:1452-1476 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f58097d21448d3852e2eb9c799cebb66c93c047ab6fcd2bdf6c1545165ce3d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4506-4527 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5342-5363 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4506}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0e0aae2f7a3c93321854350c34b5f53c7ac792b0716b857577d0be34ed4359"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-core/src/query/plugin_data.rs:167-180 | crates/dbx-core/src/query/plugin_plan.rs:555-574 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/plugin_data.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a92cdb392e37edd3ddde4a8ed945276d622ca8da9071c77a91a99c95eaa20b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java:206-221 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3975-3990 \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":"agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"529d2e9685a9570ed8771a40a8b80bff865ec1bf43af06ef8f40f41d8a2ff532"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): agents/drivers/kingbase-go/main.go:1400-1421 | agents/drivers/vastbase-go/main.go:1139-1159 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cb1cf362967b84c9d5aacf934c9d830872136c69e27521ffeed16cc111020c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): agents/drivers/oracle-go/main.go:6561-6581 | agents/drivers/xugu/main.go:6062-6082 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6561}}}],"partialFingerprints":{"codehealthFindingId/v1":"73abba44f51cc996584332be02be957516559e88e267bb4a5c89484a02a47712"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): agents/drivers/rabbitmq/operations.go:848-869 | agents/drivers/rabbitmq/operations.go:889-905 \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":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16b01d30cca590abcd59c1fc6f285fe5cb11e8c216ce2f059160193bf04caa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/go-common/iotdb-client-go/client/session.go:906-924 | agents/go-common/iotdb-client-go/client/session.go:926-944 \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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f54003d2f902151b03961c65680c21ba7de92be345c9bd72d9c1f607eb0876d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 21\u002B corresponding lines): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:199-219 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:279-299 | crates/dbx-ai-provider/src/ai_codex_cli.rs:456-476 | crates/dbx-ai-provider/src/ai_cursor_cli.rs:171-191 | crates/dbx-ai-provider/src/ai_grok_cli.rs:249-269 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:242-262 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:127-147 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8a9d77fe8a20005b4e4a178ac47444274fe7cee89701186be7eb6833a7012f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/persistence/secret_codec.rs:291-306 | crates/dbx-core/src/persistence/secret_codec.rs:789-799 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/secret_codec.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfa019f03214e10db0f01b11193abf528a7ab7d48f2bfb608baf55a46af1a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-core/src/query/mod.rs:3525-3538 | crates/dbx-core/src/query/snapshot_export.rs:52-68 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":3525}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2227ff7697b8596d38a976e990d88b0d5933e186034e6c2cc505f16948293f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/scheduled_backup/store.rs:306-321 | crates/dbx-core/src/scheduled_backup/store.rs:432-451 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/store.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75df5f5988ab116ef1bbc38e3daee99c0324e3bf679747d0f4585a08efe1fb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): agents/drivers/oracle-go/main.go:2285-2300 | agents/drivers/xugu/main.go:2703-2728 \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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c49b91bd8b68b5242c084c3b04ec7b46ac463533f8b3a468e36b50ce541bf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4553-4569 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4609-4625 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5512-5529 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4553}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe5a728bb42f472e1b9d19fc1bae8e3b5c9d1bc49e85f889baf2382a7dcc138"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/tdengine/src/config.rs:127-141 | agents/drivers/tdengine/src/config.rs:143-155 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/tdengine/src/config.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b48721fc7462cffda64ed8e200668f917b869edc9d590413060bf8b595cc3bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-cli/src/main.rs:751-776 | crates/dbx-cli/src/main.rs:783-797 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/main.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadfdaf1b1f74024d8a21902e2aa098120e9155aca2f40f5dee1d074debae13e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/dbx-core/src/admin/nacos/namespace_access.rs:369-389 | crates/dbx-core/src/admin/nacos/namespace_access.rs:391-411 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/namespace_access.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00a3c2856e2bb5791402f92d990766a960ee99bdf63b38ab4745e9f6162c181"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-core/src/query/document_ops.rs:642-656 | crates/dbx-core/src/query/document_ops.rs:698-712 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f619f61dde5370fa6dd44bd5f2d77795d1e2272e48cb56b34b1ff6f30d6cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-web/src/routes/mongodb_import_export.rs:213-224 | crates/dbx-web/src/routes/table_import.rs:227-244 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"02829a0df46c320110a89ebb61b3bc1f83e25225fc9a35374925ae44542dd98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:916-934 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:940-962 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1481-1499 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c336dc9cff2af3fd964308c9ad9bdd1a28c90e2ac17f662106a86ea365680c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 19\u002B corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2770-2788 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:382-401 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:386-411 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:558-591 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2386-2409 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b01cec97e9ccc77d68337626837fb84f915a47d98fa3e55b54f50bf10a3ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): agents/go-common/go-gssapi/krb5/message_token.go:190-208 | agents/go-common/go-gssapi/krb5/message_token.go:423-438 \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":"agents/go-common/go-gssapi/krb5/message_token.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"92efba45c856cc11ce19e1d7782589e2caadf71f877fcbadbf743b043dd8de44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/data/table_import.rs:1244-1254 | crates/dbx-core/src/data/table_import.rs:1260-1273 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d905dccda4a5fcdbdc1512ac081ac62a3fe063014fe5c19be81ad352bf50bff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/dbx-core/src/data/transfer.rs:9701-9719 | crates/dbx-core/src/data/transfer.rs:10956-10981 | crates/dbx-core/src/data/transfer.rs:11062-11084 | crates/dbx-core/src/data/transfer.rs:11394-11402 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":9701}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c77a98a3177a85987184b8bfbf71936783a84214abd2dc2686748e2e498506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/dbx-sql-core/src/object_source_sql.rs:1953-1970 | crates/dbx-sql-core/src/object_source_sql.rs:2007-2028 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77e1d9860aff78dfbf77d39d017d29804987292f3fcfb8dbf7ee15022462d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-sql-core/src/sql_risk.rs:630-640 | crates/dbx-sql-core/src/sql_risk.rs:652-665 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_risk.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9687ff3b95c36a2c944cced563856b9176a930925c7e0a62950c5ae74174d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:244-259 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:154-170 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:225-240 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"000e3112a88527e05681950d35eb1dbafe359787c2311bec14f888978f8b6433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): agents/go-common/iotdb-client-go/client/session.go:727-750 | agents/go-common/iotdb-client-go/client/session.go:1193-1213 | agents/go-common/iotdb-client-go/client/session.go:1215-1233 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18139fdf7ad10f2a43124f3cc4846e538c360b8837da2377664381aef012dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-core/src/admin/nacos/service.rs:33-50 | crates/dbx-core/src/admin/nacos/service.rs:567-583 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/service.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"632f519ed05cf9e6c3e7c123c5a136ee2c9a5cfc47b458a6013e8ef0271641e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): crates/dbx-core/src/connection/jdbc.rs:1231-1244 | crates/dbx-driver-agent/src/agent_offline_export.rs:1003-1015 | crates/dbx-driver-agent/src/agent_service.rs:2610-2622 | crates/dbx-plugin-runtime/src/plugins/installer.rs:1262-1274 | plugins/sdk/packager/src/main.rs:623-635 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"364c33aca564429496399fea2cbd675572914b22cdaa1c440b51b174ceb9b637"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/schema/native_jobs/details.rs:23-32 | crates/dbx-sql-schema/src/native_job_arguments.rs:263-272 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/details.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9309627b9b9aff78f17077f7636733463d423681a1d9991b9a531a5b87a4d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:396-421 | crates/dbx-drivers/src/db/rqlite_driver.rs:278-303 | crates/dbx-drivers/src/db/turso_driver.rs:339-364 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b073e831e2e7c9e08d6b4355d9462ce4ad818293d721529f67268929545cccb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/dbx-sql-data/src/data_grid_sql.rs:3955-3975 | crates/dbx-sql-data/src/data_grid_sql.rs:3983-4003 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":3955}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5bf537c8be35803b45f60d7cbe25fe6e6d7c9c9b6760a978226e94d9eae09a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:3420-3435 | agents/drivers/vastbase-go/vastbase_metadata.go:2269-2281 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3420}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca1ca429f00db2aea46ff3276e18f4f9b9d4da191764a2cbada7426ebae0a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): agents/drivers/oracle-go/main.go:3802-3825 | agents/drivers/oracle-go/main.go:3827-3851 \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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3802}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05eee4cb41257c77eac17c06d77b695675bd92e25be179a1111a8a1e14661dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-ai-provider/src/ai_codex_cli.rs:309-318 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:350-358 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7568f9084bc0f6ec9419e72fa3f4064726f3546e7bc4c4701ada460034d7159"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/persistence/storage.rs:3879-3890 | crates/dbx-core/src/persistence/storage.rs:3892-3902 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":3879}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0218bd76e30966455ea048947fbbdad3f495a3de330a7a5cfa7f123544665a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-drivers/src/db/cloudberry.rs:83-96 | crates/dbx-drivers/src/db/cloudberry.rs:245-256 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudberry.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4f8f92dd031aaf92889e699a33444f7edce90af6ee7faf9bd4aa40b90d41fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-mcp/src/server.rs:5235-5252 | crates/dbx-mcp/src/server.rs:5257-5271 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e84b54e4934901d365b3aae25c0826e76507c7ddad2d7428886d1358001718"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-mcp/src/session.rs:102-116 | crates/dbx-mcp/src/session.rs:122-136 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/session.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d452d97cc333fad60f88b7c95797760d05035e52655a63c8404f289eaf51a65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:365-382 | agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java:187-204 | agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java:644-666 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae702ec9e3059c9bf33668b839bb39dcffcbce45842510100b02bace5556138"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/admin/consul/acl.rs:350-360 | crates/dbx-core/src/admin/consul/enterprise.rs:298-311 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/acl.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"09393416369cc32d5a1365adca8b533076a058b242d3815f01d106c47bba5c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/schema/native_jobs/operations.rs:237-246 | crates/dbx-plugin-runtime/src/plugins/host.rs:148-158 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c10e74f0a8076b4c6d66b2b07fb48212bf57fa955c84c4ee7e6d030f8cec12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-drivers/src/db/proxy_tunnel.rs:319-330 | crates/dbx-drivers/src/db/proxy_tunnel.rs:332-343 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/proxy_tunnel.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6138d086a7b10aa360b054cdc68fd849e2fd483d9eeabaa4f047a0c5028cd1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): agents/drivers/kingbase-go/main.go:937-958 | agents/drivers/oracle-go/main.go:4841-4858 | agents/drivers/oracle-go/main.go:4890-4907 | agents/drivers/vastbase-go/main.go:831-851 | agents/drivers/xugu/main.go:4048-4064 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f6fd5710867ffe4715765a0778179ad427d8974bfbf8b14d10799372d63db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2680-2692 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:927-943 \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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"564f23d62426ec223179a0e1d03465eaedb492a95da83057127796c92f117cab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/data/database_export.rs:2145-2155 | crates/dbx-sql-data/src/data_grid_sql.rs:2588-2599 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8487d0507c2a10c007cf48a4997cf4aaa18b3d22e0ee1e319f0b9de24bcec2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/data/table_import.rs:7358-7373 | crates/dbx-core/src/data/transfer.rs:7237-7254 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":7358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1cad655389ee9ccace3969eb29d80d6506db5f7627d803bb90e38fa8636f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:3642-3647 | crates/dbx-driver-mysql/src/mysql_compatible.rs:130-136 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3642}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a074ff5ed61acdcf994695ea56e239c301a75b64fa22b7008e0beadcc18ae63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-mcp/src/server.rs:7426-7440 | crates/dbx-mcp/src/server.rs:7442-7456 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":7426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0596ce2ed43c5413b336bae4d842724091da4fffa08e362ea42dae5fbd512b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/drivers/etcd2-go/client.go:278-292 | agents/drivers/etcd2-go/client.go:326-340 \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":"agents/drivers/etcd2-go/client.go"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e0f2bf460ee5d28d4e9bbdd10beaf5185905958830008dee3385f0247db08a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/dbx-core/src/query/mod.rs:5083-5103 | crates/dbx-driver-sqlserver/src/sqlserver.rs:905-932 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5083}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9e0bf2c8b8ce5d2b92c38a91e921d85f32656f09c30cf128c89c8b23a7072a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:2221-2227 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2236-2242 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2962-2973 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2221}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddd56e1382c3c7a48e82ef3ed9821924d90fe50317e2236955a945ffd58919a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:10631-10643 | crates/dbx-driver-postgres/src/postgres.rs:11213-11220 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":10631}}}],"partialFingerprints":{"codehealthFindingId/v1":"763d66af3940d68c865d89349d16d71e044ebd5900717e043a47c59f80e34de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/dbx-driver-redis/src/lib.rs:512-525 | crates/dbx-driver-redis/src/lib.rs:601-614 | crates/dbx-driver-redis/src/lib.rs:616-626 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"511a432d4d26d50afe188154145b9cb8fbafcc866d572cd2769153a99be2c470"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-web/src/routes/export_download.rs:46-58 | crates/dbx-web/src/routes/nacos.rs:992-1006 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/export_download.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"18346959d1846a07a78152915661a33895839d3f46007ba152ae102483625859"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 8\u002B corresponding lines): crates/dbx-web/src/routes/schema.rs:179-196 | crates/dbx-web/src/routes/schema.rs:403-410 | crates/dbx-web/src/routes/schema.rs:415-422 | crates/dbx-web/src/routes/schema.rs:666-673 | crates/dbx-web/src/routes/schema.rs:1032-1039 | crates/dbx-web/src/routes/schema.rs:1212-1225 | crates/dbx-web/src/routes/schema.rs:1230-1237 | crates/dbx-web/src/routes/schema.rs:1242-1249 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6758ba544359e40ecbd01a5426212b6985a35f12fd4257bd113d51779b94d41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): agents/drivers/rocketmq/helpers.go:48-70 | agents/drivers/rocketmq/helpers.go:72-94 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/helpers.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"df24d01efea6573b1608322d45eedeace42a4409972e66ed69a9dee8c662d98e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:120-137 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:197-217 | crates/dbx-ai-provider/src/ai_grok_cli.rs:170-187 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:52-69 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddff50e5ae5a27834832a22a2615222f42895a64843716debbca06a8b7687128"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/data/mongodb_import_export.rs:2771-2788 | crates/dbx-core/src/data/mongodb_import_export.rs:2793-2808 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"23afd498d688cda2a4c77caefdbc2a167e3287587784cef076abddd22c553981"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1383-1394 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1401-1412 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b62a94301009f2292dafc8c2cc1906038bb2f66d7b5ae595236e8f13704766b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2671-2694 | agents/drivers/transwarp/src/main/java/com/dbx/agent/transwarp/TranswarpAgent.java:313-326 \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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6cd74a21bc768d2bd6c607cf473b1df118687c945c69eca360e1768cdbdcb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/xugu/main.go:3557-3570 | agents/drivers/xugu/main.go:3891-3904 \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":"agents/drivers/xugu/main.go"},"region":{"startLine":3557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f933931e7695467acd2590d49db486383d979726fe141ef72fc22689a7fde3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:488-504 | crates/dbx-ai-provider/src/ai_codex_cli.rs:1021-1032 | crates/dbx-ai-provider/src/ai_grok_cli.rs:710-730 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca357eaba2a5e66e5f54154764f84b861213c428600595c149c4e98c767c4b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:1677-1688 | crates/dbx-core/src/persistence/cloud_sync.rs:1738-1748 | crates/dbx-core/src/persistence/cloud_sync.rs:1835-1846 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0dd723700448f1a947ce849c7b6d4a5de6b223e708a6f02516d92c6a881c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-core/src/query/mod.rs:420-442 | crates/dbx-core/src/query/mod.rs:460-482 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02ee8d23721b036a1f3a13eab2896ce8abe3cee9fa3a7aa4ea52bfd8d8887e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-drivers/src/db/meilisearch_driver.rs:182-196 | crates/dbx-drivers/src/db/victoriametrics_driver.rs:189-202 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/meilisearch_driver.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"05165eb4cc948d3fb2315c1b4deddca06c5dfe895fc027e4cddb3515871af0ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:3177-3183 | crates/dbx-core/src/persistence/state_persistence.rs:541-547 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a81ccaa72b443f3dfcc0fafc322572144cc6497ba119ca834e1f4776d9f4862"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-web/src/routes/mq.rs:721-736 | crates/dbx-web/src/routes/mq.rs:1165-1178 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bacec1d6d6c174ba0f2e217b4170a54280fea588c25376c9a704c8a2fa757b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2034-2051 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:471-483 \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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdae46dee45de8e635bf8a05ec77d82fba93d8ca9db0396c650a14ff2ed51f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/drivers/xugu/spatial.go:456-470 | agents/drivers/xugu/spatial.go:472-486 \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":"agents/drivers/xugu/spatial.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"44257e35777b3cbcaa999046900243d39d347688c2f14550a750171a8cc71f81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-core/src/connection/mod.rs:8229-8244 | crates/dbx-core/src/connection/mod.rs:8287-8300 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f243806ef6b1c5874463def88913fa895c34250b20b2e0841e89f2dae462d35a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/schema/native_jobs/references.rs:106-116 | crates/dbx-core/src/schema/native_jobs/service.rs:733-744 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/references.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f4479024e636f778752c0e33b7f681c40c74df758feb08e9f575a778f08ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): crates/dbx-web/src/routes/schema.rs:201-210 | crates/dbx-web/src/routes/schema.rs:476-484 | crates/dbx-web/src/routes/schema.rs:898-906 | crates/dbx-web/src/routes/schema.rs:950-958 | crates/dbx-web/src/routes/schema.rs:1254-1262 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f98ccb122eedd79f5251798c05cfd0c9fe5b70d7db267c2041b9c1d29e9412"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): agents/common/src/main/java/com/dbx/agent/ForeignKeyInfo.java:72-82 | agents/common/src/main/java/com/dbx/agent/ObjectInfo.java:100-112 | agents/common/src/main/java/com/dbx/agent/TableInfo.java:87-97 | agents/common/src/main/java/com/dbx/agent/TriggerInfo.java:98-110 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/ForeignKeyInfo.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3986604c681a2064d3c3b20eccc0265bfba0184527c2b1ef7d4c2c5c9064d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/drivers/vastbase-go/main.go:491-509 | agents/drivers/vastbase-go/main.go:511-533 \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":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adc46830c9ed8fe1d33e2f10f0f9f932d1c2b3b790af4cb87a605e67c1fa9c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/drivers/vastbase-go/spatial.go:105-123 | agents/drivers/xugu/spatial.go:174-192 \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":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b263c7e761dca464c871e3df1098faa08e9a22c21b944922ded2dfd57699810"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): agents/go-common/iotdb-client-go/client/session.go:412-428 | agents/go-common/iotdb-client-go/client/session.go:554-567 | agents/go-common/iotdb-client-go/client/session.go:579-595 | agents/go-common/iotdb-client-go/client/session.go:1175-1191 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"e634875a69d465059c9b089030bb250ecc7e0d1abe344edbdbbb3aa2532d0ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-ai-provider/src/ai_effort.rs:334-351 | crates/dbx-ai-provider/src/ai_effort.rs:353-366 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_effort.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe6b2ed483f06b8943d86c8cb85515f682882bc0db92dc39c416404c216e6af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-ai-provider/src/ai_opencode_cli.rs:304-314 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:210-221 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_opencode_cli.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"04af47cf1ed4c32b847ecb3dc61b0959ead7f4a361d5c58cb866eae9e8532616"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/schema/mod.rs:14245-14260 | crates/dbx-core/src/schema/mod.rs:14506-14521 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":14245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11e6885080f8641e3c51c97beedbeecb3716da0bae7038ac70bd54161dce57d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:5227-5239 | crates/dbx-driver-postgres/src/postgres.rs:5464-5473 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":5227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc83532191be5d50a56620675475cc88ffaf884897217a3faf7a26324207195"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-driver-redis/src/lib.rs:2465-2480 | crates/dbx-driver-redis/src/lib.rs:2493-2503 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf9fc9e2a6d23ec00e704f3b7c6ac9fa75870e2b4b02f0d9bc12fb672c502ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/dbx-formats/src/csv_export.rs:325-338 | crates/dbx-formats/src/csv_export.rs:404-417 | crates/dbx-formats/src/csv_export.rs:436-454 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/csv_export.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52701f257af90e8075a75e7b04cedbe895ee788857ccd4ce43182a34ba39487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:562-573 | agents/drivers/transwarp/src/main/java/com/dbx/agent/transwarp/TranswarpAgent.java:186-197 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e110f04f169ec1831dd06bb1de28ecdc18c2a10e811476a9f448dbf5d7f7ba39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): agents/drivers/etcd-go/auth.go:249-264 | agents/drivers/etcd-go/auth.go:362-377 | agents/drivers/etcd-go/auth.go:379-394 | agents/drivers/etcd2-go/auth.go:129-144 | agents/drivers/etcd2-go/auth.go:290-305 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bd9061ecf81cf66dcba674f35967e00d7ab60188b1d879d6113837d57d266f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:2010-2036 | agents/drivers/vastbase-go/vastbase_metadata.go:1280-1299 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adeaa56236ccef4d73501970129d4e200525d89507b47bcee1cd0da7bdd2c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): agents/drivers/oracle-go/pldebug_probe.go:36-57 | agents/drivers/xugu/main.go:3537-3555 | agents/drivers/xugu/main.go:3871-3889 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_probe.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3286b7dc822f9392dd9ed0fe74c61f2f2357ab38e8161e7f841e91d19b9269e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): agents/drivers/rabbitmq/operations.go:357-376 | agents/drivers/rabbitmq/operations.go:968-991 | agents/drivers/rabbitmq/operations.go:993-1011 | agents/drivers/rabbitmq/operations.go:1134-1152 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"54620cbd010240c6a0ffc0af54c74216da65b3361065c12d5833cfa4e5f07fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-ai-provider/src/ai.rs:1175-1189 | crates/dbx-ai-provider/src/ai.rs:1191-1201 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"076df216f70126c208a98aa5ca754d3ccd8934b2dc50ef109f7401c66ffcbb5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-core/src/admin/consul/mesh/intentions.rs:147-155 | crates/dbx-core/src/admin/consul/mesh/intentions.rs:161-169 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/mesh/intentions.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"048b71450e99fde19962992095f97bffe593f487028fb43ebef03e58ed924710"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-tauri-schema/src/commands.rs:661-669 | crates/dbx-tauri-schema/src/commands.rs:679-687 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-tauri-schema/src/commands.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2dcc81f703faf3e004153dcefdc94b4e73f0c4a8b1d5c8f05481ef8df804da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:1268-1280 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:2756-2769 \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":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc64f0ee3e6797d0468fad60fed6c2ed2737fc45d5258cde80891f102795798f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:2139-2155 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:2162-2177 \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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffa91127176efe5809bb14d06ab42ad1d854ac6d216ccf5fa1de60c1480e86d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-core/src/ai/agent_loop.rs:1616-1624 | crates/dbx-core/src/ai/agent_loop.rs:1717-1727 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_loop.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a07375297d0775518272d8de5eb578e153b008bc1f449865c49cbd884cfb84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/data/database_export.rs:1845-1852 | crates/dbx-sql-data/src/data_grid_sql.rs:5111-5118 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd6d62cac8c713b261a45cf586cf56d31bb774409d93ba73ebe8b859c8206e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/dbx-core/src/host/changelog.rs:171-181 | crates/dbx-core/src/host/update.rs:195-205 | src-tauri/src/commands/update.rs:958-968 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/host/changelog.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"362c2707673e5f5b65325e86a0a01c3f7405bb176a6ef020aca95b1f1a6bc8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/persistence/storage.rs:6156-6166 | crates/dbx-core/src/persistence/storage.rs:8991-9000 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5ec3dc090debe9ffbd631574f7218ed03fd1aee017dfdb49703ec54ade6a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-driver-agent/src/agent_manager.rs:126-138 | crates/dbx-driver-agent/src/agent_service.rs:652-664 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_manager.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d79ff807db9b601080b3272740507697a8ebea875fc4c35c98665342dbbc81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/dbx-sql-core/src/object_source_sql.rs:1518-1535 | crates/dbx-sql-core/src/object_source_sql.rs:1553-1570 | crates/dbx-sql-core/src/object_source_sql.rs:1679-1694 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c25fe63f25359f57fad453381a92402a6d0b1418ea8dd51eee1a12dd47ac24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:117-128 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:131-140 \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":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f67d33681919233caa9520e89788a825f8ccd70129b837cb8c4852bfa8398de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-core/src/data/transfer.rs:4176-4187 | crates/dbx-core/src/data/transfer.rs:4226-4240 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":4176}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f26f57dfa2a16128c963fa047b50cd5dbf7115c8409932f70aa4578e9605f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/query/pl_debug/compilation.rs:64-74 | crates/dbx-core/src/query/pl_debug/inspection.rs:261-271 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/compilation.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0ff11dd1e1ffa014b270905a0b4e9a4467141b99355fae9e66653662427eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/dbx-core/src/schema/mod.rs:286-294 | crates/dbx-core/src/schema/mod.rs:350-358 | crates/dbx-core/src/schema/mod.rs:365-373 | crates/dbx-core/src/schema/mod.rs:384-393 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b9d1c27880cbf84489bfe71347f81a76e080cf81b36c8ad16f77e4593f4161"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-driver-agent/src/agent_service.rs:563-576 | crates/dbx-plugin-runtime/src/plugins/installer.rs:1193-1203 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da0a03c778006a2611ece5340ce899db03ebaa24223dcf5fa2b30b1d31cc4e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/dbx-formats/src/temporal_format.rs:236-255 | crates/dbx-formats/src/temporal_format.rs:265-273 | crates/dbx-formats/src/temporal_format.rs:287-302 | crates/dbx-formats/src/temporal_format.rs:316-326 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/temporal_format.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2f23f38ef8dd861a12e9f2bb13dc4de9d4621578ed76f004d5b794130ac2a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-web/src/routes/tab_runtime_cache.rs:57-70 | src-tauri/src/commands/tab_runtime_cache.rs:39-52 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/tab_runtime_cache.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12de6f9c038e9577991cee5677b988a5a30556205396f528fd4c26ee952baec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:78-90 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:164-175 \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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85b2664071097ad09e5fbc166a936ae7f073274d062bc53f72439761290325c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java:268-276 | agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java:157-168 \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":"agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fb6f5af39bde5d5368ce3e76473d8015538f772d3dbcc17e8795c5b32686a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): agents/drivers/oracle-go/pldebug_collection_input.go:28-37 | agents/drivers/oracle-go/pldebug_object_input.go:26-35 | agents/drivers/oracle-go/pldebug_record_input.go:40-52 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_collection_input.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdd89c679d693167e7eaefe7ca0c8fe2712981f54b896bf979599b644e3cf98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-drivers/src/db/salesforce_driver.rs:484-494 | crates/dbx-drivers/src/db/solr_driver.rs:99-108 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/salesforce_driver.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce4adfd0eeb58ba83a02fd64f9f0f7f6b759cb373e29a4072c92fab7aafd12c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-sql-core/src/object_source_sql.rs:2134-2145 | crates/dbx-sql-core/src/object_source_sql.rs:2346-2356 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2c67241d73e4639a87943c406c6d87889e5e527bf7131f85be3af9fc958fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-web/src/routes/mq.rs:633-640 | crates/dbx-web/src/routes/mq.rs:659-666 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3b7e50687b8ea8aa3f92800292bad7017bb267a02fde3a69756c22ec5aed21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-web/src/routes/mq.rs:768-775 | crates/dbx-web/src/routes/mq.rs:781-788 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc21e935ee5495b3570f14062fbdd37ec4bdf97e72626ae29c1e54608e703a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-web/src/routes/mq.rs:1039-1046 | crates/dbx-web/src/routes/mq.rs:1052-1059 | crates/dbx-web/src/routes/mq.rs:1065-1072 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1606b225ca522712834563e78c4c7b208860e2a46d0d121bca5d07d592fa5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-web/src/routes/redis.rs:675-691 | crates/dbx-web/src/routes/redis.rs:696-704 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc3c109afbaa6595efec0c56c3d7a45178df87aa6568de017c1ea9c02d2bfe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/drivers/oracle-go/main.go:2139-2159 | agents/drivers/xugu/main.go:2445-2464 \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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cbc01e3a59e5bf5e4b1da06d55197c4904fad552bd5af650c9ae5fd29dde04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/rabbitmq/operations.go:503-521 | agents/drivers/rabbitmq/operations.go:794-807 \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":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"2807ee246872f0c8c11ac90b16f61a8186de9467dbf45b76ed5877aaeee06102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-core/src/admin/consul/session.rs:123-130 | crates/dbx-core/src/admin/consul/session.rs:160-167 | crates/dbx-core/src/admin/consul/session.rs:169-179 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/session.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2390a7e81a27a6e00f017859f5b0d3d724ae0c58406eaed80a672e6b454bef17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/dbx-core/src/admin/nacos/service.rs:341-354 | crates/dbx-core/src/admin/nacos/service.rs:369-379 | crates/dbx-core/src/admin/nacos/service.rs:385-395 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/service.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"54843a493b6283e9e7c8840e930472c1f7d5b088e3dd61508710d7eb871b6697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/connection/connection_secrets.rs:628-641 | crates/dbx-core/src/persistence/storage.rs:10436-10446 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e072f47b26e198cdda0049c7149bcfdc2a62c18cc88d589b4c5aa71471e9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-drivers/src/db/meilisearch_driver.rs:157-167 | crates/dbx-drivers/src/db/victoriametrics_driver.rs:458-467 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/meilisearch_driver.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ecb06a4d2ebd12d30e9bc0daea48d090c2c05694bc7295e1cbcd456d8391a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/dbx-plugin-runtime/src/plugins/installer.rs:1235-1248 | crates/dbx-plugin-runtime/src/plugins/manifest.rs:2220-2229 | crates/dbx-plugin-runtime/src/plugins/marketplace.rs:555-568 | crates/dbx-plugin-runtime/src/plugins/marketplace.rs:667-680 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"59978450ffff42af1b6191cfe6dff70affdb1c131c72adb994698e95db082e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-web/src/routes/mongo.rs:360-367 | crates/dbx-web/src/routes/mongo.rs:543-560 | crates/dbx-web/src/routes/mongo.rs:668-676 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"639342716833cfd53bb6f2f21e700fb5175d3414f780acdfa13dc79abddd875b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-web/src/routes/mq.rs:514-521 | crates/dbx-web/src/routes/mq.rs:527-534 | crates/dbx-web/src/routes/mq.rs:565-572 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0688d5574b692def43dbd613e1212f5d438a20165f6825c462469c76289d37d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-web/src/routes/mq.rs:540-547 | crates/dbx-web/src/routes/mq.rs:578-585 | crates/dbx-web/src/routes/mq.rs:646-653 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b849eb4e277b10289bc79b617cef406010a968d17fb6a883555653446417fbc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:336-350 | agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:353-367 \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":"agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"91123ebdeb0ef1ce20e94abcc2678d3222c9979c0809bc81b5620f07c775ffa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/oracle-go/dbms_output.go:477-489 | agents/drivers/oracle-go/dbms_output.go:498-509 \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":"agents/drivers/oracle-go/dbms_output.go"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cff20c1beab08e7ca4004bddcb35e81ecfcd2f4c9b564dbd1e50f6bee59bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/tdengine/src/driver.rs:814-820 | agents/drivers/tdengine/src/driver.rs:826-844 \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":"agents/drivers/tdengine/src/driver.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d3a1214db1ecc20a0e19a705b739d3ee1facac0ccd7d0e0d02e188a695a8f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/dbx-core/src/admin/nacos/service.rs:237-248 | crates/dbx-core/src/admin/nacos/service.rs:250-261 | crates/dbx-core/src/admin/nacos/service.rs:263-279 | crates/dbx-core/src/admin/nacos/service.rs:290-306 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/service.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"601cf08ca88aeb5dc7041c5b047058660aff53f5e6b2eea44a8ab7c795f51e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/dbx-core/src/query/mongo_ops.rs:1449-1469 | crates/dbx-mcp/src/backend.rs:2991-3011 | crates/dbx-mcp/src/server.rs:6322-6342 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"f904acb39c9e2929838bd541dc543f5769067af648de7ef543e7735e2353f301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-drivers/src/db/meilisearch_driver.rs:130-139 | crates/dbx-drivers/src/db/rqlite_driver.rs:445-457 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/meilisearch_driver.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9b0d6391cccb40a24fd2fb17ee3060e4dfa2f49b5e7094080de2a8cbde9b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-sql-core/src/sql.rs:1891-1901 | crates/dbx-sql-core/src/sql.rs:2004-2015 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd59eb0196105b63458a9356ec8e9004997fd2a3eefd4648227f1625906db60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/dbx-web/src/routes/schema.rs:911-919 | crates/dbx-web/src/routes/schema.rs:924-932 | crates/dbx-web/src/routes/schema.rs:937-945 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa142e9fe4fc1c0503b11ce4dbc1d8c3d179c12b238758b9800b292881bbc4fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:213-231 | agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:234-250 \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":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"263342f4942d6f78ba6ec62fd72d57bcf29ad4a8b2faa0d54d4ba3cc46d48080"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:2499-2522 | agents/drivers/vastbase-go/vastbase_metadata.go:1499-1523 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"6628d24d97d580ad8550b4a2b9f8ca094540a0fdeac758ff7be1d31cb85e7d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:987-999 | crates/dbx-core/src/admin/nacos/http.rs:1049-1067 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfbd05770526a3d705af9405df5fe3e2b8760821268ea55dfef082c948cae68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/connection/connection_secrets.rs:542-554 | crates/dbx-core/src/persistence/storage.rs:10278-10290 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d863c003b71a772781359cb23533c7969ada605d49014bd64a99abca0ebd7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-core/src/connection/connection_secrets.rs:643-654 | crates/dbx-core/src/persistence/storage.rs:3637-3651 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f0fb6d9359990e6c2430fa95f715fe1bcedb5d417dc31a1e0e3e560d533c15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-core/src/data/transfer.rs:6398-6420 | crates/dbx-core/src/query/mod.rs:2819-2838 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6398}}}],"partialFingerprints":{"codehealthFindingId/v1":"868cf0d3be806b88fa58641532c7deb79042c7d7066f3ff1090e45e1fdce1edc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-core/src/schema/oracle_routines/references.rs:18-26 | crates/dbx-core/src/schema/oracle_routines/transfer/packages/external_types.rs:4-12 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/references.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d199a35f5eddbdcebcd292ad998805072148cf20dfd9e9aa29e3e20c116548"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:5181-5193 | crates/dbx-driver-mysql/src/oceanbase_mysql.rs:90-102 | crates/dbx-driver-mysql/src/starrocks.rs:137-149 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8a0cf49770b39b52b6da76eb509960e58ce78535fb5c4ae55b9925d60da59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-sql-dialect/src/sql_dialect/dialect_types.rs:29-45 | crates/dbx-sql-dialect/src/sql_dialect/dialect_yaml.rs:949-966 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/dialect_types.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb1f52167803bf957d160e9320d9581a5f7ac38519f6babe4a8c2da582a1e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 9\u002B corresponding lines): crates/dbx-web/src/routes/consul.rs:1150-1158 | crates/dbx-web/src/routes/consul.rs:1174-1182 | crates/dbx-web/src/routes/consul.rs:1186-1195 | crates/dbx-web/src/routes/consul.rs:1220-1228 | crates/dbx-web/src/routes/consul.rs:1249-1257 | crates/dbx-web/src/routes/consul.rs:1261-1270 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e62738900f39873f0a02cc7823a92fd777484b07fd1c8bf369c387fb68b98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/dbx-web/src/routes/mq.rs:742-749 | crates/dbx-web/src/routes/mq.rs:1025-1033 | crates/dbx-web/src/routes/mq.rs:1184-1191 | crates/dbx-web/src/routes/mq.rs:1298-1306 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4be6656a5b4af69b5d30371c82faaf710f710f89e2c7c93b23c97847307ffab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-web/src/routes/mq.rs:1335-1342 | crates/dbx-web/src/routes/mq.rs:1538-1548 | crates/dbx-web/src/routes/mq.rs:1563-1570 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a49d407405ec4a2b204da39379377da9bd7234bde6e295c076c5d75d1c82b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src-tauri/src/commands/plugin_storage.rs:163-172 | src-tauri/src/commands/plugin_storage.rs:181-190 | src-tauri/src/commands/plugin_storage.rs:198-207 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/plugin_storage.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7e7b16a9245a1be6491a23ffaa0d374653410bc416155223f169cc138b5e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2125-2136 | agents/drivers/transwarp/src/main/java/com/dbx/agent/transwarp/TranswarpAgent.java:402-415 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3dd41bdcbb47cce3b5ca5150a0ce1eb988cf9139240d2bafe35a80c0ad4a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/vastbase-go/spatial.go:77-90 | agents/drivers/xugu/spatial.go:146-159 \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":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd4c37cc1970b5661028c43849633257c99aa6db3712bc7c00fe32ee4e6b134"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-cli/src/main.rs:991-1000 | crates/dbx-mcp/src/backend.rs:3088-3101 | crates/dbx-mcp/src/server.rs:7458-7465 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/main.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7937582f78d4ff8a8ce32ae5ec3944928b12d90b9e6d7b56c9b9c84c0076d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:510-517 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:581-588 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:647-655 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f02b3dfb64092546ed56ee25418d91f9099638b034b377b2a0cb21acff58794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-core/src/persistence/storage.rs:3229-3243 | crates/dbx-core/src/persistence/storage.rs:8066-8084 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0353aaa2740c305d4200f052e3cece5966a367ec08f635b3d02a5451a948fa6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/query/document_ops.rs:415-425 | crates/dbx-core/src/query/mongo_ops.rs:933-943 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c27709159044fbfce66d53234831e45a79ab6a51f4fd8ec95e7118e645ff80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:4179-4188 | crates/dbx-driver-postgres/src/postgres.rs:4498-4507 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":4179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a694d53cf287a3034c64a73e26259f1fce4f83468175cca91f23a0b99253aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:1801-1812 | crates/dbx-drivers/src/db/clickhouse_driver.rs:631-642 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7375750b93e82b56f3d51f4693ffbb4faca83173f52e99d4538003832a74fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-driver-support/src/http_tunnel.rs:124-132 | crates/dbx-drivers/src/db/proxy_tunnel.rs:85-93 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/http_tunnel.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"57287d314232675441baf830e9b201b811b4e6e9db4dba762a09b6e67f6886bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/dbx-mcp/src/server.rs:1698-1715 | crates/dbx-mcp/src/server.rs:1858-1875 | crates/dbx-mcp/src/server.rs:1882-1896 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa07949b072d1f4ee22d1c19f6ec4b4c23475611ae1c5f6ebcbc4b38ee2e2187"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-web/src/routes/mcp_policy.rs:266-280 | src-tauri/src/commands/mcp_bridge.rs:1326-1342 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mcp_policy.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff07d1da872efcc05485c7418b01891e5db43006a91169f4591ca65b6dd8da58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-web/src/routes/plugins.rs:249-259 | crates/dbx-web/src/routes/plugins.rs:264-274 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/plugins.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cb93b7dadef203a8d5f2b15bf8d92f575f0a973a108cd0aeeaff5ed192e86a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/drivers/cassandra-go/runtime.go:170-188 | agents/drivers/neo4j-go/main.go:370-388 \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":"agents/drivers/cassandra-go/runtime.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5fbd6c7f5bd43f79e07c3a886a1e01466f76c979630b802394210abd609df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:1079-1088 | agents/drivers/vastbase-go/vastbase_metadata.go:904-913 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca281a5ad8e26bef336a080b63cd2bfd4ed6b54bfab61f5c4d2a686b931ca3b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-cli/src/agent_skill.rs:297-307 | crates/dbx-core/src/data/dameng_dump.rs:142-151 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/agent_skill.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad284a62633518027a1fa8cb46c39fa6668743be66ccaac75554320251e1067"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/dbx-core/src/ai/agent_tools.rs:572-609 | crates/dbx-core/src/ai/agent_tools.rs:660-689 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61bb60f388682e8007c1ca4e0b9b0acaeca8831f49e26a957024fb7b7f9b7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/persistence/storage.rs:5046-5056 | crates/dbx-core/src/persistence/storage.rs:7626-7637 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":5046}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3f19db810d5d97f2c2055927238f06d9a6015f913f4c80293ffb9da269e393"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-core/src/persistence/storage.rs:8399-8413 | crates/dbx-core/src/persistence/storage.rs:8419-8435 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8399}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d6cece6cbc047d045622a884d944ed5e143b9b210a2ac0636f2f9e300c6d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/dbx-core/src/persistence/storage.rs:8685-8711 | crates/dbx-core/src/persistence/storage.rs:8743-8785 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8685}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0e335ddbbe7b60e5ac0fe6d0ddfbff76272b08678cb08a1081aefdaa6e13c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/dbx-core/src/query/document_ops.rs:327-335 | crates/dbx-core/src/query/document_ops.rs:397-405 | crates/dbx-core/src/query/document_ops.rs:433-441 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bf9c67b19f018b8e0935eb2e1e1f57bac27f00fdb12fb7293009064bf106a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/dbx-core/src/schema/mod.rs:1274-1292 | crates/dbx-core/src/schema/mod.rs:10271-10287 | crates/dbx-core/src/schema/mod.rs:10437-10454 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0965803cbbd09eeedd5e51566bda85090a9576ff643355f4e090b9eae0e237eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:555-565 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1025-1033 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1126-1141 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfeb285facc59490fa5bfe87eb0e2b8a6acddffc83e2afaa46b03296eada95ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/dbx-driver-mongodb/src/mongo_oidc.rs:179-202 | crates/dbx-drivers/src/salesforce_oauth.rs:250-273 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b12457310768cde6054d5aa7a563dc83a3adc30becd858188f730025073ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:1875-1886 | crates/dbx-driver-postgres/src/postgres.rs:9018-9029 | crates/dbx-driver-postgres/src/postgres.rs:9044-9057 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8eca6980dd731c391f20b24f7d7c91be89dd09e46df9e37bbdeee35f9832606"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:9348-9357 | crates/dbx-driver-postgres/src/postgres.rs:9707-9714 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":9348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efe34bcbb1b15de51ca21080affbf4f134362a24c2dd4ded7aa012a47521893"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-driver-support/src/http_tunnel.rs:248-261 | crates/dbx-driver-support/src/http_tunnel.rs:282-289 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/http_tunnel.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ae6c7393d792651d0e18b62b728b44185d9f79e66f4f41e12e0bcd257937de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-sql-schema/src/schema_diff.rs:5857-5864 | crates/dbx-sql-schema/src/schema_diff.rs:5869-5875 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5857}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c790b3dcfef4231581d9e90cc27c4a2eaa705e0254297f7890b3ecb21c664a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-web/src/routes/app_settings.rs:277-283 | crates/dbx-web/src/routes/app_settings.rs:288-294 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/app_settings.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc74289b0fc9b9833d645e1e83514680168bf3396b751bd087f1ddf55d91c04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-web/src/routes/mongodb_import_export.rs:350-356 | crates/dbx-web/src/routes/table_import.rs:401-407 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f02fce3c0773a92d42af908b47f5a468276fd977707279114695e2bee60969"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): agents/drivers/oracle-go/main.go:4060-4081 | agents/drivers/xugu/main.go:3344-3359 \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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4060}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc9e821f9fa30ad88135bbd47a6376a6f6ec3e83b82701333c5f07aa66ec370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-ai-provider/src/ai.rs:250-261 | crates/dbx-ai-provider/src/ai_effort.rs:438-448 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf057d8a5a8b203f8a54e3af6d8992ce93543616fa75fc28ca4652a335c16416"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:417-425 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:439-448 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:482-491 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:691-699 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d544afa87dfe6b14cbbe2eda7d1a4b33899e1639c44bd4556dced42ed62741"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/connection/mod.rs:6945-6952 | crates/dbx-core/src/connection/mod.rs:6954-6962 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":6945}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdfeb604dde4f08b2075136e3d186961745f492ecb007dff39febd1f16821e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-core/src/schema/mod.rs:8318-8331 | crates/dbx-core/src/schema/mod.rs:8338-8351 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8318}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d66ebb20d7924aff4a3147e44e3c401211d51010f319508f88c114b224f60a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:78-92 | crates/dbx-drivers/src/db/turso_driver.rs:38-47 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43c348971832a80c972d76cdf78a31836d3d0cc72b4d0240f8160928880b9cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-drivers/src/db/dynamodb_driver.rs:1272-1278 | crates/dbx-drivers/src/db/dynamodb_driver.rs:1329-1333 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d6ed2f641ef40aeff921a681b6ae29ff7feda8e040be05da24d6da7ae1c2fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-sql-data/src/data_grid_extractors/delimited.rs:251-265 | crates/dbx-sql-data/src/data_grid_extractors/delimited.rs:274-288 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/delimited.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3051e187ec6de72f346376b960dbb3b803a1b01a6f4b45ff14a7acdfd0dd67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src-tauri/src/commands/document_cmd.rs:65-87 | src-tauri/src/commands/mongo_cmd.rs:173-196 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/document_cmd.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c44ba93b76d5d5acda88497c23df13d811d1e15455ddb20980345222e58f8e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java:307-313 | plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java:354-360 \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":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"75eeb039352a4e7493dfae8dfbae9138c3b7818b2e268cb2fc5a8604cc17a32f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:404-420 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:423-440 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:455-471 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7300980825d4cc4fbdfbe2c9dd88018c832e224ba14545c6c2dcc6fa5ad45c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/data/database_export.rs:502-511 | crates/dbx-core/src/schema/mod.rs:1574-1584 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc0deb5590fb1db1ec949362fd8f484fdfd0a258f04da4f71aba6541c3b11c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-core/src/data/transfer.rs:7963-7983 | crates/dbx-core/src/data/transfer.rs:7985-7990 | crates/dbx-core/src/data/transfer.rs:7992-8016 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":7963}}}],"partialFingerprints":{"codehealthFindingId/v1":"961629ed4d250d0deb8fac8ed42a29f6e7eb5fae4ab1798c1af66cc21b8abbf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/dbx-core/src/query/document_ops.rs:916-926 | crates/dbx-core/src/query/document_ops.rs:978-988 | crates/dbx-core/src/query/document_ops.rs:1011-1021 | crates/dbx-core/src/query/document_ops.rs:1028-1038 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d647d355e15787a9543809a8cbd0522760c2f66f845a674783c0f7da821b99f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-driver-agent/src/agent_service.rs:3718-3725 | crates/dbx-driver-agent/src/agent_service.rs:3727-3734 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":3718}}}],"partialFingerprints":{"codehealthFindingId/v1":"caac6dc901308cab74a9abd4d9c585c108f270441f0aced85444961db3b14a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-driver-redis/src/lib.rs:4672-4676 | crates/dbx-driver-redis/src/lib.rs:4827-4842 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":4672}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae6f207efa63657ce2a9f08836f180b96c8b8e0e85d825eedc8b59add76b98f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-plugin-runtime/src/plugins/installer.rs:1221-1233 | plugins/sdk/packager/src/main.rs:611-621 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"6087a4aedfc946fb27df98c21310add867aeb5c0310079ae77635c1cf88212f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/dbx-sql-data/src/database_structure_search_sql.rs:193-236 | crates/dbx-sql-data/src/database_structure_search_sql.rs:419-453 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/database_structure_search_sql.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2748eeeb390952d08178dee17e8246065bc1f18ab5061bab51bbc5918f0eb3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src-tauri/src/commands/query.rs:544-568 | src-tauri/src/commands/query.rs:606-629 \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":"src-tauri/src/commands/query.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"79840a412e08b2023f4b75e14b48a3469b4f013bcd6ef84c8da2e261e10dbbc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2970-2981 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2983-2993 \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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4baf3b8390d5dbc923bfc303aeb328c9271ebc2813607efc91cdd382e82c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): agents/drivers/xugu/main.go:5826-5842 | agents/drivers/xugu/main.go:5844-5862 \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":"agents/drivers/xugu/main.go"},"region":{"startLine":5826}}}],"partialFingerprints":{"codehealthFindingId/v1":"6887855b43f582c80ad6a88f6c26966f10f1c81c0b9d23097278de1b87ff8f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): agents/drivers/xugu/package_members.go:265-288 | agents/drivers/xugu/package_members.go:290-310 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/package_members.go"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f64d36b2e364bfcbc3ddbf1ae5db6d59bf1f8f046a8bf02522bd2299ea180a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/data/database_export.rs:1061-1070 | crates/dbx-core/src/data/database_export.rs:1082-1094 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a069cd9391699e9fa1bd9f923270e2f354d31797fa9a615f037f1258de4f29d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/dbx-web/src/routes/redis.rs:370-382 | crates/dbx-web/src/routes/redis.rs:387-401 | crates/dbx-web/src/routes/redis.rs:406-420 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f8e5416797268b450603a7e3a27c1f5d6597a0a3afde200517919a399e1310"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): agents/drivers/argo-go/main.go:144-154 | agents/drivers/etcd-go/main.go:167-178 | agents/drivers/etcd2-go/main.go:137-148 | agents/drivers/hive-go/main.go:144-154 | agents/drivers/iotdb/main.go:148-158 | agents/drivers/neo4j-go/main.go:172-183 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac427e0adbd6089a6ee65d36254d540dd2fbd2dad728051bd63efb90bd08ce9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/drivers/nebula-go/graph_display.go:9-17 | agents/drivers/neo4j-go/graph.go:75-83 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/graph_display.go"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4858f7faa3c82c33eb44d27787f3807ce95140e397b6bea5ee1b9b42390ce20b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/drivers/oracle-go/main.go:3054-3068 | agents/drivers/oracle-go/main.go:3129-3145 \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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"35324e06c31181f01c39e093d24260cd67d0c53d12eff8655fd68adc2813a4f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-core/src/admin/nacos/service.rs:56-69 | crates/dbx-core/src/admin/nacos/service.rs:532-539 | crates/dbx-core/src/admin/nacos/service.rs:544-553 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/service.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"78db92703b07a68663a1101119708a588b377e9489c77d461595aecd61e223c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): crates/dbx-core/src/query/document_ops.rs:994-1004 | crates/dbx-core/src/query/document_ops.rs:1044-1054 | crates/dbx-core/src/query/document_ops.rs:1060-1070 | crates/dbx-core/src/query/document_ops.rs:1081-1091 | crates/dbx-core/src/query/document_ops.rs:1097-1107 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b26aa6f8fa98cd5620dfbe5da9642ae819845435ad8d0cc7c6625ea57e10e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/schema/mod.rs:3313-3328 | crates/dbx-core/src/schema/normalization.rs:71-86 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":3313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccd4abdacc81927361ba780d2bdd3574a3b1521b2b6c92122b964ba093c92e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:5935-5948 | crates/dbx-driver-mysql/src/mysql.rs:5969-5987 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5935}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c2f389f3b9e796e3dc89f9139a01b7004a7d831fb17156a62e9e96c505d7fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/dbx-mcp/src/server.rs:1903-1919 | crates/dbx-mcp/src/server.rs:1962-1979 | crates/dbx-mcp/src/server.rs:1989-2006 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0ad9857a4ac0ca8c565423f19f0f61955b6e187ad7917495e380e44987c5e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-web/src/routes/mq.rs:1468-1482 | crates/dbx-web/src/routes/mq.rs:1498-1511 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"56605094d64ddb177de453f9bf68d60c74aa595eb398c682fd99d4ec00539011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-web/src/routes/schema.rs:460-471 | crates/dbx-web/src/routes/schema.rs:503-514 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"686532646791f3d4ae150254e0a1a583f920da1d337d1186cd3069328f85e9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:93-105 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:178-192 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:53-65 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:58-69 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bdb937b337030c72d9511cdbdd09f68d897299f56136c4dde180a031e5cd9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCapabilities.java:176-187 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4684-4699 \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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCapabilities.java"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2738cdccb8965900b511117d39bb2d2f66f3827f800c09285ea26640c1f2aa01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): agents/go-common/iotdb-client-go/client/tablesessionpool.go:103-118 | agents/go-common/iotdb-client-go/client/tablesessionpool.go:127-142 | agents/go-common/iotdb-client-go/client/tablesessionpool.go:153-168 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/tablesessionpool.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9e09cf7dcfef3db8163a0263402a4f49ef621e65f3e675e50fe922b56a3d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:68-75 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:145-152 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"82244930bac3a54ceef51d6ba29c8851c576ad9cf44cc54162992225fbebf67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:1888-1894 | crates/dbx-driver-postgres/src/postgres.rs:9031-9037 | crates/dbx-driver-postgres/src/postgres.rs:9059-9065 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca0dce142f0dc656ab39de279763b126908bcd88c015d3e764d162d2155c910"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:189-215 | crates/dbx-sql-dialect/src/sql_dialect/dialect_yaml.rs:404-425 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"859ecceb7a69fadd884f40921704683693e1cf5b1357e6c041669142ee78a24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-web/src/routes/mq.rs:1195-1202 | src-tauri/src/commands/mq_cmd.rs:608-615 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dca3ba12c53284526cfc861d0d0911f778aba6c0ca149676730d4f6ce56786a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-web/src/routes/mq.rs:1208-1218 | crates/dbx-web/src/routes/mq.rs:1263-1270 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb1bac25dcd7ca83950cb000c968077406f1ba2993ee60f7ffc337b0bd9ef8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 6\u002B corresponding lines): crates/dbx-web/src/routes/schema.rs:134-140 | crates/dbx-web/src/routes/schema.rs:155-161 | crates/dbx-web/src/routes/schema.rs:678-683 | crates/dbx-web/src/routes/schema.rs:1278-1284 | crates/dbx-web/src/routes/schema.rs:1289-1295 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf002036ebeb662f640b3a426972b219fe7f1385b7441509313034b8c35ef0a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src-tauri/src/commands/external_db.rs:42-54 | src-tauri/src/commands/external_sql.rs:169-181 \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":"src-tauri/src/commands/external_db.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"201615cd06ffd086e529346b04fbb9996d16296475d50dd5322273926a9c8e57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 15\u002B corresponding lines): src-tauri/src/commands/mongo_cmd.rs:570-593 | src-tauri/src/commands/mongo_cmd.rs:605-627 | src-tauri/src/commands/mongo_cmd.rs:690-704 | src-tauri/src/commands/mongo_cmd.rs:716-738 | src-tauri/src/commands/mongo_cmd.rs:750-772 | src-tauri/src/commands/mongo_cmd.rs:783-804 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mongo_cmd.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"989c93bf1817530259238a8cccd5f124eb4e92653cc5b6f9f23ac2891d9e3faf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/common/src/main/java/com/dbx/agent/JdbcDatabaseInfo.java:70-78 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:1084-1092 \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":"agents/common/src/main/java/com/dbx/agent/JdbcDatabaseInfo.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"59622f916d57114c2e5af777042c1f51d35cdfe4444f2e3c8415d4f0a904e434"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java:322-329 | plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java:410-420 \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":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"0284254d352726c2bfab53efa541eb72d48d4e6bf71122f590757107defb30f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/kingbase-go/main.go:851-863 | agents/drivers/vastbase-go/main.go:714-726 \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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8bd4aaef31f32f96a2299c64000af9a930516f82839ffcddd4a81de0570a84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/kingbase-go/main.go:1082-1096 | agents/drivers/xugu/main.go:4197-4210 \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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"811da6e035de59c061608cc76da4c907a26d405f0e31a64f68744cc8570bcdf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): agents/drivers/vastbase-go/vastbase_metadata.go:2140-2158 | agents/drivers/xugu/main.go:1442-1457 \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":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c49a796ab1a67adf13aa7ca746b58c8f463326bfcd8a804b44667fa8a3bd355"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-ai-provider/src/ai_cli_agent.rs:481-489 | crates/dbx-ai-provider/src/ai_cli_agent.rs:1036-1045 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aff8d9a52498ce92b4aec4d43e2c4ac73d30e38bcf3b6adcda355ffac972ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-core/src/admin/mq/config.rs:202-207 | crates/dbx-core/src/admin/nacos/config.rs:284-292 | crates/dbx-core/src/admin/nacos/config.rs:294-301 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/config.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea314fb5c6172d5cfe0353b59075508d567bcae19327c3e5167ad5cf26d394b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:621-625 | crates/dbx-core/src/persistence/cloud_sync.rs:711-715 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b26ca39d0688d9dd16e7dc657cf149057b7b9559e1efcbaa787315a117ca7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/dbx-core/src/persistence/state_persistence.rs:105-114 | crates/dbx-core/src/persistence/state_persistence.rs:120-130 | crates/dbx-core/src/persistence/state_persistence.rs:132-141 | crates/dbx-core/src/persistence/state_persistence.rs:143-153 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/state_persistence.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f23d889f2d391ace8870b8d95ca0e7e705c5665a5bba82aa4656723282d0f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-driver-agent/src/oracle_oci.rs:136-146 | crates/dbx-driver-mysql/src/mysql.rs:2645-2655 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/oracle_oci.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23c51c944094aa67c4e3a27b7cf11b565f31e32c6c35adf48667c877525ac5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:328-335 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1166-1173 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0e2fc5231eace1ab4e6a556b36860533568787eff9b0c5882dd1bcbbacfa5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-formats/src/csv_export.rs:482-492 | crates/dbx-formats/src/csv_export.rs:508-521 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/csv_export.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"36095bad25b359ce7ede2a874bca091b2a0f4b0faa559f42922d38d07a982621"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/dbx-plugin-runtime/src/plugins/filesystem.rs:220-237 | crates/dbx-plugin-runtime/src/plugins/filesystem.rs:245-255 | crates/dbx-plugin-runtime/src/plugins/filesystem.rs:264-275 | crates/dbx-plugin-runtime/src/plugins/filesystem.rs:285-298 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/filesystem.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11c401349a22058b956c80d4127e63da415db0c5f351fea7c7eacd55235be9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/dbx-sql-schema/src/schema_diff.rs:1511-1521 | crates/dbx-sql-schema/src/schema_diff.rs:1523-1533 | crates/dbx-sql-schema/src/schema_diff.rs:1535-1545 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"838456b695290faaaccad2510d7df3a405d49ef956d1f21bd78011ff21bf1016"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-web/src/routes/redis.rs:489-500 | crates/dbx-web/src/routes/redis.rs:505-518 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a24acbf4b0cca2424cfc55073f9ee33472a548d1e67952b6c2997e947ef0f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): src-tauri/src/commands/mongo_cmd.rs:387-408 | src-tauri/src/commands/mongo_cmd.rs:418-438 | src-tauri/src/commands/mongo_cmd.rs:477-497 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mongo_cmd.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc84efbc2ac49381f5465b230bc9a0cdb80f9857178e94a01627fae3a6f3005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/common/src/main/java/com/dbx/agent/ExecuteQueryParams.java:55-63 | agents/common/src/main/java/com/dbx/agent/QueryPageParams.java:65-74 \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":"agents/common/src/main/java/com/dbx/agent/ExecuteQueryParams.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8667dfc2a34fac97f69f1993341e97e14d8bcf8d51cc4916d7c62bad6b7d686f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): agents/drivers/etcd-go/watch.go:18-46 | agents/drivers/etcd2-go/watch.go:19-49 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77378541b4b34a604898b46e32377e7ced9c504073c3d70bba86987a6ce5925"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/vastbase-go/spatial.go:346-363 | agents/drivers/xugu/spatial.go:427-440 \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":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6e930c60558ed42ad347326719f48349cf3ea5d3206be859dd58f835e5aa68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agents/go-common/gosasl/gssapi.go:96-110 | agents/go-common/gosasl/gssapi.go:293-303 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/gosasl/gssapi.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0126879a6434d6c3761b1946babee16b5007cd6296977940420fc649f235306"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): agents/go-common/iotdb-client-go/client/session.go:349-360 | agents/go-common/iotdb-client-go/client/session.go:369-380 | agents/go-common/iotdb-client-go/client/session.go:389-400 | agents/go-common/iotdb-client-go/client/session.go:532-543 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66d2fc92eb56250bef924d17905c797e78e882903348bff07bfd10b11a42c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-ai-provider/src/ai_codex_cli.rs:321-327 | src-tauri/src/commands/mcp.rs:1435-1441 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4978c5e142ab83190654cbc24bda1122ddb071b505a4b82e1c2c77bbc7a8a764"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/ai/agent_kv.rs:1202-1211 | crates/dbx-web/src/routes/mongodb_dump.rs:76-85 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7d3ce260ac77c802d0b4176660b7606edd24007dfee1c5b3a5337a9d811975"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/query/plugin_plan.rs:576-588 | crates/dbx-core/src/schema/plugin_metadata.rs:140-152 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/plugin_plan.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dab1daf615fb5d142c9a657c9eb4523f2e9fc5d0bd601853b85c508112b41f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-web/src/routes/query.rs:1456-1466 | src-tauri/src/commands/query.rs:1073-1082 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"78542b88ae3eace578ee9b8ed95eedfb17a9f4992fd92a35205c878a09409bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src-tauri/src/commands/etcd_cmd.rs:148-161 | src-tauri/src/commands/etcd_cmd.rs:170-183 \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":"src-tauri/src/commands/etcd_cmd.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c49f801ebe9c1ed408f15220e6cc02fdf269110f40d76a9f307726ec8a9ca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src-tauri/src/commands/ssh_prompt.rs:48-61 | src-tauri/src/commands/ssh_prompt.rs:74-83 \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":"src-tauri/src/commands/ssh_prompt.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6499547fcf5b3d0b14dc806ddd6d47482b4d86dcf5a3861a5c72f017b0e842"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agents/drivers/iotdb/metadata.go:593-610 | agents/drivers/neo4j-go/metadata.go:378-395 \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":"agents/drivers/iotdb/metadata.go"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"7682aac2c98b5fa219400472389cec1689b845103972843945c945b83cfd48ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:3122-3136 | agents/drivers/vastbase-go/vastbase_metadata.go:2033-2047 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33cd071454a68107cb9b1072580a16176e960ae1da1fe23f99de8d7630150e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:192-204 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4783-4796 \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":"agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88487a73ef4cdeeecd65e57c87ab634b36b7ac4ffb71998cb656c4a4017d082"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/rocketmq/consumers.go:608-621 | agents/drivers/rocketmq/topics.go:562-574 \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":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"525e0fefe7bbb8eb8a052f154436da78cee850eca29c6ce6229f063378e8f9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/dbx-core/src/connection/mod.rs:7492-7503 | crates/dbx-core/src/connection/mod.rs:7519-7528 | crates/dbx-core/src/connection/mod.rs:7536-7547 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":7492}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed84b21f0769a31439785f38018661db1bdb40f6bdd526d51d4dbb475b1fe21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-core/src/persistence/state_persistence.rs:214-219 | crates/dbx-core/src/persistence/state_persistence.rs:221-226 | crates/dbx-core/src/persistence/state_persistence.rs:228-234 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/state_persistence.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a177d3a54c3ffe082aca36b14db184210e66c9f3408a20aa31e20cd34f4a451b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): crates/dbx-driver-postgres/src/text_encoding.rs:639-644 | crates/dbx-driver-postgres/src/text_encoding.rs:649-654 | crates/dbx-driver-postgres/src/text_encoding.rs:659-664 | crates/dbx-driver-postgres/src/text_encoding.rs:669-674 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/text_encoding.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a165476fcdcdb919b2623b0f9377c81b966182069e520970cdcd65b5a99fade0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-web/src/routes/query_result_export.rs:133-140 | crates/dbx-web/src/routes/table_export.rs:121-128 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query_result_export.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c2a8fdc8d33e691c4ed506f2aa8094c419481fb0decd577f9a6cb140fbdc54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-web/src/routes/redis.rs:425-436 | crates/dbx-web/src/routes/redis.rs:462-473 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c8961d50bd61be0e1bc2ce316b338eab3b4c4d1e1ab75e9ce0fd2977803be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:659-671 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2447-2460 \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":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c1d5ee4fdfd9d2234ef43c97e3f675d10c369cd5fb3878f56649e9e3cb0d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): agents/go-common/go-gssapi/krb5/message_token.go:142-158 | agents/go-common/go-gssapi/krb5/message_token.go:405-421 \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":"agents/go-common/go-gssapi/krb5/message_token.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b03bbc1e6548973cdf4beeb3cd9082b550e870da68bc17849b309d1765a9451"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/dbx-ai-provider/src/ai_cli_agent.rs:656-665 | crates/dbx-ai-provider/src/ai_cli_agent.rs:747-756 | crates/dbx-ai-provider/src/ai_cli_agent.rs:912-921 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23c3d17d0bcb45041808bea9cd8ca4f94853dfa4fe9d9a505d19c29eef7c4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): crates/dbx-core/src/admin/mq/token.rs:113-121 | crates/dbx-core/src/admin/nacos/archive.rs:251-259 | crates/dbx-driver-mysql/src/mysql.rs:1156-1164 | crates/dbx-driver-support/src/db.rs:322-330 | crates/dbx-sqlite-worker/src/runtime.rs:251-259 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/token.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c4162c4cf9bb5177b0f511441958193f18762f5b0f9e2f14dafc84290fd0c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/data/table_import.rs:2920-2929 | crates/dbx-core/src/data/table_import.rs:4080-4089 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9235fa890208ad14b891966ac9c3995beb18a8d2d6904f54d4bb628f4cabc5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/data/transfer_rebuild.rs:620-628 | crates/dbx-core/src/data/transfer_rebuild.rs:639-646 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_rebuild.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c58ce50631abea3ad1c27b9ae0da80125c705ad9c527a5e9dcd20671b4f6ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-core/src/scheduled_backup/store.rs:33-37 | crates/dbx-core/src/scheduled_backup/store.rs:39-44 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/store.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd9db7134e4f70974a82b67ba500dde575ccf8824ed24d5236a963f2bbbcaa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): crates/dbx-core/src/schema/mod.rs:8748-8757 | crates/dbx-core/src/schema/mod.rs:8759-8772 | crates/dbx-driver-mysql/src/mysql.rs:4142-4156 | crates/dbx-driver-mysql/src/mysql.rs:4158-4177 | crates/dbx-driver-postgres/src/postgres.rs:4481-4496 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8748}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fc4824a4112704593f97a14397297a901cd22e3d761c4404179a5de93be0b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/dbx-driver-elasticsearch/src/lib.rs:449-456 | crates/dbx-drivers/src/db/couchdb_driver.rs:107-111 | crates/dbx-drivers/src/db/solr_driver.rs:142-149 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19049bbb0646a809ad564dd9d4183df66b2b67ded6ee01d429d11f4bcf112f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-driver-elasticsearch/src/lib.rs:3123-3127 | crates/dbx-sql-core/src/sql.rs:3423-3428 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":3123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8706c7007059ca25e3b8120bc98dc5e9d22601023c0a7036f32d4b4ac77d71b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-driver-mongodb/src/mongo_oidc.rs:166-177 | crates/dbx-drivers/src/salesforce_oauth.rs:236-248 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c249eec7a740dfdc506bf47de43818b4a3b08fe63e1c017e279de6c5271826"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:855-863 | crates/dbx-driver-postgres/src/postgres.rs:865-873 | crates/dbx-driver-postgres/src/postgres.rs:875-883 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d62a1a88884f0bcfa605baaebdf3c032d20369a477ccba22120bfb56a51737"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): crates/dbx-mcp/src/server.rs:1722-1736 | crates/dbx-mcp/src/server.rs:1743-1757 | crates/dbx-mcp/src/server.rs:1764-1781 | crates/dbx-mcp/src/server.rs:1816-1830 | crates/dbx-mcp/src/server.rs:1837-1851 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1013e35123ed2a827680195d4c882725c00c912fbe69e180c29e4a9119ccf03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-sql-schema/src/table_structure_sql/triggers.rs:306-313 | crates/dbx-sql-schema/src/table_structure_sql/triggers.rs:315-320 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8984245b1f76b171549f2ce495427f548f2782662564ef38e340e4273d385d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): src-tauri/src/commands/plugins.rs:71-77 | src-tauri/src/commands/plugins.rs:83-91 | src-tauri/src/commands/plugins.rs:97-105 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/plugins.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fef83a01ff8033fcfeebd2dc421896d79f8de9f4655d2a1ab832e9ed70495eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): agents/drivers/zookeeper/connection.go:585-595 | agents/drivers/zookeeper/connection.go:597-607 | agents/drivers/zookeeper/connection.go:609-619 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"49db94e09b1646652ca67afb04ebabc40c1ae439f1737933771106722141cfa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/admin/consul/capabilities.rs:169-178 | crates/dbx-core/src/admin/consul/capabilities.rs:199-208 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/capabilities.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5116d4c3f3384773c32f65148ce1d8385d39b4eade6649722ce5d4615ae59d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:2283-2313 | crates/dbx-core/src/admin/nacos/http.rs:2315-2345 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee945441167c2228218c262af796f6236d889c44c3d5988c094cbf5faad996bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-driver-mongodb/src/mongo_shell.rs:508-513 | crates/dbx-web/src/routes/mcp_policy.rs:190-195 | src-tauri/src/commands/mcp_bridge.rs:1698-1703 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda33c4408a39efa74dde832e3ce55c7f1940b4ef6fa5005cc3c75dc0414f1a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-drivers/src/db/sqlite_worker.rs:253-265 | crates/dbx-drivers/src/db/sqlite_worker.rs:267-277 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite_worker.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"071928b468942236af0273e0ea3b83f66dd904ed8241e7f582976fff100059d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-web/src/routes/consul.rs:343-355 | crates/dbx-web/src/routes/zookeeper.rs:79-91 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c340f8aa2863284031565c81bcdb8b561eacc98859ed0f13db022a30a4f584c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-web/src/routes/schema.rs:166-174 | crates/dbx-web/src/routes/schema.rs:215-222 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"324baccef5c9369e2eaac1bcdcb2b5204b8d74824512edd7f3edcf2dd6dab08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-web/src/routes/table_import.rs:29-45 | crates/dbx-web/src/routes/table_import.rs:47-63 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/table_import.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"776d547f117008f3fd049194b2f026bca741140e545806403d36aaffc2499519"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:138-151 | agents/drivers/gbase8c/src/main/java/com/dbx/agent/gbase8c/Gbase8cAgent.java:102-113 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:166-179 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f030b4a1fc7a366d07eb8d1631fbff2b4f149a84da74783c98b9cb8aba5367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:460-472 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3875-3887 \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":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2b86140ec2409c2c5a7974ff32c7402af5c77ac0d3d566a13da59bc6ca4e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:705-717 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5939-5952 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"900c061596c8a6a6ea790da7c029341f8f797eb4d4816885b33b4fd977e5e238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/etcd-go/auth.go:178-190 | agents/drivers/etcd-go/auth.go:313-325 \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":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca728cb381fb7089e164f11a2ff24a75e9b317dcd6ad72622486848a106075a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): agents/drivers/iotdb/metadata.go:281-296 | agents/drivers/nebula-go/metadata.go:121-131 | agents/drivers/neo4j-go/metadata.go:151-161 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/metadata.go"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"977b0892bda9a48e12786dc24a479c1662bb7963fbcb5f956b770760eea3a590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3209-3215 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5646-5652 \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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"948e1eec7bc3feb20cfef5f5679f4af713d84ff3a9df73a68c3546b0ad475cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/admin/consul/acl.rs:471-486 | crates/dbx-core/src/admin/consul/operator.rs:474-492 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/acl.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cfed112695f9ff90a144ae5477df205b82137b05a59b6164a5141fd6288ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-core/src/admin/consul/mesh/intentions.rs:121-127 | crates/dbx-core/src/admin/consul/mesh/intentions.rs:133-141 | crates/dbx-core/src/admin/consul/mesh/peering.rs:102-108 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/mesh/intentions.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"262356482db2a9e1d08685582f83221a89072d1735797a9538e36cf02cb48120"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:420-426 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:428-439 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rocketmq.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"edec36184c2c6322c7769abc14f75e9c2877dca1ec71f2dfd991c54ae053f2bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-core/src/host/changelog.rs:123-134 | crates/dbx-core/src/host/update.rs:212-224 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/host/changelog.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee10335a24dec4c9a28da0a6b54d5a06f1f4ae1d0953cc49f6e149f82d2472ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-driver-agent/src/agent_connection.rs:546-556 | crates/dbx-driver-agent/src/agent_connection.rs:696-706 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_connection.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef49c9f1c5faec796e61fceb59e37f6ca3cc16038b6fc8669d58efcd735678e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/dbx-driver-elasticsearch/src/lib.rs:1698-1705 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1503-1509 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1518-1524 | crates/dbx-drivers/src/db/dynamodb_driver.rs:957-967 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"14915bdcccdb7528898aafd15b4d84bc23f63c54574452118c83f1ab983037f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/dbx-driver-sqlserver/src/sqlserver.rs:1398-1407 | crates/dbx-driver-sqlserver/src/sqlserver.rs:1409-1418 | crates/dbx-sql-data/src/query_result_sql.rs:2339-2348 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a362e957c41359fdb27bd69c6bab02fe251d50722ff0117e1102ec8c2a226a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/dbx-plugin-runtime/src/plugins/assets.rs:83-92 | crates/dbx-plugin-runtime/src/plugins/installer.rs:1211-1219 | crates/dbx-plugin-runtime/src/plugins/manifest.rs:1421-1433 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/assets.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"526c5db845e23c8338199f7e0d65a56bc16f8441942808ad66a317d5405abb7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/dbx-web/src/routes/ai.rs:281-290 | crates/dbx-web/src/routes/ai.rs:299-308 | crates/dbx-web/src/routes/ai.rs:313-322 | crates/dbx-web/src/routes/ai.rs:327-336 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/ai.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"89506938e0ca5729a31bd94cf06754d981a9def727de3344c807c7de86c47963"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/dbx-web/src/routes/document_store.rs:491-505 | crates/dbx-web/src/routes/mongo.rs:761-774 | crates/dbx-web/src/routes/mongo.rs:966-979 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/document_store.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2ea205fac45d294d4db3063d12bc0ebcd38469309193316bcbf24536f20073"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): plugins/sdk/rust/dbx-plugin-sdk/src/lib.rs:131-137 | plugins/sdk/rust/dbx-plugin-sdk/src/lib.rs:355-361 \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":"plugins/sdk/rust/dbx-plugin-sdk/src/lib.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d19d0638e7a2fdfecbbab2f56896c75c9b51cc6a6eadcddd98ea9028d2b60c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): agents/drivers/cassandra-go/config.go:501-513 | agents/drivers/iotdb/driver.go:395-404 | agents/drivers/kingbase-go/main.go:606-617 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"54957d9f8aef54bddaf72956e4b7105c33d54cd39893f61edd4ee13d21a83e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/iotdb/main.go:284-296 | agents/drivers/kingbase-go/main.go:338-350 \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":"agents/drivers/iotdb/main.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b50e1cd493da5d88affa9bc223ecc94ed5858beebab749d00201a0760dde420"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/duckdb/src/schema.rs:590-597 | crates/dbx-core/src/schema/mod.rs:14132-14138 \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":"agents/drivers/duckdb/src/schema.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"918ad37abee1920909d0970309ccb5ced8ea0a50b7a217b0a763ba85163dcf2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/duckdb/src/sql.rs:103-112 | crates/dbx-drivers/src/db/duckdb_sql.rs:122-131 \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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"52525cb558b176d7cd5ad901569b8368044032b21d529c56cc78e0a38ce0977c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-core/src/connection/session_credentials.rs:189-197 | crates/dbx-core/src/connection/session_credentials.rs:199-209 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/session_credentials.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4fd37acf54d8ecd7bee85367a87acbbe90ead90df84316c93219d4b0b9408a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:2687-2702 | crates/dbx-core/src/persistence/cloud_sync.rs:2742-2756 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"891f147629dcab4cde26519ce1068fb48dbe39d60d2bb206f8656f052b336223"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-driver-mongodb/src/mongo_oidc.rs:137-144 | crates/dbx-drivers/src/salesforce_oauth.rs:210-217 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb2c86329847db4ef3445b49a5e44cf523a82f5e0ce8f877bb57e3c2c18a3cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:2116-2123 | crates/dbx-driver-mysql/src/mysql.rs:2972-2980 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1571233b35526e35fa5f0f7bbb48cefb9a8c1e27123230b0357a34fa1c65d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-sql-core/src/object_source_sql/oracle_trigger.rs:367-375 | crates/dbx-sql-core/src/object_source_sql/oracle_trigger.rs:625-633 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_trigger.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6a8031bfbec54f3814f5962159d2b17447c6e11eddd9c8bf0412ca23a51e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-web/src/routes/redis.rs:441-447 | crates/dbx-web/src/routes/redis.rs:478-484 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c3f8e25ece714787fc1ff46017fb3bd4d9497c1fd3ad0db4b282121d91c05f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/admin/consul/mesh/config_entries.rs:30-37 | crates/dbx-core/src/admin/consul/mesh/config_entries.rs:44-51 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/mesh/config_entries.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a77af75d18094ff15140a8e99eda080147f7469f12b198f6f64a0f1ec71a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:4570-4577 | crates/dbx-drivers/src/db/clickhouse_driver.rs:489-496 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":4570}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6aafea1fa8aa589dd3ad71bc132dd4f2447a30d13146dd4b5e5aa1b635d764"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/data/script_generator.rs:159-174 | crates/dbx-core/src/data/script_generator.rs:228-240 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d6e1bc5c02146b3bd25d8d6af258173ba65ef5f8205adbf813e4b6a0bd385a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/dbx-core/src/data/transfer.rs:6271-6288 | crates/dbx-sql-schema/src/schema_diff.rs:3060-3079 | crates/dbx-sql-schema/src/schema_diff.rs:3235-3250 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6271}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe80f558289a21b0556e8ebbe6affd7f1a8912c04b3e65e98d2d85fe8a55e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/dbx-core/src/persistence/storage.rs:9223-9235 | crates/dbx-core/src/persistence/storage.rs:9239-9255 | crates/dbx-core/src/persistence/storage.rs:9351-9370 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":9223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bd6bfb661f65338ed34d47468307d5ef2540055a04c957ca37a2c6e597f005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-driver-agent/src/agent_service.rs:1092-1096 | crates/dbx-driver-agent/src/agent_service.rs:1098-1102 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea17858fdc4913857e17bcce62bda734ae1b1c640ec94e4ba9589573aad8090d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:558-564 | crates/dbx-driver-postgres/src/postgres.rs:597-604 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f878637b5045be53be293980ecb84a3fbb6d88b7997b64fb0368116122cdf3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-web/src/routes/connection.rs:920-930 | crates/dbx-web/src/routes/sql_file.rs:100-111 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9604249563c9fc5b97ea2b6952e9e097c604ba64701a316e830055343f3760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:992-1008 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2707-2718 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4a21b09c06de0b8c0b308f6e80b892a16ab116bdd8530af8a0be7f75848b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:488-500 | crates/dbx-core/src/admin/nacos/http.rs:4385-4395 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_pi_agent_cli.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"104c186fd961edb353bb3b08d0492a3e0b75c0d99ecf7dacddbe5e0344a9f930"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-core/src/connection/connection_secrets.rs:385-396 | crates/dbx-core/src/connection/connection_secrets.rs:403-414 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdd55c2b0db7de8f8c6ce4ba8d3f4060380c988d1943d6d20222a9ae9631395"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/dbx-core/src/persistence/storage.rs:6145-6154 | crates/dbx-core/src/persistence/storage.rs:8981-8989 | crates/dbx-core/src/persistence/storage.rs:9002-9014 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6145}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c9a862e73d73f62637016fbdd232d4e5a51c892d339c81300cd099a9b6a7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/persistence/storage.rs:8878-8890 | crates/dbx-core/src/persistence/storage.rs:8892-8905 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8878}}}],"partialFingerprints":{"codehealthFindingId/v1":"da49c854668f1cf9684f1c178df8ce86958a980c433f896061ec47a214890cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-driver-support/src/elasticsearch_sql.rs:226-235 | crates/dbx-driver-support/src/elasticsearch_sql.rs:254-264 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/elasticsearch_sql.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48167103008d0a3cf70fa1a390de4287e2298f4e12066adadcb43d061c2ea0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-drivers/src/db/meilisearch_driver.rs:1565-1573 | crates/dbx-drivers/src/db/meilisearch_driver.rs:1597-1606 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/meilisearch_driver.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"95661eebcc1b290b1b9b4e811394eff6f8a58c6e9bf1dff950f05c760989c443"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-plugin-runtime/src/plugins/installer.rs:1148-1157 | crates/dbx-plugin-runtime/src/plugins/marketplace.rs:248-257 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"29444fdc1fc8e90ca2f57b3103cbd8574be60b86b56275dd14eab808de33c8c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): src-tauri/src/commands/mongo_cmd.rs:210-229 | src-tauri/src/commands/mongo_cmd.rs:241-259 | src-tauri/src/commands/mongo_cmd.rs:268-275 | src-tauri/src/commands/mongo_cmd.rs:286-297 | src-tauri/src/commands/mongo_cmd.rs:310-335 | src-tauri/src/commands/mongo_cmd.rs:347-365 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mongo_cmd.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa17f318a58a5de5aa9f16eac0bbaea38fa5f23c347c1df244d129576c731495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:296-308 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1366-1378 \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":"agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b449796912f81003b17d351f28df6d389bb9dbead546d44d24eb8e4311c1174"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/dbx-core/src/ai/agent_tools.rs:300-329 | crates/dbx-core/src/ai/agent_tools.rs:547-569 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8127cee4d2becf0bf8451b89ccd72c9927a5b20e454a8878569ec943449c6cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/dbx-core/src/data/script_generator.rs:1162-1172 | crates/dbx-core/src/persistence/state_persistence.rs:748-758 | crates/dbx-core/src/query/two_phase_commit.rs:126-135 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ce649ef36d1442be0c4389609942f1b6c4bee9020b7321b765edd98f812146"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-core/src/data/sql_file_import/failure_log.rs:779-790 | crates/dbx-formats/src/export_split_zip.rs:184-195 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import/failure_log.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb639a2b83d5488fbeee7f554a52f7598ecf7425ad1b764487ed6c19e07482a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:663-670 | crates/dbx-plugin-runtime/src/plugins/manifest.rs:2177-2182 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c029d6aea066071684e345d722062c8bb834d0a4828fd6056b302dad7cd267"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/schema/agent_pg_sequences.rs:70-77 | crates/dbx-core/src/schema/kingbase.rs:117-124 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/agent_pg_sequences.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0137cca823d1067a6a3c0792770367c1ca632f006b11b6a996a357050c3c08be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-core/src/schema/mod.rs:929-943 | crates/dbx-core/src/schema/mod.rs:2337-2348 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"099ee4f64a00c6f1e8f38e0d82a08aec362b654d76427e373809ee7d9cfa7a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-driver-elasticsearch/src/lib.rs:1033-1045 | crates/dbx-driver-elasticsearch/src/lib.rs:1047-1059 | crates/dbx-driver-elasticsearch/src/lib.rs:1061-1068 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd06989d2bacd92328e48bed62d46e3974acb6d8f551b087b0d0ae3230308e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-plugin-runtime/src/plugins/assets.rs:51-60 | crates/dbx-plugin-runtime/src/plugins/filesystem.rs:324-334 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/assets.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"760056c33c3b6c20d425eeddef41290729a1f5bca1f1226bbbb3cb15626b44ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-sql-core/src/dml_preview_sql.rs:58-69 | crates/dbx-sql-core/src/sql_risk.rs:43-54 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/dml_preview_sql.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c884012c7aaf12f6b73dcb122f11905bb186a138e0d5e513c841c4fa0c845eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:1244-1250 | crates/dbx-sql-core/src/object_source_sql/oracle_trigger.rs:107-119 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4292f05aed4d0e27881807071d9663f60fda3765798c40a1b0384585beb820"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-web/src/routes/consul.rs:891-904 | crates/dbx-web/src/routes/consul.rs:949-962 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d42da59489eab46c9e1044f975fab35b3bcf37583c71faa310fdf252821c017"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): crates/dbx-web/src/routes/mq.rs:830-837 | crates/dbx-web/src/routes/mq.rs:843-850 | crates/dbx-web/src/routes/mq.rs:856-863 | crates/dbx-web/src/routes/mq.rs:869-876 | crates/dbx-web/src/routes/mq.rs:925-938 | crates/dbx-web/src/routes/mq.rs:944-957 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e2eb6b1005779a2a3787363512445f6ad44d3c000640bab5fc674aa1fb2fa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3224-3235 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugNative.java:509-520 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6378-6390 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb227309cf4955629346aa9cf80613afe35fe9f4d359430d3904893b116de51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5315-5326 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5328-5340 \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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed21fd4a12e65a7f50183a03cd6033452e684aeb2a3ca745171aca487b0c995"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): agents/drivers/duckdb/src/wire.rs:212-217 | crates/dbx-drivers/src/db/duckdb_worker_protocol.rs:57-62 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/wire.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a148a1906c40c827329f6281fab2454ff0450717d66dfd4e8242c868cdb51a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/connection/jdbc.rs:166-176 | crates/dbx-core/src/connection/jdbc.rs:178-187 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10fbe6b174ec50f1af8736deb7c4873501344433228a795ad40c384248cfc79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/data/transfer.rs:4586-4595 | crates/dbx-sql-data/src/data_grid_sql.rs:3782-3791 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":4586}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5c9ebfe2bd1bdc96d52035233f2c6424b5b1d6c2bdd7c813bdec288f3b3819"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/schema/oracle_type_details.rs:51-61 | crates/dbx-core/src/schema/oracle_type_management.rs:72-82 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_details.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d264bbe32986972064724018338220cdbb2be9b6231e65d566600ab24a181f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:593-601 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1863-1874 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6690c61111108dcb2411b773cfdc64e6186a3c4680c74b880450436eeda27f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/dbx-sql-core/src/sql_analysis.rs:943-954 | crates/dbx-sql-core/src/sql_analysis.rs:956-967 | crates/dbx-sql-core/src/sql_analysis.rs:1074-1089 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ecd33be43a94bb9b0641c78dbbf9d7f106a6af7896793a3c70de6bf932c105"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/dbx-sql-core/src/sql_risk.rs:292-298 | crates/dbx-sql-core/src/sql_risk.rs:316-326 | crates/dbx-sql-core/src/sql_risk.rs:408-416 | crates/dbx-sql-core/src/sql_risk.rs:454-465 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_risk.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa03c91ce1f19d950e8b0f333e185346ecd509cabfda8e4521da75da9f8076d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): plugins/sdk/packager/src/main.rs:560-566 | plugins/sdk/packager/src/main.rs:568-578 \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":"plugins/sdk/packager/src/main.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1d60001923004ec6fb207b9e4cf7c5930145119d603e2e239a6a963a36c966"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/common/src/main/java/com/dbx/agent/ExecuteQueryOptions.java:63-71 | agents/common/src/main/java/com/dbx/agent/QueryPageOptions.java:73-82 \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":"agents/common/src/main/java/com/dbx/agent/ExecuteQueryOptions.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be11ff20a2075c93f1b503964f9c3cc0b7444196c923d4feaf3179cd2c069f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:21-32 | agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:46-55 \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":"agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f008ef988ee65509c172c622a700c1613ec24b8673654def908f6a3142cb7a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): agents/drivers/cassandra-go/main.go:284-298 | agents/drivers/neo4j-go/main.go:312-326 | agents/drivers/vastbase-go/main.go:347-361 | agents/drivers/xugu/main.go:958-971 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b65166525bed9202b54c81b87c714875a3d558a3015931261094d04a36130e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:3909-3922 | crates/dbx-drivers/src/db/hbase_driver.rs:583-595 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"c944a530602026b30ef95bf46ad98934b4fe410b3fc9578c6462a14fbe5c4d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/dbx-core/src/data/database_export.rs:1771-1792 | crates/dbx-sql-data/src/data_grid_sql.rs:5063-5084 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51e4c969a4c556e19b2e8aa53c7e4fd0b63fb5ef2533f5534c4730250b06b45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/dbx-core/src/data/transfer/oracle_table_contract/length.rs:60-74 | crates/dbx-sql-core/src/object_source_sql.rs:2294-2309 | crates/dbx-sql-schema/src/schema_diff/mysql_charset.rs:93-108 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract/length.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1322e54ea1985a76ee45c160e2b622a825a225ed3cb8951d590ce8ffaaae9815"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-core/src/persistence/storage.rs:1049-1054 | crates/dbx-core/src/persistence/storage.rs:1056-1066 | crates/dbx-drivers/src/db/meilisearch_driver.rs:1246-1256 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"578dc264dc384b903d5d22d0bb5ef2c44e08737ad07e8ff6a0718f69aaba2bde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:3473-3484 | crates/dbx-plugin-runtime/src/plugins/jdbc_sessions.rs:196-206 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2ef7a23b8d802df1c3f4f7cd9773581c8c29f9018ea06c6b5219ba08a0b8ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-drivers/src/db/vector_driver.rs:341-346 | crates/dbx-drivers/src/db/vector_driver.rs:385-390 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/vector_driver.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8936b28c29668a0c8a77803f131aaf985539360cde60c86fd8ce81973cb9fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-web/src/routes/mq.rs:1104-1110 | crates/dbx-web/src/routes/mq.rs:1142-1148 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebfd1abccbdca5ca30fb8a555d5e2de25e72bf0b0c9b3dde7191b3d162a5220"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-web/src/routes/plugins.rs:195-200 | crates/dbx-web/src/routes/plugins.rs:205-210 | crates/dbx-web/src/routes/plugins.rs:215-220 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/plugins.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"009f2ebd1bbc16525dbd07ad8ecfd1785dfd7b0177310e7ba3308b7d47993b79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-web/src/routes/sql_file.rs:455-468 | src-tauri/src/commands/sql_file.rs:360-371 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/sql_file.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b202bfbc369dad5de6910406f27e978a18a8b66eff215c83e8b83797956a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src-tauri/src/lib.rs:820-831 | src-tauri/src/lib.rs:833-844 | src-tauri/src/lib.rs:846-857 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lib.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"1151b90bdd6032b6a76d8fb851c7e56927f6182c14164eb93bd82a10e5d18f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/drivers/kingbase-go/main.go:960-979 | agents/drivers/vastbase-go/main.go:853-867 \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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b15fd1b778797b947c50eda56968aacf29f65eee67ae98eefea8a335109d7e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): agents/go-common/iotdb-client-go/client/rpcdataset.go:355-366 | agents/go-common/iotdb-client-go/client/rpcdataset.go:384-395 | agents/go-common/iotdb-client-go/client/rpcdataset.go:413-424 | agents/go-common/iotdb-client-go/client/rpcdataset.go:520-531 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f1c2e0d258be98a1db901a7b2671410c75b888bb24fc0806d09a035f9592d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/dbx-core/src/connection/mod.rs:1689-1705 | crates/dbx-core/src/connection/mod.rs:1714-1739 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fab6e9d9ed4b63c81d1f876f641dcaff08be04a1a8ff16e15c7293d8a6ad7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/dbx-core/src/data/transfer.rs:6290-6303 | crates/dbx-core/src/schema/mod.rs:18399-18414 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6290}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b802344d2c73b18833dcf7ce933f0396adf84d530ed7a45c4615d6729b108a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/schema/oracle_type_details.rs:107-113 | crates/dbx-core/src/schema/oracle_type_management.rs:128-134 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_details.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"db56c3171df200a71b0c7583d90b522d5e5e0d6044d327e440582abd9d7ce498"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-driver-redis/src/lib.rs:1941-1955 | crates/dbx-driver-redis/src/lib.rs:2155-2169 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ff790885a471eab84dd75213ac691ef781ee7edc9e1fdc43dc777a3e879a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-web/src/routes/database_export.rs:157-163 | crates/dbx-web/src/routes/mongodb_import_export.rs:330-336 | crates/dbx-web/src/routes/table_import.rs:381-387 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/database_export.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"784a9b92b9577ec12663a292ccb524c8c59223d66284d63af734db1ed2e261c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-web/src/routes/mq.rs:591-597 | crates/dbx-web/src/routes/mq.rs:696-702 | crates/dbx-web/src/routes/mq.rs:1000-1006 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"9115251d0b9b462dc9d540d7b2c2c548575b6715ffe0442bebb98628c06d435a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 7\u002B corresponding lines): crates/dbx-web/src/routes/mq.rs:672-678 | crates/dbx-web/src/routes/mq.rs:684-690 | crates/dbx-web/src/routes/mq.rs:794-800 | crates/dbx-web/src/routes/mq.rs:806-812 | crates/dbx-web/src/routes/mq.rs:963-969 | crates/dbx-web/src/routes/mq.rs:1390-1396 | crates/dbx-web/src/routes/mq.rs:1423-1431 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e584811826b52361a1d9b5b19fda872413d0b3fb3050ce5d19f5ef811785369"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-web/src/routes/mq.rs:882-889 | crates/dbx-web/src/routes/mq.rs:975-981 | crates/dbx-web/src/routes/mq.rs:1360-1366 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e8b7ef95e57164275602765079902c9640daae757de925969309baa9a5aff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 13\u002B corresponding lines): crates/dbx-web/src/routes/redis.rs:543-556 | crates/dbx-web/src/routes/redis.rs:589-604 | crates/dbx-web/src/routes/redis.rs:639-652 | crates/dbx-web/src/routes/redis.rs:721-734 | crates/dbx-web/src/routes/redis.rs:747-761 | crates/dbx-web/src/routes/redis.rs:786-800 | crates/dbx-web/src/routes/redis.rs:805-818 | crates/dbx-web/src/routes/redis.rs:872-884 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0ffe235af5096c32282a3932c3ca0eae2d21bb965794e7663393fe7b20576f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/dbx-web/src/routes/redis.rs:657-670 | crates/dbx-web/src/routes/redis.rs:844-856 | crates/dbx-web/src/routes/redis.rs:889-901 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb256af8c4b6e52b3792cf3d2b6972c9aaeb215a9089b9a2d19ef81d210a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-web/src/routes/redis.rs:906-913 | crates/dbx-web/src/routes/redis.rs:918-929 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc4719ecb9da3d31ec6350d923fa6466c919b8a5838505fece13301e9a649c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src-tauri/src/commands/mcp.rs:1562-1567 | src-tauri/src/commands/mcp.rs:1639-1644 \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":"src-tauri/src/commands/mcp.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7515a8851b4296a104aedc81b6b8471fccfa5631ac8169f274a758dda940036"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src-tauri/src/commands/mcp_http_server.rs:80-87 | src-tauri/src/commands/update_cache.rs:214-221 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_http_server.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6692694a1e19954fc810732fd8ec5d0ecee709f681cc184d9f9a23edfb73ba45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src-tauri/src/commands/text_export.rs:35-43 | src-tauri/src/commands/text_export.rs:46-54 | src-tauri/src/commands/xlsx_export.rs:73-84 \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":"src-tauri/src/commands/text_export.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"30689e692b0fed9b00dea6ff6b9a6ef8a1484c7b0bcc437966458243cc0fa0dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java:97-103 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1348-1357 \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":"agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"251290269a4df726e1854e1928f5c66d6bc2d8970f5b56c62a538383f8ba164d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2119-2133 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2313-2325 \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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"46686e8f4164abead8b77021b3fb39f2fc7cc0ee2d782c35b85dc4f7bc3b5583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:1994-2000 | agents/drivers/kingbase-go/kingbase_metadata.go:2002-2008 | agents/drivers/kingbase-go/kingbase_metadata.go:2217-2225 | agents/drivers/vastbase-go/vastbase_metadata.go:1264-1270 | agents/drivers/vastbase-go/vastbase_metadata.go:1272-1278 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3e8e13ad852d872f9296bff5dbcb484eb0a9981e1b627780be31bbe50a6eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/rocketmq/consumers.go:571-580 | agents/drivers/rocketmq/topics.go:309-318 \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":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ef463cfdaa848cf21d9a3b70faea014066f67bdbffb26e056902349681b1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-ai-provider/src/ai_codex_cli.rs:390-398 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:372-380 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e499000d7f56dc0506327550f72fcaa27d7c91d133aff738eb11e1772d1582f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-core/src/admin/consul/agent.rs:335-342 | crates/dbx-core/src/admin/consul/agent.rs:344-350 | crates/dbx-core/src/admin/consul/agent.rs:352-358 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/agent.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d015766b72ba7f2c07ce5fe2964211f26257dcbabb7d3e6c62588542d76015bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/admin/consul/session.rs:230-237 | crates/dbx-core/src/admin/consul/session.rs:239-246 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/session.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"616dc3d2b97bbb84d1e52505a5e8709889ed81675e153fae26567fb2a9859494"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-core/src/data/database_export.rs:3179-3194 | crates/dbx-core/src/data/database_export.rs:3203-3217 | crates/dbx-core/src/data/transfer.rs:1407-1413 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a417df64b3eb25c2436cbe93210394541e479f66913dc6a9958a87937ab3f479"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-core/src/data/table_export.rs:343-351 | crates/dbx-formats/src/text_export.rs:109-117 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f352f4112a439820f7c6ef7796c2d572464e8783d940488b62224d65cf7d888c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:1666-1671 | crates/dbx-core/src/persistence/cloud_sync.rs:1698-1703 | crates/dbx-core/src/persistence/cloud_sync.rs:1721-1728 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84769e136ee8cdbed5a9a00489d49991e6095d8c875d04d280fe3a83ef68109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-driver-redis/src/lib.rs:1140-1151 | crates/dbx-driver-redis/src/lib.rs:1155-1166 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d764722b63aecc66b14d546f1cfb73b104c050899e46c7895b17fac10390b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-driver-redis/src/lib.rs:4310-4318 | crates/dbx-driver-redis/src/lib.rs:4847-4855 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":4310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4875e3216e9eaa3ce9e397eb51189e30bfd632d1a8be0b73fb87960402204a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/dbx-sql-data/src/data_grid_extractors/sql_identifiers.rs:89-116 | crates/dbx-sql-data/src/data_grid_extractors/sql_identifiers.rs:118-143 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql_identifiers.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f6abae5b09f9fb9975ce0a384757a4bb0deb4676cae57c46b828011cfdf2c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-types/src/models/connection.rs:1202-1207 | crates/dbx-types/src/models/connection.rs:1209-1216 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a63c322efe477651f7478d8f1b76586ebfed524117663efccfb20e8ae290ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-web/src/routes/document_store.rs:816-822 | crates/dbx-web/src/routes/document_store.rs:827-833 | crates/dbx-web/src/routes/document_store.rs:909-921 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/document_store.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"9000eebebf6f9ba0737adbd9cfbd010703bb63270eb197548ffe0abfdf15f84e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/dbx-web/src/routes/hbase.rs:123-135 | crates/dbx-web/src/routes/hbase.rs:140-153 | crates/dbx-web/src/routes/hbase.rs:158-170 | crates/dbx-web/src/routes/hbase.rs:175-181 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/hbase.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21983b03262b7e2875f4b3f8f60553a7b42337bb8a37da27feff74b5648c3db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src-tauri/src/commands/external_db.rs:27-32 | src-tauri/src/commands/external_sql.rs:64-69 \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":"src-tauri/src/commands/external_db.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a8a5defd21aa80dd0eaa2b16e94ae994236c8a33229e7221c80eb23fb06c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src-tauri/src/commands/mcp.rs:1158-1162 | src-tauri/src/commands/mcp.rs:1236-1240 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d0625fc45765589f4d563d59643aaaef58ad2f9dcf0370d59527fce6784a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): agents/common/src/main/java/com/dbx/agent/DdlBuilder.java:534-543 | agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:538-545 | agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:547-554 | agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:556-563 | agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:579-586 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"9097405b504ea9c4198674a4f423c2a10dc318cc2f1eda52cba090c2e77ba7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:34-44 | agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:57-67 | agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:69-77 \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":"agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"472f75b712204e0dba150345a24eda4604cbe330b17e81dcb393935ba24c8cd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/oracle-go/pldebug.go:3730-3739 | agents/drivers/oracle-go/pldebug.go:3770-3779 \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":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":3730}}}],"partialFingerprints":{"codehealthFindingId/v1":"411ef7dafe863a6cf96dbde4e13f719710b9ffe09229e0c6c5062281a8216129"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 11\u002B corresponding lines): agents/go-common/iotdb-client-go/client/column.go:718-728 | agents/go-common/iotdb-client-go/client/column.go:730-740 | agents/go-common/iotdb-client-go/client/column.go:742-752 | agents/go-common/iotdb-client-go/client/column.go:754-764 | agents/go-common/iotdb-client-go/client/column.go:766-776 | agents/go-common/iotdb-client-go/client/column.go:778-788 | agents/go-common/iotdb-client-go/client/column.go:790-800 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/column.go"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6765318568541abd5980fe652511501a1d46597f72eb3c0b84b01eb4e977c5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/admin/mq/adapters/pulsar.rs:979-988 | crates/dbx-core/src/admin/mq/adapters/pulsar_version.rs:368-379 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/pulsar.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b245fcd215731a691e76c31d57ccb557e1c21b6d8e38561d4102fc07e29c41d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:2209-2224 | crates/dbx-core/src/admin/nacos/http.rs:2226-2243 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"74709d06e66ca43b3d7c5d93202fdb171725e7f98aa48718d8f393fb28a7620e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/dbx-core/src/data/query_result_export.rs:716-725 | crates/dbx-core/src/data/query_result_export.rs:734-745 | crates/dbx-core/src/data/table_export.rs:160-169 | crates/dbx-core/src/data/table_export.rs:178-189 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2cc6029e401c65a4870b3f5c277705f521a1adec873df76e71f225e1d0ab5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/dbx-core/src/data/transfer.rs:1292-1299 | crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:566-574 | crates/dbx-drivers/src/db/rqlite_driver.rs:416-424 | crates/dbx-drivers/src/db/turso_driver.rs:661-669 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1218f4a8eee0d39a0bc1195127fc3bd378dc7a8dd898361f1d03d9d329bbf35d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-core/src/persistence/storage.rs:6527-6534 | crates/dbx-core/src/persistence/storage.rs:6612-6619 | crates/dbx-core/src/persistence/storage.rs:6645-6652 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6527}}}],"partialFingerprints":{"codehealthFindingId/v1":"4978f2a07468ea4f4b832977d86b50222fa51c3ae4e8df1dd64314faaf40402e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-mcp/src/server.rs:2045-2050 | crates/dbx-mcp/src/server.rs:2136-2150 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbaf74db9e3f57c17e98248154e9a365c1d8518879a8f078fae1c4b9fe2f9e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-mcp/src/session.rs:159-167 | crates/dbx-mcp/src/session.rs:171-179 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/session.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bdd48d1c4d70a32cd843b2628b1222a5ba87f48512d72d64da7043181c9dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/dbx-sql-core/src/sql_risk.rs:328-336 | crates/dbx-sql-core/src/sql_risk.rs:418-426 | crates/dbx-sql-core/src/sql_risk.rs:467-475 | crates/dbx-sql-core/src/sql_risk.rs:496-504 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_risk.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c63387dffc2a527b1a70579d86c30c310d7034721bd5ad44ec7f563dc985621"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-sql-data/src/query_result_sql.rs:2405-2416 | crates/dbx-sql-data/src/query_result_sql.rs:2444-2452 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"934f7be82852fbb6245af703c504ab276aec48f844f3fcd6056327c19baec315"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-sql-data/src/query_result_sql.rs:2550-2555 | crates/dbx-sql-data/src/query_result_sql.rs:3051-3056 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5299e509f3cb3e36dc766478a91cf5f189b3a31d4e45ddcec52cce5a9436a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-web/src/routes/consul.rs:1371-1378 | crates/dbx-web/src/routes/consul.rs:1406-1414 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70aa285537803603811606fd22cd0b85e9c33f62e982c2e0d00177e30d5bd39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-web/src/routes/mongodb_import_export.rs:229-235 | crates/dbx-web/src/routes/table_import.rs:249-255 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"765c68d6d1e3883665a42682b11b4c1114ecab92c9f82d8e95310c5f93dbd162"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-web/src/routes/pl_debug.rs:123-132 | crates/dbx-web/src/routes/pl_debug.rs:150-157 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/pl_debug.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc474e75097bbbc6e0fdb209d370c6e7496e117bf775dfa735b7af3a6838cb9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-web/src/routes/schema.rs:227-238 | crates/dbx-web/src/routes/schema.rs:1267-1273 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e39884ab3b3544f6d239950042cb4af4810cb77787d9f3f647fca3980bbec96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src-tauri/src/commands/plugins.rs:46-54 | src-tauri/src/commands/plugins.rs:60-68 \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":"src-tauri/src/commands/plugins.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba0952759edd661cd834bdc2082c6f4759dc9284a65c47d1dceff80682ae792"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:227-241 | agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:259-273 \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":"agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef1425a11de894953b099bfc80e28a51c1cbcbe3f854af6d0b4d6919ca9160f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1573-1578 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1443-1448 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbb56f96729ec9b2b0ccdd70b4e59c1854fda13dc0b76f1b4892d418e428333"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1585-1595 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1675-1683 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3477-3490 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1705-1714 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"935ea728217de908970ecf71970c1890b81842c96e9f08ed33ebb79c676d33f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2695-2707 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3956-3968 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4702-4714 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"284ab3a3e177ae2e358c9251ac7bf478cca30e8f3add679d77542451f2ec04c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 5\u002B corresponding lines): agents/drivers/duckdb/src/runtime.rs:78-82 | agents/drivers/duckdb/src/runtime.rs:84-93 | agents/drivers/duckdb/src/runtime.rs:95-105 | agents/drivers/duckdb/src/runtime.rs:107-117 | agents/drivers/duckdb/src/runtime.rs:122-126 | agents/drivers/duckdb/src/runtime.rs:128-139 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/runtime.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cda9a65b5882132a78d9c5cf9c13d04b0ede2c7eb2b8f065b3d57bd4c8230e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-core/src/admin/consul/enterprise.rs:256-262 | crates/dbx-core/src/admin/consul/enterprise.rs:268-273 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/enterprise.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0475dad7ac79d96f9853c892b297819bc0f3190e83ce90c472c061fbb300a243"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-core/src/admin/consul/mesh/peering.rs:82-87 | crates/dbx-core/src/admin/consul/mesh/peering.rs:92-97 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/mesh/peering.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e100eaea2e42f7880c005ec2fda80ccf374ae0b8415f1d282e4055309215bc37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/admin/mq/adapters/kafka.rs:479-485 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:716-722 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebda5b21371ba10526b5cd4b5dc07f12b015d18f29a1335de6a03d1f8cd28b38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/schema/mod.rs:1062-1068 | crates/dbx-core/src/schema/normalization.rs:59-69 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4d1cdd055d7b1c28a3c5b0cc557ae5f4588f7679565b350e537fa3dd7987d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/schema/mod.rs:2552-2561 | crates/dbx-core/src/schema/mod.rs:2568-2577 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":2552}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a356997ef86791806d9fe8d07a680d82f2bf06ccda6bcb316f7a4d6f9c8d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/dbx-drivers/src/db/meilisearch_driver.rs:528-537 | crates/dbx-drivers/src/db/meilisearch_driver.rs:593-606 | crates/dbx-drivers/src/db/meilisearch_driver.rs:1070-1079 | crates/dbx-drivers/src/db/meilisearch_driver.rs:1163-1171 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/meilisearch_driver.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0c5cccdab0729c3de47a9f12c760da72dadea274ec1992c5d2feb61cfe58bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-drivers/src/db/salesforce_driver.rs:262-272 | crates/dbx-drivers/src/db/salesforce_driver.rs:330-339 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/salesforce_driver.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"512792a9b53061d5e39eb26fe9c62f6b8e5e5dda051f19ec9258b2f7ef716bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-sql-core/src/sql_risk.rs:620-628 | crates/dbx-sql-core/src/sql_risk.rs:642-650 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_risk.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bbdd0b746f8b868b9f2f7251a30b6126f6adcab01051cf85b6dcdb815aa91a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): crates/dbx-web/src/routes/consul.rs:1285-1292 | crates/dbx-web/src/routes/consul.rs:1360-1367 | crates/dbx-web/src/routes/consul.rs:1394-1402 | crates/dbx-web/src/routes/consul.rs:1440-1447 | crates/dbx-web/src/routes/consul.rs:1461-1468 | crates/dbx-web/src/routes/consul.rs:1498-1506 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae5b12c83db9e67ac6aec4f6672040101b53125a82b77973dde7b7a7b267dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-web/src/routes/etcd.rs:123-137 | crates/dbx-web/src/routes/etcd.rs:167-181 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/etcd.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"36db757212dc31722993e34c32954919eb8f0fe9ba3471d47ad04274199a6eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-web/src/routes/mq.rs:1154-1159 | crates/dbx-web/src/routes/mq.rs:1312-1318 | crates/dbx-web/src/routes/mq.rs:1324-1329 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"25697a7702561ad98e9f0579d1464e090216010d62286cb19fcc2e440b1d7a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): agents/drivers/argo-go/config.go:897-901 | agents/drivers/hive-go/config.go:937-941 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"6719165e28c9de3b5524e48aef955911f78042b628078356d11f8e5d30c6e55b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): agents/drivers/argo-go/main.go:567-576 | agents/drivers/cassandra-go/main.go:491-500 | agents/drivers/hive-go/main.go:567-576 | agents/drivers/iotdb/main.go:465-474 | agents/drivers/vastbase-go/main.go:1397-1406 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7688ac36eb31a0bd7b4b0f94758f0a7c759792db655b57aec9c835104a4c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:788-795 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:797-805 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1569-1576 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c70737cdaf65da7472d8b7d840a6fa451b24b272fcbe4ed42c4536a3c1716b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/oracle-go/tns.go:194-207 | agents/drivers/oracle-go/tns.go:209-225 \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":"agents/drivers/oracle-go/tns.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe0beb05f8c1e06b0744daae247d84720a2eafaae500939ccedac05b4835ca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-ai-provider/src/ai.rs:5282-5288 | crates/dbx-ai-provider/src/ai.rs:5320-5326 | crates/dbx-core/src/persistence/history.rs:118-124 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":5282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57f762b3b49e115b422d2f03b3b62030a2beb762d79614a6d00089f5a4ccbc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/admin/nacos/access_control.rs:1121-1128 | crates/dbx-core/src/data/database_export.rs:4837-4845 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b646cca11a8585b950d78f431166038d4c2e486ea56cfd874a02463e7821c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/dbx-core/src/ai/agent_tools.rs:1731-1741 | crates/dbx-types/src/models/connection.rs:1808-1817 | crates/dbx-types/src/models/connection.rs:1819-1828 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27ad9466f4017c89366e4d0c229c04c0b6b7d8dc1b273192a917ad656d0866a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-driver-sqlserver/src/sqlserver.rs:1617-1622 | crates/dbx-driver-sqlserver/src/sqlserver.rs:1624-1629 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dfd784feb5e09bb69b1c2a238ddd676f27f03d79c5c775a50bd5b6ab2c6b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-driver-support/src/elasticsearch_sql.rs:163-171 | crates/dbx-driver-support/src/elasticsearch_sql.rs:173-181 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/elasticsearch_sql.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1e7876f43683bbe78315ceaf59616812b5095245dadf27665e025ebfcf16de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-mcp/src/transaction.rs:180-193 | crates/dbx-mcp/src/transaction.rs:195-207 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/transaction.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"85724d196de2eaab6c5f7a0cb2ce9bd226ddac46376e3712bdbf300c9e808435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-plugin-runtime/src/plugins/marketplace.rs:682-692 | plugins/sdk/cli/src/lib.rs:1383-1395 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/marketplace.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"4281e2f7976f34d25750432bb72a3037e85b41e16c8c67b99182952ba3b6915d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-web/src/routes/document_store.rs:761-767 | crates/dbx-web/src/routes/document_store.rs:772-778 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/document_store.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a173be00a594763c650f8466afcb6efc6d4b5e3326ba212119e0674b91f1bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-web/src/routes/document_store.rs:783-795 | crates/dbx-web/src/routes/document_store.rs:800-811 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/document_store.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d757ca2476901652799a10f38b30fd8a6c51e3402a646eceaf6933b4f718596"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:288-302 | agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:297-314 \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":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb6b34f0d442c8ceecffa0b889a4b7b67110532f70d1619a34e2f0b596b46cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java:223-234 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3944-3954 \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":"agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec078e3b056be7cb8c71359975ce1abaf816618d62a935286cb55b02af322a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdAgent.java:329-338 | agents/drivers/yashandb/src/main/java/com/dbx/agent/yashandb/YashandbAgent.java:132-141 \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":"agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdAgent.java"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9993ae7c640804b3fea39e7f47ffa5e54111a0916ecf6f54975716272579b2ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/dbx-core/src/ai/agent_tools.rs:416-437 | crates/dbx-core/src/ai/agent_tools.rs:692-713 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"58527565289ea33d1cd9ab29d750200d27130b3c78a2d384d13e80bfaaa5e827"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/dbx-core/src/data/database_export.rs:1099-1106 | crates/dbx-core/src/data/database_export.rs:1759-1769 | crates/dbx-sql-data/src/data_grid_sql.rs:3531-3539 | crates/dbx-sql-data/src/data_grid_sql.rs:3555-3563 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d4075a9709214942eaa5984c6325e12d5cb721e9d1f317af5b03924ccf4670"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-core/src/data/script_generator.rs:677-684 | crates/dbx-sql-core/src/object_source_sql.rs:2100-2107 | crates/dbx-sql-core/src/object_source_sql.rs:2117-2124 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a45310062066ec03375d2577fbf2fe413beb4836d88cccd83afce81009303e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/dbx-core/src/data/transfer.rs:2134-2157 | crates/dbx-core/src/data/transfer.rs:2911-2930 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1bb6c7208222dba71c2cc5a4b4bcefa5c9a15ba1c72da44973a3edbe4be8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/dbx-core/src/query/mod.rs:382-397 | crates/dbx-core/src/query/mod.rs:832-847 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f24d3cf88d2cc3c9d56d14a2f2895e3d58e000f7ca1717bd888cf48e4b17bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-driver-agent/src/backend_error.rs:303-314 | crates/dbx-driver-agent/src/backend_error.rs:339-350 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/backend_error.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"10597cad01db3b8f3425353e0387bb7f72e651e5a961a6c75b31529cad805e83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-driver-agent/src/startup_cleanup.rs:105-110 | crates/dbx-driver-agent/src/startup_cleanup.rs:112-117 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/startup_cleanup.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e516f65d7ef35659f42706d9df28d70dfe724cb7128e3177fdcc78e0f086fa97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-driver-mongodb/src/mongo_driver.rs:1511-1516 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2627-2632 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d92e2ee5f71ab4b58a07d29d63fcf163bbf663518c77f5bf362e8632d449c16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:5750-5761 | crates/dbx-sql-data/src/query_result_sql.rs:2273-2282 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5750}}}],"partialFingerprints":{"codehealthFindingId/v1":"645ac42d9cd94bfd52dc44283016badfd43aa18791b6f6e3ea43b30e2ec82097"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-mcp/src/backend.rs:1585-1590 | crates/dbx-mcp/src/backend.rs:1597-1602 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"2796ffb3a2608b4aee79b229658e228b3f18da8456357c79a6d9b3e5333028bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/dbx-platform/src/ssh_prompt.rs:174-190 | crates/dbx-platform/src/ssh_prompt.rs:199-215 | crates/dbx-platform/src/ssh_prompt.rs:218-234 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-platform/src/ssh_prompt.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4dbaf27d3310948f9c359188f79cc807e98a03e162464aa9a8194506e7aa3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-web/src/auth.rs:60-63 | crates/dbx-web/src/routes/plugins.rs:28-32 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/auth.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c0f9849e778cab6b677650d752b7e88c96849b88bdccb697d6d6b273bbd1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 4\u002B corresponding lines): crates/dbx-web/src/routes/redis.rs:361-365 | crates/dbx-web/src/routes/redis.rs:1026-1031 | crates/dbx-web/src/routes/schema.rs:72-75 | crates/dbx-web/src/routes/schema.rs:80-84 | crates/dbx-web/src/routes/schema.rs:125-129 | crates/dbx-web/src/routes/schema.rs:145-150 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abd00a1ca9dea94bf2aebc4d8bcda40f3465d4e704993314c1956f07a38898c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src-tauri/src/commands/plugin_file/mod.rs:374-381 | src-tauri/src/commands/plugin_file/mod.rs:390-397 \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":"src-tauri/src/commands/plugin_file/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3fdea95256af9be16de25a137f881c109f6cc2d79af50c41507b437d1d0bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src-tauri/src/commands/plugins.rs:494-500 | src-tauri/src/commands/plugins.rs:507-513 \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":"src-tauri/src/commands/plugins.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"959197b130bb52be34818fb57d031444f89ed18d3ee1245a010d235218c5af44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2477-2491 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2607-2621 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b7836cd0110cd7da1fccb7d1ffbdccb8752a4ad3997376bc839fb09e9a4df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/etcd-go/client.go:361-376 | agents/drivers/etcd2-go/client.go:428-440 \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":"agents/drivers/etcd-go/client.go"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64bef979baec92db339989f16ee90f883a76edf10190aae8960288f96535813"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/go-common/iotdb-client-go/client/sessionpool.go:139-152 | agents/go-common/iotdb-client-go/client/sessionpool.go:154-166 \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":"agents/go-common/iotdb-client-go/client/sessionpool.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e4ed58f95f8e768e884ac8c514ef1b21e2f295515628c28f2cf9124fcc7d37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3067-3079 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6629-6639 \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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b8228e9d16af21e9f36c0e7620f6a2eff7150ec8861d51855be159c19873ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-core/src/admin/consul/mesh/intentions.rs:78-82 | crates/dbx-core/src/admin/consul/mesh/peering.rs:73-77 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/mesh/intentions.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"72846ea79674655ba60f471eb457ea15018f770940efdf764c677a79b2d0d1cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/persistence/storage.rs:5861-5868 | crates/dbx-core/src/persistence/storage.rs:5903-5910 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":5861}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae078bf68905202df0fa839a7a7736d2a08a554ff23b4184204ecb336045505"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-core/src/schema/mod.rs:1550-1556 | crates/dbx-core/src/schema/mod.rs:13002-13009 | crates/dbx-drivers/src/db/questdb.rs:228-235 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"1521eb404dfb64699563da2953045a950d0811cbfcf9d9ac7c4cbe56903d5053"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/schema/native_jobs/operations.rs:211-221 | crates/dbx-core/src/schema/native_jobs/operations.rs:223-235 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bce3bb525fe7956e495b8dacae5c6f3525b5d3d53cfb8752b86e308e2c2a3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-mcp/src/server.rs:2013-2018 | crates/dbx-mcp/src/server.rs:2112-2126 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"085500be63ffc7e69815227427c616c269718c1536cbd606dfef1f9cba8512b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-web/src/routes/consul.rs:302-308 | crates/dbx-web/src/routes/consul.rs:323-329 | crates/dbx-web/src/routes/etcd.rs:186-192 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"80593c7b5c6a7a9e055bf51ddba35fdb885ce1c26a269a1d6fd60769d100bb4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-web/src/routes/hbase.rs:89-101 | crates/dbx-web/src/routes/hbase.rs:106-118 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/hbase.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28acee822000d6747cc68db8740ce07810b66a5aa8e932ef8a4541183d55a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 6\u002B corresponding lines): crates/dbx-web/src/routes/mongo.rs:349-354 | crates/dbx-web/src/routes/mq.rs:480-485 | crates/dbx-web/src/routes/mq.rs:491-496 | crates/dbx-web/src/routes/mq.rs:818-824 | crates/dbx-web/src/routes/mq.rs:1378-1384 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"75791355e8eb978ebf92e19844c4ca11f4e5f08b543c33b96cf601996428045d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): agents/common/src/main/java/com/dbx/agent/JdbcAgentProfile.java:231-237 | agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java:294-300 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:678-684 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcAgentProfile.java"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ff9762343649b52bdf0d32ee0d060464675ae0cb6997ec21a995a19fe21201"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:565-578 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:580-594 \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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7f9548a6797e74590b8e632c7711fbb3cd6df988c786b22168e6006c55a3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/drivers/oracle-go/pldebug.go:4996-5003 | agents/drivers/oracle-go/pldebug.go:5137-5148 \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":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":4996}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3deabe0c8f7a636e38e3c64995cefcd0ff0bcafcad798e8afc58f1e834c2934"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/dbx-core/src/data/table_import.rs:3621-3629 | crates/dbx-plugin-runtime/src/plugins/manifest.rs:630-638 | crates/dbx-sql-core/src/value_literals.rs:146-154 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fb7c62d4613dc6123718132d49ad2c64753cf1c360e19fa6cbf7387947df1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/persistence/storage.rs:3870-3877 | crates/dbx-core/src/persistence/storage.rs:3904-3912 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":3870}}}],"partialFingerprints":{"codehealthFindingId/v1":"6039fc0f22d773a3fe7a4fb84e2126ee2cb3a96d82d9a3f9219cce24f8cb3afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agents/common/src/main/java/com/dbx/agent/DdlBuilder.java:492-502 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:805-815 \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":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad700b3f0d35fa48fbe9e7976fd2c613849c12372925ea97cc795cc310ab61c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/neo4j-go/query.go:240-249 | agents/drivers/neo4j-go/query.go:380-392 \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":"agents/drivers/neo4j-go/query.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"450901253d0da7125238fdf3ee61cebc2cf4257a0688f4d5547eeaf40bed1908"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:28-34 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:34-40 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:130-135 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:27-32 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3815b89deeae80ed2f773fc911745d2a7246816aa3bff7cca23cbccab8e7f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:4602-4609 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:1038-1045 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":4602}}}],"partialFingerprints":{"codehealthFindingId/v1":"e438ed1ef8d161a7ac68dd5425f94492d82a8cdadd16e973d765bc4e9e9da231"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-core/src/connection/session_credentials.rs:180-186 | crates/dbx-core/src/connection/session_credentials.rs:213-217 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/session_credentials.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"859d7274abf38177c998d39024d863c1a5265bbd2e631badc19246d77bd9f3e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/dbx-core/src/persistence/cloud_sync.rs:2725-2740 | crates/dbx-core/src/persistence/cloud_sync.rs:2758-2772 | crates/dbx-core/src/persistence/storage.rs:3658-3671 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b64129745a78c7527dca41cef286a58f6bd8e7c32bd7e067c4136a47f247aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dbx-driver-agent/src/agent_offline_export.rs:1089-1106 | crates/dbx-web/src/routes/export_download.rs:32-44 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"1522c410ba0126bb1b5553d3160eddaeb0c9f9e93d539e0e117d7f1f5316ee41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): crates/dbx-driver-agent/src/agent_offline_export.rs:1108-1116 | crates/dbx-driver-agent/src/agent_service.rs:3661-3669 | crates/dbx-plugin-runtime/src/plugins/installer.rs:1250-1260 | crates/dbx-plugin-runtime/src/plugins/runtime.rs:1221-1231 | plugins/sdk/packager/src/main.rs:587-597 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"283691d3fc74ccb6fb4748d739c11dd38e7f2a5d16b56836a11b9075018ab982"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/dbx-driver-postgres/src/postgres.rs:6565-6576 | crates/dbx-drivers/src/db/clickhouse_driver.rs:752-761 | crates/dbx-sql-data/src/data_grid_sql.rs:5000-5009 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":6565}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c8d5d6d688b7a3cade16562cec9117a0416b75b3e8fb2aea08dc73a471d357"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-sql-data/src/query_result_sql.rs:1637-1650 | crates/dbx-sql-data/src/query_result_sql.rs:2432-2440 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13b08ac46185cb67e5ef2c9a7781f98c101e31223a2154303fb3ecf214e4163"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-web/src/routes/document_store.rs:430-437 | crates/dbx-web/src/routes/document_store.rs:639-645 | crates/dbx-web/src/routes/document_store.rs:650-656 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/document_store.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f6bd7e87f87effdd76c58e272050ea16e629563fc6992698ed424876d74ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-web/src/routes/document_store.rs:628-634 | crates/dbx-web/src/routes/document_store.rs:696-702 | crates/dbx-web/src/routes/document_store.rs:707-714 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/document_store.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"97de22afdbb4a30132cf2db440ad97a1e6d3a81bbf7f7ea0118a740798827c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5004-5012 | agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java:230-238 \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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5004}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfc2b9b9a2c72dcd7ebdd04c6d3be1556f839e11a16404c5e706a75004c3b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/GenericJdbcDdlBuilder.java:139-150 | plugins/jdbc/src/main/java/app/dbx/jdbc/GenericJdbcDdlBuilder.java:215-226 \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":"plugins/jdbc/src/main/java/app/dbx/jdbc/GenericJdbcDdlBuilder.java"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"886ae79401dff06e493516643fd6853bcddf6fe11db6ba12c14d38d60b194bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:4579-4584 | crates/dbx-core/src/admin/nacos/http.rs:4596-4600 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":4579}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcbd3b1d85d70c7407ed30c022d5dcdd80550fe25a09f3696297f0c90724533"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-core/src/data/table_import.rs:3291-3296 | crates/dbx-driver-agent/src/agent_service.rs:3671-3678 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3291}}}],"partialFingerprints":{"codehealthFindingId/v1":"959360aa77b61e0f7826f7d27d9aa9ad96bab36fd367e2785dffce41207a5bc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/dbx-core/src/data/transfer.rs:9626-9648 | crates/dbx-core/src/data/transfer.rs:10983-11026 | crates/dbx-core/src/schema/mod.rs:1562-1572 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":9626}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe64e9f36c63dea3b7fc782131f1cfd2e5c07e9fb581fde09f485c17d66cd35b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-formats/src/csv_export.rs:158-169 | crates/dbx-formats/src/csv_export.rs:240-250 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/csv_export.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad69aeef333ecba229a4539fc8f2694fdbae97cec206b845ee9477472e84565"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-sql-data/src/data_grid_salesforce_sql.rs:139-144 | crates/dbx-sql-data/src/data_grid_sql.rs:2703-2708 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_salesforce_sql.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc25009c27877083cdcf593bbb84d1ed62aa37aca68a06324d3f01683d3ad35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/dbx-web/src/routes/consul.rs:220-231 | crates/dbx-web/src/routes/etcd.rs:106-118 | crates/dbx-web/src/routes/zookeeper.rs:53-65 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"509da9a1695dbc5bd32cfd2344eaf5542857bde47a86025faacfead302b76da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-web/src/routes/mongodb_dump.rs:383-392 | crates/dbx-web/src/routes/mongodb_import_export.rs:520-529 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_dump.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89e549fd0207867df2d67c86dafd651cec05ac9f70ecef0d34918ed146f5fef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-web/src/routes/sql_file.rs:481-492 | src-tauri/src/commands/sql_file.rs:297-306 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/sql_file.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf445101250f78b1d270f3cebdf63a261480e7f57efd8325c661d3b48314491"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): agents/common/src/main/java/com/dbx/agent/QueryPageResult.java:145-150 | agents/common/src/main/java/com/dbx/agent/QueryResult.java:129-134 \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":"agents/common/src/main/java/com/dbx/agent/QueryPageResult.java"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6548774f4fbad81c3b616196c22f595338928ad642ae1ba25b957f9e4407c73e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/drivers/cassandra-go/runtime.go:206-214 | agents/drivers/vastbase-go/runtime_pool.go:44-52 \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":"agents/drivers/cassandra-go/runtime.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cad83f216143e3e5c1ad3409a72904a5713153c274f4233e16dbe588ed650e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:3381-3391 | agents/drivers/vastbase-go/vastbase_metadata.go:2247-2257 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3381}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa04725c492dac0526f3d017968d333d96dc2d318fb11fb92d01bac59be845f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): agents/drivers/kingbase-go/main.go:697-710 | agents/drivers/oracle-go/oci.go:116-129 | agents/drivers/vastbase-go/main.go:583-596 | agents/drivers/xugu/main.go:1384-1399 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d949f7243079794f83a5c53c152c14661750ace701aa1f25fb88f997bc5e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agents/drivers/oracle-go/pldebug_native.go:83-93 | agents/drivers/oracle-go/pldebug_target.go:152-164 \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":"agents/drivers/oracle-go/pldebug_native.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439a38ab38df7a1ab38da199612461f1a9695c5d01a304cfc914b0935e8467e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/dbx-core/src/schema/mod.rs:3408-3424 | crates/dbx-core/src/schema/mod.rs:14483-14498 | crates/dbx-core/src/schema/mod.rs:17612-17627 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"02af8da7c68a5dc53c7de4e41c1f00fedc1d87d9100d4757aa71597e77322b7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-driver-support/src/db.rs:381-387 | crates/dbx-drivers/src/db/dynamodb_driver.rs:341-347 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/db.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bc6435f1918eacc31d7c26861908d68a764143c54d85074c1afa2c4b53becc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java:241-254 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:1397-1407 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTypeMetadata.java:112-122 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebee166aae938526439334ead584330c9fa63a3ec3429446baa031420189f447"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:1381-1387 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2436-2442 \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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"970235c39a1d7aa15d04d79dc1058ef7e2265dd73a9d40337f5bdb0c5fb01ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-core/src/admin/consul/config.rs:192-199 | crates/dbx-drivers/src/db/influxdb_driver.rs:120-127 | crates/dbx-drivers/src/db/victoriametrics_driver.rs:108-116 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/config.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"687b0fa90a9b924aedc4cd6f4dc04d758668d18d20fd7fa5e43e11c904709364"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-plugin-runtime/src/plugins/assets.rs:24-37 | crates/dbx-plugin-runtime/src/plugins/assets.rs:39-49 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/assets.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f334354e2adeccea99d25bcdbc6adf64b5809aef77fa70eb709308e47f179bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-sql-dialect/src/sql_dialect/table_select.rs:44-48 | src-tauri/src/commands/mcp.rs:683-686 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c75de03a8c1fb9fc3d03f355776a6746278a033862bf56ce79cb6e64679c7b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agents/drivers/etcd-go/protocol_error.go:99-116 | agents/drivers/etcd2-go/protocol_error.go:91-108 \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":"agents/drivers/etcd-go/protocol_error.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab334f4c52d2d82d53da6e3009ed1af86748c806f4e4431fa45cf546ef2d581c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-core/src/schema/oracle_routines/plan.rs:146-156 | crates/dbx-core/src/schema/oracle_routines/readback.rs:186-196 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3057a53f9e21a8c1f87d9aa5316a8c87492e6edb281e7bd81a144d726c33fdd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): crates/dbx-sql-dialect/src/sql_dialect/capabilities.rs:173-180 | crates/dbx-sql-dialect/src/sql_dialect/identifiers.rs:251-258 | crates/dbx-sql-dialect/src/sql_dialect/identifiers.rs:486-493 | crates/dbx-sql-schema/src/table_structure_sql/util.rs:65-72 | crates/dbx-sql-schema/src/table_structure_sql/util.rs:118-124 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/capabilities.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b2e44528bd6a36f9635dd7b79c66c1963927ce5c5b814af451d7e609f4aecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-sql-schema/src/table_structure_sql/triggers.rs:294-300 | crates/dbx-sql-schema/src/table_structure_sql/util.rs:22-27 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1030d54518361dcf9f18942a0b811d90311788c498430cf6ee0f19757bb0f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src-tauri/src/window_geometry.rs:82-90 | src-tauri/src/window_state_guard.rs:81-90 \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":"src-tauri/src/window_geometry.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a5e8382634ef94e21d8afebade530fed04115869a7ca864fe7fd5af6a1a1ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java:1002-1007 | agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java:257-262 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:1145-1149 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccedad068558a139e53d038984aff7b3d2e4c850ae43a97413b1082c7cd81008"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/common/src/main/java/com/dbx/agent/NativeJobSession.java:24-30 | plugins/jdbc/src/main/java/app/dbx/jdbc/NativeJobSession.java:38-44 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/NativeJobSession.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f999a0039c465796cd686a2674bb6cbc4ef78816c11917dd05d71de2ce847d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/common/src/main/java/com/dbx/agent/NativeJobSession.java:79-87 | plugins/jdbc/src/main/java/app/dbx/jdbc/NativeJobSession.java:115-122 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/NativeJobSession.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e5815f40ad5a77dc87c6e393f5073e2d2b7b1c31b033f138323af8a19492cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agents/drivers/etcd-go/kv.go:559-570 | agents/drivers/etcd2-go/kv.go:462-472 \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":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cef492d68bacff675821f4c3de5d0e99eda843ceef02dab7b6e100f1ee30ab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/NativeJobSession.java:147-152 | plugins/jdbc/src/main/java/app/dbx/jdbc/NativeLegacyJobSession.java:88-93 \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":"plugins/jdbc/src/main/java/app/dbx/jdbc/NativeJobSession.java"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"071d3d3937ceb152758adc66279877423f99778904b7a9ebe1f835c1fdb1167d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-core/src/admin/consul/agent.rs:328-333 | crates/dbx-core/src/admin/consul/catalog.rs:146-151 | crates/dbx-core/src/admin/consul/status.rs:17-22 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/agent.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a09e5f441be37fadb978dd988c8beff8be7e29f484e013711a7acdfe260fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/dbx-core/src/admin/nacos/config.rs:362-372 | crates/dbx-drivers/src/db/victoriametrics_driver.rs:118-127 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/config.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52315db3e79eb2bed93da90d04e4ff739047ac1ce03b0fdb8c3c880d49e0f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/ai/agent_kv.rs:1312-1318 | crates/dbx-core/src/ai/agent_kv.rs:1320-1326 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe21c10cf695a12013785ee6cdeb54bc3911f87e50fb66cb8d3d6a1e065b906"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/dbx-core/src/data/database_export.rs:1487-1491 | crates/dbx-sql-data/src/data_grid_sql.rs:3456-3460 | crates/dbx-sql-data/src/data_grid_sql.rs:4643-4647 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1cdb09d7bfb80ae9b1cb3b2c177489e9cb865198a1c8ff816a6b0f396bea4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-core/src/schema/mod.rs:9413-9425 | crates/dbx-core/src/schema/normalization.rs:88-96 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":9413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6201ba177fed0d3197aa32ad88db389081ad7bae274420e5423dbda64a61c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/common/src/main/java/com/dbx/agent/DdlBuilder.java:461-470 | plugins/jdbc/src/main/java/app/dbx/jdbc/GenericJdbcDdlBuilder.java:114-121 \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":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"470806130400d74b55659da66605a6b43b7642cf25140097ef83a8d2e0041357"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/common/src/main/java/com/dbx/agent/DdlBuilder.java:512-521 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1386-1395 \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":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a0dba3c7fb5ccf734534580901279873dc7a2b6fd70dec2ebb44ffe40c2873"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/common/src/main/java/com/dbx/agent/DdlBuilder.java:523-532 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1401-1410 \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":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb932e75aeb689f19972af1741595001fbe18b1863b3173104fc4bf2725f9b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:12-19 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1138-1144 | agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:265-271 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b2d6441b1e60f8cfb177d7c3029eb40f4165b0f6dc15c7065ef619027ca0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:3558-3579 | agents/drivers/vastbase-go/vastbase_metadata.go:2367-2386 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b898aec58c120b4246dd2092618d9abf35a24b5ff757274e4466328c9149cc04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseLobValues.java:223-229 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4953-4961 \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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseLobValues.java"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d5c5710de918d5a111b0fe395dcb8e5998c2257564a566e5864819ecdaa5ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/oracle-go/main.go:910-923 | agents/drivers/xugu/main.go:836-845 \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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"add09301a5a9b89ac622a79a247beaae4dea5196faf10b13866cd9c0bccc69bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): plugins/jdbc/src/main/java/app/dbx/jdbc/NativeJobSession.java:64-69 | plugins/jdbc/src/main/java/app/dbx/jdbc/NativeLegacyJobSession.java:116-121 \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":"plugins/jdbc/src/main/java/app/dbx/jdbc/NativeJobSession.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8689684787de739231eecdc3049f13ed3faf803a9295450cd2253b08ae8225d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-cli/src/agent_skill.rs:309-315 | crates/dbx-formats/src/sql_file_zip_package.rs:127-137 | plugins/sdk/cli/src/lib.rs:1410-1418 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/agent_skill.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"45501f8cde49239445e8ccced6cc7d8a8d927e553cdf9a6a6e3cb72b41c33a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/drivers/argo-go/query.go:381-388 | agents/drivers/hive-go/query.go:384-391 \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":"agents/drivers/argo-go/query.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"610f4a8a2f7908eb3685c751255393f545886722a1e047df39e551690b6e9364"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/drivers/cassandra-go/runtime.go:196-204 | agents/drivers/vastbase-go/runtime_pool.go:54-62 \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":"agents/drivers/cassandra-go/runtime.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ae90ef05240c6042a2ad8d058453f0b5a2321b103cf9729dd18704db8c35c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/dbx-ai-provider/src/ai_cursor_cli.rs:321-325 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:545-549 | crates/dbx-drivers/src/db/ssh_tunnel.rs:332-338 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"df520c6fbd0b55cf2b72869d54985deb1a07c7c3c608b4a46be772ea19d6aafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-core/src/connection/mod.rs:8912-8915 | crates/dbx-driver-agent/src/agent_manager.rs:911-915 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8912}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c124fc1eb651af955f53f4d6483f34fc7185f212e82bd14daba78006b87d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-driver-agent/src/agent_manager.rs:94-104 | src-tauri/src/commands/update.rs:150-160 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_manager.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae038a30fd7adb2ca4d8632ac9da9738a578bc72f6e089e6320e4456b7892670"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-drivers/src/db/influxdb_driver.rs:37-49 | crates/dbx-drivers/src/db/clickhouse_driver.rs:26-29 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/influxdb_driver.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"591c3b3f86193196aae0c46d05008096dca84e22944c17c5827e4da405d92721"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java:300-303 | plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java:375-382 \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":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cb80383f64ce90beed222f01a9dd1cd9cad81e4ea90f410b0cdaea30062858"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/data/database_export.rs:1416-1422 | crates/dbx-sql-data/src/data_grid_sql.rs:3770-3776 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9dab4b09bd78d967020104ffb0c6ba4265f42269fa7d114dc8d4617c3b1350"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/data/transfer_rebuild.rs:725-734 | crates/dbx-core/src/safety/production_safety.rs:699-706 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_rebuild.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41e7e19875a84d3ced1056f5cf1b4ac45f8ee35b73404a9b38e87f8347cfec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/safety/production_safety.rs:970-976 | crates/dbx-sql-core/src/sql.rs:1255-1261 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5445a73cbf9ab56c5f8a4883a8822b11b7b4ab151787038255d799117c0cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/schema/oracle_type_details.rs:93-101 | crates/dbx-core/src/schema/oracle_type_management.rs:120-126 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_details.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"937ce8560b4ab1b218a6ae73caac4431236f86bd297b4354299c1e28807694bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-driver-agent/src/agent_driver.rs:1135-1140 | crates/dbx-plugin-runtime/src/plugins/runtime.rs:1204-1209 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c802b4af401b84110e614b1f9a406ea4f914cf57a3bae7bb5a3eaa64a3b2d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-sql-schema/src/table_structure_sql/dialect.rs:426-435 | crates/dbx-sql-schema/src/db_admin_sql.rs:1441-1446 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/dialect.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbd1a6eb29a3df176dbb68d5d583dea294861c827536b1522adf86fa1a184f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/drivers/neo4j-go/driver.go:327-334 | agents/drivers/xugu/main.go:1375-1382 \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":"agents/drivers/neo4j-go/driver.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca33c7028b7c6111c9759e48f55cbc80550676e4e47c47ca9b72cdacbc6aa4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-driver-agent/src/startup_cleanup.rs:91-101 | src-tauri/src/migration_gate.rs:21-31 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/startup_cleanup.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0678ccfac21bd42d2d64fa37bde0d9f0c98c8cc744ab64a286f1b2b39573a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:552-558 | agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:1257-1266 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:1125-1131 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4b572e172d8aa3c2a7510f92bbce61421eac96e5b5fdac2ccd0bb999de184f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java:212-223 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:414-425 \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":"agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4655674b81212cf95a7764cce68e5730473e8fc98c22c43d400182c6d2e540"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:3437-3451 | agents/drivers/vastbase-go/vastbase_metadata.go:2283-2294 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3437}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5c0f9601d8da85e8fd53ff45e6b855a2ca277a672ac7439f84e2a8b02563e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/drivers/oracle-go/pldebug_breakpoint.go:259-270 | agents/drivers/oracle-go/pldebug_value.go:37-44 \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":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d136f4ba4d8056f10f8cb1917443de62be7d1d1209d94aceb83b02f5d8987d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/dbx-ai-provider/src/ai.rs:5290-5293 | crates/dbx-core/src/connection/connection_secrets.rs:979-983 | crates/dbx-core/src/persistence/history.rs:126-129 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":5290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9e05a0a8b8e3871e4431aeb5e4cfaae3eab270ef66d4beac2db229bc2a2664"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-ai-provider/src/ai.rs:5315-5318 | crates/dbx-core/src/connection/connection_secrets.rs:84-87 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":5315}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4173206723815fd158023a2dd2592f2c5743a74d966bf087f9e7a93b60ef5d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/ai/plugin_tools.rs:1025-1032 | crates/dbx-core/src/ai/skill_tools.rs:421-428 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_tools.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d667ea836270d392a528d03e27a9a6e541ec9f6ec0f424bfbe8a73373608165"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/dbx-ai-provider/src/ai_cursor_cli.rs:327-334 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:551-558 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:438-445 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b3ca45e6b21ee6fd8fc6ca3cf214a08dfd015d174410669dd6e9eba2054937"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-core/src/data/sqlite_backup.rs:112-115 | crates/dbx-driver-agent/src/agent_service.rs:2794-2797 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sqlite_backup.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"af843670b9739215f6ca4d2ea078f56ecf5ee012755799589ca092e3fc85c2a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-driver-agent/src/agent_connection.rs:776-784 | crates/dbx-driver-sqlserver/src/sqlserver.rs:1800-1808 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_connection.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a7747cc5580922c22b8229d2286e367537f9609c2e546694551732913de69f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/dbx-sql-core/src/query_execution_sql.rs:862-876 | crates/dbx-sql-core/src/sql_risk.rs:826-841 | crates/dbx-sql-data/src/data_grid_sql.rs:4930-4946 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dc36f330d2064a7172b071da0d878230c561a09342eb5b357cd68c073bb9c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java:186-194 | agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java:795-803 \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":"agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e41e17c978e80e6d8c8e20125753499911bb973b8a0268289e010128b78d622"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-sql-data/src/data_grid_sql.rs:4661-4665 | crates/dbx-core/src/data/data_compare.rs:1641-1645 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":4661}}}],"partialFingerprints":{"codehealthFindingId/v1":"67734250f79bce9ae3ec1ab2d5101f3fb9a5242264c6056c7b79f6f8901b8ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-web/src/routes/ai.rs:372-377 | src-tauri/src/commands/ai.rs:338-343 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/ai.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3758c06a4ef6cfd1595b83ccdcaad47928156b827a418de2eae31f33a09cbd93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:707-716 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:185-194 \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":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e15e0f1fb9a145fc8b312572eb6a3e57866712e6b20d83a39db82e7ac3da4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/cassandra-go/main.go:554-563 | agents/drivers/vastbase-go/runtime_pool.go:175-184 \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":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8384df495616d029dd77a5546bba5412dbb1ad03ca8560cf82ad4ca0ae2a254"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/data/sql_file_import.rs:161-167 | crates/dbx-core/src/data/table_import.rs:1646-1652 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1cd6f28eae0cbe6b6ea4cf8470e867f12a6fccc1669fc93ef3b5af419faddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-mcp/src/server.rs:7336-7338 | src-tauri/src/webview2_preflight.rs:1158-1160 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":7336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dda6f30322bc67d44b76f65d051f026d4175e17557449abb09878659167b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/dbx-sql-core/src/object_source_sql.rs:1394-1408 | crates/dbx-sql-schema/src/db_admin_sql.rs:1237-1251 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0fc3edcd3d490eb4033822909215dc9bb7d41fea0ed652205dc056dc0b18c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/drivers/cassandra-go/main.go:540-548 | agents/drivers/iotdb/main.go:504-512 \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":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"983925f3d6f0507dcdbf2e47b2b8bc874ac2735cb370dea06815a36d9ac042a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): agents/drivers/iotdb/metadata.go:566-577 | agents/drivers/oracle-go/main.go:2429-2440 | agents/drivers/xugu/package_members.go:124-135 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/metadata.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2407cfd1f807bbf0c8cf09c2df9e18685849bf5c206cebf860350d2a1fd263"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:36-41 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:42-48 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:34-39 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c711e9573fe9f960c6ee667f86801379b70cc461860b9561932276c21d954b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-core/src/admin/mq/adapters/pulsar.rs:938-944 | crates/dbx-driver-mongodb/src/mongo_shell.rs:321-325 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/pulsar.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"af481372efa20d4dc95123c915d8aad96a42299cdc054182a1bd6abd149ef737"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:1771-1776 | crates/dbx-drivers/src/db/influxdb3_driver.rs:120-125 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aafa02d5fbf5c2699f4a4d5d2e6e3814d876969766402461554a423e2184bfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-core/src/ai/skill_tools.rs:172-181 | crates/dbx-types/src/models/connection.rs:1069-1071 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/skill_tools.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdafaa4b67f169277f59d4f2ff1b8ea2e416001931eacc5c198396553c42b1ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-web/src/routes/layout.rs:24-27 | crates/dbx-web/src/routes/schema_cache.rs:38-41 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/layout.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e390b998ac2482b726853d8209d72fd941f632a07df4759f9612f906dafd052"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/common/src/main/java/com/dbx/agent/QueryPageResult.java:212-225 | agents/common/src/main/java/com/dbx/agent/QueryResult.java:242-253 \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":"agents/common/src/main/java/com/dbx/agent/QueryPageResult.java"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9f6209d660a1e31497233b64cfd99d2f8e39b653541e687c8d36b96f601ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/drivers/cassandra-go/metadata.go:612-620 | agents/drivers/etcd-go/maintenance.go:158-166 \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":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b989419dcce5a262aab7a991ce5f67472c14bff157323b48a0244ff363568d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dbx-core/src/persistence/storage.rs:3966-3972 | crates/dbx-core/src/query/plugin_data.rs:182-188 | crates/dbx-core/src/query/plugin_plan.rs:545-551 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b97aa5d2eeadde4c8afb5511a3a6e0d5dce2adf130a57e7bce03cc1883478ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/dbx-driver-mysql/src/manticoresearch.rs:37-40 | crates/dbx-driver-mysql/src/mysql.rs:685-689 | crates/dbx-driver-mysql/src/ob_oracle.rs:39-42 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/manticoresearch.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2002c2d4c38eb7a4d08c607f6835dd7b88bf48276144a0195e565da9952dda4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/dbx-web/src/routes/consul.rs:334-338 | crates/dbx-web/src/routes/nacos.rs:346-351 | crates/dbx-web/src/routes/zookeeper.rs:70-74 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"75503e3dd66f2567cd7718c7a1ff7ec5a2ab697e2994907072f542f803640f10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-web/src/routes/plugins.rs:658-663 | src-tauri/src/commands/plugins.rs:542-547 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/plugins.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c6b1134bbf66aff7a9f11010d4293d048368cb771bac3d3322b70b1803ce0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/etcd-go/main.go:343-349 | agents/drivers/etcd2-go/main.go:310-316 \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":"agents/drivers/etcd-go/main.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4a85f7cce4364cf84bd18c17617da406a12d8f7969d4668d0623da6da38593"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:3193-3207 | agents/drivers/kingbase-go/main.go:1205-1214 | agents/drivers/kingbase-go/routine_metadata.go:27-36 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"003f5cf582aa79af26b7fe248a09352e64e5763e3faa35f9a79c958916e0a2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): agents/drivers/tdengine/src/driver.rs:992-996 | crates/dbx-sql-dialect/src/sql_dialect/type_rewrite.rs:29-31 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/tdengine/src/driver.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e17423db9ecb39b4e05137947a05aa53182c0d289e8c9334213299e3e695f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-ai-provider/src/ai.rs:5310-5313 | crates/dbx-core/src/persistence/history.rs:147-150 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":5310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a227a77c40bc1d7191bc27871c12a2d6f0ec286bbcc7f2462f3a35864417997"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/admin/consul/kv.rs:374-381 | crates/dbx-types/src/models/connection.rs:3125-3131 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/kv.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a62721e773be62d0a279950e6cb4d545a6877e5ec23ece9c2fcb2ff4a5913d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-core/src/admin/nacos/access_control.rs:80-83 | crates/dbx-core/src/admin/nacos/search.rs:19-22 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"af43baaf5f70ea3fc7df5b72deb259141bb7c234e7a1ece5a2cc8a99ee945487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/schema/oracle_type_details.rs:127-133 | crates/dbx-core/src/schema/oracle_type_management.rs:136-142 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_details.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7312cf9cceb91fd052e37bbced270f52c07944a734bf19760529caadc0f7be63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src-tauri/src/commands/document_cmd.rs:245-256 | src-tauri/src/commands/redis_cmd.rs:404-417 \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":"src-tauri/src/commands/document_cmd.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f5f5bea3cfdb9580da5bc56ff3c44ae55bbb913713c66c65b08fd1d3cf7c9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:849-855 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:468-474 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fb933614fab5de2c08411699e766c67dce17aff817c3fbd18516efd70b28f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-driver-agent/src/agent_driver.rs:4339-4352 | crates/dbx-plugin-runtime/src/plugins/runtime.rs:213-224 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":4339}}}],"partialFingerprints":{"codehealthFindingId/v1":"404d120ea479cc876e8d1cc2545f72c4975d118918ef1533d2ccc5f8c2c039bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-plugin-runtime/src/plugins/installer.rs:768-772 | src-tauri/src/commands/mcp_cleanup.rs:21-25 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"5673dbeebc575884af05205979c45e207d713516413ea885218591ee6b8d3f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-sql-schema/src/schema_diff.rs:4755-4763 | crates/dbx-sql-schema/src/table_structure_sql/indexes.rs:378-386 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":4755}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a9528cfbb81b58cbc1ee36761154d4002a4dd69cb68c7b12542387fe249ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/drivers/kingbase-go/kingbase_metadata.go:3163-3174 | agents/drivers/vastbase-go/vastbase_metadata.go:2074-2087 \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c840e5538e66bd43296ebace65ee98bc7e405d9c52a7ed826bd53ffefaf8216b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): agents/drivers/duckdb/src/wire.rs:177-181 | crates/dbx-drivers/src/db/duckdb_worker_protocol.rs:22-26 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/wire.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa56678985d13567de9ba227bf78e84b7b7a3e1edea32c446df55651df5f05f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs:409-412 | crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs:528-530 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1f99519678e634af809a71eb1d7abbbcf678b8cbbe5835cd42a77e289b13bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-tauri-consul/src/commands.rs:238-241 | src-tauri/src/commands/zookeeper_cmd.rs:44-47 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-tauri-consul/src/commands.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7762fbdf4542ebf98be6da2dd658fea855212dad5211f2fe9ad68290eac97c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-web/src/routes/agents.rs:217-222 | crates/dbx-web/src/routes/cloud_sync.rs:217-222 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/agents.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd37706e82d5f234325ef9a6c548106c5c7854e20047bfd873f3b82b53644c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-web/src/routes/connection.rs:497-500 | crates/dbx-web/src/routes/plugins.rs:426-429 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49d1f9a27cc8ab950cd65797ec4a356aa77f2704dc9a4d982bc550df011d2bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): .github/scripts/ci-gradle.py:27-33 | .github/scripts/ci-install-system-deps.py:111-118 \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":".github/scripts/ci-gradle.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ae4176844389b9be61ea4f97d203f11a4b3bc26a5aa4111d09921e7cabf8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/common/src/main/java/com/dbx/agent/DdlBuilder.java:411-417 | plugins/jdbc/src/main/java/app/dbx/jdbc/GenericJdbcDdlBuilder.java:207-213 \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":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fae065f5ac4db6c9675be7216015df2ab4c24ae1c06b26e90a2b3932096c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-core/src/admin/consul/acl.rs:429-432 | crates/dbx-core/src/admin/consul/enterprise.rs:317-320 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/acl.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef22b44a6f77ac814388fd2e4a6f2d2a5912001ee23381ea572470c2e8e8c0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/dbx-core/src/admin/consul/client.rs:265-272 | crates/dbx-core/src/admin/consul/mod.rs:67-74 | crates/dbx-core/src/data/mongodb_dump/stream.rs:159-164 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/client.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a480f1f3c9feda81de57d00a7302541519962cafb8ce5eb312df4b4aeb0a77e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/dbx-core/src/admin/mq/adapters/kafka.rs:657-659 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:991-993 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:993-995 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f7d9537b9e19cc9e27719a0226f542469a36a0e26e93b76f8884d838fe55ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-core/src/connection/mod.rs:1768-1771 | crates/dbx-core/src/query/query_cancel.rs:450-453 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1912e05dd02c26b7e6d030c0e9da7862c0390e5106e6bc1a0e1df073ee60639"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-driver-mysql/src/mysql.rs:7466-7470 | crates/dbx-driver-sqlserver/src/sqlserver.rs:4022-4026 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf9c76045e756d92459d4e4edc1bc2be3cc3732f209d6043e89afc6e8ac8ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-drivers/src/db/sqlite_worker.rs:976-981 | crates/dbx-mcp/src/runtime.rs:173-178 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite_worker.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d940ff60380c9930f94c27879d9a682b9372e97425803ae6617aef4f66745d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-web/src/routes/ai.rs:395-400 | crates/dbx-web/src/routes/query.rs:1205-1215 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/ai.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d217fe3a29612942527de1f78b8a69c25e8d2a865eebf730769d9b444e02360d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/drivers/oracle-go/main.go:2442-2450 | agents/drivers/xugu/type_members.go:674-682 \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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81895928c48628b9079e5a58483005c9e868b122fc327963d3af637f92827b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-ai-provider/src/ai.rs:912-919 | crates/dbx-sql-schema/src/db_admin_sql.rs:1361-1368 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca61095ce00307b6106de340dd96251969e9f0cfa7d226f730f01a5820a516fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:818-824 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:436-442 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7513c18eccffbc3ac1bca1ae075dbcd018b5740e694132cdff439af4c19692c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-ai-provider/src/ai_cursor_cli.rs:140-142 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:211-213 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4726600986ac0a9f45321e25d314bcbfe1262ed0087e5bf6b8e1c228b74901e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-core/src/schema/mod.rs:11966-11969 | crates/dbx-core/src/schema/providers/native.rs:358-361 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":11966}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e6445fd54f8cb805a43f120fef80955ca94192e410e8f1609af1e8bfc2c627"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-core/src/skills/mod.rs:175-177 | src-tauri/src/commands/ssh_keys.rs:36-38 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/skills/mod.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3f2b11b9a7fe47fa447c0e314dbf1f114d0a2956d2ec2bdeb1689d9ae6cff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-drivers/src/db/sqlite.rs:2114-2117 | crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:616-619 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f77bf7dbd1be950098ad89c8a2876b76eb7d673ee5b9d63536e6d486dde3042"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-drivers/src/db/sqlite.rs:3023-3026 | crates/dbx-sqlite-worker/src/runtime.rs:246-249 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad05c67a76ee20d70c5082847daa3baab2dceedaf95c757e1e7b5d5fbf166d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): src-tauri/src/commands/external_db.rs:56-61 | src-tauri/src/commands/external_sql.rs:183-185 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/external_db.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"76407c16ae68b2499736935794de27816a93bca2751b70133ee64e0f5f40cbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java:287-289 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTypeGraph.java:19-22 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc014646eeac5fc9e81eac170267f6d138702cbbe16f5a283901b7709be95802"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:227-230 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:208-211 \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":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee3ef6cc65e82180ecd2af451aec9744d2b96494b483ef0cd825c8f5b2963de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agents/drivers/etcd-go/client.go:220-232 | agents/drivers/etcd2-go/client.go:162-174 \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":"agents/drivers/etcd-go/client.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57c21239b3320d19df8ab119b507f569f09910afd83724250a110b25060da10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/drivers/etcd-go/watch.go:79-87 | agents/drivers/etcd2-go/watch.go:82-89 \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":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc03fa698ac8560b2a48842ef2134c7bccbb76ffbf48a7ca12afe7b1633e53c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-core/src/schema/native_jobs/details.rs:19-21 | crates/dbx-core/src/schema/oracle_type_details.rs:115-117 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/details.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2430bc945b35c50d32a621e31fef292d8959b678139626968852269a14ce6bd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs:134-140 | crates/dbx-sql-core/src/oracle_view_rename.rs:223-225 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c8c0bdd366bcb319f7b81a0123dbde5e09f5a8739649e4e965bbb9c749d512"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/dbx-web/src/routes/query.rs:1158-1162 | crates/dbx-web/src/routes/schema.rs:597-601 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d364bb910d5b88d2aa91ca00e701a56a654e2db24660613f5687a451d63cc9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:1077-1084 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6521-6528 \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":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddb235250a9be5e6a4d644b8b45d4406b7116987d03147d397d85c6d8b85392"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): agents/drivers/argo-go/metadata.go:172-174 | agents/drivers/hive-go/metadata.go:172-174 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c83ed960efd16f257e44abe2c734985768c5c1258c00b6a7ea7b6a58c5fb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 3\u002B corresponding lines): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:201-203 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:645-647 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1379-1384 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:479-481 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:628-630 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:515-517 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:329-331 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:285-287 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f132785f4a52683cf760017c35149928d02167a134a572d93c90c07f2968eb9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/cassandra-go/query.go:318-324 | agents/drivers/vastbase-go/spatial.go:292-298 \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":"agents/drivers/cassandra-go/query.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3acf8e6bbf135bc0853d14f8dc4b617c6c5150431bd17d561b9c1b8ec084fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/tdengine/src/driver.rs:1044-1050 | crates/dbx-driver-mysql/src/mysql.rs:645-651 \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":"agents/drivers/tdengine/src/driver.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"767a52f41fe25d498770ed6e5d4d34dd1f77b10abea6620524b61e1734172a53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-ai-provider/src/ai_effort.rs:433-436 | crates/dbx-core/src/persistence/cloud_sync.rs:672-674 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_effort.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65bf847e9b678990960781d96903f07930e2802ba08178b7f19dd5f6d24c2cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-cli/src/main.rs:744-749 | crates/dbx-core/src/persistence/storage.rs:4691-4693 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/main.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d0a28b9f18d8c03b9a39365003f3e41d717feb3564a65fcd487a04b70ce75f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/admin/nacos/access_control.rs:1112-1119 | crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:531-538 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf40e9ef87520816be1f0d87a22cf3c9a29557864b1fb40970ad0de8f2fc6c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/data/query_result_export.rs:758-764 | crates/dbx-driver-support/src/execution.rs:308-314 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad35b184554e836641f8e0b554fe1a3a5c82d6db29054855b1dbb1bf6f72930"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-driver-mongodb/src/mongo_oidc.rs:80-83 | crates/dbx-drivers/src/salesforce_oauth.rs:171-174 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccade7b5feb2d6ed2d57cbce5a0b50186d8a72e49fd7994dd3ed5410d2d67ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-driver-sqlserver/src/sqlserver.rs:2542-2544 | crates/dbx-sql-schema/src/table_structure_sql/comments.rs:64-66 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2542}}}],"partialFingerprints":{"codehealthFindingId/v1":"1473109a9bad3080368407e9e30f4551aab92bbf5c7fadff845069acce1de4f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/data/database_export.rs:1248-1254 | crates/dbx-core/src/data/transfer.rs:4470-4479 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a4c1e192ea35d056f406801bbaba591b3b6147fbe36ef83e2acf9fc8e9f7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/dbx-core/src/query/document_ops.rs:714-717 | crates/dbx-core/src/query/mongo_ops.rs:580-583 | crates/dbx-core/src/schema/mod.rs:8534-8537 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa15f920d9d9fa1acaaf04448a3a49a88d82a45fc9365797443c61b766435ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-core/src/query/pl_debug/inspection.rs:180-185 | crates/dbx-driver-agent/src/agent_driver.rs:2025-2030 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/inspection.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9d575da5e76c7f9adffbf46a6482fff490e4af2b2976d14e4bc59ec1b4bfeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src-tauri/src/commands/document_cmd.rs:544-554 | src-tauri/src/commands/redis_cmd.rs:171-182 \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":"src-tauri/src/commands/document_cmd.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"633b29cc3503ce2c0cf3cd578c0daf40daff3b6474bd8bb75edd13ac7c3a555b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2418-2423 | agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:54-59 \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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbd9c56b24e9f837d3c8e834559c9fad844856ce2deea9a3a8c86a78dc9bcd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompile.java:65-71 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java:499-505 \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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompile.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d688fc18c36ae18c95fcdb3910f88ad5d8c60d03fa210120b544c202b37e1de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): agents/drivers/oracle-go/main.go:1084-1090 | agents/drivers/xugu/main.go:752-754 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"295e61a9c036cc27c9bd5a2b717828aad3ce5d530596d15646a837121ffa1597"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-core/src/admin/consul/catalog.rs:225-231 | crates/dbx-core/src/persistence/storage.rs:196-202 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/catalog.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ee14d4bc1868d03951d48adf6fbd4d8e7ac964b4f1fc569cc37fb7a218fd92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-core/src/admin/consul/kv.rs:534-536 | crates/dbx-core/src/admin/consul/txn.rs:407-409 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/kv.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"defb906b3079e819048491d449191fd83621c86f83699ac1db6938090a217a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/dbx-core/src/admin/nacos/http.rs:3814-3821 | src-tauri/src/commands/update.rs:491-498 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":3814}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ed0b3666db5eab95995c0b62904b29666fd9350adeb625fc82c6e37897a7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-driver-mysql/src/ob_oracle.rs:63-65 | crates/dbx-driver-sqlserver/src/sqlserver.rs:4125-4129 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/ob_oracle.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2749d0f91d382fc6978c815011153eadf65caae8438712913e5016f4ee66acdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-plugin-runtime/src/plugins/installer.rs:1290-1292 | plugins/sdk/packager/src/main.rs:654-656 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8763fd66058a1d682e4a476b0b729384f5a59d90c77363e7d4489bfeb9c07eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:319-321 | crates/dbx-sql-schema/src/table_structure_sql/columns.rs:683-685 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7568c1854bfcb68d77dacebb93d97022007951d45f6b065fb9fd2a4497ace0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-web/src/routes/ai.rs:141-145 | crates/dbx-web/src/routes/cloud_sync.rs:203-206 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/ai.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2aa6e4b4f232c49183aad46f51a318850f476eb131328328f7571dce660e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-web/src/routes/ai.rs:235-239 | crates/dbx-web/src/routes/cloud_sync.rs:348-351 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/ai.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ed646c84fde5057fb89694d8cbbc7452424c39b200392e5109ad94cba02d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-web/src/routes/consul.rs:654-656 | crates/dbx-web/src/routes/etcd.rs:79-81 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6d9d0d7beaf8118e35458e6468db819f76ca41536a83e06ef1b2e7809c538e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): agents/drivers/argo-go/config.go:1132-1135 | agents/drivers/hive-go/config.go:1172-1175 \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":"agents/drivers/argo-go/config.go"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"38259baec8cd79db24562d4b9a3d1068ca849dee574b94117309b89edb840e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): agents/drivers/argo-go/metadata.go:568-571 | agents/drivers/hive-go/metadata.go:579-582 \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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc87a1918622960ae23b232eec46a0ece7e524b233b100f26c83ff18a9da90e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3203-3206 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:699-702 \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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5a92828fa6b8a9035091256d2349e2eafcaf45b5ee86d9697e94ddb39698e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/etcd2-go/kv.go:130-136 | agents/drivers/oracle-go/pldebug_results.go:55-61 \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":"agents/drivers/etcd2-go/kv.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a422a85adf03bf919bb5a4b42f311514e0818453ed144e795fb39646a285d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:1373-1379 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6680-6686 \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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb1b94cfa8cc64d42ef5d07accc0c47b84df96457832bae5712623fd5bbb975"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-core/src/ai/plugin_mcp.rs:304-307 | crates/dbx-mcp/src/backend.rs:824-827 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_mcp.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77d1278246a732c64b16696db2ee06706c33c00981d3324ca0a6343254bbe5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/dbx-core/src/connection/connection_secrets.rs:656-661 | crates/dbx-core/src/persistence/storage.rs:3673-3681 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c08f953b1b564dd5f2983d78e615a39d04c47369a3669ae6345b637dd3c282"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/dbx-core/src/data/docs/export.rs:46-48 | crates/dbx-sql-data/src/data_grid_extractors/document.rs:142-144 | plugins/sdk/cli/src/lib.rs:1515-1517 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/docs/export.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"63256e08c0a8d13302058976c102147f66d8a089ccea2ea7bb2eb95907b88931"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/dbx-core/src/data/sql_file_import/table_restore.rs:217-219 | crates/dbx-sql-core/src/object_source_sql.rs:1074-1076 | crates/dbx-sql-core/src/sql_analysis.rs:886-888 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import/table_restore.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"75aa4d60dd409cd294d1c956af0ed8c8d1fae3e8f16014cfd458a7712af1fcba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/dbx-core/src/data/transfer/xugu_objects.rs:44-46 | crates/dbx-sql-core/src/oracle_view_rename.rs:236-238 | crates/dbx-sql-schema/src/schema_diff/mysql_charset.rs:82-84 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"148c360dfe1a98827658013d01d78d45755d8a1650c05086ad3e878321b6f225"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-core/src/persistence/storage.rs:4695-4698 | crates/dbx-web/src/routes/ai.rs:129-132 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4695}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1c481d6ec69241e535edc03b182ee4ed3f476335af7236ef0a9b8b6f925d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-core/src/query/plugin_data.rs:220-222 | crates/dbx-core/src/query/plugin_plan.rs:526-528 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/plugin_data.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7db67a2464dce430d5d57b0424eac58774884f0ebfc804f4b0b6c908aae8d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-formats/src/sql_file_zip_package.rs:33-38 | src-tauri/src/commands/background_image.rs:35-37 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/sql_file_zip_package.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1325cc8bc7eeaa621f6d81c403d5ca62c47b528744672615098cff3c07992c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/dbx-web/src/routes/ai.rs:269-272 | crates/dbx-web/src/routes/history.rs:76-79 | crates/dbx-web/src/routes/saved_sql.rs:34-37 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/ai.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f30f0fb13191e4c2503ee8662fd8f680257bf4f2c3a96ed3f3d04dc452cf03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): src-tauri/src/commands/external_db.rs:21-23 | src-tauri/src/commands/external_sql.rs:156-158 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/external_db.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76672d1ad5221d2cc7c73264f667c248e6fa584350aa8dd7f4be13bbe94df30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agents/common/src/main/java/com/dbx/agent/ObjectInfo.java:27-33 | agents/common/src/main/java/com/dbx/agent/ObjectSource.java:26-32 \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":"agents/common/src/main/java/com/dbx/agent/ObjectInfo.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00c70a798236d6cb8470d2f7c06cf98ea4fcb98f0bc6de1f04efe9ba590b060"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:69-69 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTypeGraph.java:23-25 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6495df4e9eec3a3d9a21c0bd027c7bf84f40975b0bd839ad530edf67914d593"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dbx-core/src/admin/mq/config.rs:191-199 | crates/dbx-core/src/persistence/task_history.rs:885-893 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/config.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff52633280c8cfd3fca62b96ac9df97e9014c49eb5e715bfc6e226a69de68294"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-core/src/schema/mod.rs:12100-12102 | crates/dbx-core/src/schema/providers/native.rs:390-392 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c96f976c35af8bb43a6793c5c19e535dee2131b7b77d0c9440e720fd139f7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/dbx-driver-mysql/src/doris.rs:22-26 | crates/dbx-driver-mysql/src/manticoresearch.rs:13-17 | crates/dbx-driver-mysql/src/starrocks.rs:48-52 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/doris.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87e03b119c364685862f9e0a59715b89f02bd9bbde06b793256cea6650298fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/dbx-driver-sqlserver/src/sqlserver.rs:3642-3653 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:1101-1113 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":3642}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d383082cce7cf0c00a97a5f818ad1230a15caac2d434ff6a91f3f0bb9d82d03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java:86-96 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:67-77 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2959-2968 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bf8046d94ab001a43fe8dbea70f2ac918d982d2780a7424b7277c144f54e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java:953-956 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:149-152 \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":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ca261c5e433a47faa991291469552b60ac0e3acac6fa7d662f03861b9fc2f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/dbx-core/src/ai/agent_kv.rs:1688-1690 | crates/dbx-core/src/persistence/storage.rs:3427-3429 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"8404c4e4a81671ded2669dd4e5965cbf15d2977ac52ae74deaffa69a015afc2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:170-172 | crates/dbx-drivers/src/db/rqlite_driver.rs:96-98 | crates/dbx-drivers/src/db/turso_driver.rs:157-159 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc3fb58ee0bb1d392abd1f51cca0ceda693fded545bb765ff8f09a480441b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs:182-188 | crates/dbx-sql-core/src/oracle_type_migration_sql.rs:53-59 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ecc54e02a946995a46f9e4248fe8fc4ca8dd9578bec1933bb8704c43598cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/dbx-tauri-schema/src/commands.rs:201-213 | src-tauri/src/commands/query.rs:643-653 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-tauri-schema/src/commands.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"237d1a94dfd3507a6bbfd578805be0bf03e46b5f736b4c3ad2320bcbabdc7e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/dbx-web/src/routes/connection.rs:812-815 | crates/dbx-web/src/routes/layout.rs:52-55 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c5aae1d870fd2e1bc3074357fdc2547d23fe0c10d27c86d479a983f6a4a498"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src-tauri/src/commands/document_cmd.rs:503-512 | src-tauri/src/commands/query.rs:683-687 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/document_cmd.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9c64149c04152eb7db7335585a756bd5ab37c2ea60865c189440d789352016"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/dbx-core/src/data/transfer.rs:7270-7286 | crates/dbx-core/src/query/document_ops.rs:457-474 | crates/dbx-sql-schema/src/schema_diff.rs:6386-6403 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"490baa7645d12b374075ab365d437113ea763524e7c19375376a9771a0d7caab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (82 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:6160-6241 | crates/dbx-driver-mysql/src/mysql.rs:6570-6651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:6160\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8337f0d660918849387285f02ffd2037f61a44b2fab6dd3dbfe324e1f85d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63 lines \u00D7 2): crates/dbx-drivers/src/db/couchdb_driver.rs:534-596 | crates/dbx-drivers/src/db/solr_driver.rs:911-973 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/couchdb_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/solr_driver.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c093783a7c89e85befa4c2f43f10283d1eb6d5baf43e00be24c2df770cfa7df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 5): crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:820-867 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:900-947 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:1070-1117 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:1244-1291 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:1391-1438 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:820\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c6c71f74d8a3bcedc33d79e2d412ebbc1d4be8646ac495e87ae6f5f32e3c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:440-488 | crates/dbx-web/src/routes/mcp_policy.rs:122-170 | src-tauri/src/commands/mcp_bridge.rs:1630-1678 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"90de2105ec256238fbed3e9e4eec4490ed8d388238bc138789c1b0214ee6232a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201345 lines \u00D7 6): crates/dbx-core/src/data/table_export.rs:1946-1990 | crates/dbx-core/src/data/table_export.rs:2050-2093 | crates/dbx-core/src/data/table_export.rs:2166-2210 | crates/dbx-core/src/data/table_export.rs:2266-2309 | crates/dbx-core/src/data/table_export.rs:2354-2397 | crates/dbx-core/src/data/table_export.rs:2442-2485 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_export.rs:1946\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ca1014a3c0ef8ad656c16bb82e7fff637504ea9a08a6fbc8d39890c1e5f22a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64\u201366 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:2-65 | crates/dbx-drivers/src/db/duckdb_sql.rs:12-77 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-drivers/src/db/duckdb_sql.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 169 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"634d11b555a51f8bb19ca9704cf90a701b7b4bb6e48e8957a2b3b4d968d29da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): crates/dbx-drivers/src/db/rqlite_driver.rs:220-262 | crates/dbx-drivers/src/db/turso_driver.rs:281-323 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/turso_driver.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 255 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/rqlite_driver.rs:220\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060client\u0060 to \u0060\u0026RqliteClient\u0060 in one and \u0060\u0026TursoClient\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/rqlite_driver.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"375c14e9d20bc82677218ce3030c94207d69710a9d9d10011c9d54e0b8afed08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201341 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:1406-1446 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1644-1682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:1406\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bef013ab2e4d71fdb21707ba3258abd65ba73e80086822f9a9be8390f61796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:6943-6980 | crates/dbx-driver-mysql/src/mysql.rs:6997-7034 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:6943\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-driver-mysql/src/mysql.rs:6942\u0060 calls \u0060columns_ref\u0060, \u0060iter\u0060, \u0060name_str\u0060 and \u0060crates/dbx-driver-mysql/src/mysql.rs:6996\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6943}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ad31ca52e534b1f6ec89a082b6a10f9f47ce4e217476efae5a2d6a4adc6dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201337 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:6992-7028 | crates/dbx-core/src/data/transfer.rs:7194-7223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:6992\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6992}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef179b9fbc0b67a7f851b0c1ee49c54bf0481e8eb21388f4ae4032218e39a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:3867-3918 | src-tauri/src/commands/connection.rs:2538-2589 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3867\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3867}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ca4ca48f40361cdfabbee03a8bddf7212e571756a9ce92032b14d25baf31de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201336 lines \u00D7 2): src-tauri/src/commands/connection.rs:2056-2091 | src-tauri/src/commands/connection.rs:2633-2666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/connection.rs:2056\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":"src-tauri/src/commands/connection.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbc32193329c163b8f9159f4d08b4514fc8177890f90ba343cf1fdd5ceb2657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 4): crates/dbx-core/src/data/query_result_export.rs:1758-1789 | crates/dbx-core/src/data/query_result_export.rs:2023-2054 | crates/dbx-core/src/data/query_result_export.rs:2260-2291 | crates/dbx-core/src/data/query_result_export.rs:2460-2491 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1758\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"457fe95f72a8b552f677752b619c0661a889d49d5d91165c41340110d5a90922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:3731-3765 | crates/dbx-core/src/data/table_import.rs:4475-4509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:3731\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83200a1cdee9476be8d883857948e670af2ef90596a22359939c71919b65eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): crates/dbx-mcp/src/server.rs:4548-4577 | crates/dbx-mcp/src/server.rs:4675-4706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:4548\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4548}}}],"partialFingerprints":{"codehealthFindingId/v1":"138854b72f179809935622859a052aa9d69d0206ce3b1aac7f75becaa94f7583"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_extractors/sql.rs:104-135 | crates/dbx-sql-data/src/data_grid_extractors/sql.rs:394-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_extractors/sql.rs:104\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c3db14ce29cff15fab70d4b3e4cece264912d446c7690a1376cb7b29b54a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/dbx-web/src/routes/redis_pubsub_ws.rs:122-152 | src-tauri/src/commands/redis_pubsub_server.rs:153-183 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/redis_pubsub_ws.rs\u0060 and \u0060src-tauri/src/commands/redis_pubsub_server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 120 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/redis_pubsub_ws.rs:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis_pubsub_ws.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7407e31204f1adb29f62ea5095ff0544a5a27fc7f54554f93d9da4378b51c89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 3): crates/dbx-core/src/data/table_import.rs:8182-8210 | crates/dbx-core/src/data/table_import.rs:8681-8709 | crates/dbx-core/src/data/table_import.rs:9088-9117 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:8182\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/data/table_import.rs:8712\u0060 calls \u0060store\u0060 and \u0060crates/dbx-core/src/data/table_import.rs:8213\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":8182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2149fb72e4bca14d7bc9b89a8c59da1b5e93b61d21335bff2138f1d51b777f22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): crates/dbx-web/src/routes/redis_pubsub_ws.rs:79-117 | src-tauri/src/commands/redis_pubsub_server.rs:110-148 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/redis_pubsub_ws.rs\u0060 and \u0060src-tauri/src/commands/redis_pubsub_server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 120 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/redis_pubsub_ws.rs:79\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis_pubsub_ws.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55d1afd52e40f88aa71154b98b77db85a7b8fdebffbcc1c76f5c34c5453cac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:3946-3974 | crates/dbx-ai-provider/src/ai.rs:4188-4216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3946\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3946}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8b771340636efe104f613af4270d72b8e81af38f565805435623a35f424839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:6826-6852 | crates/dbx-core/src/persistence/storage.rs:6893-6921 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:6826\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6826}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82e0041c2a1cadb1181585c3a50417f3848d51ae53a97ee98604ac311d63ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/dbx-core/src/admin/nacos/search.rs:250-277 | crates/dbx-core/src/admin/nacos/search.rs:331-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/search.rs:250\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/search.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f6db0a46beb2262d75841e791513a1545ce9a2442b2b83b9bb74d36f6ec5e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:3918-3944 | crates/dbx-ai-provider/src/ai.rs:4527-4553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3918\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a286fa46ed358cdbeb5c2667ebff5dbd78c9e0d950bbd5bced5200a523f861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:490-516 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:727-753 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"8801202a7ea41d2e0c809694aac0e3c7373a3e80c7c7dab85e891111b4fe079d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:13239-13265 | crates/dbx-core/src/data/transfer/structure_plan.rs:571-597 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:13239\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":13239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed6de1d12701571d4a9719bbda591570b90b72dc4556d9826c42337bb8420e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:676-701 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:731-756 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:791-816 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b24da7d52f31b034c2f67f44882035f1aa1a55fbdcd5a7aac5ac69927b75d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_oidc.rs:236-280 | crates/dbx-drivers/src/salesforce_oauth.rs:313-357 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_oidc.rs\u0060 and \u0060crates/dbx-drivers/src/salesforce_oauth.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_oidc.rs:236\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a50df1069e047d3dbd91bff60ba78db333b813db2ee6303304583759c1a4562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201326 lines \u00D7 2): crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:709-729 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:764-789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc403a7c3aceb887763e2240b7ec94d8638d8d213d3f2fb753a80ca6b8a9f323"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/dbx-web/src/routes/redis_pubsub_ws.rs:194-219 | src-tauri/src/commands/redis_pubsub_server.rs:225-250 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/redis_pubsub_ws.rs\u0060 and \u0060src-tauri/src/commands/redis_pubsub_server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 120 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis_pubsub_ws.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ccb24e065969f687561f92a85f57d3ff116383b39e051082d113e92881b5c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:170-194 | crates/dbx-drivers/src/db/duckdb_sql.rs:208-231 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-drivers/src/db/duckdb_sql.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 169 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"22af03d8c25cf6ef7d488215fc2a7dcaf3c78fa09b1d353d283785c4e63d12b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/dbx-core/src/data/table_export.rs:1227-1251 | crates/dbx-core/src/data/table_export.rs:1278-1302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_export.rs:1227\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b1d2d81d763748109eedbfc12e34780d54372083fff0836b3680328387ed2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:8395-8419 | crates/dbx-core/src/data/table_import.rs:8932-8956 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:8395\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":8395}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f496801cae02f8e9947ba9dc37cdc67ee9368784bd08679824c6025a057205b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:8448-8472 | crates/dbx-core/src/data/table_import.rs:8981-9004 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:8448\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":8448}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b63a9391caace5f5dc98871f2b1ca899e4635fe1d559d2d3d0f307a2cea17be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): crates/dbx-driver-agent/src/agent_service.rs:1667-1689 | crates/dbx-driver-agent/src/agent_service.rs:1796-1820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-driver-agent/src/agent_service.rs:1823\u0060 calls \u0060retain_driver_delta_base\u0060, \u0060stop_driver_processes_before_replacement\u0060 and \u0060crates/dbx-driver-agent/src/agent_service.rs:1690\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"742c0cef61bf178f11d0554c3c4d88f39de6829e8afcff7c1233203dbad672c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201325 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:7019-7043 | crates/dbx-driver-postgres/src/postgres.rs:7088-7106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:7019\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":7019}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ef1b56081d7a03c1896f669d2bd61ca57ed21d08f96b677a4379a84fa252f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/dbx-drivers/src/db/rqlite_driver.rs:373-397 | crates/dbx-drivers/src/db/turso_driver.rs:618-642 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/turso_driver.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 255 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/rqlite_driver.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"79738405208edf4a941b0bc08dff6d2b398cefad3ed8f8ac4a7e673d172e0cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:486-510 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:657-678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d28e7063966c59beb342fecebee1cda8007779d27cfe36df9cfeee9158c84d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 6): crates/dbx-core/src/data/table_export.rs:2019-2042 | crates/dbx-core/src/data/table_export.rs:2121-2143 | crates/dbx-core/src/data/table_export.rs:2220-2243 | crates/dbx-core/src/data/table_export.rs:2324-2345 | crates/dbx-core/src/data/table_export.rs:2413-2434 | crates/dbx-core/src/data/table_export.rs:2517-2538 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_export.rs:2019\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/data/table_export.rs:2436\u0060 calls \u0060write_all\u0060, \u0060map_err\u0060 and \u0060crates/dbx-core/src/data/table_export.rs:2043\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacb9c5d27c1382036c520975a09249bf3b60eca264181486c8e4c9ca7cd20e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201344 lines \u00D7 3): crates/dbx-core/src/data/table_import.rs:8250-8292 | crates/dbx-core/src/data/table_import.rs:8775-8817 | crates/dbx-core/src/data/table_import.rs:9153-9196 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:8250\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/data/table_import.rs:8818\u0060 calls \u0060store\u0060 and \u0060crates/dbx-core/src/data/table_import.rs:8293\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":8250}}}],"partialFingerprints":{"codehealthFindingId/v1":"08940373748a48882a68733f6a6ee3321b7f93cf59f692360642a475cf5eb839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:128-151 | crates/dbx-drivers/src/db/duckdb_sql.rs:166-189 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-drivers/src/db/duckdb_sql.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 169 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/sql.rs:128\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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"63012f6e62e88e9a8d0f84150faed9706d096c2185f7f7ed773dd4ccf2d9bef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:4237-4270 | crates/dbx-ai-provider/src/ai.rs:5124-5157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:4237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ef93351cc2781ed4c5f487b3a7228824a2beb6c897dc5578884344705cc890"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:8496-8519 | crates/dbx-core/src/persistence/storage.rs:8591-8614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:8496\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8496}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c530c522768d59a699862ba6858ab3565d66d6c8a25281a134e40e163cb064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/dbx-sql-core/src/sql.rs:4053-4076 | crates/dbx-sql-core/src/sql.rs:4148-4171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/sql.rs:4053\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":4053}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d61d9b77e7a8040b5056b528ef00f4ca6ab3604bd93cd39e736064393194e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/dbx-web/src/routes/redis_pubsub_ws.rs:155-178 | src-tauri/src/commands/redis_pubsub_server.rs:186-209 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/redis_pubsub_ws.rs\u0060 and \u0060src-tauri/src/commands/redis_pubsub_server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 120 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/redis_pubsub_ws.rs:155\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis_pubsub_ws.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab141fc6200d2a956577dd23cf58dfbf7eead32ae6db7e9d0e76e9368656892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/dbx-mcp/src/server.rs:2719-2741 | crates/dbx-mcp/src/server.rs:3087-3109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46b86e1d287c162ae5709ec7de1cd5e5a424948809e05ab4dd4b5ddfebc347f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs:144-165 | crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs:232-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs:144\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb0fdf5d63e2dbca2c7773ccd1ede9df6f0dfc6c46a556b35c4444b743346b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 4): crates/dbx-drivers/src/db/clickhouse_driver.rs:97-119 | crates/dbx-drivers/src/db/influxdb3_driver.rs:89-111 | crates/dbx-drivers/src/db/influxdb_driver.rs:130-152 | crates/dbx-drivers/src/db/victoriametrics_driver.rs:153-175 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/influxdb3_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/influxdb_driver.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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/clickhouse_driver.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"35187570a3a900054f96f6f89cd3703092dfd0732d46d7658700074d1b97c41f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/dbx-core/src/admin/consul/archive.rs:481-501 | crates/dbx-core/src/admin/consul/kv.rs:486-507 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/consul/archive.rs:481\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/archive.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"574deaf14f6a46eec060149558fdb820e52afd42c61dc3dc7bab435b843f7897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/dbx-core/src/data/transfer_runner.rs:369-390 | crates/dbx-core/src/data/transfer_runner.rs:435-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer_runner.rs:369\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2e51ba40601efde214983e0a927ff836b9061d1253479494c81f896f57d323"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:1417-1439 | crates/dbx-core/src/query/mod.rs:1450-1472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:1417\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/query/mod.rs:1449\u0060 calls \u0060agent_protocol_row_count\u0060, \u0060unwrap_or\u0060 and \u0060crates/dbx-core/src/query/mod.rs:1416\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa7795f7b027e8c495270e5c4ec756138bf756dfa1190f1217e3deacab2230f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:6243-6264 | crates/dbx-driver-mysql/src/mysql.rs:6653-6674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:6243\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f4aa4f9fe67a806769c34fc850cce8970e1c0e3646b1f33aa7b0c2dc7cb4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:356-376 | crates/dbx-web/src/routes/mcp_policy.rs:38-58 | src-tauri/src/commands/mcp_bridge.rs:1546-1566 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"1488c9e13b26ad6629b3462abd3e62e7a97d7dea4c6f7469c9a338c9c4d58561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): crates/dbx-driver-mysql/src/mysql.rs:6193-6213 | crates/dbx-driver-mysql/src/mysql.rs:6379-6399 | crates/dbx-driver-mysql/src/mysql.rs:6603-6623 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:6193\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6193}}}],"partialFingerprints":{"codehealthFindingId/v1":"336346c567b58f3e42c5cf86fd29933f288f5fbbde6c685ec77013d0011a0759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): crates/dbx-core/src/data/sql_file_import.rs:823-843 | crates/dbx-core/src/data/sql_file_import.rs:1331-1349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca6a883a089cc14420a8db9549d09261ac463fac74772c2ced4fd79040c4163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:12036-12056 | crates/dbx-core/src/data/transfer.rs:13941-13961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:12036\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":12036}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9070adec9a83c19d0804369223c24f3a6048c0d847af4cf5da6c283df051717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/dbx-drivers/src/db/couchdb_driver.rs:604-624 | crates/dbx-drivers/src/db/solr_driver.rs:981-1001 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/couchdb_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/solr_driver.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff67e7fd6a0d82c58f6d4f8ec01ad5c2d8098fab13d0aaae17810587bbbbf84b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): crates/dbx-mcp/src/server.rs:2896-2916 | crates/dbx-mcp/src/server.rs:3238-3255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:2896\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2896}}}],"partialFingerprints":{"codehealthFindingId/v1":"5304e317dc83afa387aeb856782cf393aa238d6dd29640be2c2f4f29b30bc306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:1475-1492 | crates/dbx-sql-data/src/query_result_sql.rs:3112-3132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6a4411c3312264895a652a0c7ab0e8cceb298f676f54ac9725cc9259f97b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:96-115 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:173-192 | crates/dbx-ai-provider/src/ai_codex_cli.rs:343-362 | crates/dbx-ai-provider/src/ai_grok_cli.rs:143-162 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:96\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-ai-provider/src/ai_grok_cli.rs:163\u0060 calls \u0060Some\u0060, \u0060var_os\u0060, \u0060push\u0060 and \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:116\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3a5b45b22166a16fb8ab242a2061828bc5f3cf4615703eca824682604c2acd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 3): crates/dbx-core/src/data/query_result_export.rs:1808-1843 | crates/dbx-core/src/data/query_result_export.rs:2107-2142 | crates/dbx-core/src/data/query_result_export.rs:2316-2351 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1808\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f1271c20323ae7f12326b232f65674793cc8c93ee360010405dad89e27d5a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:516-535 | crates/dbx-web/src/routes/mcp_policy.rs:198-217 | src-tauri/src/commands/mcp_bridge.rs:1706-1725 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd231bea770bcdd7ba87f7b7ffe38a35322403ded8df27e53e567a742e065fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:3960-3979 | src-tauri/src/commands/connection.rs:2673-2692 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3960\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3960}}}],"partialFingerprints":{"codehealthFindingId/v1":"215999b26e466bb674038422e2554f7e38675aa3f00b291a0514d21ceae8c72b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:3348-3368 | crates/dbx-core/src/data/table_import.rs:3541-3561 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:3348\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/data/table_import.rs:3538\u0060 calls \u0060is_cancelled\u0060, \u0060Err\u0060, \u0060to_string\u0060 and \u0060crates/dbx-core/src/data/table_import.rs:3347\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3348}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d198e26f6b2a5d7e6fd5752ccdb9a783cf111c210938110facdc7632385c67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/dbx-driver-sqlserver/src/sqlserver.rs:3961-3980 | crates/dbx-driver-sqlserver/src/sqlserver.rs:4085-4104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":3961}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2d882e321e72f82f306e4f52be99ccc06b19496b8a1f99b7b73fdede6f329a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/dbx-drivers/src/db/dynamodb_driver.rs:666-685 | crates/dbx-drivers/src/db/salesforce_driver.rs:1216-1235 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd4874f0f9edd35fc33bd705f09e704590a8611afee8ff79818ec68c76dad26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/dbx-sql-core/src/sql_analysis.rs:580-599 | crates/dbx-sql-core/src/sql_analysis.rs:788-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/sql_analysis.rs:580\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98b951c7e7fd2a8aac0a8c89e8f255c6003e1d17c1cefc8898bbc20ed2fe01d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_extractors/sql.rs:257-276 | crates/dbx-sql-data/src/data_grid_extractors/sql.rs:350-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_extractors/sql.rs:257\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4883307f8b984a747889a86ecc3d51b73d0207c239e315b94cdc2f96049bd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/dbx-web/src/routes/query_result_export.rs:109-128 | crates/dbx-web/src/routes/table_export.rs:97-116 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/query_result_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/query_result_export.rs:109\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query_result_export.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"02566276a2b0c9973ab2cbac7988c268b7eb751113540397a254e8cc10e57185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 5): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:302-320 | crates/dbx-drivers/src/db/rqlite_driver.rs:174-192 | crates/dbx-drivers/src/db/sqlite.rs:2518-2536 | crates/dbx-drivers/src/db/sqlite.rs:2578-2596 | crates/dbx-drivers/src/db/turso_driver.rs:235-253 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs\u0060 and \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:302\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f248f097152dbaf439a68aa1957445a7a623939f4f790d717c7486810b27a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/dbx-core/src/data/transfer.rs:10454-10472 | crates/dbx-core/src/data/transfer.rs:10603-10621 | crates/dbx-core/src/data/transfer.rs:10700-10718 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:10454\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10454}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b8a2b2aff7d68ded3c58144a62db4ac79c51611d82c46f6618c5625b9376a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:1366-1383 | crates/dbx-driver-mongodb/src/mongo_shell.rs:1513-1531 | crates/dbx-driver-mongodb/src/mongo_shell.rs:1567-1584 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"49dac00766c83691820a7277dca75ef665e9ef13def12978f7afe061db6a9ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:403-421 | crates/dbx-drivers/src/db/rqlite_driver.rs:285-303 | crates/dbx-drivers/src/db/turso_driver.rs:346-364 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs\u0060 and \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:403\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060client\u0060 to \u0060\u0026CloudflareD1Client\u0060 in one and \u0060\u0026RqliteClient\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-drivers/src/db/rqlite_driver.rs:305\u0060 calls \u0060execute_query\u0060, \u0060execute_query_with_max_rows\u0060 and \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:423\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"06176c5ab9db37b68c974b6782db9e8fe269407fc253eeeea0bb56b93a7942c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:664-682 | crates/dbx-ai-provider/src/ai_grok_cli.rs:590-608 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_grok_cli.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:664\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba837130bd34bbc17b5e0a8e62a7c6fb8793b0e33d3777b467c7ec54db5a3ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:538-568 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:775-805 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d10d6d6b7f4c1bc4019f5590a1123f5f23a310139a393293a7c0be16d66e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:3670-3685 | src-tauri/src/commands/connection.rs:2621-2639 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3670\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3b80ef02021027a94372f08f4260c0e4e855daae4c950ab9bad90f053e3c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/dbx-core/src/data/data_compare.rs:1456-1473 | crates/dbx-core/src/data/data_compare.rs:1509-1527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/data_compare.rs:1509\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"9472de4d078d1599ecc359017e12d7f38f9ff6f65a9f152a856b60660524be3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/dbx-core/src/data/query_result_export.rs:1655-1673 | crates/dbx-core/src/data/query_result_export.rs:2157-2175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1655\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e37bc71030fa0c29f7b6bc6c7e7e135ac0fc73706aae1aa9f14b7587a6e1803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/dbx-core/src/data/query_result_export.rs:1801-1819 | crates/dbx-core/src/data/query_result_export.rs:2514-2532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1801\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/data/query_result_export.rs:2512\u0060 calls \u0060drop\u0060 and \u0060crates/dbx-core/src/data/query_result_export.rs:1799\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eff6341ff76def3cf476162831cae69996ade05348f3c3eb05a47493b672538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:8735-8753 | crates/dbx-core/src/data/table_import.rs:8760-8778 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:8760\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":8735}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d4eae27b6c00dd0336f48aba702ad2e8b53924276215bf6f677781fab33399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:6971-6989 | crates/dbx-core/src/data/transfer.rs:7174-7191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:6971\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":6971}}}],"partialFingerprints":{"codehealthFindingId/v1":"933cd93c284bceae4da7427118c686afd6516e35fbfbc8c44e465ff2b8665261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:14341-14358 | crates/dbx-core/src/data/transfer.rs:14379-14397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:14341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14341}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6ecc2aa90b3bea9770058bf726f312aadbbbfbc251c7a714ea72402ac65e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:3097-3115 | crates/dbx-types/src/models/connection.rs:2085-2103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:3097\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3097}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d8b0df0b1767999604e79002ed960fcf5837959f9bbdddc5321787e94d97f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:1756-1774 | crates/dbx-sql-data/src/query_result_sql.rs:1849-1867 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"895e26c6c51fd9b0bed25dbe0aa7ae1528f98a0f10f2a7e1dc6f089a9947e523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:732-750 | crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:1020-1038 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:732\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"76570046a95fe78d69cb3719a663bc6dea34d28c14028074ae125d344bc269be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:945-963 | crates/dbx-sql-schema/src/schema_diff.rs:1012-1029 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3da5112b5789e62507f8a109bd2d00dc8a1468556dee4ccb1c821e57ad7cdc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/dialect.rs:184-199 | crates/dbx-sql-schema/src/table_structure_sql/dialect.rs:264-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/dialect.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3dd84d6192a0021e8ccac2bf13aac70feea8db660ab846f513f1a86460ad55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/dbx-types/src/models/connection.rs:1351-1371 | crates/dbx-types/src/models/connection.rs:1534-1554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-types/src/models/connection.rs:1351\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f3c3b147af19d4a3fa6faf38de099d39574c6448e7f371f0ba29f1a4a95517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:123-156 | crates/dbx-web/src/routes/table_import.rs:127-160 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/mongodb_import_export.rs:123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-web/src/routes/table_import.rs:161\u0060 calls \u0060Some\u0060 and \u0060crates/dbx-web/src/routes/mongodb_import_export.rs:157\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fbe65b67cf1d8aff44682157bc763e1a2570f9f61b7ce3551a1c61ebaca096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:252-271 | crates/dbx-web/src/routes/table_import.rs:274-294 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/mongodb_import_export.rs:252\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b46403494f367ff2b20e48b38a6bdbed6ac6bcc5ac9345cac24257a3c0f9c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/dbx-web/src/routes/query.rs:1664-1681 | src-tauri/src/commands/query.rs:1284-1302 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/query.rs:1664\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":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"879ffe5063e0b782a4ac35cb90e12e03315eacec89961ab58c6d8017122d0e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:3940-3956 | src-tauri/src/commands/connection.rs:2022-2040 | src-tauri/src/commands/connection.rs:2601-2617 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3940\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3940}}}],"partialFingerprints":{"codehealthFindingId/v1":"c961733204359a57b277bad3ece86f668ebc6f48a21fb59dedbdd42c8783bb24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/dbx-core/src/query/mongo_ops.rs:1561-1578 | crates/dbx-drivers/src/db/dynamodb_driver.rs:620-637 | crates/dbx-mcp/src/backend.rs:3048-3065 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mongo_ops.rs:1561\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060documents\u0060 to \u0060Vec\u003Cserde_json::Value\u003E\u0060 in one and \u0060Vec\u003CValue\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07ff99d7a2166a09ea23b0defef82064ab218cf542123fc0349b7e745fc8e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 3): crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:499-516 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:667-681 | crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs:782-796 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/ddl_profile.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f238df21be48464381a3ecdbddc7f10f6a1f43472a18998f148f0a0caaefef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:5353-5369 | crates/dbx-core/src/connection/mod.rs:5467-5484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:5353\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":5353}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ac7db3707d19ff1e0ef7b381f7306691a82071f4f8539e94c1e47e945f58da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:5655-5671 | crates/dbx-core/src/data/database_export.rs:5693-5710 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:5655\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5655}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a129ffe8bed6c2bd6a651edac2ee12450d9e3993719df0fb536434fffa3aeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/dbx-core/src/data/table_export.rs:1208-1225 | crates/dbx-core/src/data/table_export.rs:1259-1276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_export.rs:1208\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed30d83aad252e6301ea53cac35302cf5834cc6a2d62547ea967985b2cff9830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:1404-1421 | crates/dbx-core/src/data/table_import.rs:7116-7133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24f2a22f2a607db6904dc08633d4f912eda49b68f2b2d52577e93a0d0b758b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:11430-11445 | crates/dbx-core/src/data/transfer.rs:12724-12741 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:11430\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/data/transfer.rs:12724\u0060 calls \u0060as_deref\u0060 and \u0060crates/dbx-core/src/data/transfer.rs:11430\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":11430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7828be51c5f4786687eb698faa0522d3569019acb40b0ebaaa2b7a900c85a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_shell.rs:1866-1883 | crates/dbx-driver-mongodb/src/mongo_shell.rs:1908-1925 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs:1866\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"0561bba59abef3ad79c7f818ede34e8889b5e881bc30b3b9705d6783ccb5a18e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_shell.rs:1875-1892 | crates/dbx-driver-mongodb/src/mongo_shell.rs:1958-1975 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs:1875\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"440549631c620b9f2f8cbdc8ed388ea4be57667a7a527726371d6cc595e34b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/dbx-drivers/src/db/ssh_tunnel.rs:554-571 | crates/dbx-drivers/src/db/ssh_tunnel.rs:648-665 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e099410739fc7f958fa0131faeeb495f460a99eced162b281e60c771b41ad39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/dbx-mcp/src/server.rs:840-857 | crates/dbx-mcp/src/server.rs:893-910 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:840\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-mcp/src/server.rs:839\u0060 calls \u0060take\u0060 and \u0060crates/dbx-mcp/src/server.rs:892\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2fbd15e5e63a276ef65ef0bc4bd45df65a4e7b51124e424d373394f64b0772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_extractors/sql.rs:281-298 | crates/dbx-sql-data/src/data_grid_extractors/sql.rs:427-444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"78745f0ef3616f6c3fa990d2e119d6141f1746ca8219e601fbb5dfc8bd08c832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/dbx-web/src/routes/query.rs:497-514 | crates/dbx-web/src/routes/query.rs:662-679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64aa3e45528786735b2fd79f62efe0f4bcdba76cae450d3ce68e1caf15faa18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/dbx-web/src/routes/tunnel_profiles.rs:87-105 | src-tauri/src/commands/tunnel_profiles.rs:57-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/tunnel_profiles.rs:87\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/tunnel_profiles.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f5fd31ce955406b7c45afc012dddf940624e91b1969e003931b3a196f0393d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/dbx-ai-provider/src/ai.rs:3960-3976 | crates/dbx-ai-provider/src/ai.rs:4202-4218 | crates/dbx-ai-provider/src/ai.rs:4296-4312 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3960\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3960}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e867e96c713fa98baa38d1611882c0581e52705a5eeeb82251d1e6771c12d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:3885-3916 | crates/dbx-ai-provider/src/ai.rs:4490-4521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3885\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3885}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab259a161ca05167f7720cb997ce26ac7cf7fabb889eeff2d8809aad827f0bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/dbx-core/src/admin/consul/blocking.rs:121-137 | crates/dbx-core/src/admin/consul/blocking.rs:176-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060ConsulBlockingRequest\u0060 in one and \u0060ConsulDomainWatchRequest\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/blocking.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"869c132450838e635f342bf54dd6c34d1a8270ae4b2a341c1cc71b030a6e7693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): crates/dbx-core/src/admin/consul/blocking.rs:142-167 | crates/dbx-core/src/admin/consul/blocking.rs:196-220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/consul/blocking.rs:142\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060ConsulBlockingRequest\u0060 in one and \u0060ConsulDomainWatchRequest\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/blocking.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed98139ff31a756a81e492e2d98745824ee325b622c4153e5759aba6c5c0571"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:273-293 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:442-462 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78419827ff3dab103024421833b7b7cebeb5e691733e679f3844f12d17c1a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:519-535 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:756-772 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3fefa1afba4b5882f525f2fd0c8e7693157338bc14c8c94636097d13af3a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:796-812 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:1062-1078 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs:796\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"c782b201d5d67371018fa9f32ba8d43f0c19901ab671e8ab7ebfbd785b8f9d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/dbx-core/src/data/mongodb_import_export.rs:1872-1888 | crates/dbx-core/src/data/mongodb_import_export.rs:1947-1963 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/mongodb_import_export.rs:1947\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b10649e7ca5bf6d8aaffa35d89a2285924c4efdd413a797d4b0dfe0ae65840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:5954-5970 | crates/dbx-core/src/persistence/storage.rs:10074-10089 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:5954\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":5954}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9921f7e0216be052d06a70672afb362f61ab70e8de42c0a3dcef3c18d06cf7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs:548-565 | crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs:580-597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler/transition.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"059c29943319149ceca6dba5441f4ff54a6b5dc75d97c116dcb1f763f1fda55d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_oidc.rs:207-230 | crates/dbx-drivers/src/salesforce_oauth.rs:284-307 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_oidc.rs\u0060 and \u0060crates/dbx-drivers/src/salesforce_oauth.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_oidc.rs:207\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18f9055b78e9830c58f55ac7f14eac9bcee320e7637b0aa0354211cacac4c0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/dbx-drivers/src/db/couchdb_driver.rs:627-643 | crates/dbx-drivers/src/db/solr_driver.rs:1004-1020 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/couchdb_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/solr_driver.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/couchdb_driver.rs:627\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060start\u0060 to \u0060Instant\u0060 in one and \u0060std::time::Instant\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f094525c310aea36a79cebe278159496fb99dca378fd4967346adfd9c24aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/dbx-drivers/src/db/sqlite.rs:2760-2776 | crates/dbx-sqlite-worker/src/runtime.rs:100-114 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/sqlite.rs:2760\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":2760}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc963d78a712242f2cfa384f3449b01718483cd173d56e6b8f615b1daa590f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:1281-1297 | crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:1652-1668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:1281\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"277dbec68a87cd1f3e9f3c6fa2b6deded7064fe6b0a38553dfde65f55ecb1f92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/dbx-sql-core/src/query_execution_sql.rs:1302-1318 | crates/dbx-sql-core/src/query_execution_sql.rs:1384-1400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/query_execution_sql.rs:1302\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d18b69e0fa73ba7656a042f09c8b1e7220a65165e22b92b998a591fcdb196e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:158-174 | crates/dbx-web/src/routes/table_import.rs:164-180 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/mongodb_import_export.rs:158\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-web/src/routes/table_import.rs:161\u0060 calls \u0060Some\u0060 and \u0060crates/dbx-web/src/routes/mongodb_import_export.rs:156\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"bede6d77b79184d2ef25a30a546f690e86a86834d4b53cd7d208839dca3f8566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src-tauri/src/commands/mongodb_dump.rs:43-59 | src-tauri/src/commands/mongodb_dump.rs:74-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/mongodb_dump.rs:43\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060MongoDatabaseDumpRequest\u0060 in one and \u0060MongoDatabaseRestoreRequest\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mongodb_dump.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b7811301a89013336080d24008e41cada67b9b6d9bc896ebc7e161a4067346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6): crates/dbx-core/src/data/table_export.rs:1232-1247 | crates/dbx-core/src/data/table_export.rs:1283-1298 | crates/dbx-core/src/data/table_export.rs:1335-1350 | crates/dbx-core/src/data/table_export.rs:1390-1405 | crates/dbx-core/src/data/table_export.rs:1441-1456 | crates/dbx-core/src/data/table_export.rs:1516-1531 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_export.rs:1232\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/data/table_export.rs:1406\u0060 calls \u0060write_all\u0060, \u0060map_err\u0060 and \u0060crates/dbx-core/src/data/table_export.rs:1248\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc33dacd88155729bf19db9eb136e1f7ac7c0db316e9b33e84366f110740d3a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:792-807 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:878-893 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:1041-1056 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:1219-1234 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:1364-1379 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:792\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:790\u0060 calls \u0060as_bytes\u0060 and \u0060crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:876\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"c478cb58742fd51f1934cc2d2b470040eb7bda824ea743d0e7d19eb28f95e85f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 3): crates/dbx-core/src/query/document_ops.rs:560-572 | crates/dbx-core/src/query/mongo_ops.rs:370-385 | crates/dbx-core/src/query/mongo_ops.rs:547-562 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/document_ops.rs:560\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/query/document_ops.rs:573\u0060 calls \u0060Some\u0060 and \u0060crates/dbx-core/src/query/mongo_ops.rs:563\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87386dce76080070c864c22a51975b7fedfa9ecafe547d9578c0afb7a0bae8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/dbx-mcp/src/server.rs:4146-4161 | crates/dbx-mcp/src/server.rs:4210-4225 | crates/dbx-mcp/src/server.rs:4276-4291 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:4146\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cdb40eca59d56b5404bd9c1c88e7cb8a01d09caa258e9267a52d5b3fa5c0be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:4139-4169 | crates/dbx-ai-provider/src/ai.rs:4863-4893 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:4139\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efc2e3709874d3a548072535710eaf4989541aa07e6c815b15b00df0e097b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:421-437 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:711-726 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"787780ac86dd4d65d20613195e3476befaf7448a75968ca5fb9867a3637df7e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-core/src/admin/nacos/http.rs:1081-1096 | crates/dbx-core/src/admin/nacos/http.rs:1110-1125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/http.rs:1081\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4aec5a6b3415cf0979f2d60823812934e5d864b3b8078c0d52f71fd4d775ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-core/src/connection/connection_secrets.rs:991-1006 | crates/dbx-core/src/persistence/cloud_sync.rs:2464-2479 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/persistence/cloud_sync.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/persistence/cloud_sync.rs:2480\u0060 calls \u0060as_deref\u0060 and \u0060crates/dbx-core/src/connection/connection_secrets.rs:1007\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbe88748209f56748d8b44dbeb045983427c21867a5efe9853fa1b65eca7c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:3843-3858 | src-tauri/src/commands/connection.rs:2504-2519 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3843}}}],"partialFingerprints":{"codehealthFindingId/v1":"300af50452e287e4a7162c6f0bdc574d8a59795f6b99bb1de62c9e338ad66eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-core/src/data/query_result_export.rs:1675-1690 | crates/dbx-core/src/data/query_result_export.rs:2177-2192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1675\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2fbe21cf02ea27ad4ffdb28a3f54da4012b979d9742bf22e7a51638532dcaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-core/src/data/sql_file_import.rs:1191-1206 | crates/dbx-core/src/data/sql_file_import.rs:1255-1270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/data/sql_file_import.rs:1210\u0060 calls \u0060buffered_statement_bytes\u0060, \u0060sql_file_statement_batch_is_full\u0060 and \u0060crates/dbx-core/src/data/sql_file_import.rs:1271\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f37d855cefd63ae150d9f1f8b01b0b60acbce095f27d1b70532972aeeb9955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): crates/dbx-core/src/data/table_export.rs:1351-1362 | crates/dbx-core/src/data/table_export.rs:2246-2261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_export.rs:1351\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ab75288da72b7aa8afa3befd55af38393e9d380d1cdca90a4f3b42ada6551e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:5461-5476 | crates/dbx-core/src/persistence/storage.rs:5480-5495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":5461}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbd890a1f74a54315b02fd6f91748de38eb8f9f6d0e2e1f9aec84587d89d414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:10193-10208 | crates/dbx-core/src/schema/normalization.rs:103-118 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db4fe07d04d45b662f18ffc956a0442f7debea3291c5e6c09df093419e11599"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/dbx-driver-elasticsearch/src/lib.rs:2382-2396 | crates/dbx-driver-elasticsearch/src/lib.rs:2412-2427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-elasticsearch/src/lib.rs:2382\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"407f5160ab13fe90178963216f7244daf033b15c287843ba85cb4a21dd4ce7b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:1727-1742 | crates/dbx-sql-data/src/query_result_sql.rs:1827-1842 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c46af3ddb36d199ba8cee042bae0664aeb2821994fbae5d8833b8db8976894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:649-664 | crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:895-910 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:649\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b64264491640ab6b39db76bca18b122decd0fe388743d7887134a6aff2e1d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:811-826 | crates/dbx-sql-schema/src/schema_diff.rs:833-848 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:811\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9969a49043c0ea0d4673b3c1254e9050320866d8622ede59659986428a52e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-web/src/routes/agents.rs:473-488 | src-tauri/src/commands/agents.rs:363-378 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/agents.rs\u0060 and \u0060src-tauri/src/commands/agents.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/agents.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4ffeaf87cb5aae0e9e845a40f91fb3849480fdf4c29363ce5b7a4188d27a2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:389-404 | crates/dbx-web/src/routes/table_import.rs:441-456 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf373f5cb5faa1c3f5c483249f1664f60ded15371544b52a47fa241258c8903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): crates/dbx-core/src/data/database_export.rs:5763-5777 | crates/dbx-core/src/data/database_export.rs:6169-6182 | crates/dbx-core/src/data/database_export.rs:6271-6284 | crates/dbx-core/src/data/database_export.rs:6370-6383 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:5763\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5763}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdf9d13d9a7e68639ce9a1686606b31a2ca50aafc5f787081707d6477973aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:3843-3855 | src-tauri/src/commands/connection.rs:1918-1932 | src-tauri/src/commands/connection.rs:2504-2516 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3843\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3843}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3087ebc6f715e33069d785abb965b34c9517bccff6be78e8e075dca17dbd23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:3859-3871 | src-tauri/src/commands/connection.rs:1946-1960 | src-tauri/src/commands/connection.rs:2530-2542 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3859\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3859}}}],"partialFingerprints":{"codehealthFindingId/v1":"efca439a7b2d4e0e9e40cf298027228934c649f7bf9f843d011c9aa67716f67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:3875-3887 | src-tauri/src/commands/connection.rs:1963-1977 | src-tauri/src/commands/connection.rs:2546-2558 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3875\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb7b534d73e84affda1c17ab5c10e5b23784b08783deade5b5aaf8f87c1b66c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/dbx-drivers/src/db/rqlite_driver.rs:232-246 | crates/dbx-drivers/src/db/sqlite.rs:2665-2679 | crates/dbx-drivers/src/db/turso_driver.rs:293-307 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/sqlite.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/rqlite_driver.rs:232\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/rqlite_driver.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"588a2541b2fd64c4c400016c838b94af509731b6897c6e072a236ea50ca8efd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/dbx-mcp/src/server.rs:3552-3566 | crates/dbx-mcp/src/server.rs:3596-3610 | crates/dbx-mcp/src/server.rs:3637-3651 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3552}}}],"partialFingerprints":{"codehealthFindingId/v1":"d559ff2199b268b4b341e5b6b2c2624de850603f373370b617faf7b9e4f6e8dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/dbx-web/src/routes/document_store.rs:15-29 | crates/dbx-web/src/routes/mongo.rs:28-42 | crates/dbx-web/src/routes/schema.rs:47-61 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/document_store.rs\u0060 and \u0060crates/dbx-web/src/routes/mongo.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/document_store.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"82df6edc75515b1ebaf7c348751fbe1b5d551378bfcbe9a3fba24337bf1f5983"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:3175-3189 | crates/dbx-ai-provider/src/ai.rs:3194-3208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3175}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4bedf8f9709fa12a19b85a2c328b2ce6fa958ea42f7ee933e17654538e76fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:4016-4030 | crates/dbx-ai-provider/src/ai.rs:4715-4729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:4016\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4016}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0818b52a11e2af733068bf60d5e5873f2835a96f6514a09d6e6e765a0019fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/dbx-ai-provider/src/ai_opencode_cli.rs:380-394 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:401-414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_opencode_cli.rs:380\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_opencode_cli.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"038ae251cccf57afb488dd20a985713871fb2a1497817a839f6a6d0235a04e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/pulsar.rs:670-684 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:690-704 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/pulsar.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1616302564cc6d91a9116cc8244be546ec7462b9d3fa9f7b44e9531c3eb59d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/data/data_compare.rs:1949-1963 | crates/dbx-core/src/data/data_compare.rs:1978-1992 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f96ebe5e1aed645783f930c18bef3a1bb7ab0fd42d994657d6eff9a836185b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:3148-3162 | crates/dbx-core/src/data/database_export.rs:3243-3257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:3148\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a006632e5aa5b7120d7f87c83bccad9ab0edf5917bcb49a172ba9505c6f880f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:15036-15050 | crates/dbx-core/src/data/transfer.rs:15059-15073 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":15036}}}],"partialFingerprints":{"codehealthFindingId/v1":"60daeafdb94bfc3a211e503e79fc7f47ab6f4f7bbea26d8f8c3d2a57afc349c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:2445-2459 | crates/dbx-core/src/query/sqlserver_agent_batch.rs:66-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"383767a4409ebfd5d8612ea0deed90dbf408d26912cf8a77087c6ed22b322c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:4631-4645 | crates/dbx-core/src/query/mod.rs:4678-4692 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/query/mod.rs:4695\u0060 calls \u0060should_continue_batch_after_error\u0060 and \u0060crates/dbx-core/src/query/mod.rs:4646\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":4631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08f7bc4345db07c3ce532cc0cee0f891578bc6ec6f6cb746163d45a22f1502e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:7381-7395 | crates/dbx-core/src/query/mod.rs:7598-7612 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":7381}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eae6e47200cc0b27c831b66dd8884813b412b05fe8138e2119192b49e4c1458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:1400-1414 | crates/dbx-core/src/schema/mod.rs:1419-1433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:1400\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/schema/mod.rs:1418\u0060 calls \u0060sqlserver_table_comment_sql\u0060 and \u0060crates/dbx-core/src/schema/mod.rs:1435\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df996fcb9722644e2b52e8bec7c1281f4e67719cab6ffb57bf883c99e84aba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:2995-3009 | crates/dbx-core/src/schema/mod.rs:3040-3054 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:2995\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":2995}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4d1dc74135602c6b66609d0fcc7e15a55669bfb15465635c09e0913f46b89d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:18438-18452 | crates/dbx-core/src/schema/mod.rs:18455-18469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":18438}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd991d526e2984be273f825e2da016e45b0a0656a5fa6cc4d14c04b90fca9d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/schema/state_calibrator.rs:468-482 | crates/dbx-core/src/schema/state_calibrator.rs:491-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 \u0060crates/dbx-core/src/schema/state_calibrator.rs:468\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/state_calibrator.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce67d8c8a902c40adf1b35d68856d6c4bf65f536110d82872e128f9c0cd38ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/dbx-driver-agent/src/agent_driver.rs:2717-2733 | crates/dbx-driver-agent/src/agent_driver.rs:2780-2793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-driver-agent/src/agent_driver.rs:2794\u0060 calls \u0060apply_to\u0060 and \u0060crates/dbx-driver-agent/src/agent_driver.rs:2734\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e336818003fc5bb61753ede5eecf82ab09f78bf929c21caabb3ab367f54f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:10874-10888 | crates/dbx-driver-postgres/src/postgres.rs:10924-10938 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:10874\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":10874}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc3aaf2b8042d46a0fda29c074cf3c83ac2042fed82795bce41fcad9f8bb14d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-driver-sqlserver/src/sqlserver.rs:1821-1835 | crates/dbx-sql-data/src/query_result_sql.rs:3065-3079 \u2014 before extracting anything, compare \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs\u0060 and \u0060crates/dbx-sql-data/src/query_result_sql.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs:1821\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0da4c6403e4eb4b2e44ca01281dc9925a2753ec4161e696c32be57d1af83b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-driver-sqlserver/src/sqlserver.rs:1933-1947 | crates/dbx-sql-data/src/query_result_sql.rs:3191-3205 \u2014 before extracting anything, compare \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs\u0060 and \u0060crates/dbx-sql-data/src/query_result_sql.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af8d9c730a4c0248da5cfa01f62c5c02336b31e0a954a6824f0afa35225b01d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-drivers/src/db/ssh_tunnel.rs:573-587 | crates/dbx-drivers/src/db/ssh_tunnel.rs:612-626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/ssh_tunnel.rs:573\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-drivers/src/db/ssh_tunnel.rs:593\u0060 calls \u0060server_offers_password\u0060 and \u0060crates/dbx-drivers/src/db/ssh_tunnel.rs:627\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9fa997c208ca3077fc1fba80abb5e00d248723e845e171b87383355e0473f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-drivers/src/db/victoriametrics_driver.rs:355-369 | crates/dbx-drivers/src/db/victoriametrics_driver.rs:396-410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/victoriametrics_driver.rs:355\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/victoriametrics_driver.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6115e373f598cdd6b79bd5c1676c079a96999bc774684f1e77888da6c40603f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-sql-core/src/sql.rs:3699-3713 | crates/dbx-sql-core/src/sql.rs:3750-3764 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":3699}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5b2b0ccb1f662bfb812882e24d59b9d6cf71d25afd22ece91f12bb92cbca37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:902-916 | crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:1030-1044 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:902\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5ea698bf1efa09f3374b2294453fe739c06972cf4798afc458820ca9a338ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-sql-dialect/src/sql_dialect/dialect_types.rs:30-44 | crates/dbx-sql-dialect/src/sql_dialect/dialect_yaml.rs:950-964 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/dialect_types.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a678737bb7b43918784e67dcccf97c41c0b2c4c9129211be9139b73e32c8a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src-tauri/src/commands/cloud_sync.rs:173-187 | src-tauri/src/commands/cloud_sync.rs:357-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src-tauri/src/commands/cloud_sync.rs:172\u0060 calls \u0060as_deref\u0060 and \u0060src-tauri/src/commands/cloud_sync.rs:356\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":"src-tauri/src/commands/cloud_sync.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7d55d25f92e4f82de137b1f8c56e64a804528b130f5ba9dfaec543c33b1ccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/dbx-core/src/schema/mod.rs:1016-1030 | crates/dbx-core/src/schema/mod.rs:3056-3069 | crates/dbx-core/src/schema/mod.rs:9152-9166 | crates/dbx-core/src/schema/mod.rs:10071-10085 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:1016\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1937977cad0df8bd50e2142cbee0201d03e172736cef2201be0f436d37ce9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/dbx-drivers/src/db/rqlite_driver.rs:232-245 | crates/dbx-drivers/src/db/sqlite.rs:2665-2678 | crates/dbx-drivers/src/db/sqlite.rs:2711-2724 | crates/dbx-drivers/src/db/turso_driver.rs:293-306 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/sqlite.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/rqlite_driver.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7804d2de3e7eccc81805764c6d24de728940ab23d015228194b05be3f0c2a2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): agents/drivers/duckdb/src/sql.rs:390-401 | crates/dbx-sql-core/src/sql.rs:3692-3705 | crates/dbx-sql-core/src/sql.rs:3743-3756 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-sql-core/src/sql.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/sql.rs:390\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd6dd4e409ab0fc75603f5f8e27330d5a656b03c8c461e9e9a5fcabae8310d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/dbx-core/src/connection/connection_secrets.rs:992-1005 | crates/dbx-core/src/persistence/cloud_sync.rs:2465-2478 | crates/dbx-core/src/persistence/storage.rs:3621-3634 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/persistence/cloud_sync.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/persistence/cloud_sync.rs:2480\u0060 calls \u0060as_deref\u0060 and \u0060crates/dbx-core/src/connection/connection_secrets.rs:1007\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd38b9b32f099ea188e1096d41c029b9eacc9b6f4425ef41aed5eb15e60d097d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:3891-3904 | src-tauri/src/commands/connection.rs:1980-1993 | src-tauri/src/commands/connection.rs:2562-2575 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3891\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3891}}}],"partialFingerprints":{"codehealthFindingId/v1":"9543b91b729d37a5d01dae79f536cf052e3daaaf2f33f526579f9fab4dcb706d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:1872-1885 | crates/dbx-driver-mongodb/src/mongo_shell.rs:1914-1927 | crates/dbx-driver-mongodb/src/mongo_shell.rs:1955-1968 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0576be00a185a4654ec442a4b927e91f3d9177929408286aab7d3baa3c31303"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/dbx-driver-mysql/src/mysql.rs:6166-6179 | crates/dbx-driver-mysql/src/mysql.rs:6352-6365 | crates/dbx-driver-mysql/src/mysql.rs:6576-6589 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:6166\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1566f73a6ddbb876ffc8f88aaf51cd2ec337f50f342ac8fc6ad53fb3521a364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:233-246 | crates/dbx-drivers/src/db/rqlite_driver.rs:112-125 | crates/dbx-drivers/src/db/turso_driver.rs:173-186 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs\u0060 and \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:233\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"670e95e62d186cdb54b6d8ee05519646f936bd034e2baa0acbeccd0dfabaccdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:82-95 | crates/dbx-drivers/src/db/duckdb_sql.rs:98-111 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-drivers/src/db/duckdb_sql.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 169 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/sql.rs:82\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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"189b999b2357a85e18d422f01779bef246792d7c1f89e3dee9dd6194bb64beca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/dbx-core/src/admin/nacos/service.rs:34-47 | crates/dbx-core/src/admin/nacos/service.rs:569-581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/service.rs:34\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060operation\u0060 to \u0060NacosAccessControlOperation\u0060 in one and \u0060NacosServiceOperation\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/admin/nacos/service.rs:568\u0060 calls \u0060service_capabilities\u0060 and \u0060crates/dbx-core/src/admin/nacos/service.rs:33\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/service.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09686d5bd2d7de502f844f02cb45a78669bdd84f22a766c3c8ab713c7b94ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:5069-5082 | crates/dbx-core/src/connection/mod.rs:5109-5122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:5069\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":5069}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1313c1ed8f9fd87250ba9a69316abef2500a1cc3e8105d4dd7426f3a5ccc01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:7808-7821 | crates/dbx-core/src/connection/mod.rs:7836-7849 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:7808\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":7808}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b2d1e92627b8690c9ba6274ff44053c26721f1f8e204182f25c40e74ecaf8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:5819-5832 | crates/dbx-core/src/data/database_export.rs:5888-5901 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:5819\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5819}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fc2b9f4374b9d6ec040147efc22f8dcc98076e4621f3a1d1d9a5bc6581153d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:967-980 | crates/dbx-core/src/data/transfer.rs:987-1000 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:967\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf7b624daa65f0f8cfb672b733775b49f6ef7886d5dc3756bded431c3c7321b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:12714-12727 | crates/dbx-core/src/data/transfer/overwrite_clear.rs:38-51 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:12714\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":12714}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c56f9c52c76a11d90504912402d03f61017edf69d74af03ec1a2b7dd095f030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/data/transfer/oracle_table_contract.rs:39-52 | crates/dbx-core/src/data/transfer/oracle_table_contract.rs:76-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2e6657034c3c065e97c6a170fb63f06d9c51e6a27910e90b121fe3a1c3c51c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/data/transfer_runner.rs:216-229 | crates/dbx-core/src/data/transfer_runner.rs:324-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer_runner.rs:216\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"058cbbee66f74c022998733accf2c4805eee4be73043b7093439b66859161878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:1758-1771 | crates/dbx-core/src/persistence/storage.rs:1792-1805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:1758\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"a458066a675d9319fbc3f34dce8a9da5b3369302bf12ecacb82f845e9028c8f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/query/mongo_ops.rs:1539-1552 | crates/dbx-mcp/src/backend.rs:3028-3041 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mongo_ops.rs:1539\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe777082277f4176a0a76a086f64d0eb1196899e5d6f846eb324e8e0e06e186"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:3345-3357 | crates/dbx-types/src/models/connection.rs:2228-2241 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:3345\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3345}}}],"partialFingerprints":{"codehealthFindingId/v1":"85733db99f08f05a488f0f9a4e7829280a3ff1854235b39c8c9a77101b6a875b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:5938-5948 | crates/dbx-driver-mysql/src/mysql.rs:5974-5987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:5938\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5938}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9d46983192dbc0347840f05b8005b60ef02b7924f55f798762b59338158df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:1471-1484 | crates/dbx-sql-data/src/query_result_sql.rs:1610-1623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/query_result_sql.rs:1471\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b774223915264fe1295ccd236906bab8aa4b0948256afa70ded8c0fa2edcb2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-web/src/routes/document_store.rs:473-486 | crates/dbx-web/src/routes/mongo.rs:800-813 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/document_store.rs\u0060 and \u0060crates/dbx-web/src/routes/mongo.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/document_store.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f1a5fc9e82ebe10e8003bba4e5ab7760cbddab1ff84c27f2e15613bb4a08b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src-tauri/src/commands/transfer.rs:64-77 | src-tauri/src/commands/transfer.rs:120-133 \u2014 both copies are in the same file, so extract the block into one function there 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-tauri/src/commands/transfer.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba714eda67bac56ae9332dfb3e046feb3a5fe7c4a039e0fc3df0d2ea624cf4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): crates/dbx-core/src/data/database_export.rs:5766-5778 | crates/dbx-core/src/data/database_export.rs:5977-5989 | crates/dbx-core/src/data/database_export.rs:6171-6183 | crates/dbx-core/src/data/database_export.rs:6273-6285 | crates/dbx-core/src/data/database_export.rs:6372-6384 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5766}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8c382f38e0fc1756920488837c0d83010b8c568c122f851f4e070d7c85cf8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/dbx-ai-provider/src/ai.rs:3896-3908 | crates/dbx-ai-provider/src/ai.rs:4150-4162 | crates/dbx-ai-provider/src/ai.rs:4501-4513 | crates/dbx-ai-provider/src/ai.rs:4874-4886 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3896\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"012cadcaeeefc60dedb5c6e0545904837288425c75ca83acd59d8548dc338fc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/dbx-core/src/data/transfer.rs:13710-13722 | crates/dbx-core/src/data/transfer.rs:13767-13779 | crates/dbx-core/src/data/transfer.rs:13789-13801 | crates/dbx-core/src/data/transfer.rs:14090-14102 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:13710\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":13710}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f22356e1ee4f53532882597207a444b8c044cefd74b4bfd4830adce8cb7d734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): src-tauri/src/commands/mcp_bridge.rs:2481-2493 | src-tauri/src/commands/mcp_bridge.rs:2509-2521 | src-tauri/src/commands/mcp_bridge.rs:2912-2924 | src-tauri/src/commands/mcp_bridge.rs:2968-2980 \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 \u0060src-tauri/src/commands/mcp_bridge.rs:2481\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src-tauri/src/commands/mcp_bridge.rs:2495\u0060 calls \u0060unwrap_or_default\u0060 and \u0060src-tauri/src/commands/mcp_bridge.rs:2982\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":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c07231f83e2cc62899951cbe16ab2b53d3e5b27204426ec5001f16c80ec9bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/dbx-sql-data/src/data_grid_extractors/sql.rs:262-274 | crates/dbx-sql-data/src/data_grid_extractors/sql.rs:355-367 | crates/dbx-sql-data/src/data_grid_extractors/sql.rs:561-573 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4d5201d497d8feb43c624f8442d3c56edc16830af22fd3f7423ccba3fa0196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/dbx-sql-schema/src/schema_diff.rs:6811-6823 | crates/dbx-sql-schema/src/schema_diff.rs:6862-6873 | crates/dbx-sql-schema/src/schema_diff.rs:6889-6900 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:6811\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6811}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25a4b7b78ae2754cafe7a3c86107f65843cde715907b73a5f6bfa0ebfe18848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:207-219 | agents/drivers/duckdb/src/sql.rs:332-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/sql.rs:207\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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46fd1e272d1162266845e9bafe0862d2709d4cb2e7dac643653ab573c02e6a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:405-416 | crates/dbx-sql-core/src/sql.rs:3777-3789 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-sql-core/src/sql.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/sql.rs:405\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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6359ce8260cdf45638e060e01ecf71cdcc038fde307bdd93cb47c4eab9234f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:3627-3639 | crates/dbx-ai-provider/src/ai.rs:3697-3705 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3627\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3627}}}],"partialFingerprints":{"codehealthFindingId/v1":"af884ecd60a592325e26dbff200627ce2abc8de31969f77884d39fcbcd7b53be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:4171-4183 | crates/dbx-ai-provider/src/ai.rs:4900-4912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:4171\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4171}}}],"partialFingerprints":{"codehealthFindingId/v1":"951e49b6e4c052c275b6dc212a7c530b6a0d3697a4c68e0dfd064fe4ca7dba44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:262-274 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:336-348 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb3e1e413ef2d8522cbadf94a71deb6036aedc91066196b676c6474ddc9074e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:370-382 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:481-493 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:370\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"5264ebd06623686adf5a829238f110c140fb8394a0312394b57e21407c96b1eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:588-609 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:830-851 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs:588\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cff588edd848b49619e4bc59b3f02f1a60b71d73665885f86a86aafabb772b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201313 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:3816-3828 | src-tauri/src/commands/connection.rs:1893-1894 | src-tauri/src/commands/connection.rs:2476-2488 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3816\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src-tauri/src/commands/connection.rs:2490\u0060 calls \u0060is_some\u0060 and \u0060crates/dbx-core/src/connection/mod.rs:3830\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3816}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7761d9196d9d88e2dbdc9322ce6fcb8eb7cec8b0f4275a9dbc42f7fc1ef94f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:5641-5653 | crates/dbx-core/src/data/database_export.rs:5659-5671 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:5641\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5641}}}],"partialFingerprints":{"codehealthFindingId/v1":"d473f0fc4528599c3dbb82ec802c8b18404409740758f16b06d036f9c5cbb2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:8475-8487 | crates/dbx-core/src/data/table_import.rs:9006-9018 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/data/table_import.rs:8474\u0060 calls \u0060excel_path_streams_incrementally\u0060 and \u0060crates/dbx-core/src/data/table_import.rs:9004\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":8475}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde5509a76957778eac7c915fe394154d725d7d86356965b51b8220b4e270f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:5710-5722 | crates/dbx-core/src/data/transfer.rs:5863-5874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5710}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee1523f3d1e8cd711e61534d13bf10727185baa1f51c61fdb2c527fe7e307e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:5943-5955 | crates/dbx-core/src/data/transfer.rs:5994-6006 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:5943\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5943}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aea2a0d63dc5de48df2c1d6110b822c22b21edb330a8cc160ad23bf5f337dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-core/src/data/transfer_runner.rs:152-164 | crates/dbx-core/src/data/transfer_runner.rs:207-219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer_runner.rs:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d94ef86035d782dad6a8df927b7d45c9896e2b75470a3d81b0a251ae899af61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:1124-1136 | crates/dbx-core/src/query/mod.rs:1152-1164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:1124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cc95b6f2953a0e8509baf93402a9ef285444728c282153cd3b7686a9931aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:1180-1192 | crates/dbx-core/src/schema/mod.rs:1204-1216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:1180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c98ba1e60061602cfc661ad2079c5c6509d32d026713f78b340d8eabef5fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:9867-9879 | crates/dbx-core/src/schema/mod.rs:9903-9915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:9867\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":9867}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f37507dcbb4da313a8b07363a0f60dacb185709e821d840b22240fc82cc085a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:10251-10263 | crates/dbx-core/src/schema/normalization.rs:127-139 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10251}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4435ec18f694b766e114b53f314460327eecfabb9f5bc105043249dd3da08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:4555-4567 | crates/dbx-driver-postgres/src/postgres.rs:5186-5193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":4555}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80a2e96afe3f2068bb2311c4870ad9d153dc765909a721de8a4914207315282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-driver-support/src/ddl_scan.rs:74-86 | crates/dbx-driver-support/src/ddl_scan.rs:111-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-support/src/ddl_scan.rs:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/ddl_scan.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb76fef95c364df0add5218c84ae20c8b51db26898d62180dd5222ec0b8a85c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/dbx-drivers/src/db/sqlite_worker.rs:677-688 | crates/dbx-drivers/src/db/sqlite_worker.rs:698-710 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/sqlite_worker.rs:677\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite_worker.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bd152f5c079fe6cf7f7a111785332e55ae4a2126c91e55a7c1ed4d6a444723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-drivers/src/db/ssh_tunnel.rs:1023-1035 | crates/dbx-drivers/src/db/ssh_tunnel.rs:1038-1050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/ssh_tunnel.rs:1023\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc974f6c0b98a54dd8cca186933fe8538f2b55ea83bb635cb53ed034e1503ebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/dbx-mcp/src/server.rs:2443-2455 | crates/dbx-mcp/src/server.rs:2516-2526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:2443\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"34430342c687d4bb8f399b6a36ff19831812ff0899eac1c0ce66a29389e37876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-mcp/src/server.rs:4038-4050 | crates/dbx-mcp/src/server.rs:4383-4395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:4038\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4038}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d72fc240483caf6ebb11bfbd7951504f63cc900c17e965db3d21b8a870c5fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:27-39 | crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:104-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:27\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_neo4j_sql.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9a33a63a21c3790dadd6b49bb411ffcbd9e0e25b24a68adbc3de2dbfd6c632"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:337-349 | crates/dbx-sql-schema/src/table_structure_sql/columns.rs:701-713 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:337\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2412cc7e91bf3e71e18726efcd04735d2921303d4bdacfa162431c6695fd533"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-tauri-schema/src/commands.rs:267-279 | crates/dbx-tauri-schema/src/commands.rs:380-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-tauri-schema/src/commands.rs:267\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-tauri-schema/src/commands.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"60009a48354a522a6a29129ea8edf8f2ad2beda1e7efb9245da54b5974d68bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-web/src/routes/etcd.rs:401-413 | src-tauri/src/commands/etcd_cmd.rs:266-278 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/etcd.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dd41d5775173803a170153630acc431c23fb835edaa3edc61207105da637b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-web/src/routes/etcd.rs:443-455 | src-tauri/src/commands/etcd_cmd.rs:299-311 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/etcd.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfabe15fcede176863560233afb8417905e8b640fd7961ba340def0a02fc5d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/dbx-web/src/routes/sql_file.rs:521-533 | src-tauri/src/commands/sql_file.rs:348-358 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/sql_file.rs:521\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/sql_file.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"23186073429048225fae819969dfb420a8f9e72598408b65b72f71110e874841"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src-tauri/src/commands/mcp_bridge.rs:1814-1826 | src-tauri/src/commands/mcp_bridge.rs:2077-2089 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/mcp_bridge.rs:1814\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":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc312bea3bb55fd21bf02319791faa9b1f7c857b0e1d46cc05ae6fd783f1c3e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src-tauri/src/commands/mcp_bridge.rs:2169-2181 | src-tauri/src/commands/mcp_bridge.rs:2411-2423 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/mcp_bridge.rs:2169\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":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"052e808549cedfbc833c8ccdee08f89be48891635fac8979b4a07e86a83fda51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/dbx-core/src/data/query_result_export.rs:1729-1740 | crates/dbx-core/src/data/query_result_export.rs:1994-2005 | crates/dbx-core/src/data/query_result_export.rs:2231-2242 | crates/dbx-core/src/data/query_result_export.rs:2435-2446 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1729\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"2758f2c16ec7b3de1ca7e013281bbf853b6fa26d05cee3f01f00596a96e53654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): crates/dbx-core/src/data/query_result_export.rs:1823-1833 | crates/dbx-core/src/data/query_result_export.rs:2122-2132 | crates/dbx-core/src/data/query_result_export.rs:2331-2341 | crates/dbx-core/src/data/query_result_export.rs:2536-2547 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1823\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa091fc30d5f52709c3334931b5c674a8b30f08bd97b3b65a60b5f7dbe7795e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/dbx-driver-elasticsearch/src/lib.rs:2018-2031 | crates/dbx-drivers/src/db/couchdb_driver.rs:492-505 | crates/dbx-drivers/src/db/solr_driver.rs:856-869 | crates/dbx-sql-core/src/query_execution_sql.rs:802-815 \u2014 before extracting anything, compare \u0060crates/dbx-driver-elasticsearch/src/lib.rs\u0060 and \u0060crates/dbx-drivers/src/db/couchdb_driver.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2018}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb70dca4a3888a969db605ba69aff39b12dae1621996b7db305ccf6ed2a7eb93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/dbx-mcp/src/server.rs:2436-2447 | crates/dbx-mcp/src/server.rs:2509-2520 | crates/dbx-mcp/src/server.rs:2576-2587 | crates/dbx-mcp/src/server.rs:2611-2622 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:2436\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040840f1e2c4f38f44434dfe9c3ffdbc6f8fda988032b062071798c691ec643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): agents/drivers/duckdb/src/sql.rs:90-101 | crates/dbx-core/src/data/transfer.rs:6314-6325 | crates/dbx-drivers/src/db/duckdb_sql.rs:106-117 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-drivers/src/db/duckdb_sql.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 169 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/sql.rs:90\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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2d9c9c91f3b1bff5cc273d56c0ee733c0a58ca0d0afbca239478938c005bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): agents/drivers/duckdb/src/sql.rs:403-413 | crates/dbx-core/src/data/table_import.rs:2271-2280 | crates/dbx-sql-core/src/sql.rs:3775-3786 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-sql-core/src/sql.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/sql.rs:403\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab284aeff1706292a97cc939fa48ab0c89750da3ba6ae4947f53f8dea888ad87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): crates/dbx-core/src/data/query_result_export.rs:1686-1709 | crates/dbx-core/src/data/query_result_export.rs:1893-1916 | crates/dbx-core/src/data/query_result_export.rs:2188-2211 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"21990abab531f4604b5f79c584a37f770ca52112dc3faabab89ec5f309d29e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:379-390 | crates/dbx-web/src/routes/mcp_policy.rs:61-72 | src-tauri/src/commands/mcp_bridge.rs:1569-1580 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f20a989da1f8db33c099b509343b0b6aa1dd5d5ea30acdb674cfaa61711cfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:2591-2602 | crates/dbx-ai-provider/src/ai.rs:4227-4238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb23a1212ed73ad4c4b0eb7868473ac3eaad1d1fc46b1bc7e490d81540378ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:356-367 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:453-463 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d32d76223d612ac746c6b306baf6d9e5b4ac0f140c86055ad05c9ed350fd36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-cli/src/main.rs:484-495 | crates/dbx-cli/src/main.rs:524-535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/main.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a45e6e1a0dc85ff0c3e6f619dc3f17e49b90057c4948121eabcf61db80b2e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/dbx-core/src/admin/nacos/batch.rs:297-308 | crates/dbx-core/src/admin/nacos/http.rs:1226-1235 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/batch.rs:297\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/batch.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6a93a398df0ca6edb14bf305ab8e1e57541784d60d17913df3927e5f4e47c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:1381-1392 | crates/dbx-sql-data/src/data_grid_sql.rs:3729-3740 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/data/database_export.rs\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec21ed584d53f2c498307598a8e66651685b4552fbfc1224d60a319aad63cee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:5729-5740 | crates/dbx-core/src/data/database_export.rs:6404-6415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:5729\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5729}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc34d5c30457483d05d49bc53ecc5152f3b43b773c55005861fe97dd310fe18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:5816-5827 | crates/dbx-core/src/data/database_export.rs:5926-5936 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:5926\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5816}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f92f9f31174514742e0dac18a038e50f01b6a8e81d07a81fb496288c290aa6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-core/src/data/query_result_export.rs:2298-2309 | crates/dbx-core/src/data/query_result_export.rs:2500-2511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:2298\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"455a6ce904017b6b0e6bd89deffce5018ef38a334eaa7467537186c382f407d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-core/src/data/sql_file_import.rs:327-338 | crates/dbx-core/src/data/sql_file_import.rs:3135-3146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf182dc783e34f5fbbecfbbb263bfdc66e6d854f6ca610e59dab28defcaa7e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:10537-10548 | crates/dbx-core/src/data/transfer.rs:10641-10652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:10537\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10537}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f745b299294eda647cce8f19f2a67c6f2a489e22e0e9c55f0b4b6e3ab4f7e60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-core/src/data/transfer_runner.rs:314-325 | crates/dbx-core/src/data/transfer_runner.rs:359-370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer_runner.rs:314\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52dfd751bd2dcf583ac2197a75416b4e9e6b13dbaeb61c0cc6a389c17afe2bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201330 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:3839-3868 | crates/dbx-core/src/persistence/storage.rs:4033-4057 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":3839}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db22dd508878ed0548ac57aa8b8fbdd2842c6eeef19f4a74775bdfa5a20c3d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:4831-4842 | crates/dbx-core/src/persistence/storage.rs:4939-4950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:4831\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4831}}}],"partialFingerprints":{"codehealthFindingId/v1":"967414af05e58fc69b3a15885ae3e58ed1ef60b02b3e9eabbe90b81318045c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:7747-7758 | crates/dbx-core/src/persistence/storage.rs:7807-7818 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:7747\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":7747}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7705869ff0b7945f72a20cc4df9eb60407cf3b7ab719525bf8f5d2c5653d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:2273-2284 | crates/dbx-core/src/query/mod.rs:2293-2304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:2273\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":2273}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edb1d6327949c2b42c7a27f0192b6a9c58da75eebbfdd98d2bf1fc7a3bf0173"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/dbx-driver-agent/src/agent_service.rs:1255-1266 | crates/dbx-driver-agent/src/agent_service.rs:1291-1301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-agent/src/agent_service.rs:1255\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":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6998708b975154c37d6f8276051671f56a6404dbb704064aa129b4c3142040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-agent/src/agent_service.rs:2712-2723 | crates/dbx-driver-agent/src/driver_delta.rs:140-151 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a5e6302fb36f0e3e4ea855878e50f55ebe04c551457196cdb858aaf2235190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-elasticsearch/src/lib.rs:1780-1791 | crates/dbx-drivers/src/db/solr_driver.rs:445-456 \u2014 before extracting anything, compare \u0060crates/dbx-driver-elasticsearch/src/lib.rs\u0060 and \u0060crates/dbx-drivers/src/db/solr_driver.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"a662815080b22108aaeed03b76ffbc1dfae0e565a863756fa4949be7f810e611"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_oidc.rs:64-75 | crates/dbx-drivers/src/salesforce_oauth.rs:143-154 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_oidc.rs\u0060 and \u0060crates/dbx-drivers/src/salesforce_oauth.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b22434e18e4d77902cb36a41b0ff7f0cab39fd1a9a36438cfac6510370ce6ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:2433-2444 | crates/dbx-driver-postgres/src/postgres.rs:3598-3609 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mysql/src/mysql.rs\u0060 and \u0060crates/dbx-driver-postgres/src/postgres.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:2433\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba412d9f021684e8c23d361f9dd93ffa92b1ef8356ff5e15267e53ca1b9b62f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:6093-6104 | crates/dbx-driver-mysql/src/mysql.rs:6462-6473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:6093\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6093}}}],"partialFingerprints":{"codehealthFindingId/v1":"100f685ff8a2e4565a7bedd14b5fe8727e8465fad0fa19ea5558e3dfe876d1fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:2687-2698 | crates/dbx-driver-postgres/src/postgres.rs:2719-2730 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:2687\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25cd9cef6ca39b1acc0a52c0d7d2a1d26e0587ccdf2c8b735bc89295cab2415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:9550-9561 | crates/dbx-driver-postgres/src/postgres.rs:9603-9614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:9550\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":9550}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a67183a7cf17cbf86866e387fa4b7183c1eb31ae716fc9591ab40904087727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-drivers/src/db/dynamodb_driver.rs:845-858 | crates/dbx-drivers/src/db/dynamodb_driver.rs:905-918 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/dynamodb_driver.rs:845\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0523f5ff85dd52e4a82d05f8120d07b1fb94cc9bd1845e11a461e2b43cd50c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/dbx-drivers/src/db/rqlite_driver.rs:129-153 | crates/dbx-drivers/src/db/turso_driver.rs:190-214 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/turso_driver.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 255 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/rqlite_driver.rs:129\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/rqlite_driver.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3227a951637bc672dc2441b79aeb6b96c5747fa31d6dd1f787a5ef335f34b7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/dbx-drivers/src/db/ssh_tunnel.rs:1858-1866 | crates/dbx-drivers/src/db/ssh_tunnel.rs:1918-1929 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/ssh_tunnel.rs:1858\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"86828a82d52b6e4add091e4f9f712bbbcc5e6dc177646cb60fbe99ab434d8904"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs:198-210 | crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs:796-808 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs:198\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb713f364b984384d7cb7e022f76f7e6d3bd5b75391826d35b4c7b3f123fc2de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-sql-core/src/sql_analysis.rs:648-659 | crates/dbx-sql-core/src/sql_analysis.rs:676-687 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"b602e81d9b583f3f0ea918391928db757c1f28d968b4048e31c1ff12526a4430"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-sql-core/src/sql_editability.rs:515-526 | crates/dbx-sql-core/src/sql_editability.rs:631-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/sql_editability.rs:515\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"6826e01ab88519fe4a5e2dfc716118331636be765b3de31ed9d90104f77fa099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:594-605 | crates/dbx-sql-data/src/query_result_sql.rs:3090-3101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/query_result_sql.rs:594\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-sql-data/src/query_result_sql.rs:3089\u0060 calls \u0060Some\u0060 and \u0060crates/dbx-sql-data/src/query_result_sql.rs:593\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62c51f3fda277b8e56ea80019b0cf81c39803a8caf9c8b17e4707c8d6e416fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:1365-1376 | crates/dbx-sql-data/src/query_result_sql.rs:2892-2903 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/query_result_sql.rs:1365\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9e04b4a0c0014fbbb6efdea4ca04d3b11e5fc92801761c2074b9f768867b8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-web/src/routes/etcd.rs:379-390 | crates/dbx-web/src/routes/etcd.rs:424-435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/etcd.rs:379\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/etcd.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35f21e0c2b8ba1e68072dc1066b30cf728168d93873e281e58516a4a86d0a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-web/src/routes/query_result_export.rs:79-91 | src-tauri/src/commands/query_result_export.rs:334-346 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/query_result_export.rs:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query_result_export.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cdcac203c58c80fcf0bc71d2d94bb025de05aad125c774cda00ccc540ce121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): plugins/sdk/packager/src/main.rs:87-99 | plugins/sdk/packager/src/main.rs:213-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/sdk/packager/src/main.rs:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/packager/src/main.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"898cbcb9e10077d159536d54d55c79091c8bdfe5f9d15bdf76f83f95bd660e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src-tauri/src/lib.rs:3371-3383 | src-tauri/src/lib.rs:3386-3398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/lib.rs:3371\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":"src-tauri/src/lib.rs"},"region":{"startLine":3371}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdba3e2ebf6c3aa0bf284c4d8099a0fc66e3dc4d6e22e3a103c5fa6e881afb4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 13): src-tauri/src/commands/mcp_bridge.rs:2536-2546 | src-tauri/src/commands/mcp_bridge.rs:2555-2565 | src-tauri/src/commands/mcp_bridge.rs:2587-2597 | src-tauri/src/commands/mcp_bridge.rs:2615-2625 | src-tauri/src/commands/mcp_bridge.rs:2634-2644 | src-tauri/src/commands/mcp_bridge.rs:2655-2665 | src-tauri/src/commands/mcp_bridge.rs:2689-2699 | src-tauri/src/commands/mcp_bridge.rs:2717-2727 | src-tauri/src/commands/mcp_bridge.rs:2749-2759 | src-tauri/src/commands/mcp_bridge.rs:2781-2791 | src-tauri/src/commands/mcp_bridge.rs:2805-2815 | src-tauri/src/commands/mcp_bridge.rs:2836-2846 | src-tauri/src/commands/mcp_bridge.rs:2875-2885 \u2014 all 13 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/mcp_bridge.rs:2536\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":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba5e892b3e3d99a461dba970322bef86b73e75493dab0dfb1e84d00e837f87f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/dbx-ai-provider/src/ai.rs:4023-4033 | crates/dbx-ai-provider/src/ai.rs:4176-4186 | crates/dbx-ai-provider/src/ai.rs:4722-4732 | crates/dbx-ai-provider/src/ai.rs:4905-4915 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:4023\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4023}}}],"partialFingerprints":{"codehealthFindingId/v1":"3344c1902d8a9780898dc5f3877be9328051d8cf8e618751b9d853dcd1c7ef25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/dbx-core/src/data/transfer.rs:10200-10210 | crates/dbx-core/src/data/transfer.rs:10448-10458 | crates/dbx-core/src/data/transfer.rs:10597-10607 | crates/dbx-core/src/data/transfer.rs:10694-10704 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:10200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2804f91410f7c804c47217aed6351a012746df05eb4dd8dfb23773899cccb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/dbx-core/src/query/mod.rs:5508-5519 | crates/dbx-core/src/query/mod.rs:6214-6225 | crates/dbx-core/src/query/mod.rs:6549-6560 | crates/dbx-driver-postgres/src/postgres.rs:10087-10097 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:5508\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":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15359d7824d761d039362cb1c23a7cecb6adcd47b8d1c5626e7d7e93d32d3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/dbx-ai-provider/src/ai_codex_cli.rs:404-414 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:386-396 | src-tauri/src/commands/mcp.rs:1605-1614 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_pi_agent_cli.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs:404\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060script\u0060 to \u0060\u0026str\u0060 in one and \u0060\u0026str) -\u003E (String\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"1824c221160170900528b617f1a3aa7bfb59cd516a4570ccdaf869d49df0a58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:3830-3838 | src-tauri/src/commands/connection.rs:1896-1906 | src-tauri/src/commands/connection.rs:2491-2499 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src-tauri/src/commands/connection.rs:2490\u0060 calls \u0060is_some\u0060 and \u0060crates/dbx-core/src/connection/mod.rs:3829\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3830}}}],"partialFingerprints":{"codehealthFindingId/v1":"e350e6a490c5e124c6b73fbc5f998c888fc49e66b0cff5a566867831cad8ada4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:8785-8795 | src-tauri/src/commands/connection.rs:2064-2072 | src-tauri/src/commands/connection.rs:2641-2649 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8785}}}],"partialFingerprints":{"codehealthFindingId/v1":"c281661d8f421bd0b21af3cd405e7a82a4b6af641a29de68ede89d970b84797e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/dbx-core/src/data/database_export.rs:5730-5740 | crates/dbx-core/src/data/database_export.rs:6323-6333 | crates/dbx-core/src/data/database_export.rs:6405-6415 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:5730\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5730}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7fb420e0d10ab0ebd6724d56a57ca8b3cf54e4932026d1566df21d8e075039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/dbx-core/src/query/mod.rs:3499-3509 | crates/dbx-core/src/query/mod.rs:3526-3536 | crates/dbx-core/src/query/mod.rs:3706-3716 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/query/mod.rs:3497\u0060 calls \u0060Err\u0060, \u0060to_string\u0060 and \u0060crates/dbx-core/src/query/mod.rs:3525\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":3499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43d066cc45a363cdaa057a73684839996eb941d844c077eb664979656312264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/dbx-driver-elasticsearch/src/lib.rs:2590-2600 | crates/dbx-drivers/src/db/couchdb_driver.rs:636-646 | crates/dbx-drivers/src/db/solr_driver.rs:1013-1023 \u2014 before extracting anything, compare \u0060crates/dbx-driver-elasticsearch/src/lib.rs\u0060 and \u0060crates/dbx-drivers/src/db/couchdb_driver.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-elasticsearch/src/lib.rs:2590\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060start\u0060 to \u0060std::time::Instant\u0060 in one and \u0060Instant\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15f76ba1805ae1fec86c2763a4f080e3630d2c719f4a79d61d3b71cf8e499ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/dbx-driver-mysql/src/mysql.rs:7902-7912 | crates/dbx-driver-sqlserver/src/sqlserver.rs:4613-4623 | crates/dbx-sql-core/src/sql.rs:3596-3606 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7902}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e651480a733fba441bda6c22c846fe8580a7d46b79de37c06ecc3b1850919e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:678-688 | crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:856-866 | crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:948-958 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:678\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"709da746a249db65a124034577be513c7a8bdda44b123045b1dae95dd96964e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:741-751 | crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:901-911 | crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:1029-1039 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:741\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e163f8bb110f90fc957e3dedb9c7ea719183f0ace3502564034d0f72b879f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/dbx-tauri-schema/src/commands.rs:83-95 | src-tauri/src/commands/document_cmd.rs:17-29 | src-tauri/src/commands/mongo_cmd.rs:17-29 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-tauri-schema/src/commands.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"12aad108c047b06d59010a694fd3f70efeed58b02d76cb6a813744b709b119ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:630-640 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:873-883 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs:630\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"4109dc320def09a5b0d51d5745db058c856eec5e5b9929f8bf857aa3337d6176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:1391-1401 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:1411-1421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:1391\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:1410\u0060 calls \u0060thrift_message_type\u0060, \u0060u8\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:1390\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f614a6383ce720ee1f61bb9fffd4635bb53e92fd09edc00dd319f346a9c215d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/admin/nacos/access_control.rs:182-192 | crates/dbx-core/src/admin/nacos/access_control.rs:206-216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/access_control.rs:182\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b66384b0bf715b2aaeff84acea86b883b9be7201a1569ad81450533a34a5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/ai/plugin_tools.rs:844-854 | crates/dbx-mcp/src/plugin_tools.rs:139-149 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/ai/plugin_tools.rs:844\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_tools.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"d937ad89085228532e5146875e8476c1d57bb106195e5a66b6fb51be8fc21500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/dbx-core/src/connection/jdbc.rs:662-672 | crates/dbx-driver-agent/src/agent_service.rs:132-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/jdbc.rs:662\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4424bf040b32a393ca99c153a575cbac25c661ba21ff69aa9049ec66607b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:6592-6602 | crates/dbx-core/src/connection/mod.rs:7781-7791 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:6592\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":6592}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c438a0ed9d2acae8fa4949bd2229cf16008e758842aff47f1e47e77db8f3ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:8271-8281 | crates/dbx-core/src/connection/mod.rs:8288-8298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e167c3a851a8072aced63dd242d9e71d59efc6f162e305b7c9cd29ada996861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:1667-1680 | crates/dbx-sql-data/src/data_grid_sql.rs:3613-3626 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/data/database_export.rs\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ea346a4a2ab4a2f1fbf0ce9acb14c0ac89e8afb3c3a2f40134349de05c0f55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:6024-6034 | crates/dbx-driver-postgres/src/text_encoding.rs:185-195 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:6024\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":6024}}}],"partialFingerprints":{"codehealthFindingId/v1":"c077ba3a3053f42c04cde10b472173057d02b245387c174e6719bfd599c73af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:9521-9531 | crates/dbx-core/src/data/transfer.rs:9590-9599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/data/transfer.rs:9534\u0060 calls \u0060iter\u0060, \u0060collect\u0060 and \u0060crates/dbx-core/src/data/transfer.rs:9602\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":9521}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a4c34264eb48401a09cfecc3a42c145942c495dac18511d1716861bda23714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:4384-4394 | crates/dbx-core/src/persistence/storage.rs:4551-4561 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:4384\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4384}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6df44f3b7671cf9cc136e0300f1cfcb03e4a4d64bd4dc3c1ac508dd560bcf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:4713-4723 | crates/dbx-core/src/persistence/storage.rs:4780-4790 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:4713\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4713}}}],"partialFingerprints":{"codehealthFindingId/v1":"707292c18fd6701767ff8f1446c6bc8f4b64b872bae5fc86596bc6efd69851dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:8519-8529 | crates/dbx-core/src/persistence/storage.rs:8556-8566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:8519\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc1c46944f4041e0f3ab5da5cabf64305d7577987806a24a251363906cd80e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:1138-1148 | crates/dbx-core/src/query/mod.rs:1166-1176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:1138\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"819a86dec4ba294d7ae881196bd1e0c0eb310f9a22bc7f1549f32b8d6bee8331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/query/redis_ops.rs:1120-1130 | crates/dbx-core/src/query/redis_ops.rs:1159-1169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/redis_ops.rs:1120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"61596b365083ed5d53e3ee0989220e373d8f639dfd995c4ca516e7c19059b5b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/operations/observation.rs:262-272 | crates/dbx-core/src/schema/native_jobs/operations/observation.rs:280-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/native_jobs/operations/observation.rs:262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/observation.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0522d9c889f8ca8647dd0af8c62e66bd34923cc6391a69cda754b27fb7f41fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:2152-2162 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2175-2185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2152\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2151\u0060 calls \u0060Err\u0060 and \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2174\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cf1f752b485f52ba8cd34fcfe9e0db172b6a88233c01120671463af9dcf029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:1480-1490 | crates/dbx-driver-mysql/src/mysql.rs:1519-1527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea96f3253e4d19c70cc3898d73b89ead78056ba6b82031c2f5207d6397dc925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:2409-2419 | crates/dbx-driver-mysql/src/mysql.rs:3035-3044 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:2409\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2777b117b2d1c4f23a41dc1532b2d08d5c9a47ba0753876e890cad91561676be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:3084-3099 | crates/dbx-driver-mysql/src/mysql.rs:3122-3137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:3084\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7f46fc3608ea8c35db913a0bf56d234a36991538d5472ef905b19f35a31c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:5647-5657 | crates/dbx-driver-mysql/src/mysql_compatible.rs:202-212 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:5647\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5647}}}],"partialFingerprints":{"codehealthFindingId/v1":"6743bc771ebb4ca394649b8e6853bb1440811b636f83f28a5237007c69dc78e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-driver-redis/src/lib.rs:3324-3334 | crates/dbx-driver-redis/src/lib.rs:3451-3461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4428f9ade290bb64a96edf14f83c06d824226afd29e675e98b390225295e03fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-driver-sqlserver/src/sqlserver.rs:1916-1926 | crates/dbx-sql-data/src/query_result_sql.rs:3167-3177 \u2014 before extracting anything, compare \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs\u0060 and \u0060crates/dbx-sql-data/src/query_result_sql.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs:1916\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d8c8d83feb5cce61a59325e8f13d565d1ac505cc86f1ac648f747c617cfaf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-drivers/src/db/proxy_tunnel.rs:381-391 | crates/dbx-drivers/src/db/proxy_tunnel.rs:412-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/proxy_tunnel.rs:381\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/proxy_tunnel.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac22db017cdff1be358e16f2d1f937443bf3f726d705f7fe22ec9c0fdabbcdec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-drivers/src/db/rqlite_driver.rs:329-340 | crates/dbx-drivers/src/db/turso_driver.rs:423-433 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/turso_driver.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 255 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/rqlite_driver.rs:329\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":"crates/dbx-drivers/src/db/rqlite_driver.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8baebaf77aec9ea3f778f30033c163dc4e09d8fcb501a4bfc824ddca6947445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-mcp/src/backend.rs:1322-1332 | src-tauri/src/commands/app_settings.rs:282-292 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/backend.rs:1322\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060plugin_id\u0060 to \u0060\u0026str\u0060 in one and \u0060String\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55f44f0309488e048d425f25179a032a8bc01b9cc35f9fe4d91bd03e314552f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-mcp/src/server.rs:2839-2849 | crates/dbx-mcp/src/server.rs:4440-4450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28ed2e8bbe35aae83baac860ff9253982ea1bca301741e6923136012676fa3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-mcp/src/server.rs:5551-5561 | crates/dbx-mcp/src/server.rs:5763-5773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:5551\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5551}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a746b0ecd077188bb51a645885380db05fb23af472456646349a9bf80500de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-mcp/src/session.rs:103-113 | crates/dbx-mcp/src/session.rs:123-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/session.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4e3bce89826cbce71378969b2eb6f45950813dd43c9bf79c942e24bbcb8fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_extractors/json.rs:22-32 | crates/dbx-sql-data/src/data_grid_extractors/json.rs:41-51 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/json.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"adeaeb62d85b7b8869ae295b2818ff991641c8b70f072fefd768ccf490251617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:1689-1698 | crates/dbx-sql-data/src/query_result_sql.rs:2004-2014 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/query_result_sql.rs:1689\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5284f2ecd69093e2e97c7b5450c484445f8d5152f901bb6aa25284b04fa01b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:636-646 | crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:882-892 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs:636\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/descriptor.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"539e22620554e5980bf65b177dab2e0d49582c12ce682abaa4c1a371324c0520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:920-930 | crates/dbx-sql-schema/src/schema_diff.rs:998-1007 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef936cbb7f5e05ed4ed5de1fcfd5c3ceb15a7f5e93f87c95012fd9b190239de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:1036-1045 | crates/dbx-sql-schema/src/schema_diff.rs:1048-1058 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c01beea254ac74f6f48c2cea5258ebd760e188d59bad246a9eaab9832c28cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-types/src/models/connection.rs:1471-1481 | crates/dbx-types/src/models/connection.rs:1766-1776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-types/src/models/connection.rs:1471\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"739c1ac8cc33bb0b68d384a28d7bd1b2839ba8121e5046c2cf78cda5eb62407d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-web/src/routes/agents.rs:453-463 | src-tauri/src/commands/agents.rs:330-340 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/agents.rs\u0060 and \u0060src-tauri/src/commands/agents.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060state\u0060 to \u0060\u0026dbx_core::connection::AppState\u0060 in one and \u0060\u0026AppState\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/agents.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be2f2b083fb2680c201b56d87dc91cd97065267f8c7734a3ed1490d209e8a4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-web/src/routes/agents.rs:505-515 | src-tauri/src/commands/agents.rs:343-353 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/agents.rs\u0060 and \u0060src-tauri/src/commands/agents.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060state\u0060 to \u0060\u0026dbx_core::connection::AppState\u0060 in one and \u0060\u0026AppState\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/agents.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffc6a7fcb4296b1eb0dce31f4b7af61256ea39e87fa05b848510a22fc8d3735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-web/src/routes/ai.rs:443-453 | crates/dbx-web/src/routes/ai.rs:566-576 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/ai.rs:443\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/ai.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"805771ff5a603789f2694c17ccbb96558a7a1c75017d097b3cd6f69e450580e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/dbx-web/src/routes/connection.rs:521-530 | crates/dbx-web/src/routes/connection.rs:711-721 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4276178b1981b85861463c60105a55a21931e4c5dc8d1b23c47363533d5d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/dbx-web/src/routes/connection.rs:1043-1053 | crates/dbx-web/src/routes/connection.rs:1184-1193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/connection.rs:1043\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d9cc732d388f2a5e1c117fb346e986614da39cf14e92b18cc54d75ad2167d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): crates/dbx-web/src/routes/database_export.rs:43-53 | crates/dbx-web/src/routes/table_export.rs:40-46 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/database_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/database_export.rs:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/database_export.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ab1a90c2549b8f47b4641dc633f80c8d7a5632fa9536fd7a2cc40b90488548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-web/src/routes/export_download.rs:47-58 | crates/dbx-web/src/routes/nacos.rs:995-1006 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/nacos.rs:995\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/export_download.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2837ca11ec7febe07e9094032717d6a495ae4baff02c03fd7e400024fb44374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-web/src/routes/mcp_policy.rs:18-28 | src-tauri/src/commands/mcp_bridge.rs:1526-1536 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 and \u0060src-tauri/src/commands/mcp_bridge.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mcp_policy.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd537e92c7fa87da8a0fb714774fd34ad1b05c1ea9e57897009de625de58b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-web/src/routes/query_result_export.rs:67-79 | crates/dbx-web/src/routes/table_export.rs:68-80 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/query_result_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/query_result_export.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query_result_export.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4254d32c0ebaaef754c597d10feb44b8dd8989e59b588b198b211993658e5f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src-tauri/src/commands/connection.rs:2442-2451 | src-tauri/src/commands/connection.rs:2784-2794 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/connection.rs:2442\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":"src-tauri/src/commands/connection.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5144c516b4b871c0158ec1e8168f70aa7bbb19c320eb3138953336fb5173ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/dbx-core/src/data/transfer.rs:14741-14750 | crates/dbx-core/src/data/transfer.rs:14765-14774 | crates/dbx-core/src/data/transfer.rs:15086-15095 | crates/dbx-core/src/data/transfer.rs:15110-15119 | crates/dbx-core/src/data/transfer.rs:15144-15153 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:14741\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/data/transfer.rs:15083\u0060 calls \u0060push\u0060 and \u0060crates/dbx-core/src/data/transfer.rs:14738\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14741}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa57dc998c4a32f8f25dbd91acc1ddb2e78ff96878a0746b5c3ce5a38873e655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/dbx-core/src/persistence/storage.rs:5677-5686 | crates/dbx-core/src/persistence/storage.rs:6546-6555 | crates/dbx-core/src/persistence/storage.rs:6569-6578 | crates/dbx-core/src/persistence/storage.rs:6592-6601 | crates/dbx-core/src/persistence/storage.rs:6623-6632 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:5677\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":5677}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7baaae3a088162588d65965e08db0a9dd93278144badc83716df174e52094c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/dbx-core/src/data/query_result_export.rs:1322-1331 | crates/dbx-core/src/data/query_result_export.rs:1439-1448 | crates/dbx-core/src/data/query_result_export.rs:1454-1463 | crates/dbx-core/src/data/query_result_export.rs:1586-1595 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3f44c128e9eaa54630df194d8399a568feef6c6e2af6632ae73aefef2f4aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/dbx-core/src/data/transfer.rs:14717-14726 | crates/dbx-core/src/data/transfer.rs:14741-14750 | crates/dbx-core/src/data/transfer.rs:14765-14774 | crates/dbx-core/src/data/transfer.rs:14794-14803 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:14717\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14717}}}],"partialFingerprints":{"codehealthFindingId/v1":"91445a784c7fb5002c1e5eb479aef97594116b7d0498c63f65ca4617216d3489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/dbx-sql-schema/src/schema_diff.rs:3800-3809 | crates/dbx-sql-schema/src/schema_diff.rs:4105-4114 | crates/dbx-sql-schema/src/schema_diff.rs:4228-4237 | crates/dbx-sql-schema/src/schema_diff.rs:4297-4306 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:3800\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060source\u0060 to \u0060\u0026[IndexInfo]\u0060 in one and \u0060\u0026[TriggerInfo]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":3800}}}],"partialFingerprints":{"codehealthFindingId/v1":"7173ef583ea66bd3adf8c04aca836ee6a7e2d04fbb79110951589ba86c2f1bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:262-271 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:336-345 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:754-763 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4802bbf5f4722c8f4ac2563738ec6d30a462db2fcf86e126d59bc03e795bafb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:3907-3916 | src-tauri/src/commands/connection.rs:1997-2006 | src-tauri/src/commands/connection.rs:2578-2587 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3907\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3907}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b32116580318dcdb636c8a1e2534bf1c30ccabe638cf29b63c8715dc88fd9a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:6589-6598 | crates/dbx-core/src/connection/mod.rs:7745-7754 | crates/dbx-core/src/connection/mod.rs:7778-7787 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:6589\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/connection/mod.rs:7755\u0060 calls \u0060remove_pool_owners\u0060 and \u0060crates/dbx-core/src/connection/mod.rs:6599\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":6589}}}],"partialFingerprints":{"codehealthFindingId/v1":"8513895176b672e1347eb4e6bc2342d49d49bf87b2a851081f1c0f3bcfac5cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-core/src/data/query_result_export.rs:1675-1684 | crates/dbx-core/src/data/query_result_export.rs:1871-1880 | crates/dbx-core/src/data/query_result_export.rs:2177-2186 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1675\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4a835c7ebab724d791bfcce2560a58fe84a468d3d3158f494139b6178e2f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-core/src/data/transfer.rs:15006-15015 | crates/dbx-core/src/data/transfer.rs:15097-15106 | crates/dbx-core/src/data/transfer.rs:15155-15164 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:15006\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":15006}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee052982845b832a28a7535062448fad3394fc13a125115e9e58329653af906"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/dbx-core/src/persistence/storage.rs:4711-4720 | crates/dbx-core/src/persistence/storage.rs:4778-4787 | crates/dbx-core/src/persistence/storage.rs:5003-5011 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0156ce46afb2ebd2dee5b62be3474cb558fb003e86db7872e9d3d5d050e5c398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-core/src/persistence/storage.rs:8523-8532 | crates/dbx-core/src/persistence/storage.rs:8560-8569 | crates/dbx-core/src/persistence/storage.rs:8618-8627 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:8523\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8523}}}],"partialFingerprints":{"codehealthFindingId/v1":"013b655128a0edc75779c1be550b887ae7f7457061d78752015a1ffbb3ca5c7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-core/src/persistence/storage.rs:8538-8547 | crates/dbx-core/src/persistence/storage.rs:8575-8584 | crates/dbx-core/src/persistence/storage.rs:8633-8642 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:8538\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8538}}}],"partialFingerprints":{"codehealthFindingId/v1":"496f2b8067081a3ce7f996ed811da1eae3d130b276a81b776103c38125ac1937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:428-437 | crates/dbx-web/src/routes/mcp_policy.rs:110-119 | src-tauri/src/commands/mcp_bridge.rs:1618-1627 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b3a64ef8d330464abdd8a16cab757e25a815a859b425ef3113bcf7d93af541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-driver-redis/src/lib.rs:751-760 | crates/dbx-driver-redis/src/lib.rs:1061-1070 | crates/dbx-driver-redis/src/lib.rs:1097-1106 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-redis/src/lib.rs:751\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eba0cfe7eaed1073d2dd85fc43eeec8c1ce7386618dbfc3dc14d34d49ae2b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-sql-data/src/query_result_sql.rs:1365-1374 | crates/dbx-sql-data/src/query_result_sql.rs:1431-1440 | crates/dbx-sql-data/src/query_result_sql.rs:2892-2901 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6de36c1e8e8185be2fe35ea1bb685794a126ff23da01aebb150bb7209cf92f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-sql-schema/src/schema_diff.rs:4123-4132 | crates/dbx-sql-schema/src/schema_diff.rs:4265-4274 | crates/dbx-sql-schema/src/schema_diff.rs:4312-4321 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:4123\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060source\u0060 to \u0060\u0026[TriggerInfo]\u0060 in one and \u0060\u0026[SequenceInfo]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":4123}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbe18594825559b54e205ce7ca2a2a4fc53fbbc6ea7f6a5d7409d7cd46e9dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-web/src/routes/query.rs:496-505 | crates/dbx-web/src/routes/query.rs:559-568 | crates/dbx-web/src/routes/query.rs:661-670 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69c72d51ef5930151f84c957d31890c4f07ab575428d5912b022e689f54ebb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/duckdb/src/schema.rs:484-493 | agents/drivers/duckdb/src/schema.rs:534-543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/schema.rs:484\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":"agents/drivers/duckdb/src/schema.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2f1bfb97f4a4da31538d472551a1af8aa2b17c6068f3579c52bb241dfdf0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:4272-4281 | crates/dbx-ai-provider/src/ai.rs:5161-5170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:4272\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4272}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f50426485697a79b02095e460cfda6515a87da8c16378edf9a66cdd7091db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:227-236 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:898-904 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs:227\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:905\u0060 calls \u0060get\u0060, \u0060and_then\u0060, \u0060as_str\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs:237\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"258ca6bf12361ead7674f5ce849c34eb78288e827f313c4c7560d0e520887c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/admin/mqtt/client.rs:523-532 | crates/dbx-core/src/admin/mqtt/client.rs:665-674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mqtt/client.rs:523\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e55b734ff97c1c47de321a0e5a05f388791f5dea5dfa31822f7548d0955bdc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/admin/nacos/http.rs:3156-3165 | crates/dbx-core/src/admin/nacos/http.rs:3172-3181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/http.rs:3156\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":3156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf3113b8b1f51f6589a05a7439959461f6575733225470bde54748e3fb07171"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/connection/jdbc.rs:990-999 | crates/dbx-core/src/connection/jdbc.rs:1070-1079 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/jdbc.rs:990\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee64ad7be75f462a6f2d396d036ee578f1b7f1e0f634360599114dbdbe9d653b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:3083-3092 | crates/dbx-core/src/connection/mod.rs:3124-3133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3083\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3083}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a4968ec0f85548bf752794fbe2d1bddeedadc8a93aa08dddb65bb3c824889d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:3919-3928 | src-tauri/src/commands/connection.rs:2520-2529 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2a8926a544393898eabd8e66fe38c33d88dbf21fc391d8fe529e1bebecfaf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:7863-7872 | crates/dbx-driver-support/src/http_tunnel.rs:143-152 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":7863}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9db5738d5a4975fc3e40db2059fc51d85706592832338a6c8e7eddde543d040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:8235-8244 | crates/dbx-core/src/connection/mod.rs:8276-8285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:8235\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8235}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefb94defd7af3c0113b6f9a0f61a6b1e5457127f7d319afe78cf7e333653001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:1348-1357 | crates/dbx-sql-data/src/data_grid_sql.rs:3374-3383 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/data/database_export.rs\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:1348\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-sql-data/src/data_grid_sql.rs:3371\u0060 calls \u0060get\u0060 and \u0060crates/dbx-core/src/data/database_export.rs:1345\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"779baae9772c66cd313383275b48cc483abc49df46b04a48d3985acabf59d23e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/data/query_result_export.rs:1437-1446 | crates/dbx-core/src/data/query_result_export.rs:2312-2321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1437\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7969bb970392ec53c2475690357b7f6707aaba8e2ab9ebb906f7d2f96760be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/data/sql_file_import.rs:914-923 | crates/dbx-core/src/data/sql_file_import.rs:1018-1027 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da30af7c20985e823b104df7e629a0bf69780099fb827f289f9c8fc0815d74e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:3990-4000 | crates/dbx-core/src/data/table_import.rs:4019-4029 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3990}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d9a8d97ff2610a942861c1968c510413c25b181435c5029bf870c035de1f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:7359-7368 | crates/dbx-core/src/data/transfer.rs:7238-7247 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:7359\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":7359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec45d4f36887537c089ca7793a9a4174b9f2009ea894b04f2b8736f79840d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:5705-5714 | crates/dbx-core/src/data/transfer.rs:5836-5845 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5705}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d24f67cf0cf5cb7af83f8518256800cb76d6c59c9aa90b80572c210c43e473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:9518-9527 | crates/dbx-core/src/schema/mod.rs:248-257 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:9518\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":9518}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eccf5e0b79947b752f14ea2e809b89763a8031e4f92f92cb7b172fdc476c91a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:5503-5512 | crates/dbx-core/src/persistence/storage.rs:5534-5544 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:5503\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":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":5503}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef9d2342057d7745978ab186737fc54b780727150c79b1f4edb1e48b2b90a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:10024-10033 | crates/dbx-core/src/persistence/storage.rs:10107-10116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/persistence/storage.rs:10023\u0060 calls \u0060update_app_settings_key_in_tx\u0060 and \u0060crates/dbx-core/src/persistence/storage.rs:10106\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":10024}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78b034a26998531398759a11623271b4fda739da8a22826aeb6aa15e54bea34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:5656-5665 | crates/dbx-core/src/query/mod.rs:6050-6059 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5656}}}],"partialFingerprints":{"codehealthFindingId/v1":"001f3e776448b6dec50f43c2111f05bcc72d4a645d5f40f737dfc86e6eed28e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/query/pl_debug/transport.rs:243-252 | crates/dbx-core/src/query/pl_debug/transport.rs:280-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/pl_debug/transport.rs:243\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/transport.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"947043877adc40ba025c6ad05ce7b4a85344a3ee83e8d1961560be67fb98cfdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:8817-8826 | crates/dbx-core/src/schema/mod.rs:8851-8860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:8817\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8817}}}],"partialFingerprints":{"codehealthFindingId/v1":"765a101a5c8864ca190f6558ea0a3a36d5a5c1200d51de17024647a1118db9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/operations.rs:97-106 | crates/dbx-core/src/schema/native_jobs/operations.rs:133-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/native_jobs/operations.rs:97\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bf61b8a2097ce116cf60cfd0561b68a9a775cbde0aef46a72b70cb9cbdc79d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/operations.rs:494-500 | crates/dbx-core/src/schema/native_jobs/operations/dameng.rs:319-328 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/native_jobs/operations.rs:494\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"09190a85911a53f801f9cccabce962fbf7087c800b1948bf96fb9235ed960d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/operations/scheduler.rs:167-176 | crates/dbx-core/src/schema/native_jobs/operations/scheduler.rs:211-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/scheduler.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e02afa526a89da8352a98b56aaa7460c43bade265d925482234feb9f500d21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/schema/oracle_routines/execution.rs:94-103 | crates/dbx-core/src/schema/oracle_routines/execution.rs:177-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/execution.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d226d3f390326eaac49c2b41db3e9e7b73a4de7a0e3a426938f94cfa545e8b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-agent/src/agent_runtime.rs:435-446 | crates/dbx-driver-agent/src/agent_runtime.rs:468-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_runtime.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7217aa85b8d978d83b92f2ac07c82abee18c639285732612fbbcf44dee997bf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:6125-6134 | crates/dbx-driver-mysql/src/mysql.rs:6334-6343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:6125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6125}}}],"partialFingerprints":{"codehealthFindingId/v1":"af23da0a96d80c522dab639ca83e5b1c39100462bd3a6f7e88889a83e727a3bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:9493-9502 | crates/dbx-driver-postgres/src/postgres.rs:9859-9868 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:9493\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":9493}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfe411545feed84e9fc3418fdef40586d832b9751390a99137b456e5b4bb802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:10890-10902 | crates/dbx-driver-postgres/src/postgres.rs:10946-10958 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:10890\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":10890}}}],"partialFingerprints":{"codehealthFindingId/v1":"4451447b2bf8847282667879f1d70086a999b792840271aef3bc35f243f06629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-driver-redis/src/lib.rs:5342-5351 | crates/dbx-driver-redis/src/lib.rs:5414-5423 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-redis/src/lib.rs:5342\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5342}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb49e1be6a1c8b9c2cbbdbcacc2ecfe9ad514764f56bface3d4915d186ec9177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/dbx-driver-support/src/ddl_scan.rs:50-62 | crates/dbx-sql-data/src/query_result_sql.rs:3151-3164 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/ddl_scan.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"908310890bc534f134e1cf6d2a9f0a628969ae92b7215c574d12af705b25bf6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-mcp/src/server.rs:3740-3749 | crates/dbx-mcp/src/server.rs:3822-3831 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:3740\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3740}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefafeb8f8c55a20ab12b2028212b77098b949784a5b72a945835e63a47fb628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-mcp/src/server.rs:4515-4524 | crates/dbx-mcp/src/server.rs:4545-4554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:4515\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4515}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23c808112537ecf73a4018e7805f641713e107ec1500580638ab68773e7a2eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql.rs:232-241 | crates/dbx-sql-core/src/object_source_sql.rs:2183-2192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql.rs:232\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b810edcda520bc8210647ce1ad73c468263c5228c444f1d8547853f839c8295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-core/src/sql.rs:1007-1016 | crates/dbx-sql-core/src/sql.rs:1794-1803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/sql.rs:1007\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd70e12c95661b722db0049538f29dc41d81eae9dbc164df99e1ccc5afbb77c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-core/src/sql.rs:1892-1901 | crates/dbx-sql-core/src/sql.rs:2006-2015 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/sql.rs:2006\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24901ef09f996dbcc57e0f4dd96bd6c1a3769cf126cbc2981f96074444b8993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-core/src/sql_editability.rs:433-442 | crates/dbx-sql-core/src/sql_editability.rs:631-640 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/sql_editability.rs:433\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae43602576f97e7c68f582ce1049966c2c0400efd3f05ce7acc9f6f000d7ba16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-core/src/value_literals.rs:32-41 | crates/dbx-sql-core/src/value_literals.rs:70-79 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/value_literals.rs:32\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/value_literals.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a4ebb6d7fc378186e78b7e2013e0ad9f76cf899bbfeef4ff944f247e31794f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-core/src/value_literals.rs:100-109 | crates/dbx-sql-schema/src/db_admin_sql.rs:1419-1428 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/value_literals.rs:100\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/value_literals.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1331b7a745c1e269b9514d978450d7ab681f2715a0580cd912b0bd3948ec96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:10-19 | crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:87-96 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:10\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:84\u0060 calls \u0060is_empty\u0060, \u0060Ok\u0060 and \u0060crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:9\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_neo4j_sql.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"829835829702047401bdcdd9f6a367a1a19f00cb34c9c0e56417ea3a360b30a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_sql.rs:2229-2238 | crates/dbx-sql-data/src/data_grid_tdengine_sql.rs:19-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_sql.rs:2229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3706a763bea7329c177f2ad969bab9270a957bb266200fbd29fe1b6e0bdf6ab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-data/src/database_search_sql.rs:256-265 | crates/dbx-sql-data/src/database_structure_search_sql.rs:483-492 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/database_search_sql.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bedef9735aa9d8c520029142fad8c82343c4e1a5287979d49bf539a795bcd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:1815-1824 | crates/dbx-sql-data/src/query_result_sql.rs:1870-1879 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/query_result_sql.rs:1815\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff90b482b916101f3b8cd3108c1ea1d5737d0071e9fb1370bdb87e04cf3d09c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:99-108 | crates/dbx-sql-schema/src/table_structure_sql/create_table.rs:329-338 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e77a49c8dc404e9650db8e92b84214f27a8bd14c4e6ae27c3c9015a26417b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:324-335 | crates/dbx-sql-schema/src/table_structure_sql/columns.rs:688-699 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b1c916c53aa5dc8b082ed9ffe81a609cd2b2212139f55b3ece221f16c570f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-web/src/routes/schema.rs:462-471 | crates/dbx-web/src/routes/schema.rs:505-514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/schema.rs:462\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5a3c55fed9620e92c01833f7b55c6d4609dbcf1e674554959869cde799b4b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-web/src/routes/table_import.rs:330-339 | crates/dbx-web/src/routes/table_import.rs:342-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/table_import.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5770a1c36d3ec0f851cf0cdc559f2ad0e0c93d844f99e08239a9111e1334b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): plugins/sdk/cli/src/lib.rs:1491-1500 | plugins/sdk/packager/src/main.rs:600-609 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"plugins/sdk/cli/src/lib.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"2969978a11ef5239e132e98edf9029df530596b238d56d432ecc6c5d84774955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): plugins/sdk/packager/src/main.rs:183-204 | plugins/sdk/packager/src/main.rs:293-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/sdk/packager/src/main.rs:183\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":"plugins/sdk/packager/src/main.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b76df53665f5ef37e2a1f8f3d249bb9a1bab0edfd694804ef1086f99c40c036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src-tauri/src/lib.rs:2053-2062 | src-tauri/src/lib.rs:2133-2142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/lib.rs:2053\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, \u0060src-tauri/src/lib.rs:2063\u0060 calls \u0060report_window_visibility_probe\u0060, \u0060probe_main_window_visible\u0060, \u0060handle\u0060 and \u0060src-tauri/src/lib.rs:2143\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":"src-tauri/src/lib.rs"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"754e6652da04f9323b6dc285c62bcd0f7e53169c6d32abcf841bf4884acbbf87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): crates/dbx-ai-provider/src/ai.rs:3896-3904 | crates/dbx-ai-provider/src/ai.rs:4150-4158 | crates/dbx-ai-provider/src/ai.rs:4249-4257 | crates/dbx-ai-provider/src/ai.rs:4501-4509 | crates/dbx-ai-provider/src/ai.rs:4874-4882 | crates/dbx-ai-provider/src/ai.rs:5136-5144 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3896\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b218f6180d0453e4884d6b4107691742a4cfea04b92aaf01a7607f7b2363db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/dbx-driver-mysql/src/mysql.rs:6951-6959 | crates/dbx-driver-mysql/src/mysql.rs:7005-7013 | crates/dbx-driver-postgres/src/postgres.rs:2689-2697 | crates/dbx-driver-postgres/src/postgres.rs:2721-2729 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mysql/src/mysql.rs\u0060 and \u0060crates/dbx-driver-postgres/src/postgres.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:6951\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6951}}}],"partialFingerprints":{"codehealthFindingId/v1":"868e74ac78d1b8193c76c95d181b32eb3f374c79a8afafa1d362a81a7c53d7f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/dbx-driver-sqlserver/src/sqlserver.rs:1889-1897 | crates/dbx-driver-sqlserver/src/sqlserver.rs:1903-1911 | crates/dbx-sql-data/src/query_result_sql.rs:2289-2297 | crates/dbx-sql-data/src/query_result_sql.rs:2309-2317 \u2014 before extracting anything, compare \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs\u0060 and \u0060crates/dbx-sql-data/src/query_result_sql.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd9e4063cc58cbb5007bc02d2a96c58cd222984a8160b82a936b601684b3ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-ai-provider/src/ai.rs:4596-4604 | crates/dbx-ai-provider/src/ai.rs:4927-4935 | crates/dbx-ai-provider/src/ai.rs:5189-5197 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:4596\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4596}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d23731fced845d4542830c9cb675207c1fbb85ad12e11ae1bc6796f96c6a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-core/src/admin/nacos/http.rs:3614-3622 | crates/dbx-core/src/admin/nacos/http.rs:3664-3672 | crates/dbx-core/src/admin/nacos/http.rs:3689-3697 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/http.rs:3614\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":3614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a400212037cdda0ec56eac5b20bfcc9d1b0ccf4af899dfc3854e80955391ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-core/src/connection/jdbc.rs:1233-1241 | crates/dbx-plugin-runtime/src/plugins/installer.rs:1264-1272 | plugins/sdk/packager/src/main.rs:625-633 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb60e42e012761f037b7619b41ffd869da478bf783f2947b7c42b0982502126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:3670-3678 | src-tauri/src/commands/connection.rs:2043-2053 | src-tauri/src/commands/connection.rs:2621-2629 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3670\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c187bfc5e80516b8bbc512a937e05f27af7cf4ee11329b320542d583882618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-core/src/data/database_export.rs:556-564 | crates/dbx-core/src/data/database_export.rs:2840-2848 | crates/dbx-core/src/data/database_export.rs:3005-3013 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbba1681608297a679917c452266a3c1ca8da150267be3636030484fd8bfcb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-core/src/data/database_export.rs:1433-1441 | crates/dbx-sql-core/src/sqlserver_temporal.rs:143-151 | crates/dbx-sql-data/src/data_grid_sql.rs:3760-3768 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/data/database_export.rs\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"925fe4c5b71a079ede5c2e65591157ee7c48db738a27d59c4fe6e455630de02f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-core/src/persistence/storage.rs:4742-4750 | crates/dbx-core/src/persistence/storage.rs:4831-4839 | crates/dbx-core/src/persistence/storage.rs:4939-4947 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:4742\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea81373906bec1f3545aa0286a48bd1635750882ad9611d9cb3cf1b0d712ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-core/src/schema/state_calibrator.rs:473-481 | crates/dbx-core/src/schema/state_calibrator.rs:496-504 | crates/dbx-core/src/schema/state_calibrator.rs:507-515 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/state_calibrator.rs:473\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/state_calibrator.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4109aa7f5fc03e9660f471104618d1cbbaedc1328992e015e4690f9c713cae15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/dbx-driver-elasticsearch/src/lib.rs:539-549 | crates/dbx-drivers/src/db/solr_driver.rs:156-166 | crates/dbx-drivers/src/db/vector_driver.rs:1074-1084 \u2014 before extracting anything, compare \u0060crates/dbx-driver-elasticsearch/src/lib.rs\u0060 and \u0060crates/dbx-drivers/src/db/solr_driver.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2649f84a3cea3120df238ac77e45b30653b0f3fcdb6834a84cd6b981e230b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-driver-mysql/src/mysql.rs:2438-2446 | crates/dbx-driver-mysql/src/mysql.rs:3068-3076 | crates/dbx-driver-postgres/src/postgres.rs:3603-3611 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mysql/src/mysql.rs\u0060 and \u0060crates/dbx-driver-postgres/src/postgres.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"66eee683fb4cf51db9fdb070ab7cfbdb582b6bb2636e6a63b24a83a131e18943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/dbx-drivers/src/db/dynamodb_driver.rs:666-674 | crates/dbx-drivers/src/db/salesforce_driver.rs:1216-1224 | crates/dbx-mcp/src/server.rs:6324-6331 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/dynamodb_driver.rs:666\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-drivers/src/db/dynamodb_driver.rs:676\u0060 calls \u0060elapsed\u0060, \u0060as_millis\u0060 and \u0060crates/dbx-mcp/src/server.rs:6332\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"134755dcc7390a13c0458286fd100f3278a22626f8321a8fd73ae6b4865ad7da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/dbx-drivers/src/db/sqlite.rs:1595-1602 | crates/dbx-drivers/src/db/sqlite.rs:2620-2628 | crates/dbx-drivers/src/db/sqlite.rs:2694-2702 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/sqlite.rs:1595\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-drivers/src/db/sqlite.rs:2691\u0060 calls \u0060is_empty\u0060, \u0060Some\u0060 and \u0060crates/dbx-drivers/src/db/sqlite.rs:2618\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"960985437e86db7f7b0667109493b445ebac656e743abe1948167cad7b99f1bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-drivers/src/salesforce_oauth.rs:463-473 | crates/dbx-drivers/src/salesforce_oauth.rs:559-567 | crates/dbx-drivers/src/salesforce_oauth.rs:622-632 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/salesforce_oauth.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef07d28e332258bc843c1feb1cccc9f9d0ef511b556d726efb942bcb0029fc74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-sql-data/src/data_grid_extractors/sql.rs:281-289 | crates/dbx-sql-data/src/data_grid_extractors/sql.rs:427-435 | crates/dbx-sql-data/src/data_grid_extractors/sql.rs:786-794 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a16bbf885fd7b67d25ae1ecd7ea3c09f12e9b4179f6a455fff01870895cac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/dbx-web/src/routes/database_export.rs:196-203 | crates/dbx-web/src/routes/query_result_export.rs:173-181 | crates/dbx-web/src/routes/table_export.rs:161-169 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/database_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/database_export.rs:196\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/database_export.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"56197a030173e152b9aeba8840a363d02c0cfd307b12699e0f4cceb7336eb2c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:395-402 | crates/dbx-driver-sqlserver/src/sqlserver.rs:4617-4625 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/duckdb/src/sql.rs:395\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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e057dc396283c3018971df17098d33777f54dab1609ff997a84a94028e23efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:1658-1666 | crates/dbx-ai-provider/src/ai.rs:1688-1696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:1658\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"14245e10c0b37ec5e139e8c21775ef7c5936b8d1b016f7dce1af0143fd27a3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:361-369 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:766-774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7797f5f8676e022ec47d699a234ac9f865d881ab1ee5b2bd18e65c7d2ce9b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-ai-provider/src/ai_cursor_cli.rs:338-346 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:562-570 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_cursor_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_opencode_cli.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_cursor_cli.rs:338\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"496b882a8265a11cb7b7c30341f52824a5aebc258c3b477429a160044362ff54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-ai-provider/src/ai_opencode_cli.rs:612-620 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:637-645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_opencode_cli.rs:612\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_opencode_cli.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"153c4551d929f41fa28893a49ea1a1b808d57ef0da11a7d8af1a5b1d4bc4e11e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/admin/nacos/http.rs:1013-1021 | crates/dbx-core/src/admin/nacos/http.rs:1035-1043 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/http.rs:1013\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82031e9d497cfd558801fd95e45d7f34f416eadfa525a5d2ea3da79bf8b982e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/admin/nacos/http.rs:2433-2441 | crates/dbx-core/src/admin/nacos/http.rs:2473-2481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060req\u0060 to \u0060NacosNamespaceCreate\u0060 in one and \u0060NacosNamespaceUpdate\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cce9ab5d8f00d2ed966ece1b6968211fbfb26077bf645462979481d0199db91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/ai/agent_tools.rs:902-910 | crates/dbx-core/src/ai/agent_tools.rs:1004-1012 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cf54f565d4b6f33fa9f1055ffe8910c16b41c413a32c4045ccd5ccdc497318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:2437-2445 | crates/dbx-core/src/connection/mod.rs:2483-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 \u0060crates/dbx-core/src/connection/mod.rs:2437\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"137b9d9212dc47d0f53ae8e300d5385d192aedc9a418ef3470199b985f08d88b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:3728-3736 | src-tauri/src/commands/connection.rs:2391-2399 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3728\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3728}}}],"partialFingerprints":{"codehealthFindingId/v1":"849dfef1b6d96de819f658460a92b855db0e892f3b941c0ba2de4d14bf8cdaab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/cloudflare_d1/import.rs:29-37 | crates/dbx-core/src/data/table_import.rs:4958-4966 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/cloudflare_d1/import.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"891e39b455f45db96e18737ca2f3132157d2bc1bec5c2fd8943291db0111414b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:1366-1376 | crates/dbx-sql-data/src/data_grid_sql.rs:3389-3399 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/data/database_export.rs\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eff1dec2079cf3ecfa314506496e2389c2777c11b6d1c03b6bca50e73b61acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:1400-1408 | crates/dbx-sql-data/src/data_grid_sql.rs:3743-3751 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/data/database_export.rs\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-sql-data/src/data_grid_sql.rs:3741\u0060 calls \u0060get\u0060 and \u0060crates/dbx-core/src/data/database_export.rs:1399\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f3feb415a4343948be8cbe0fda74748f93e9bdc7a4503eb23c1d940b42a972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:1615-1623 | crates/dbx-sql-data/src/data_grid_sql.rs:3602-3610 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/data/database_export.rs\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:1615\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8ccdb59c444380128ce02cc6089ee7f9f0f8944b5bd125d446a82285dce540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/mongodb_import_export.rs:910-918 | crates/dbx-core/src/data/mongodb_import_export.rs:1545-1553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/mongodb_import_export.rs:910\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"4579eb9bb1020892fd998f696855bb081aae7bcb4510a0b44dca3eba11d87b68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/mongodb_import_export.rs:3037-3045 | crates/dbx-core/src/data/mongodb_import_export.rs:3277-3285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/mongodb_import_export.rs:3037\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":3037}}}],"partialFingerprints":{"codehealthFindingId/v1":"9622c279f78d7cb2d6f1d84ff52c1d0e3dce17f4ea3a141f7bb8abf74d223176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/dbx-core/src/data/sql_file_import.rs:1964-1978 | crates/dbx-core/src/data/sql_file_import.rs:2012-2027 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/sql_file_import.rs:1964\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4bfd4f7956da7114b2782475b8df072e413c8c4cf552ade62be2572b46827a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:1359-1367 | crates/dbx-core/src/data/table_import.rs:1463-1471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:1359\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"844f06749bbb3c2eb3f344c8c4bf08a4bb19bd1ed5cd40257b753f4d2be4afaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:5791-5799 | crates/dbx-core/src/data/transfer.rs:5918-5926 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:5791\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5791}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10115ad6e57fef705b72de5865adf83f74921ca147c372fa8e4f4e8fb4c2974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/dbx-core/src/persistence/cloud_sync.rs:3142-3154 | crates/dbx-core/src/persistence/cloud_sync.rs:3162-3172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/cloud_sync.rs:3142\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2c9dc745dc90c7cfbfde5b9c01b1cd5b4fc729e029365886ec8f387539c25e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:6557-6565 | crates/dbx-core/src/persistence/storage.rs:6580-6588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:6557\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6557}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a4d5b7db3f323e0dd48c80279cc9d1c03a3f1855b9012023a61f4120175cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:8580-8588 | crates/dbx-core/src/persistence/storage.rs:9428-9436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:8580\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcdfaba2772f65f7b65dd550355f9258567893f99172980a97d2e28be1866db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:2822-2830 | crates/dbx-core/src/query/mod.rs:2853-2861 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:2822\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":2822}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2ded9deb5948a1268544bdbbe162bac70e350a27bbfae65244aff24ad76ced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:7205-7213 | crates/dbx-core/src/query/mod.rs:7432-7440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:7205\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":7205}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dab0c4356cdcb10dfd63a27a70bdb06b9fd2a3029ed5b588f98d0753347393"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/schema/agent_pg_sequences.rs:53-61 | crates/dbx-core/src/schema/kingbase.rs:100-108 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/agent_pg_sequences.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"277981208141a9dd36b92199d3965248069b10856cb7e33073ddcaba209cbb11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/schema/exact_metadata.rs:159-167 | crates/dbx-core/src/schema/exact_metadata.rs:192-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/exact_metadata.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4f8ad373b5204bdddc3f2b3a12cf75d7e4f3566f0d9cb486aef1eb67fff6a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:10551-10559 | crates/dbx-core/src/schema/mod.rs:10628-10636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:10551\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10551}}}],"partialFingerprints":{"codehealthFindingId/v1":"710150c1ea5a3c072aaf18472a7a7782b4777d16a520064738a6489d0bb5937c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:11105-11113 | crates/dbx-core/src/schema/mod.rs:11140-11148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:11105\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":11105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cae876e524dc664d645d412b4c4d45aceb4363e5edfacd86bff1f1758367936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:17992-18000 | crates/dbx-core/src/schema/mod.rs:18504-18512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":17992}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7405c2de611e38c6c7793c35f0cabece07e42ad1b76e78cda5e65ebf9ace92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/operations/dameng.rs:278-286 | crates/dbx-core/src/schema/native_jobs/operations/dameng.rs:306-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6fdd17a09992448f624509b307dcb154e93608384e748f52b1125ddafd700f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/references.rs:130-138 | crates/dbx-core/src/schema/native_jobs/service.rs:652-660 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/native_jobs/references.rs:130\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/references.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e952ffad9555179c9d2e26c0943c8f89265f448456ccea1efdbfde7df7f6d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/schema/providers/native.rs:109-118 | crates/dbx-core/src/schema/providers/native.rs:133-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/providers/native.rs:109\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/providers/native.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d776590bb6f0ea21b4debaa51599062009fe6a8648a318d56b67b8e9be9a5979"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-driver-agent/src/agent_driver.rs:2392-2400 | crates/dbx-driver-agent/src/agent_driver.rs:2424-2432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-agent/src/agent_driver.rs:2392\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d28061b0b7a83f130c7fcc87157b4a98a16eea9bddc9b49c9988704c7f112d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-driver-elasticsearch/src/lib.rs:1037-1045 | crates/dbx-driver-elasticsearch/src/lib.rs:1051-1059 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-elasticsearch/src/lib.rs:1037\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a45e264d5874888fff46e7ba6e67067e18bc07688a1e815a217c8be2207dc34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:2709-2718 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2754-2763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b0d2f2823cc59170725fe9afbeb6a5ac27a6210c55b5acecc979e7409fff2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:2817-2826 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2854-2863 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2817\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2817}}}],"partialFingerprints":{"codehealthFindingId/v1":"111329bc52b1939011cf19c08ad8b33c7eb9d6d664911f5cfb1638393075599f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql_compatible.rs:497-505 | crates/dbx-driver-mysql/src/mysql_compatible.rs:515-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql_compatible.rs:497\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql_compatible.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"8616df9c7d19c719c096fd85b1924e7c71acdbe87b2fbd388d83499b93694c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:7432-7439 | crates/dbx-driver-postgres/src/postgres.rs:7458-7466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:7432\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":7432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b691fb3bdd1acabaabf32083349ccb6a1681f319ea64068b5e4adb451273205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:9575-9583 | crates/dbx-driver-postgres/src/postgres.rs:9646-9656 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:9646\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":9575}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ac0b8aee9127564d8f406fade91227658a07a2297eaf7412e1a4cf36f0094b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-driver-redis/src/lib.rs:5332-5340 | crates/dbx-driver-redis/src/lib.rs:5404-5412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-redis/src/lib.rs:5332\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5332}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf7fc0674fd8f9ce4058f8a81f539da82dfcd94855d86bb15da7125712e80dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-driver-support/src/ddl_scan.rs:26-34 | crates/dbx-sql-data/src/query_result_sql.rs:3171-3179 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-support/src/ddl_scan.rs:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/ddl_scan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bfca17bd8670a57735bbfa6d25a8fed3248e70f5a40cb80c1b9b7cf44fdc7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/dbx-driver-support/src/http_tunnel.rs:58-66 | crates/dbx-driver-support/src/http_tunnel.rs:105-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-support/src/http_tunnel.rs:58\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/http_tunnel.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b464f439117d336f70f5f620926f84d6d70d2d4f5ac832dc0bcd36ee0e86fd58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-mcp/src/server.rs:2856-2864 | crates/dbx-mcp/src/server.rs:3194-3202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:2856\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2856}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2175e88c6c87c3e56d95696e78fc444567f21e7e20edf6643d7608322615400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-mcp/src/server.rs:4241-4249 | crates/dbx-mcp/src/server.rs:4298-4306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-mcp/src/server.rs:4251\u0060 calls \u0060tool_error\u0060 and \u0060crates/dbx-mcp/src/server.rs:4307\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43fe3043ac68433cd72cbb9720a1bdece15ee48b5e1104b0cf51fc51636f563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql.rs:223-229 | crates/dbx-sql-core/src/object_source_sql.rs:378-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql.rs:378\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060OracleRoutineReferenceRewriteInput\u0060 in one and \u0060OracleTableReferenceRewriteInput\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f85247779ea6af191029cc5deed0cc2ebe0c03e27d557bfbd7f8cde4195340"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:1254-1262 | crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:1634-1642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:1252\u0060 calls \u0060parse_oracle_table_ddl\u0060 and \u0060crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:1632\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3da1b4004b2b55cca32658cb051e400cfb3473bca2cc2c6e2fd5dbaaacb4a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-sql-core/src/sql_diagnostics.rs:77-85 | crates/dbx-sql-core/src/sql_diagnostics.rs:120-128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/sql_diagnostics.rs:77\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_diagnostics.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d4d237dc279ca8b7744f572c4d5e429faeb68fb8e1aa44263160de4bfb134c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-sql-core/src/value_literals.rs:90-98 | crates/dbx-sql-schema/src/db_admin_sql.rs:1409-1417 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/value_literals.rs:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/value_literals.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"497721b45291808d84480bbccadcf5fdff491bce8bd98d69e0170f7681f0a5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:12-20 | crates/dbx-sql-data/src/data_grid_sql.rs:1895-1902 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:12\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_neo4j_sql.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d3035d80ef21c36ea7538198e158196f61f1af9161c35868a2830751b42f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_sql.rs:1865-1873 | crates/dbx-sql-data/src/data_grid_sql.rs:2123-2131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-sql-data/src/data_grid_sql.rs:1875\u0060 calls \u0060iter\u0060, \u0060normalize_column_name\u0060, \u0060collect\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs:2132\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33258fdaa3a49b42a9d989962d233bba5298a3ccdc6278824187a9c8fa3e06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:916-923 | crates/dbx-sql-schema/src/schema_diff.rs:940-948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:916\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6821b6cc489a3f16662fd8cd5df973fbb247708c6b56984973386645120a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:1726-1734 | crates/dbx-sql-schema/src/schema_diff.rs:1743-1751 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:1726\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bac88669c1436474aaccc137b2c796e9babbef435a106082ba6671b6c7bc061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/foreign_keys.rs:32-40 | crates/dbx-sql-schema/src/table_structure_sql/triggers.rs:40-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/foreign_keys.rs:32\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/foreign_keys.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0f187919b7a2bc1518796da840d8e944c821df4df33303c56db1bd9f417711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/dbx-types/src/models/connection.rs:2612-2618 | crates/dbx-types/src/models/connection.rs:2632-2640 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"990cc52b5dd74fc7de06d060f2e02a228aef0de80b95dd6e3cc3ea8c1ec2db13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-types/src/models/connection.rs:2654-2663 | crates/dbx-types/src/models/connection.rs:2666-2675 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"9117b1fb20ed9b545ee3502d719663919309c0fcb0fb3ca2f660517c239a0492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-web/src/routes/connection.rs:236-244 | src-tauri/src/commands/connection.rs:84-92 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b84343300c659bcffcbc27af8925261ae11a971e9c21e4e130a8b5743af73d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-web/src/routes/schema.rs:733-745 | crates/dbx-web/src/routes/schema.rs:753-765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"1581ad2a2ae87e106cbb81d425b79492e3916dc01dd55bfc048f4be26da671fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src-tauri/src/commands/connection.rs:1675-1683 | src-tauri/src/commands/connection.rs:1714-1722 \u2014 both copies are in the same file, so extract the block 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":"src-tauri/src/commands/connection.rs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3c744fe0d4677e0dfa1a0766ea3949ad4ebb2ab8c9e1463d390a95a4fa145b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src-tauri/src/commands/mcp_bridge.rs:1877-1885 | src-tauri/src/commands/mcp_bridge.rs:2023-2031 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/mcp_bridge.rs:1877\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, \u0060src-tauri/src/commands/mcp_bridge.rs:1874\u0060 calls \u0060Some\u0060 and \u0060src-tauri/src/commands/mcp_bridge.rs:2022\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":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"41254a06207cf736094c9cc79f07f3c28d9b8da860d33fbfeb086ebaddefc4df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 17): crates/dbx-core/src/query/redis_ops.rs:517-524 | crates/dbx-core/src/query/redis_ops.rs:550-557 | crates/dbx-core/src/query/redis_ops.rs:587-594 | crates/dbx-core/src/query/redis_ops.rs:617-624 | crates/dbx-core/src/query/redis_ops.rs:647-654 | crates/dbx-core/src/query/redis_ops.rs:689-696 | crates/dbx-core/src/query/redis_ops.rs:719-726 | crates/dbx-core/src/query/redis_ops.rs:757-764 | crates/dbx-core/src/query/redis_ops.rs:797-804 | crates/dbx-core/src/query/redis_ops.rs:835-842 | crates/dbx-core/src/query/redis_ops.rs:866-873 | crates/dbx-core/src/query/redis_ops.rs:895-902 | crates/dbx-core/src/query/redis_ops.rs:927-934 | crates/dbx-core/src/query/redis_ops.rs:958-965 | crates/dbx-core/src/query/redis_ops.rs:988-995 | crates/dbx-core/src/query/redis_ops.rs:1041-1048 | crates/dbx-core/src/query/redis_ops.rs:1070-1077 \u2014 all 17 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/redis_ops.rs:517\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"38df1ad3025362fd0af3b9c559b6d66443a6cf0c8b3548765a26026abb80fc2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12): crates/dbx-core/src/connection/mod.rs:3848-3855 | crates/dbx-core/src/connection/mod.rs:3864-3871 | crates/dbx-core/src/connection/mod.rs:3880-3887 | crates/dbx-core/src/connection/mod.rs:3896-3903 | src-tauri/src/commands/connection.rs:1923-1930 | src-tauri/src/commands/connection.rs:1951-1958 | src-tauri/src/commands/connection.rs:1968-1975 | src-tauri/src/commands/connection.rs:1985-1992 | src-tauri/src/commands/connection.rs:2509-2516 | src-tauri/src/commands/connection.rs:2535-2542 | src-tauri/src/commands/connection.rs:2551-2558 | src-tauri/src/commands/connection.rs:2567-2574 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/mod.rs\u0060 and \u0060src-tauri/src/commands/connection.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 268 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:3848\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3848}}}],"partialFingerprints":{"codehealthFindingId/v1":"293649ca5b8a6a92e582bcf486c14ee441b7399fc03cf492cdcff643c964c2df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): crates/dbx-core/src/admin/mq/adapters/pulsar.rs:527-534 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:547-554 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:580-587 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:605-612 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:674-681 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:694-701 | crates/dbx-core/src/admin/mq/adapters/pulsar.rs:711-718 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mq/adapters/pulsar.rs:527\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/pulsar.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a46e9ff8dd1128ea6eab4d307b8cddcdbed292fde7f6337bec9f0605f0b29bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/dbx-ai-provider/src/ai.rs:3895-3902 | crates/dbx-ai-provider/src/ai.rs:4003-4010 | crates/dbx-ai-provider/src/ai.rs:4149-4156 | crates/dbx-ai-provider/src/ai.rs:4500-4507 | crates/dbx-ai-provider/src/ai.rs:4700-4707 | crates/dbx-ai-provider/src/ai.rs:4873-4880 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3895\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-ai-provider/src/ai.rs:4000\u0060 calls \u0060minimax_stream_semantics\u0060 and \u0060crates/dbx-ai-provider/src/ai.rs:3892\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3895}}}],"partialFingerprints":{"codehealthFindingId/v1":"164a8ca7ef41ca8f4157e5d5b27fb3b0ad4e29003959ce099ad471dd7ecc8e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/dbx-core/src/query/redis_ops.rs:222-229 | crates/dbx-core/src/query/redis_ops.rs:252-259 | crates/dbx-core/src/query/redis_ops.rs:281-288 | crates/dbx-core/src/query/redis_ops.rs:309-316 | crates/dbx-core/src/query/redis_ops.rs:412-419 | crates/dbx-core/src/query/redis_ops.rs:444-451 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/redis_ops.rs:222\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b08d3c5e7490598da6e2a51bdda97854c0ef3d7fc3bac318b1ebe601583a716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/dbx-mcp/src/server.rs:2442-2449 | crates/dbx-mcp/src/server.rs:2515-2522 | crates/dbx-mcp/src/server.rs:2582-2589 | crates/dbx-mcp/src/server.rs:2617-2624 | crates/dbx-mcp/src/server.rs:4045-4052 | crates/dbx-mcp/src/server.rs:4390-4397 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c536b507f11cbb78a127bd7cb56eee559061c8d4438cbc0610201678aed4a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/dbx-core/src/query/mod.rs:6206-6213 | crates/dbx-core/src/query/mod.rs:6541-6548 | crates/dbx-core/src/query/mod.rs:8098-8105 | crates/dbx-core/src/query/mod.rs:8134-8141 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:6206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/query/mod.rs:6216\u0060 calls \u0060elapsed\u0060, \u0060as_millis\u0060 and \u0060crates/dbx-core/src/query/mod.rs:8107\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":6206}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c458e61b092c6375631cd0cc6211c8e3003e2200448e2cf234a8668a075fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): crates/dbx-driver-elasticsearch/src/lib.rs:2582-2588 | crates/dbx-drivers/src/db/couchdb_driver.rs:627-634 | crates/dbx-drivers/src/db/solr_driver.rs:1004-1011 | crates/dbx-drivers/src/db/vector_driver.rs:978-985 \u2014 before extracting anything, compare \u0060crates/dbx-driver-elasticsearch/src/lib.rs\u0060 and \u0060crates/dbx-drivers/src/db/couchdb_driver.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/couchdb_driver.rs:627\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32c12094fced5a4b837f535a1cc8ff9d082cebef5a0f3ea17974afae9631168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/dbx-driver-mysql/src/mysql.rs:7915-7922 | crates/dbx-sql-core/src/sql.rs:3609-3616 | crates/dbx-sql-core/src/sql.rs:3708-3715 | crates/dbx-sql-core/src/sql.rs:3759-3766 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:7915\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7915}}}],"partialFingerprints":{"codehealthFindingId/v1":"48acc2f24bb23714018df27393a92b8b06eaf49e8a5024f3ccf0f6e5c19f815f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/drivers/duckdb/src/sql.rs:396-403 | crates/dbx-driver-mysql/src/mysql.rs:7915-7923 | crates/dbx-driver-sqlserver/src/sqlserver.rs:4618-4626 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/sql.rs:396\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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a74b8ab36e567327d5b7e3dad2c915129b6492e1fe7bfd0c3891879b075ad69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-core/src/admin/nacos/access_control.rs:161-168 | crates/dbx-core/src/admin/nacos/access_control.rs:184-192 | crates/dbx-core/src/admin/nacos/access_control.rs:208-216 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/access_control.rs:161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d443536a5aeffa629283d10e1dcfbfe97e58b6dbd951181a85255cf9516bce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-core/src/connection/mod.rs:7789-7796 | crates/dbx-core/src/connection/mod.rs:7819-7826 | crates/dbx-core/src/connection/mod.rs:7847-7854 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:7789\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":7789}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83423f4041313e55809aa60e1ba8e4c7dfabf081eda3bb33b3fa757c18d6a09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/dbx-core/src/persistence/storage.rs:2583-2589 | crates/dbx-core/src/persistence/storage.rs:2931-2938 | crates/dbx-core/src/persistence/storage.rs:4889-4895 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:2583\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2583}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bca123af15b1aff30331473fee1494efc0faaef409638d46a66d3fe3d4e4df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/dbx-core/src/persistence/storage.rs:7747-7754 | crates/dbx-core/src/persistence/storage.rs:7777-7783 | crates/dbx-core/src/persistence/storage.rs:7807-7814 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:7747\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":7747}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a614d25a37414d90c0d23734ce5000fc4da4c6ebf9b4a3eccf8cbbc4e28f5bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:393-406 | crates/dbx-web/src/routes/mcp_policy.rs:75-88 | src-tauri/src/commands/mcp_bridge.rs:1583-1596 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7f47cc2d644e854725d924ab860af16a13d642cef885c42d59a02aeb6c1840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:481-488 | crates/dbx-drivers/src/db/rqlite_driver.rs:378-385 | crates/dbx-drivers/src/db/turso_driver.rs:623-630 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs\u0060 and \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:481\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"174157d142fa90e5d14eb06813f0f61c06d42034e4fe23b540ce93c813b05725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-drivers/src/db/rqlite_driver.rs:321-328 | crates/dbx-drivers/src/db/turso_driver.rs:415-422 | crates/dbx-drivers/src/db/turso_driver.rs:438-445 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/turso_driver.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 255 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/rqlite_driver.rs:321\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/rqlite_driver.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c7fe44ee2f881d5e173e10ddf83da6e9038921670725ed5500d7c2ac8fb6be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-plugin-runtime/src/plugins/host.rs:193-200 | crates/dbx-plugin-runtime/src/plugins/host.rs:236-243 | crates/dbx-plugin-runtime/src/plugins/host.rs:571-578 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/host.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd8aa50cee951a70ec819886e224c80942c2165020008b01f929fa3554248a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-web/src/routes/cloud_sync.rs:411-418 | crates/dbx-web/src/routes/cloud_sync.rs:465-472 | crates/dbx-web/src/routes/cloud_sync.rs:502-509 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-web/src/routes/cloud_sync.rs:410\u0060 calls \u0060ensure_secret_export_allowed\u0060 and \u0060crates/dbx-web/src/routes/cloud_sync.rs:464\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/cloud_sync.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"566b0ac928c27a43cde2ae35446d4b6a19c8031646f1d3719194f2e818e4455d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-web/src/routes/database_export.rs:89-96 | crates/dbx-web/src/routes/query_result_export.rs:93-100 | crates/dbx-web/src/routes/table_export.rs:82-89 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/database_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/database_export.rs:89\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-web/src/routes/query_result_export.rs:101\u0060 calls \u0060drop\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs:91\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/database_export.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac4dca1221e01f94ab95e06ab240dba58b62eb6b6f25af644b4ad7112ce60e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:279-286 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:358-365 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a9588a2f7ca98c41ac7183d11513fd1eeefc03ba4f445ab4030ed9a7127727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:397-404 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:508-515 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:516\u0060 calls \u0060codebuddy_legacy_effort_levels\u0060, \u0060as_ref\u0060 and \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:405\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2e4d25d191c8bca4c0a320ac473981c4c2b893d874aef47cdc07d3c0f2173f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-ai-provider/src/ai_codex_cli.rs:391-398 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:373-380 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_pi_agent_cli.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d4948f4836631dae507381c36b0dde14c16609bf8ec99c4c822e049954b116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/admin/nacos/http.rs:4024-4031 | crates/dbx-core/src/admin/nacos/http.rs:4088-4095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":4024}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cc115d486386b62dc7b497a15d59bdb7b92b65b9c1eca7226ed3a757c1055b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/dbx-core/src/ai/agent_kv.rs:1009-1015 | crates/dbx-core/src/ai/agent_kv.rs:1737-1744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd85761e3e450defce705e1714b473f257df2cf59af0771b9294c6004ffe3fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:1122-1128 | crates/dbx-core/src/connection/mod.rs:1235-1242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3534e9553ce34e210008bd7c135d40c1cbe027f62607b178e6cdefbdd8f5a482"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/data/table_export.rs:344-351 | crates/dbx-formats/src/text_export.rs:110-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4853321a2d846dac1a4bbbee4d65059879aa4c28eece201c7281562f285932f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/dbx-core/src/data/table_export.rs:1433-1440 | crates/dbx-core/src/data/table_export.rs:2405-2411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b49da090976a1a37c4b764b191295b42866dde015cf92472c0ff58d0f34a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:2571-2578 | crates/dbx-core/src/data/table_import.rs:4853-4858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:2571\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060context\u0060 to \u0060DuckDbImportContext\u0060 in one and \u0060\u0026DuckDbImportContext\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3660d326bbc5186ddbedbf7367cee9938f7c7b7c1d6f04b79be5c83a7ae88d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:11099-11106 | crates/dbx-core/src/data/transfer.rs:11132-11139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:11099\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":11099}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1a83d91490169811097854b4d3823a72c77f086b237a5f6d7e263f2da1afe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:10242-10249 | crates/dbx-core/src/persistence/storage.rs:10407-10414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:10242\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":10242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36bb4ff8a54d69385a467c2b51893239eba0e94fbff44133735a6a2c1810f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/query/document_ops.rs:576-583 | crates/dbx-core/src/query/mongo_ops.rs:563-570 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/document_ops.rs:576\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"686302031308b3f1bbea18a38b9c2fc55e06a7357a5d9e1ef52393ee30b8eb3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/query/document_ops.rs:601-608 | crates/dbx-core/src/query/document_ops.rs:646-653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef8a8101826532101322a5dd180776f8ac45c3a729ef99f9fc547d757ddaa19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:2212-2219 | crates/dbx-core/src/query/mod.rs:2408-2415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:2212\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf7ef49573e312e628393f5950f83513277e9fe35eac5ff1290e6fb70a22473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:2392-2399 | crates/dbx-core/src/query/mod.rs:2423-2430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:2392\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d3fec310eddcf78971753f75817541e5fe9cca23829c86edbb4288743e0e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:7342-7349 | crates/dbx-core/src/query/mod.rs:7370-7377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":7342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3731d0500b6c5064e8f8427a4b1ab78c6a86d40c4c8f883d89305fd3c87a54af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/query/redis_ops.rs:194-201 | crates/dbx-core/src/query/redis_ops.rs:1332-1339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/redis_ops.rs:194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acd9ad63aa5d295b52f705cddb9642160dc268b82aab665accae60187843307"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/schema/oracle_ddl_indexes.rs:313-320 | crates/dbx-core/src/schema/oracle_ddl_indexes.rs:344-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/oracle_ddl_indexes.rs:313\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e3c7369a4550f4c4250e4bd981ddda74742caa96576cd558c0c05c5bd4e954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/schema/oracle_type_details.rs:80-87 | crates/dbx-core/src/schema/oracle_type_management.rs:107-114 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_details.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfa38d9dc6a1aa871490991784084bbde6455c1ee083ee6ab38f7cb678d1c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-agent/src/agent_driver.rs:354-361 | crates/dbx-driver-agent/src/agent_driver.rs:383-390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"5864aab2deac85eb476176353f9390fd752e544ab5a98bde53ca8fac1ae16af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-agent/src/agent_manager.rs:1310-1317 | crates/dbx-driver-agent/src/agent_manager.rs:1333-1340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-agent/src/agent_manager.rs:1310\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_manager.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6fac0195ecced39e2faff86467727eb6dbda5e6c30a66f64a645962201b6ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:594-601 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1867-1874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:1867\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ca5cb16f8e09e533125a91e92d7c234c04f001e354cbcaf954a59448856a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:2861-2868 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2884-2891 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2861\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd01f0cf0f790335c368c531e8ad90a25fa48ca4dcf607bfe54b1427e4ea3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:1879-1886 | crates/dbx-driver-postgres/src/postgres.rs:9022-9029 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:1879\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"317e379ae597ae70d41ea45959ff79fcf2983eb2e95380f182ffea452a2e85e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:5488-5495 | crates/dbx-driver-postgres/src/postgres.rs:10330-10337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":5488}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3575d22c06a3901635411ccfd21ebcbf626b80a906e561b3e12364880c969b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-redis/src/lib.rs:5534-5541 | crates/dbx-driver-redis/src/lib.rs:5560-5567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-redis/src/lib.rs:5534\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":5534}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a0bb132eaf9486b5bbb05cab4928cdbdaafada0353eb38a18c6eceb28d4754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-sqlserver/src/sqlserver.rs:2465-2472 | crates/dbx-driver-sqlserver/src/sqlserver.rs:2524-2531 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs:2465\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f619ba6a9f2f476dff9ef6753232320a954ba7a63bcb6553e5d2cf8a5177d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs:16-23 | crates/dbx-sql-core/src/sql.rs:2112-2119 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs:16\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd762e54a96fa31ea0dc6fcd39d83836e43ddb1b642026fae286ac1f7fc4470"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-drivers/src/db/duckdb_worker_process.rs:513-520 | crates/dbx-drivers/src/db/duckdb_worker_process.rs:561-568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_worker_process.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a654215ac4334725af0c29c4e4fa9567a56e980ea726e2b9bd1a7ad5a4fe3b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-drivers/src/db/dynamodb_driver.rs:872-879 | crates/dbx-drivers/src/db/dynamodb_driver.rs:928-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/dynamodb_driver.rs:872\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"578763ce26c28293ff97f829317fdba228b2feee3b4455ffbeb12ed4dd15318b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-drivers/src/db/opentenbase.rs:63-71 | crates/dbx-drivers/src/db/opentenbase.rs:96-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/opentenbase.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fc182f238ec18c8b88113cbdf9f166516908a164152cffc0027f48b2b33d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-drivers/src/db/rqlite_driver.rs:157-164 | crates/dbx-drivers/src/db/turso_driver.rs:218-225 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/turso_driver.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 255 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/rqlite_driver.rs:157\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/rqlite_driver.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"746b1a17f7110af6be25d47706a2f79819b8eb2ef8ce93f0ad89373fc764d3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-drivers/src/db/rqlite_driver.rs:203-216 | crates/dbx-drivers/src/db/turso_driver.rs:264-277 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/turso_driver.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 255 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/rqlite_driver.rs:203\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/rqlite_driver.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c4266d83e176a287348717a386dedc76df656fad57d4191cf0ae98cd97b23f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/dbx-formats/src/temporal_format.rs:237-244 | crates/dbx-formats/src/temporal_format.rs:266-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-formats/src/temporal_format.rs:237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/temporal_format.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25333db667a5902fe360571181d45c66056950943ec845c887a44daeec8bf64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/dbx-formats/src/temporal_format.rs:288-295 | crates/dbx-formats/src/temporal_format.rs:317-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-formats/src/temporal_format.rs:288\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060column_types\u0060 to \u0060\u0026[Option\u003CString\u003E]\u0060 in one and \u0060\u0026[String]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/temporal_format.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f24f4a2fcb1dc924234edd3db69b3f37f74b8f77d29a54bc8895b9aa1a748a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs:95-102 | crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs:730-737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b920ad746e0d29a16957564fe3f683de3925ba1bccd3c98fa5e52684228c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_sql.rs:2039-2046 | crates/dbx-sql-data/src/data_grid_sql.rs:2185-2192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_sql.rs:2039\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a006135fb7cd74ec77cf7a36512c851d7eb681d42115576994f3c5b6bdc6747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:230-237 | crates/dbx-sql-data/src/query_result_sql.rs:281-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/query_result_sql.rs:230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fe9e8ebaee233f0f77f1fa7f66b7e65e9880a4f126d0acbcb42f45206461ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-sql-schema/src/native_job_changes/dameng.rs:297-304 | crates/dbx-sql-schema/src/native_job_changes/dameng.rs:306-313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/native_job_changes/dameng.rs:297\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07b4ba9a5d29ea72c7033880c915d2a6eac9b7e04772e4717ed218b7577b656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:1907-1914 | crates/dbx-sql-schema/src/schema_diff.rs:1940-1947 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:1907\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fe8d487e2cc5eec92db6a950e2d1e9fb6ba82dab082719b9173558dacffa08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:562-569 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:1317-1324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:562\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"108fe9cce8c1ff7590fe238d7e8a6a4757929ef397dda8b7c4b699af58a31053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:733-739 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:954-961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:733\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdd957ac979ceddc298683597bcaa1815d98fcc3878c22d016b86f5092859c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:932-939 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:1202-1209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:932\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b33c2debb9ca45ec70f202295c7f28ace9a7e2a9acb03b8575355bffa88417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-types/src/models/connection.rs:1318-1325 | crates/dbx-types/src/models/connection.rs:1491-1498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-types/src/models/connection.rs:1318\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ae71120649652ce0b001a72e2a8b6e8c1f01d81cdd99d96ee7088853ea908c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-types/src/models/connection.rs:2051-2060 | crates/dbx-types/src/models/connection.rs:2074-2083 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-types/src/models/connection.rs:2051\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"43622933902a0bf428068bcfb2c6d09e7f8bec428340940160155fece8ccbd33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-web/src/routes/schema.rs:720-727 | crates/dbx-web/src/routes/schema.rs:805-812 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/schema.rs:720\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a658c42c07b3463315ecb79dd54dd39b934069fac20ead8bfc13cf51cd38f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src-tauri/src/commands/connection.rs:2319-2326 | src-tauri/src/commands/connection.rs:2815-2825 \u2014 both copies are in the same file, so extract the block into one function there 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-tauri/src/commands/connection.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"279e3136e9f8f75f2bcbe27b0bbdce275a56153de30459f12eef112f3442d251"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src-tauri/src/commands/xlsx_export.rs:63-70 | src-tauri/src/commands/xlsx_export.rs:77-84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/xlsx_export.rs:63\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060QueryResultXlsxExportRequest\u0060 in one and \u0060QueryResultsXlsxExportRequest\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/xlsx_export.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35d7a866086d156ea80e8b76bc0875a57405810eb9d4259cbb0c6b6af516dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 23): crates/dbx-core/src/query/redis_ops.rs:224-230 | crates/dbx-core/src/query/redis_ops.rs:254-260 | crates/dbx-core/src/query/redis_ops.rs:283-289 | crates/dbx-core/src/query/redis_ops.rs:311-317 | crates/dbx-core/src/query/redis_ops.rs:414-420 | crates/dbx-core/src/query/redis_ops.rs:446-452 | crates/dbx-core/src/query/redis_ops.rs:519-525 | crates/dbx-core/src/query/redis_ops.rs:552-558 | crates/dbx-core/src/query/redis_ops.rs:589-595 | crates/dbx-core/src/query/redis_ops.rs:619-625 | crates/dbx-core/src/query/redis_ops.rs:649-655 | crates/dbx-core/src/query/redis_ops.rs:691-697 | crates/dbx-core/src/query/redis_ops.rs:721-727 | crates/dbx-core/src/query/redis_ops.rs:759-765 | crates/dbx-core/src/query/redis_ops.rs:799-805 | crates/dbx-core/src/query/redis_ops.rs:837-843 | crates/dbx-core/src/query/redis_ops.rs:868-874 | crates/dbx-core/src/query/redis_ops.rs:897-903 | crates/dbx-core/src/query/redis_ops.rs:929-935 | crates/dbx-core/src/query/redis_ops.rs:960-966 | crates/dbx-core/src/query/redis_ops.rs:990-996 | crates/dbx-core/src/query/redis_ops.rs:1043-1049 | crates/dbx-core/src/query/redis_ops.rs:1072-1078 \u2014 all 23 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/redis_ops.rs:224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ee5bc0a8234a6b75cecaef3ebf50e94cb2af7f10eac9d7533df5d2feef1d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): agents/drivers/duckdb/src/sql.rs:239-245 | agents/drivers/duckdb/src/sql.rs:403-409 | crates/dbx-core/src/data/table_import.rs:2271-2277 | crates/dbx-driver-mysql/src/mysql.rs:7747-7753 | crates/dbx-driver-mysql/src/mysql.rs:7923-7929 | crates/dbx-driver-sqlserver/src/sqlserver.rs:4626-4632 \u2014 there are 6 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/sql.rs:403\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/duckdb/src/sql.rs:247\u0060 calls \u0060Some\u0060, \u0060dollar_quote_end\u0060 and \u0060agents/drivers/duckdb/src/sql.rs:410\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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"467c745229f437b2bee8edc692281b200e2a725a0db23cffe302fa5c4a2747de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/dbx-core/src/connection/mod.rs:6599-6605 | crates/dbx-core/src/connection/mod.rs:7756-7762 | crates/dbx-core/src/connection/mod.rs:7788-7794 | crates/dbx-core/src/connection/mod.rs:7818-7824 | crates/dbx-core/src/connection/mod.rs:7846-7852 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/connection/mod.rs:7755\u0060 calls \u0060remove_pool_owners\u0060 and \u0060crates/dbx-core/src/connection/mod.rs:6598\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":6599}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbcb7de4ca4c8ee283db2c3f02fef609de3227f4834b51393642d6b2ce81613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/dbx-core/src/schema/mod.rs:1185-1193 | crates/dbx-core/src/schema/mod.rs:1209-1217 | crates/dbx-core/src/schema/mod.rs:1223-1229 | crates/dbx-core/src/schema/mod.rs:1240-1246 | crates/dbx-core/src/schema/mod.rs:1258-1264 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:1185\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9420818b3156424f96b3f73c02196d08ada6dc83d3077ac78af7a2fcf7e08086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/dbx-driver-sqlserver/src/sqlserver.rs:1891-1897 | crates/dbx-driver-sqlserver/src/sqlserver.rs:1905-1911 | crates/dbx-sql-data/src/query_result_sql.rs:2291-2297 | crates/dbx-sql-data/src/query_result_sql.rs:2311-2317 | crates/dbx-sql-data/src/query_result_sql.rs:3041-3047 \u2014 before extracting anything, compare \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs\u0060 and \u0060crates/dbx-sql-data/src/query_result_sql.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs:1891\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-sql-data/src/query_result_sql.rs:2288\u0060 calls \u0060top_level_sql_tokens\u0060 and \u0060crates/dbx-sql-data/src/query_result_sql.rs:2308\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dca96b31456a6363fdf0695cbcfe715ca54be39cc1fa26ee03a29c41ffafd4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): crates/dbx-core/src/connection/jdbc.rs:917-923 | crates/dbx-core/src/connection/jdbc.rs:989-994 | crates/dbx-core/src/connection/jdbc.rs:1069-1074 | crates/dbx-plugin-runtime/src/plugins.rs:200-206 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/jdbc.rs:917\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"286c44c8e2a4fb0c1bacb1c529bdf1834fd9180a79ceb53aaff9ee7529e5e8a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): crates/dbx-core/src/persistence/storage.rs:8538-8544 | crates/dbx-core/src/persistence/storage.rs:8575-8581 | crates/dbx-core/src/persistence/storage.rs:8633-8639 | crates/dbx-core/src/persistence/storage.rs:8670-8675 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:8538\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f1c4277557cbad909bc570a673bf145884fdeee82884bf36154c486051bba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:807-813 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:932-938 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:1147-1153 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:1202-1208 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:807\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0e79df950a553953c5dd27d0b05e7aa54b24a481f3aa9f84c74da24bc1a5ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:433-439 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:722-728 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:494-500 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:433\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11528e29933971700bba53bf4f42e7385f8f3737347c36e82bfb1e367311cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-core/src/admin/mq/token.rs:115-121 | crates/dbx-core/src/admin/nacos/archive.rs:253-259 | crates/dbx-driver-mysql/src/mysql.rs:1158-1164 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mq/token.rs:115\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/token.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ce69e75ff37b89200f7c78a044b63c6cd8f9561cf069a263b2cd0d604e9bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-core/src/data/database_export.rs:1354-1360 | crates/dbx-core/src/data/transfer.rs:4498-4504 | crates/dbx-sql-data/src/data_grid_sql.rs:3380-3386 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/data/database_export.rs\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d8ba2ff3eb83bb12bd9b5fe03bca7c9bdd5f15c83fe3002bd19ddbdbea11f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-core/src/data/table_import.rs:3644-3653 | crates/dbx-core/src/data/table_import.rs:3974-3983 | crates/dbx-core/src/data/table_import.rs:4373-4382 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"02853473c11dd8562c41528ce689f85ffe9ec915db510464fe3a8773d42dca2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-core/src/query/mod.rs:2312-2318 | crates/dbx-core/src/query/mod.rs:2325-2331 | crates/dbx-core/src/query/mod.rs:2371-2377 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:2312\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a22985890aca6d6c9dd78568e61d17a7758883ecfae17ac8a0378593472e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-driver-agent/src/agent_service.rs:4462-4468 | crates/dbx-driver-agent/src/agent_service.rs:4480-4486 | crates/dbx-driver-agent/src/agent_service.rs:4494-4500 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-agent/src/agent_service.rs:4462\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":4462}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f21081689c36166d5569118473c6bba81746ecd3d53cb4f1fa711731516398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:291-298 | crates/dbx-drivers/src/db/rqlite_driver.rs:160-167 | crates/dbx-drivers/src/db/turso_driver.rs:221-228 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs\u0060 and \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff747865727fb4507e1d62620c2eae11e50d947a58051f17347d4ebee4d9d80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-formats/src/csv_export.rs:326-332 | crates/dbx-formats/src/csv_export.rs:405-411 | crates/dbx-formats/src/csv_export.rs:437-443 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-formats/src/csv_export.rs:326\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/csv_export.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5831af9a23ef609bd122216bbc2f20606dae7d056501cce616de9739c296ca00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-sql-schema/src/schema_diff.rs:1515-1521 | crates/dbx-sql-schema/src/schema_diff.rs:1527-1533 | crates/dbx-sql-schema/src/schema_diff.rs:1539-1545 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:1515\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"140a31339619949b5b1e330b854af572e6c4c0ffa4a2961b8d82cbdb767cb6c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:717-723 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:896-902 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:940-946 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:717\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0799283a7412a9623a9387e9fd411d6c2de09ae0e51d7c135e5b07868a6284c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/duckdb/src/schema.rs:422-428 | crates/dbx-core/src/schema/mod.rs:8543-8549 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/duckdb/src/schema.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"153206010c003d73b48df30b4a87d723b6c381f05d1e45c186d3de983382cbe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:115-125 | crates/dbx-drivers/src/db/duckdb_sql.rs:134-144 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-drivers/src/db/duckdb_sql.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 169 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f4fb7082c922139bd5ad8293f49573e97bb87b32503f1b316cb4ee1dd0e418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:4168-4174 | crates/dbx-ai-provider/src/ai.rs:4269-4275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:4168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1534ea0fa6c54b33510e2522029d44467754110cbbd50d1a4635316b0c37bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 3): crates/dbx-ai-provider/src/ai_cli_agent.rs:456-467 | crates/dbx-ai-provider/src/ai_cli_agent.rs:634-645 | crates/dbx-ai-provider/src/ai_cli_agent.rs:981-988 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs:456\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2a29309146d1ee8135cb8dfff71a94ac366ec28cdabf132d1fa3948b4c29ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/admin/mqtt/client.rs:928-934 | crates/dbx-core/src/admin/mqtt/client.rs:958-964 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mqtt/client.rs:928\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1f88866a6caee15e154eec0f506d1293b18a7b46c0e0962b6293761f7a8f9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/admin/nacos/http.rs:988-994 | crates/dbx-core/src/admin/nacos/http.rs:1050-1056 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/http.rs:988\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"26720e739824741e4ddb663066996af2f1d344de5d49fc449673b1752f467491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/admin/nacos/http.rs:1666-1672 | crates/dbx-core/src/admin/nacos/http.rs:1693-1699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/http.rs:1666\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060first_page\u0060 to \u0060NacosRoleList\u0060 in one and \u0060NacosPermissionList\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f60bc9f586396f8dea213621683a9ff00f1bd253b251b406b661ae986b50fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/admin/nacos/http.rs:3023-3029 | crates/dbx-core/src/admin/nacos/http.rs:3062-3068 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"abddaaf7f1a8f93579a144b9b30e3f5f24e3ffb415acdc27adc0bf1143c1cbde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/connection/jdbc.rs:904-910 | crates/dbx-core/src/connection/jdbc.rs:1056-1062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/jdbc.rs:904\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"f096f3f16b3d0b72ea318a4e9b12773441cd50d7ba4763303d121a1d94744f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:7493-7499 | crates/dbx-core/src/connection/mod.rs:7537-7543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":7493}}}],"partialFingerprints":{"codehealthFindingId/v1":"39941e9e5dabc850bd9ba4646f0de1ea354df298c1ae7ea9885a79ae7804dbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:8935-8941 | crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:112-118 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:8935\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8935}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3630665d44a3745ba5a0bf4094d70d005a494d241ff02e5207becaa4ca4a5c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/data/query_result_export.rs:983-989 | crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs:688-694 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs:687\u0060 calls \u0060is_some\u0060 and \u0060crates/dbx-core/src/data/query_result_export.rs:982\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"b128fe9f8f06b6cf1fad351275420ed527bc225e9e1739e548eb1d71d6db3569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/data/sqlite_backup.rs:97-103 | crates/dbx-driver-agent/src/agent_service.rs:2779-2785 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/sqlite_backup.rs:97\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sqlite_backup.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8368d6459ae5b0d4a7f831361b3edf52f16cc0e48c69a399baa53314ab35e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:3428-3434 | crates/dbx-core/src/data/transfer.rs:14264-14270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:3428\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae6b01295e3da294774ddda206c102ea84c4aba5bab91938b43cea95de7ebe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/credential_reset.rs:85-91 | crates/dbx-core/src/persistence/credential_reset.rs:146-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/credential_reset.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe470deced751c8b112e18ee3bcb82cece0a60e04c0e20f52387cdb0ec8b7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/persistence/secret_codec.rs:293-300 | crates/dbx-core/src/persistence/secret_codec.rs:790-797 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/secret_codec.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d71f73ec8586a5b3ad78f09b700bd9357d723a1f0054d1f8ddd2b1a5ff3711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:2938-2944 | crates/dbx-core/src/persistence/storage.rs:5074-5080 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:2938\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc20e31a9f103bc80a3cc6ebd4666b0342be12118de5ba03f97240a97f527bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:3029-3035 | crates/dbx-core/src/persistence/storage.rs:3044-3050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:3029\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":3029}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8742759647935e3fdae7266380019b7bbd5b488ba80f2bef7b2a0c1731ef71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:6158-6164 | crates/dbx-core/src/persistence/storage/type_execution_receipts.rs:61-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96e135c25dc50cc963d21ed993d8aa33fad79bbbf16be3f47af931a6e477911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:6799-6805 | crates/dbx-core/src/persistence/storage.rs:7013-7019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:6799\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6799}}}],"partialFingerprints":{"codehealthFindingId/v1":"246a9acc5c83224a169f5b4c778c9e36923d2288db2916b2916b2041d404b1be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:3334-3340 | crates/dbx-core/src/query/mod.rs:4065-4071 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:3334\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":3334}}}],"partialFingerprints":{"codehealthFindingId/v1":"21887fa1a0e192b63be9e2fa89f63e0fa85ad15d35c168709854aa6b694538ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:6857-6863 | crates/dbx-core/src/query/mod.rs:6903-6909 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:6857\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":6857}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dad5571a7750c7081d5cdc390e4fd1eb5cdab6a7e1a27e08fe24a5c4d024f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/dbx-core/src/safety/production_safety.rs:255-261 | crates/dbx-core/src/safety/production_safety.rs:274-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/safety/production_safety.rs:255\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":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"18997668b4777f4315dccd3d735188e94183acd898060a1363befbb30b579fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:231-237 | crates/dbx-core/src/schema/mod.rs:258-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae24e3a08f3a8d6667d50c5a195ef1200d07a47ab0279cd122d2d15151df3057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:1139-1145 | crates/dbx-core/src/schema/mod.rs:8273-8279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d57dac3430159e8506ea2f1101865e1dfffa3c92825058aed3372ac628d1f65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:2703-2710 | crates/dbx-core/src/schema/mod.rs:14568-14574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:2703\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":2703}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2617b748cba2f1cb7b0261ff6a919dd2ac3b5df1306b578b3fc4c5abd6564f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:3235-3241 | crates/dbx-core/src/schema/mod.rs:3256-3262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":3235}}}],"partialFingerprints":{"codehealthFindingId/v1":"06eef3c606722b253262a6654e67b7c29c1d96b84be6c45490bb0e0c1e3df570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:10355-10361 | crates/dbx-core/src/schema/mod.rs:10493-10499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:10355\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1442504972c2f50674ccf40ee3b3ebfaba80d1c1f1f3ebd3530438852bb1de5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:12296-12303 | crates/dbx-core/src/schema/mod.rs:12373-12379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:12296\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12296}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcca35cad743ed75503ab87be19d391a60b22267ec2d06feaa6dd80566373297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/oracle_routines.rs:297-303 | crates/dbx-core/src/schema/oracle_routines.rs:322-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebde5637452be4b8fd0cebdf7d80c7af3141eecd906156bca2c1ba857e98d654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/oracle_type_data.rs:613-619 | crates/dbx-core/src/schema/oracle_type_data.rs:718-724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/oracle_type_data.rs:613\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ca067b70185375ef9798e3cd20ac13635a6b778f80b45708793c60a6b635f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-agent/src/agent_service.rs:1209-1215 | crates/dbx-driver-agent/src/agent_service.rs:1488-1494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e7adffaad35b960c12f8000d699ba83025dda31f2c73855b829693e46730d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-agent/src/backend_error.rs:1130-1137 | crates/dbx-driver-agent/src/backend_error.rs:1150-1157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/backend_error.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6351fdcc91d25a5503226a3a52e01bfe4211c1f19e6f5550c64df45af0ea932c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-elasticsearch/src/lib.rs:380-386 | crates/dbx-driver-elasticsearch/src/lib.rs:620-626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-elasticsearch/src/lib.rs:380\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8445c7310246ef7edb9dfb5c2a8c222453d560b52f70121443fcfa392acd47d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 9): crates/dbx-driver-elasticsearch/src/lib.rs:752-753 | crates/dbx-driver-elasticsearch/src/lib.rs:1008-1009 | crates/dbx-driver-elasticsearch/src/lib.rs:1022-1023 | crates/dbx-driver-elasticsearch/src/lib.rs:1525-1526 | crates/dbx-driver-elasticsearch/src/lib.rs:1561-1562 | crates/dbx-driver-elasticsearch/src/lib.rs:1609-1610 | crates/dbx-driver-elasticsearch/src/lib.rs:1912-1913 | crates/dbx-driver-elasticsearch/src/lib.rs:1933-1939 | crates/dbx-driver-elasticsearch/src/lib.rs:1995-2001 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-elasticsearch/src/lib.rs:752\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a3a24e922400ed07182a0fef40076f47143dc818498e3786aceef058a8feab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:136-142 | crates/dbx-types/src/models/connection.rs:2384-2390 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:136\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad100425ac7a456cfaef4fcc46540ca5ea476fd9f346a803b32a5fca2c11262e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:2352-2358 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2439-2445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2352\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f227bf50a67ea36edd34a197dd6a553135305d521f295b01b3cc3ccafe72a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:2762-2768 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2782-2788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2762\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c222b885b625955f755ef9da23cb2ec1f655c4955134f42ae2d3643b15acba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_shell.rs:1150-1156 | crates/dbx-driver-mongodb/src/mongo_shell.rs:1170-1176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs:1150\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"978228065ef8915c0a76bc65dd41f788d1de9cfabb6211e3d24af85a9ac4ad60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:3923-3929 | crates/dbx-driver-mysql/src/mysql.rs:3952-3958 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:3923\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-driver-mysql/src/mysql.rs:3960\u0060 calls \u0060get_opt_str\u0060 and \u0060crates/dbx-driver-mysql/src/mysql.rs:3931\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3923}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad13ab4d32ae43f3d16ade4d76279700f81c87dab1e958069341126a1a7099ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mysql/src/oceanbase_mysql.rs:91-97 | crates/dbx-driver-mysql/src/starrocks.rs:138-144 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/oceanbase_mysql.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/oceanbase_mysql.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc01c1514580c006e7654fe70ff662b730fe01fcd1b83b29c85f27a651fa793c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:2492-2498 | crates/dbx-driver-postgres/src/postgres.rs:2506-2512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:2492\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3210ec4c53a06a04048519d737a422c3e3e41f69fa10df107985d7c7226aa1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:11029-11035 | crates/dbx-driver-postgres/src/postgres.rs:11102-11108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:11029\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":11029}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56c992fb3f7d03477eaf0902dd860f768c4b49896d8a83d04a89fbe83e934a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-redis/src/lib.rs:2466-2472 | crates/dbx-driver-redis/src/lib.rs:2494-2500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":2466}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3f0251224806b87ba4c7c5c26edea3c87f2bcc4483a1e1cd5aa82f5de6df82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-sqlserver/src/sqlserver.rs:1399-1405 | crates/dbx-driver-sqlserver/src/sqlserver.rs:1410-1416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d5a5f638aa3376f889f485942834b59b3508ee043d1e88b7f68b1323098840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-support/src/db.rs:323-330 | crates/dbx-sqlite-worker/src/runtime.rs:252-259 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/db.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b63da772b2e5d2edaa60d08905ee1dc9b1306a4a22e9f3a471935bda32fdd1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-drivers/src/db/hbase_driver.rs:331-337 | crates/dbx-drivers/src/db/hbase_driver.rs:400-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-drivers/src/db/hbase_driver.rs:340\u0060 calls \u0060header\u0060 and \u0060crates/dbx-drivers/src/db/hbase_driver.rs:409\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/hbase_driver.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd570296202575b90327f8381ffc915ddb2e1f25260b2cb2a6b174f42724306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-drivers/src/db/influxdb3_driver.rs:157-163 | crates/dbx-drivers/src/db/influxdb3_driver.rs:221-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/influxdb3_driver.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0b7db30b0c2f5e68d3990346c4bdb5d58e8438ec3ccca14449e1878fbf6821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-drivers/src/db/turso_driver.rs:521-527 | crates/dbx-drivers/src/db/turso_driver.rs:533-539 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/turso_driver.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caef89558dacd06b2ad9882bd6bae2c8082f97f6cd3f41e2aeec015c2957005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-mcp/src/backend.rs:1227-1233 | crates/dbx-mcp/src/backend.rs:1286-1292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0018768c26ec732a6ff37fb2e4627ef7c37acaf2565cefe4b7ac3938baec527e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-mcp/src/server.rs:5535-5541 | crates/dbx-mcp/src/server.rs:5747-5753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:5535\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":5535}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1836808b49b1e8decf99b8a33268585f926284a836e73cd1d6a5c56b72b264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins/host.rs:595-601 | crates/dbx-plugin-runtime/src/plugins/host.rs:611-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-plugin-runtime/src/plugins/host.rs:595\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/host.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"440ac2d99ab59b66d7dbe68f617627532f8c2451553cd7a35bd14e2ecb09f451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins/installer.rs:949-958 | crates/dbx-plugin-runtime/src/plugins/installer.rs:976-985 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-plugin-runtime/src/plugins/installer.rs:949\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"8851d7e739d7c070d4e337faf8f9c336415bd9c2d7a9a671ee560875580ff48e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-sql-core/src/dml_preview_sql.rs:200-211 | crates/dbx-sql-core/src/dml_preview_sql.rs:306-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/dml_preview_sql.rs:200\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/dml_preview_sql.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be3044f054cf03df2e42fcd111abd03e1d91c2466f5cabfd8d1f3fba34a67ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql.rs:306-313 | crates/dbx-sql-core/src/object_source_sql.rs:398-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql.rs:306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0962580ac633cc4b7649ecf4a604b9789fcaab652d04fdfabf93405701bfbc31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_extractors/document.rs:91-100 | crates/dbx-sql-data/src/data_grid_extractors/document.rs:116-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/document.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f09ccedc373c7f9312b92a2b2ac81957a96eceed675b4bd3896838b2e5b043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): crates/dbx-sql-data/src/data_grid_sql.rs:2006-2012 | crates/dbx-sql-data/src/data_grid_sql.rs:2168-2174 | crates/dbx-sql-data/src/data_grid_tdengine_sql.rs:245-248 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_sql.rs:2006\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"08445cc760ec306a2fb6fc0cbede9aa8fce409ca353f610a07781cf294e691fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_sql.rs:3659-3667 | crates/dbx-sql-data/src/data_grid_sql.rs:3680-3688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_sql.rs:3659\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":3659}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd954a8ad75f5be5125f5aee6198777e67e8e0b379ff87d4348481f57839de7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-sql-dialect/src/sql_dialect/capabilities.rs:174-180 | crates/dbx-sql-schema/src/table_structure_sql/util.rs:66-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/capabilities.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6f5ebfb159e9017fc6ce9eab3e561b365c470432f7585c7fe2ebd90df7bf66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 4): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:696-700 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:798-804 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:970-976 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:1184-1188 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:696\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21fc6bcd346736fc86ceb7fc9ff355658b5bd61b00bdf26cb54062c442c7281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/comments.rs:141-147 | crates/dbx-sql-schema/src/table_structure_sql/comments.rs:190-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/comments.rs:141\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/comments.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c6d978348c33b5ba23f6da07e35bd287bf62a6a17866131746320ad4ab5e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-web/src/routes/cloud_sync.rs:280-287 | crates/dbx-web/src/routes/cloud_sync.rs:515-522 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/cloud_sync.rs:280\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/cloud_sync.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b0de9668ca4399dff01d349c5a07e3024a771f6f1c201e2136dcba0ddf69f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-web/src/routes/mcp_policy.rs:240-246 | src-tauri/src/commands/mcp_bridge.rs:1287-1293 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 and \u0060src-tauri/src/commands/mcp_bridge.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 174 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/mcp_policy.rs:240\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mcp_policy.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b16c2d04268f9c161c32aa79644cbc5d4d26df340ee808374fa8416f1ed6291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): crates/dbx-web/src/routes/mcp_policy.rs:388-394 | crates/dbx-web/src/routes/mcp_policy.rs:420-423 | crates/dbx-web/src/routes/mcp_policy.rs:461-467 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mcp_policy.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c437ac5e4d616566d23045622952b15830c16b3fe390aac159ae4d80b82892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-web/src/routes/mq.rs:1196-1202 | src-tauri/src/commands/mq_cmd.rs:609-615 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mq.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4956144413bf544a06e763833423eaa897d3b33ba87c0e827d613c620d47a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src-tauri/src/commands/mcp_bridge.rs:2435-2441 | src-tauri/src/commands/mcp_bridge.rs:2988-2994 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/mcp_bridge.rs:2435\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: \u0060src-tauri/src/commands/mcp_bridge.rs:2435\u0060 is reached only past a guard at line 2425 that tests \u0060config.db_type\u0060 and leaves the function early, and \u0060src-tauri/src/commands/mcp_bridge.rs:2988\u0060 reads \u0060config.db_type\u0060 with no such check. What separates these copies is not which lines they run but which PRECONDITION they enforce, so one of them is operating on state the other one refuses. Decide which is intended BEFORE unifying them \u2014 extract the shared part and whichever copy is missing the check keeps running unchecked, and if the guard is the correct behaviour then that hole is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c48e529af9222e418e764054f30035a6decab5b367968adf1a2195db3572b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src-tauri/src/commands/query.rs:75-82 | src-tauri/src/commands/query.rs:253-260 \u2014 both copies are in the same file, so extract the block into one function there 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-tauri/src/commands/query.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d51880369c0817236ad896dcbd9553e76c77023d6402bdad14251131c1b55fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/dbx-core/src/query/redis_ops.rs:1015-1020 | crates/dbx-core/src/query/redis_ops.rs:1199-1204 | crates/dbx-core/src/query/redis_ops.rs:1249-1254 | crates/dbx-core/src/query/redis_ops.rs:1274-1279 | crates/dbx-core/src/query/redis_ops.rs:1380-1385 | crates/dbx-core/src/query/redis_ops.rs:1442-1447 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/redis_ops.rs:1015\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"184bc660b6b393bc1c472699379dcb836c1013747a0694640e7bdab8d719f66f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/dbx-ai-provider/src/ai_codex_cli.rs:989-994 | crates/dbx-ai-provider/src/ai_grok_cli.rs:679-684 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:537-543 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:578-584 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_grok_cli.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs:989\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":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"2297d04edee27b41afa9c3ce29fa0e2739a3b4b718c846cf182f155a5b1da8d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/dbx-core/src/data/table_import.rs:3716-3721 | crates/dbx-core/src/data/table_import.rs:3730-3735 | crates/dbx-core/src/data/table_import.rs:4463-4468 | crates/dbx-core/src/data/table_import.rs:4474-4479 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35632e23a71a1ae2dc99bf95d91a4d1bc9517e5d0d6ce46281ddca2625133d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/dbx-drivers/src/db/sqlite.rs:1555-1560 | crates/dbx-drivers/src/db/sqlite.rs:1632-1637 | crates/dbx-drivers/src/db/sqlite.rs:2644-2649 | crates/dbx-drivers/src/db/sqlite.rs:2741-2746 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/sqlite.rs:1555\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e12e98f24df03f251f4763f666b296e9fee12beb9224ba2e0332ba0bbff468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/dbx-drivers/src/db/sqlite.rs:1597-1602 | crates/dbx-drivers/src/db/sqlite.rs:2539-2544 | crates/dbx-drivers/src/db/sqlite.rs:2622-2627 | crates/dbx-drivers/src/db/sqlite.rs:2696-2701 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/sqlite.rs:1597\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d1d4e2f144abcea78319fbd5be3051c022923875a5bccbb86b5bec69a94e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:85-90 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:162-167 | crates/dbx-ai-provider/src/ai_codex_cli.rs:381-384 | crates/dbx-ai-provider/src/ai_grok_cli.rs:132-137 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4425e7edeb94946f6ef08380affac2b2f3b2cccdae5854b11987fbaf836bdbc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-core/src/data/docs/dbml.rs:238-244 | crates/dbx-core/src/data/docs/dbml.rs:286-291 | crates/dbx-core/src/data/docs/dbml.rs:307-313 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/docs/dbml.rs:238\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/docs/dbml.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4b4cbc26f68f7e294f461085bbbf1df07cf53a33753c480eb74a86618f6dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-core/src/data/transfer.rs:9407-9412 | crates/dbx-core/src/data/transfer.rs:9473-9478 | crates/dbx-core/src/data/transfer.rs:9496-9501 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:9407\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":9407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03c0006204a3fe713c76f631319eaee771839a6975c4e92497253100c6bc08b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-core/src/data/transfer.rs:10475-10480 | crates/dbx-core/src/data/transfer.rs:10623-10628 | crates/dbx-core/src/data/transfer.rs:10720-10725 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":10475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c33159920c621aedf64d0ca2e744809c3a6ab20fdf1ba5a56309e2cfa0fc700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-core/src/query/redis_ops.rs:18-23 | crates/dbx-core/src/query/redis_ops.rs:64-69 | crates/dbx-core/src/query/redis_ops.rs:143-148 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/redis_ops.rs:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"46526e2b8266aa47518fe60e0ee4c3e7849f98c2c1b0020243c1cb53bdcf4070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:494-502 | crates/dbx-web/src/routes/mcp_policy.rs:176-184 | src-tauri/src/commands/mcp_bridge.rs:1684-1692 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs:494\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1702138f21dc040c5bb35082b20472c3a576219040f91bfd01cb2f6a65d173d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-mcp/src/server.rs:3971-3976 | crates/dbx-mcp/src/server.rs:4561-4566 | crates/dbx-mcp/src/server.rs:4690-4695 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3971}}}],"partialFingerprints":{"codehealthFindingId/v1":"baeaf39a2bda4513305e7516c645ea20c1685fc6e67c2d4268dd712c32dec295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-sql-data/src/query_result_sql.rs:1738-1743 | crates/dbx-sql-data/src/query_result_sql.rs:1838-1843 | crates/dbx-sql-data/src/query_result_sql.rs:2020-2025 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/query_result_sql.rs:1738\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-sql-data/src/query_result_sql.rs:1736\u0060 calls \u0060is_some\u0060 and \u0060crates/dbx-sql-data/src/query_result_sql.rs:2018\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"923c14b9a895e1e1a1f79fe82660496b995472fa380b6782deb613b0c5e31a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-sql-schema/src/schema_diff.rs:6802-6807 | crates/dbx-sql-schema/src/schema_diff.rs:6853-6858 | crates/dbx-sql-schema/src/schema_diff.rs:6880-6885 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:6802\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5415cb43835028aa735c428f59fbefc3d39309ca617c86642e971af0c94083ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-web/src/routes/database_export.rs:177-182 | crates/dbx-web/src/routes/query_result_export.rs:157-162 | crates/dbx-web/src/routes/table_export.rs:142-147 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/database_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/database_export.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9742bc6a72d5656e3fbe29867ee8845d1d5220ba2b4b28aef1caf4c4931cd9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/duckdb/src/schema.rs:551-556 | crates/dbx-drivers/src/db/sqlite.rs:1789-1794 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/schema.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8ffb0215e2604b8f1bab8f2c5e30b450d31f99ded433caacc391d727e832de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:361-366 | crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs:23-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e9c1ec78e4ee66b5789ff26aa133e367c9d20c67dfa55b532f82c5321a87d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:331-336 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:410-415 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:610-613 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:331\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:329\u0060 calls \u0060args\u0060, \u0060iter\u0060, \u0060envs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:610\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf03476062fab7db73b9fdc385e26c1b5eb541d1db3b7284ed73366ad36d76a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-ai-provider/src/ai_codex_cli.rs:107-113 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:248-253 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_pi_agent_cli.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"46004fde8b1a5cba629e7bec10477bd88f177daf636d63a5eeb57504465a36e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-ai-provider/src/ai_cursor_cli.rs:235-240 | crates/dbx-ai-provider/src/ai_cursor_cli.rs:285-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c7045f64fe1dafb7df0b4b538defde510e929ef1ac68c8a6db787caad703ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:173-178 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:184-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:184\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060mut\u0060 in one and \u0060\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_pi_agent_cli.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b438c38822a7f5e5d6dc582ec8f94fc447f36b3529fd800308792ccbfd96bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-cli/src/main.rs:497-502 | crates/dbx-cli/src/main.rs:549-554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-cli/src/main.rs:497\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-cli/src/main.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"45540288509df569ba7ed4f12f24c776882c54a41bd1860e0116f1d943b1ccc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:777-782 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:1368-1373 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f02fc63422c1f66f3df3a2bafde02f9a159ef63b9d8deb4ef9eb3d19118634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:1206-1213 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:1284-1293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rocketmq.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12013480999980f41bf545f12a48cb574c5a9826ae71ed2f69e722ab789ad24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/admin/mqtt/client.rs:490-495 | crates/dbx-core/src/admin/mqtt/client.rs:632-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a41c02867cdb721eb2d6ba1e1de08297f58a585efc58fecfe4ba10418c62bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/admin/nacos/access_control.rs:88-95 | crates/dbx-core/src/ai/agent_tools.rs:78-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/access_control.rs:88\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/access_control.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"641c2bf016f798683dc35e42b4b49488016ad29e8cb8a127d586b6b94da7f62f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/ai/plugin_tools.rs:832-842 | crates/dbx-mcp/src/plugin_tools.rs:127-137 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_tools.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb92e2ef5935ed579f833484f75b77074d5b3cf1d6c932bdda019cdb4c18c643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/connection/connection_secrets.rs:648-654 | crates/dbx-core/src/persistence/cloud_sync.rs:2713-2719 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/persistence/cloud_sync.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/connection_secrets.rs:648\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"98549be9fb7d709e3ea2ab61ba90aab86699d0bd0b299d84d7155057d5e2dccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/mongodb_import_export.rs:1285-1290 | crates/dbx-core/src/data/mongodb_import_export.rs:1306-1312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/mongodb_import_export.rs:1285\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a94a0fcde9b861a70f03a0e5c110083c6c1413d86da6ad5d67e52f2ec13d0f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:3158-3163 | crates/dbx-core/src/data/table_import.rs:3256-3261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:3158\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ce1d2b60ebc9f012d70bde8abe5bf97aadba05dd2342726926c91cf0a78dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:7520-7525 | crates/dbx-core/src/data/transfer.rs:7794-7799 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":7520}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4852db2ad9602430a09811a28afebceee5aea8d95d5eca4ef97e59a070ce059"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:1017-1022 | crates/dbx-core/src/persistence/storage.rs:1084-1089 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:1017\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"29924aeb63577ef30319ccee88c5043b3378e36b1ff246be6c3b814c58f1cf64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:6161-6166 | crates/dbx-core/src/persistence/storage.rs:8995-9000 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:6161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6161}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf3b8bbf1a33752523f25af754d3a9ab5f893d92eaef1c44126382c640f4b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:8452-8466 | crates/dbx-core/src/persistence/storage.rs:10152-10157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:8452\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22f6e196e9ce6d88d191cf8434e6819a5350e96c8f19a049d5e197bf5b3f9b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:5064-5069 | crates/dbx-driver-elasticsearch/src/lib.rs:2583-2588 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":5064}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c666ac627db767bbd7daecabc01e9e20ef48a91a8f12dd3998874b31b74093a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/query/redis_ops.rs:338-343 | crates/dbx-core/src/query/redis_ops.rs:370-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/redis_ops.rs:338\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/query/redis_ops.rs:376\u0060 calls \u0060transpose\u0060 and \u0060crates/dbx-core/src/query/redis_ops.rs:344\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/redis_ops.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5386287dd720c948871914c2f3666a37256f9ca173d585266754ccac891f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/agent_pg_sequences.rs:71-77 | crates/dbx-core/src/schema/kingbase.rs:118-124 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/agent_pg_sequences.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f8c23cd707500faceb47ff4506114b08aa86f3d57e9cd2db956fa55d22e45e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/operations.rs:1020-1024 | crates/dbx-core/src/schema/native_jobs/operations.rs:1029-1034 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/native_jobs/operations.rs:1029\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":"crates/dbx-core/src/schema/native_jobs/operations.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3901269ef391a28a83cb54f83b2ddd055a4023c9fe80ef3f055b73a13551f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/operations/dameng.rs:334-340 | crates/dbx-core/src/schema/native_jobs/operations/dameng.rs:348-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"09677b2e91e50497ea279c45e80c14624a393a532087b53b23cfde4057dc867e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/schema/oracle_routines.rs:382-387 | crates/dbx-core/src/schema/oracle_routines/readback.rs:64-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/oracle_routines.rs:382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad2ba8e33e4b6041050203a8e5b46bdf7d2f84cc0ec025b9471fe16b19d66a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs:716-721 | crates/dbx-core/src/schema/oracle_routines/transfer/packages/pending.rs:160-166 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c222a96d738a01009d7452ef3212cc838eb27280fc19f5f6c047777b669b4ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/skills/mod.rs:263-268 | crates/dbx-core/src/skills/mod.rs:677-682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/skills/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce174747daba35822d43a459e3cf9c87c8e26cbbd7f27cb69bd431029ed2340c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-agent/src/agent_driver.rs:524-529 | crates/dbx-driver-agent/src/agent_driver.rs:583-588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-agent/src/agent_driver.rs:524\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-driver-agent/src/agent_driver.rs:523\u0060 calls \u0060kill\u0060 and \u0060crates/dbx-driver-agent/src/agent_driver.rs:582\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f948063237e97017048597f120e58bc78bb6d029efe1dd56aae5ab6ae75c544"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-agent/src/backend_error.rs:1190-1196 | crates/dbx-driver-agent/src/backend_error.rs:1214-1220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/backend_error.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"36db3fd6c36e403a41c85c753fc0670e22c939f5b39d57f2341d582c56ee34c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-elasticsearch/src/lib.rs:451-456 | crates/dbx-drivers/src/db/solr_driver.rs:144-149 \u2014 before extracting anything, compare \u0060crates/dbx-driver-elasticsearch/src/lib.rs\u0060 and \u0060crates/dbx-drivers/src/db/solr_driver.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-elasticsearch/src/lib.rs:451\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e416a42568da6025c3f6fb5f1c748ecfbc5b58255ca262fb2db6dbfb7f5654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:1452-1457 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1689-1694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:1452\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932a208e852b9937f85df6a5e01ad3775026744bc2481557357570fdbe61ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:2257-2264 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2279-2286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2257\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"df848e98a4dd0c307c512ab203decdf00b3d4b1d1a7835bbd97be7096770e9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_oidc.rs:138-144 | crates/dbx-drivers/src/salesforce_oauth.rs:211-217 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_oidc.rs\u0060 and \u0060crates/dbx-drivers/src/salesforce_oauth.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_oidc.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43d33a617d58707570bfb0d1d8e670a23f8348fe7d9c960ef1f3603b0d7beae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20136 lines \u00D7 12): crates/dbx-driver-mysql/src/manticoresearch.rs:181-182 | crates/dbx-driver-mysql/src/mysql.rs:4204-4206 | crates/dbx-driver-mysql/src/mysql.rs:8220-8223 | crates/dbx-driver-mysql/src/mysql_compatible.rs:133-134 | crates/dbx-driver-mysql/src/ob_oracle.rs:58-58 | crates/dbx-driver-mysql/src/ob_oracle.rs:80-83 | crates/dbx-driver-mysql/src/ob_oracle.rs:127-128 | crates/dbx-driver-mysql/src/ob_oracle.rs:177-182 | crates/dbx-driver-mysql/src/ob_oracle.rs:242-243 | crates/dbx-driver-mysql/src/ob_oracle.rs:297-300 | crates/dbx-driver-mysql/src/ob_oracle.rs:345-350 | crates/dbx-driver-mysql/src/starrocks.rs:75-76 \u2014 there are 12 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 12 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:4204\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, \u0060crates/dbx-driver-mysql/src/ob_oracle.rs:177\u0060 calls \u0060collect_and_drop\u0060, \u0060map_err\u0060, \u0060to_string\u0060 and \u0060crates/dbx-driver-mysql/src/manticoresearch.rs:181\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/manticoresearch.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76a7cbb83e78aeabe6818c5c316202b574eae993afae972720285141b3eecd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:1935-1940 | crates/dbx-driver-postgres/src/postgres.rs:1979-1984 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:1935\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecd48e931212af7974be4dca226da92d84491b5f9c27c65a5eeeb8c41efca01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:1947-1954 | crates/dbx-driver-postgres/src/postgres.rs:1991-1996 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:1947\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"18210901a451ee7a150221bc2332b90de25aee37171a9d88539d009d2ab11f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:2513-2518 | crates/dbx-driver-postgres/src/postgres.rs:2732-2737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:2513\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c9997940c4bc8495c2859c0da9b0fddd9af4e1323149541470a6ecfaf8dae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-sqlserver/src/sqlserver.rs:3196-3201 | crates/dbx-driver-sqlserver/src/sqlserver.rs:3260-3265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs:3196\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":3196}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae1ff9ea838f6ffc80dc75c6c7c36873a7a8360595c41d191460174827cd343"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-support/src/http_tunnel.rs:125-132 | crates/dbx-drivers/src/db/proxy_tunnel.rs:86-93 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/http_tunnel.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c4af440ed9243aa4ee985c129fac9fdf3df05590056fde9bd26170d745743b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-drivers/src/db/cloudberry.rs:155-165 | crates/dbx-drivers/src/db/opentenbase.rs:114-124 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/cloudberry.rs:155\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudberry.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59824876741ecab7f572b16dba648830d74d7391d24ff09ff46bb65add1195b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-drivers/src/db/couchdb_driver.rs:688-693 | crates/dbx-drivers/src/db/solr_driver.rs:1061-1066 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/couchdb_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/solr_driver.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/couchdb_driver.rs:688\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060start\u0060 to \u0060Instant\u0060 in one and \u0060std::time::Instant\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d718c2c32a4bc9f055fc2fbd973927082ff21b519e01015b72ea72753642fc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-drivers/src/db/duckdb_worker_process.rs:549-556 | crates/dbx-drivers/src/db/duckdb_worker_process.rs:571-578 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_worker_process.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04c9dbd92a40b39331ccc9f663111618aeb6b4f5bb1d51ec359d48c4fc39ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-drivers/src/db/proxy_tunnel.rs:294-300 | crates/dbx-drivers/src/db/proxy_tunnel.rs:583-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/proxy_tunnel.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84bd6d397d562960fdb88c0a478b71b431ced2beaead62ffdb6ef2c39aca6f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-drivers/src/db/vector_driver.rs:677-682 | crates/dbx-drivers/src/db/vector_driver.rs:726-731 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/vector_driver.rs:677\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/vector_driver.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9edbb2faa4a7533f3009e593a896ecef1b1600d5fdf0b5762189a5f29be468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins.rs:396-401 | crates/dbx-plugin-runtime/src/plugins.rs:443-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-plugin-runtime/src/plugins.rs:388\u0060 calls \u0060ensure_plugin_compatible\u0060, \u0060begin_operation\u0060, \u0060find_driver\u0060 and \u0060crates/dbx-plugin-runtime/src/plugins.rs:442\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8a3ab88f9807944a1e6acb4cf1f4744a689c273203d0c1b5b2c5a0857183c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins/installer.rs:278-283 | crates/dbx-plugin-runtime/src/plugins/installer.rs:301-306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-plugin-runtime/src/plugins/installer.rs:278\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcbf79917007ee689556cd9984af92ce2e725ddc99296b4a5541b2e72b67476"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins/installer.rs:984-991 | crates/dbx-plugin-runtime/src/plugins/installer.rs:1027-1034 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead0dd33ff6fb04220f0c30dc5a62bd6344dab4aa72803d9fdcfaf402f22da94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins/installer.rs:1133-1144 | crates/dbx-plugin-runtime/src/plugins/marketplace.rs:798-808 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"22614f6ecbf63dc71f9c4a2d074ca00085243295d4e04405ff631a2e2e5962a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql.rs:1957-1962 | crates/dbx-sql-core/src/object_source_sql.rs:2012-2017 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql.rs:1957\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-sql-core/src/object_source_sql.rs:2018\u0060 calls \u0060push\u0060 and \u0060crates/dbx-sql-core/src/object_source_sql.rs:1963\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"643362352738ea107e2e9b5a2f46cbc583184045764ec865ad0ec84ca0db81fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:79-85 | crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:209-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f37c086f6d8261cf42e8774eb5a592fce63e2692397a259d12b203ba597d6da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-core/src/oracle_type_migration_sql.rs:202-207 | crates/dbx-sql-core/src/oracle_type_migration_sql.rs:801-806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/oracle_type_migration_sql.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e9768bb133d765c6d3941be12b0445a3b33ada2238a3498441fbcf760f90ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-core/src/sql_analysis.rs:699-704 | crates/dbx-sql-core/src/sql_analysis.rs:709-714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-sql-core/src/sql_analysis.rs:705\u0060 calls \u0060extend_from_slice\u0060 and \u0060crates/dbx-sql-core/src/sql_analysis.rs:715\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"694b2d82e754099a74f40645c2d9725db712de6f6520e1701c814fc5a76d5ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_extractors/sql.rs:55-60 | crates/dbx-sql-data/src/data_grid_sql.rs:577-582 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_extractors/sql.rs:55\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"172e1f88d878c168574dbea6ee40ad43cbb0121e1a9c6d34a3534821fece00ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_sql.rs:1614-1619 | crates/dbx-sql-data/src/data_grid_sql.rs:1643-1648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_sql.rs:1614\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab74c3b15db1f5960070724e9a505d4a66f6654d2b888f0b10ad1826db236f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:1869-1875 | crates/dbx-sql-data/src/query_result_sql.rs:2003-2009 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9d43a524e53789b912c37796fab08dc0ba1040d7ca357950aee18c02d944c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:4436-4442 | crates/dbx-sql-schema/src/schema_diff.rs:5909-5915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":4436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4132ee812c6f6975715fbc7c1fa791ee0158e523b8d272a2d7b262b2cc5fa871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:782-788 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:907-912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:782\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"57edeaa5999dfa11075416c10d4e5d299e28991a6fab25f5c2ec446bc6b4634e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:58-64 | crates/dbx-sql-schema/src/table_structure_sql/create_table.rs:275-281 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:58\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a9bf14149cd9902bd624b9f41e0de26443bfb53aa624d773ff51eec7d97b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:298-305 | crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:307-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4e63c31aa2300a049474bedd8fd8aea902597e2069c027717363fd1bf9ca6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-types/src/models/connection.rs:3217-3223 | crates/dbx-types/src/models/connection.rs:3227-3233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-types/src/models/connection.rs:3226\u0060 calls \u0060matches\u0060, \u0060count\u0060 and \u0060crates/dbx-types/src/models/connection.rs:3214\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":3217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcae3c47f0f93154f07560888e803a7bec5cfc16b21c465fd6b79c47f8d9a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-web/src/routes/connection.rs:1278-1283 | crates/dbx-web/src/routes/connection.rs:1285-1290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5768c94acb6b5d4ca69d7b93035f2f2e5cb66d8868ba521bfdcc6acb2c17cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:230-235 | crates/dbx-web/src/routes/table_import.rs:250-255 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b47f0f10563e86ba636abd825cf94785954fa49d48f1d2ce89efb30e6cdf60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:286-291 | crates/dbx-web/src/routes/table_import.rs:313-319 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/mongodb_import_export.rs:286\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60ef774c490044482fcc2430e5c5cf33ef14c940929ce6f4c0d4c80856dd4cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/dbx-web/src/routes/plugins.rs:240-242 | crates/dbx-web/src/routes/plugins.rs:319-324 | crates/dbx-web/src/routes/plugins.rs:338-343 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/plugins.rs:319\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-web/src/routes/plugins.rs:324\u0060 calls \u0060stop_external_driver_pools\u0060 and \u0060crates/dbx-web/src/routes/plugins.rs:242\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/plugins.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab61765efd3bdd6e730f9a6af9dcbc5dcb63d56e89daf5ef487934cfe177d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-web/src/routes/query.rs:861-869 | crates/dbx-web/src/routes/query.rs:911-919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/query.rs:861\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7d7d740971039b2605b2646c70c8a55d46f45cab8cf6bd785c7c4886300e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-web/src/routes/query.rs:871-882 | crates/dbx-web/src/routes/query.rs:921-932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/query.rs:871\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e36df3722f195f0548c34e4dcf010c95cc1b57f5ebde44ef4e884bf4c405283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/dbx-web/src/routes/database_export.rs:184-186 | crates/dbx-web/src/routes/query_result_export.rs:165-170 | crates/dbx-web/src/routes/table_export.rs:151-156 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/database_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/query_result_export.rs:165\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, \u0060crates/dbx-web/src/routes/query_result_export.rs:165\u0060 calls \u0060remove_file\u0060 and \u0060crates/dbx-web/src/routes/database_export.rs:184\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/database_export.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b43b0b507e6e906cff8d9bedd6a53c12779ce10d65a6b6f2756594787392bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-web/src/routes/schema.rs:247-252 | crates/dbx-web/src/routes/schema.rs:326-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/schema.rs:247\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7374db144e2130f4bb4532f76f1d82df0f9f085599ae2ef2bfa505822a9e8bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): crates/dbx-ai-provider/src/ai.rs:3893-3898 | crates/dbx-ai-provider/src/ai.rs:4001-4006 | crates/dbx-ai-provider/src/ai.rs:4147-4152 | crates/dbx-ai-provider/src/ai.rs:4245-4250 | crates/dbx-ai-provider/src/ai.rs:4498-4503 | crates/dbx-ai-provider/src/ai.rs:4698-4703 | crates/dbx-ai-provider/src/ai.rs:4871-4876 | crates/dbx-ai-provider/src/ai.rs:5132-5137 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3893\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-ai-provider/src/ai.rs:4000\u0060 calls \u0060minimax_stream_semantics\u0060 and \u0060crates/dbx-ai-provider/src/ai.rs:3892\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3893}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f06523ac5a3f7db880ddced91170547961e9e15ec0bc7535d817a4da098ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:720-724 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:773-777 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:818-823 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:899-903 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:943-947 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:720\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b640fa400adee1489e64a944eff7626441372a175c6dbf3324346df327ba94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/dbx-core/src/data/query_result_export.rs:1694-1701 | crates/dbx-core/src/data/query_result_export.rs:1901-1908 | crates/dbx-core/src/data/query_result_export.rs:2196-2203 | crates/dbx-core/src/data/query_result_export.rs:2386-2393 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1694\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/data/query_result_export.rs:2385\u0060 calls \u0060max\u0060 and \u0060crates/dbx-core/src/data/query_result_export.rs:1693\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"867602de171e9be7056d7802b2a1a99e618cc16ffd8d8ed1392e762ceec8a1c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/dbx-core/src/persistence/storage.rs:2869-2873 | crates/dbx-core/src/persistence/storage.rs:3029-3033 | crates/dbx-core/src/persistence/storage.rs:3044-3048 | crates/dbx-core/src/persistence/storage.rs:3054-3058 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:2869\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f07de54e928cd611c64f72da819f62a7001951985b660789a42dfc5fd4de4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 5): crates/dbx-core/src/schema/mod.rs:449-453 | crates/dbx-core/src/schema/mod.rs:519-523 | crates/dbx-core/src/schema/mod.rs:554-558 | crates/dbx-core/src/schema/mod.rs:588-590 | crates/dbx-core/src/schema/mod.rs:623-627 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/schema/mod.rs:590\u0060 calls \u0060clone_metadata_pool\u0060, \u0060ok_or\u0060, \u0060Mysql\u0060 and \u0060crates/dbx-core/src/schema/mod.rs:627\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"391d476ca032d61c445d7595d2de8c9bf256bedce7b7ef193a8d21bb52f59715"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/dbx-driver-sqlserver/src/sqlserver.rs:3302-3306 | crates/dbx-driver-sqlserver/src/sqlserver.rs:3308-3312 | crates/dbx-driver-sqlserver/src/sqlserver.rs:3314-3318 | crates/dbx-driver-sqlserver/src/sqlserver.rs:3320-3324 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"749a8a7ef66edeaf083341e7212a45eec55c6dcd5e579af5bf0445e79905bf81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/dbx-sql-core/src/object_source_sql.rs:226-230 | crates/dbx-sql-core/src/object_source_sql.rs:383-387 | crates/dbx-sql-core/src/object_source_sql.rs:783-787 | crates/dbx-sql-core/src/object_source_sql.rs:2177-2181 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59abee08d57bdf853621ca7b0991f6dbd32610e3b35ebb4c4f3b9c07ce6a1d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:733-737 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:782-787 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:907-911 | crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:954-959 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:913\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:738\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c211842fb2795cf995b1beecddc2af6cb12519affa0ad8b042741408e21b80f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agents/drivers/duckdb/src/sql.rs:42-46 | crates/dbx-drivers/src/db/duckdb_sql.rs:54-58 | crates/dbx-sql-core/src/sql.rs:2119-2123 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-drivers/src/db/duckdb_sql.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 169 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3f77b319cf8f6617424778d6e6b0f55a73b65d506949d4e9cad9fb4caf1e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agents/drivers/duckdb/src/sql.rs:239-243 | agents/drivers/duckdb/src/sql.rs:361-365 | crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs:23-27 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5010f644ebc5c5be0da926e0951848b1e72596b53b5018a52c8691c3c86938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:70-75 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:147-152 | crates/dbx-ai-provider/src/ai_grok_cli.rs:117-122 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:70\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060command\u0060 to \u0060\u0026ClaudeCodeCommandSpec\u0060 in one and \u0060\u0026CodeBuddyCommandSpec\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21cf96524411bbf92234417e02b579c15c9890c6b27a3365276f41ff0c5eb42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:231-236 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:312-316 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:204-208 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:231\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026ClaudeCodeRunOptions\u0060 in one and \u0060\u0026CodeBuddyRunOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:309\u0060 calls \u0060insert\u0060, \u0060to_string\u0060, \u0060String\u0060 and \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:228\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd8b61be519c020a8fd98a7745132a89d53f250de1ee491d98534aadb35db84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:361-366 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:766-771 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:247-252 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_qoder_cli.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:361\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f7408833cf98fa25f6c736bc51e1e415db19d4a462707582ca6baea0eda870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-core/src/data/database_export.rs:1339-1345 | crates/dbx-core/src/data/database_export.rs:1358-1364 | crates/dbx-core/src/data/transfer.rs:4502-4508 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"655e3800bbaaf7fd5ac95ccb1cbfec69c2ef8f62fe2cb793d0cd9f4550942b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-core/src/persistence/secret_codec.rs:295-299 | crates/dbx-core/src/persistence/secret_codec.rs:792-796 | crates/dbx-core/src/persistence/secret_codec.rs:806-810 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/secret_codec.rs:295\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/secret_codec.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1d59a4cd38585ad941fef2c8c1b9bada98e56c40aedfc1579f96e16f8d6f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-core/src/persistence/storage.rs:2588-2592 | crates/dbx-core/src/persistence/storage.rs:2937-2941 | crates/dbx-core/src/persistence/storage.rs:5073-5077 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:2588\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa13f895a205ce182a501b186dd9c92445214b3a4dfc2501c63e17396f771073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-core/src/schema/mod.rs:894-898 | crates/dbx-core/src/schema/mod.rs:957-961 | crates/dbx-core/src/schema/mod.rs:9280-9284 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:894\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/schema/mod.rs:953\u0060 calls \u0060as_ref\u0060, \u0060is_some_and\u0060, \u0060visible_schema_filter\u0060 and \u0060crates/dbx-core/src/schema/mod.rs:893\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc93bb04990804546f0ae7e021902291afbd4dea075f68579ac3a1493a0d5aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): crates/dbx-core/src/schema/mod.rs:10850-10853 | crates/dbx-core/src/schema/mod.rs:11080-11084 | crates/dbx-core/src/schema/mod.rs:11205-11209 | crates/dbx-core/src/schema/mod.rs:11224-11228 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:10850\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10850}}}],"partialFingerprints":{"codehealthFindingId/v1":"9037830eead9235335ded5fee85edf48078a009a9f4987c4c7c4bdd0b25edd62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): crates/dbx-driver-elasticsearch/src/lib.rs:2126-2141 | crates/dbx-drivers/src/db/couchdb_driver.rs:509-523 | crates/dbx-drivers/src/db/solr_driver.rs:873-887 \u2014 before extracting anything, compare \u0060crates/dbx-driver-elasticsearch/src/lib.rs\u0060 and \u0060crates/dbx-drivers/src/db/couchdb_driver.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d6ce465626eb1041dd2bb6a1d7f61119bd84604abc391cba6a94f7400b7e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_driver.rs:1403-1409 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1533-1539 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1641-1647 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:1403\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f37dc67254cefd4b2f041607a75860920477467b75746bd445fa1878a1a455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_driver.rs:2716-2721 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2761-2766 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2781-2786 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2722\u0060 calls \u0060Some\u0060, \u0060find_and_modify_array_filters\u0060, \u0060as_ref\u0060 and \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2767\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"0864036424e2b84f963edb3b19a563a3b5612bc33055cf729df1f307902fc8cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_driver.rs:2823-2828 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2860-2865 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2883-2888 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2829\u0060 calls \u0060Some\u0060, \u0060find_and_modify_array_filters\u0060, \u0060as_ref\u0060 and \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs:2866\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2823}}}],"partialFingerprints":{"codehealthFindingId/v1":"6080917c82ffa0c4f6a7e6f957abac088c66589de557920ea6eb0d5697e6ee66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-driver-mysql/src/mysql.rs:3088-3093 | crates/dbx-driver-mysql/src/mysql.rs:3126-3131 | crates/dbx-driver-mysql/src/mysql.rs:3273-3278 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3088}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70614cbe9b51b189a8bdd82eb56d3fd01073b9f8ba87f554c3c45bc5872c5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-driver-mysql/src/mysql.rs:5184-5188 | crates/dbx-driver-mysql/src/oceanbase_mysql.rs:93-97 | crates/dbx-driver-mysql/src/starrocks.rs:140-144 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:5184\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5184}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc19b1b352a76c4b8a8f60690700e1bef844f39103e347138e0e17f0880926f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:567-574 | crates/dbx-drivers/src/db/rqlite_driver.rs:417-424 | crates/dbx-drivers/src/db/turso_driver.rs:662-669 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs\u0060 and \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b7e88a5919653736170862f7a309da41fedf3c855a062c4cc8a760e8c81b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-plugin-runtime/src/plugins/installer.rs:956-961 | crates/dbx-plugin-runtime/src/plugins/installer.rs:983-988 | crates/dbx-plugin-runtime/src/plugins/installer.rs:1026-1031 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-plugin-runtime/src/plugins/installer.rs:956\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ecca31a3ba18d257698b1765e4207bb56ae72a96c4b216642d6b048e6d73e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-sql-core/src/query_execution_sql.rs:612-617 | crates/dbx-sql-core/src/query_execution_sql.rs:658-663 | crates/dbx-sql-core/src/query_execution_sql.rs:716-721 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f58f9f83c1b41781dda538a16a302d014dd69bdca88e13b8e2be8b43a13ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-web/src/routes/query_result_export.rs:67-73 | crates/dbx-web/src/routes/sql_file.rs:366-372 | crates/dbx-web/src/routes/table_export.rs:68-74 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/query_result_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query_result_export.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7759c0fa6a449a76145ef35530e34eb6734abf3ccbc57d40144cc075c42e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/duckdb/src/schema.rs:248-252 | agents/drivers/duckdb/src/schema.rs:371-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/schema.rs:248\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":"agents/drivers/duckdb/src/schema.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"255324939d46a60f4bc5725651a6cb73679b313adfcad30ee87afc8ce0da06a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:2944-2948 | crates/dbx-ai-provider/src/ai.rs:3110-3115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c621e6f647c06252b965850cd7f6bcc865c1b1d7c01e6ca72a63c1eb1a2926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:5283-5288 | crates/dbx-core/src/persistence/history.rs:119-124 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":5283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb510ccfa541c0cfefc810ca5487384cea4c4993829a6f27aa7f8d6c3c26f72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:457-461 | crates/dbx-ai-provider/src/ai_codex_cli.rs:991-995 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:457\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6227ea00443ca44ba8457ee2efd269af5504d3da11601e80e401fbc5cf4adef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): crates/dbx-ai-provider/src/ai_cli_agent.rs:450-454 | crates/dbx-ai-provider/src/ai_cli_agent.rs:628-632 | crates/dbx-ai-provider/src/ai_cli_agent.rs:1048-1050 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs:450\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs:446\u0060 calls \u0060default\u0060, \u0060parse_codex_turn_completed\u0060 and \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs:626\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb6666581e98c2180ec71cd53c66685c7cc24843ea7a15e90ebcaf6f6ea71d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-ai-provider/src/ai_cli_agent.rs:553-557 | crates/dbx-ai-provider/src/ai_cli_agent.rs:592-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de113eb6efa23172e9f915b910336348f81151a033a35f5f8183f5a7aa49696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/consul/blocking.rs:383-387 | crates/dbx-core/src/admin/consul/txn.rs:376-380 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/consul/blocking.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":"crates/dbx-core/src/admin/consul/blocking.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b5748a5b3e8861107ef38705726598ffb4fa18320cc3e4b0607591ee601141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/consul/client.rs:178-182 | crates/dbx-core/src/admin/consul/client.rs:210-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/client.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f6462c7bcc9d913a1afb51a4ad3388f4c01dc2b6dcef6b726f1c7ecca34f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:152-156 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:218-222 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2eb1ed26382d9a5ad99bd4979e6fb5dd6d4ebced7453a07dc91cffc06eb630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:1154-1158 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:1369-1373 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa3780518fb203c133eac5663cc7f13fcc8b73a1113fcb5f30da9baa3284b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/nacos/http.rs:623-627 | crates/dbx-core/src/admin/nacos/http.rs:649-653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/http.rs:623\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c8df305c7014ae01a94fd6e27befd5b4a37c5d228aed95c3e00c39a0b408dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/nacos/http.rs:4033-4037 | crates/dbx-core/src/admin/nacos/http.rs:4097-4101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/nacos/http.rs:4033\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77090186e5aca8b5253041f14624396b46966bc7e46fce3ece479737f47a15a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/connection/jdbc.rs:934-941 | crates/dbx-core/src/connection/jdbc.rs:971-978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/jdbc.rs:934\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"612fb7f31bb172dca86da22a6f7a7284cdeb7f09dec3d2225a8225f9f518a878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/connection/jdbc.rs:1094-1100 | crates/dbx-core/src/connection/jdbc.rs:1166-1172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e16ef6858663f5a6903e783243be25734b3af8958000118042b37c286d2a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/connection/jdbc.rs:1144-1152 | crates/dbx-core/src/connection/jdbc.rs:1201-1209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/jdbc.rs:1144\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03cd9b3d486d34b3ef20e19784bba75a6be232c706839de78f76e74ef44e720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/data/mongodb_import_export.rs:1212-1216 | crates/dbx-core/src/data/mongodb_import_export.rs:1252-1256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/mongodb_import_export.rs:1212\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce3b263279e1320cdf13247313f195c0e95bfa44267adc274d3d93bdde33cc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/data/query_result_export.rs:1634-1639 | crates/dbx-core/src/data/query_result_export.rs:2544-2548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/query_result_export.rs:1634\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"530fd6a960b8889825ef5e78850ad5e8a94b9f91c0931c1ffb3001ef510b4a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/data/table_export.rs:1306-1310 | crates/dbx-core/src/data/table_export.rs:2151-2155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_export.rs:1306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f07f251a07f97df9329d472d5b8c02b86f7ad494c86f06e90c6a88341ea328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:1353-1357 | crates/dbx-core/src/data/table_import.rs:1457-1461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:1353\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d529ad4c45751f23bc83b479496a86bb557bf9f766e8a669e4d43c71e46798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:1540-1545 | crates/dbx-core/src/data/table_import.rs:1559-1564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:1540\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d8d6ac2503fc5e06b739a93285d7714b37fe2447a4aebc880a3d87d7f81399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/persistence/cloud_sync.rs:431-436 | crates/dbx-core/src/persistence/cloud_sync.rs:889-894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c124eaa6495e76130304078e4f6786573ca6059499c08c1f947a7f18f3d6bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/persistence/cloud_sync.rs:3087-3091 | crates/dbx-core/src/persistence/cloud_sync.rs:3111-3115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":3087}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae51fa1ee6e68f855a5e14a53a1f9ef6b5860528602211973451751324939422"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/persistence/config/governance.rs:232-237 | crates/dbx-core/src/persistence/config/governance.rs:246-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/config/governance.rs:232\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/config/governance.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98c0d3ae619045995b2baf0ff100eb77b0ee19407625fd7c7f26f11dbd93381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:5121-5125 | crates/dbx-core/src/persistence/storage.rs:8137-8142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:5121\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":5121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef64c1637824cae7fd7c3d360e6faa3e3589afda138532e1e0a210ceef11bd5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/query/pl_debug/mutation.rs:184-189 | crates/dbx-core/src/query/pl_debug/mutation.rs:206-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/pl_debug/mutation.rs:184\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/mutation.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"698abf6ed631203419ab1a259ee2e29f64e4e5ac55ff21e985f8c0e5652ad3b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/query/two_phase_commit.rs:193-197 | crates/dbx-core/src/query/two_phase_commit.rs:353-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/two_phase_commit.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"012e83ef6c6593dbdd452f7cf090e9bffe494c098c788ab952d4310db6401ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/safety/production_safety.rs:1179-1183 | crates/dbx-core/src/safety/production_safety.rs:1189-1193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdfae1b7ad23c7e73b50785658c2bbec186c7ad8c9d5edd695efed968503f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:2785-2792 | crates/dbx-core/src/schema/mod.rs:8995-9002 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd754980f7d3af30faf18d989222b8db8702f6f15ab602598decf4f1935c6001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:13003-13007 | crates/dbx-drivers/src/db/questdb.rs:229-233 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060result\u0060 to \u0060db::QueryResult\u0060 in one and \u0060QueryResult\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":13003}}}],"partialFingerprints":{"codehealthFindingId/v1":"49839fd523ce36243c3a761a4d8fe18a7ce8b180acb683a90d837e4a7793ea0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:18043-18048 | crates/dbx-core/src/schema/mod.rs:18515-18520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:18043\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":18043}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7020770e0e3f077975c87bae2bdbdc648e0513e15a6f1b5b537f92e65422054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/operations/dameng/rename.rs:131-135 | crates/dbx-core/src/schema/native_jobs/operations/observation.rs:84-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/native_jobs/operations/dameng/rename.rs:131\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/operations/dameng/rename.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d705c615d4b6d9934e1141cd4daa6862f72d0e70f24cdc9e55cdc41c75fa881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/schema/oracle_routines/plan/package.rs:185-189 | crates/dbx-core/src/schema/oracle_routines/plan/package.rs:211-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/oracle_routines/plan/package.rs:185\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan/package.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48f5ad935d0d4f1c98b98155a38bc90aa8c58b673c89b820764c5647bfcf6cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/schema/oracle_type_data.rs:195-199 | crates/dbx-core/src/schema/oracle_type_evolution.rs:467-471 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/oracle_type_data.rs:195\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29babf5bb7745f9fd3789810ddb5b111cb3d7cb8bb07f6775a6671670afced8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/schema/oracle_type_details.rs:109-113 | crates/dbx-core/src/schema/oracle_type_management.rs:130-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/oracle_type_details.rs:109\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_details.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4103a5f2881ae48b369fc4f1156b699527f3281c136d745b3f688d98a2dde6ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:279-284 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:614-619 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5d35d28a9df1ccdfb0912f16d182abd129e8e77f6a00870e9c7db262af6c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/skills/mod.rs:270-274 | crates/dbx-core/src/skills/mod.rs:684-688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/skills/mod.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefe2081f56b0ca3f72ce912c38cd7771430ba13c83b81b73f0147b3f7c62389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-agent/src/agent_offline_export.rs:754-758 | crates/dbx-driver-agent/src/agent_offline_export.rs:859-865 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"29692f465f381597a1f145cbdfe4625ad1b79b8e61fa863107515c39c5ced5ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-agent/src/agent_runtime.rs:448-452 | crates/dbx-driver-agent/src/agent_runtime.rs:481-485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-agent/src/agent_runtime.rs:448\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_runtime.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0cb00ae76c23437ae0564f8a2877fb7b7a33c55b387b6f55055a9a6c7e2df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-agent/src/backend_error.rs:1071-1075 | crates/dbx-driver-agent/src/backend_error.rs:1083-1087 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/backend_error.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"49980e0eecf7c421667d7c83f0c67715046fc61de066e23241a12904a9f6a10e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:329-335 | crates/dbx-driver-mongodb/src/mongo_driver.rs:1167-1173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ef70eeccc9f1302a3b6d9249cc15fa848d5f0bb3f7bc8240f7ba7f5d83831f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_shell.rs:650-654 | crates/dbx-driver-mongodb/src/mongo_shell.rs:665-669 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs:650\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"779eca5866bf2da7ddd664b2fc3ccf232c72e347ef74671003cfa392857b7546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:2403-2407 | crates/dbx-driver-postgres/src/postgres.rs:3516-3520 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mysql/src/mysql.rs\u0060 and \u0060crates/dbx-driver-postgres/src/postgres.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:2403\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c3449d9af55fad2d25b03caa6780220f5118f189645ffe2e92aea25368b26e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:4966-4971 | crates/dbx-driver-mysql/src/mysql.rs:4983-4988 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:4966\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":4966}}}],"partialFingerprints":{"codehealthFindingId/v1":"e140aa64a21907615cef807ed64442c8610c99100cafc64a4db92858a540769b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 8): crates/dbx-driver-mysql/src/mysql.rs:4203-4204 | crates/dbx-driver-mysql/src/mysql.rs:8085-8086 | crates/dbx-driver-mysql/src/mysql.rs:8102-8106 | crates/dbx-driver-mysql/src/mysql.rs:8164-8167 | crates/dbx-driver-mysql/src/mysql.rs:8215-8219 | crates/dbx-driver-mysql/src/mysql_compatible.rs:144-145 | crates/dbx-driver-mysql/src/mysql_compatible.rs:243-244 | crates/dbx-driver-mysql/src/starrocks.rs:74-75 \u2014 there are 8 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:8102\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":4203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5ade321dba4225cf51cd009c8b9d5ebcef662dfdd97480f8f20060b7f982a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 4): crates/dbx-driver-mysql/src/mysql.rs:8085-8086 | crates/dbx-driver-mysql/src/mysql.rs:8122-8126 | crates/dbx-driver-mysql/src/mysql.rs:8180-8184 | crates/dbx-driver-mysql/src/mysql_compatible.rs:243-244 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:8122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":8085}}}],"partialFingerprints":{"codehealthFindingId/v1":"db73186993740a51d774014c49bbc2af7a568e043734a6dcad32de5731623191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:5513-5517 | crates/dbx-driver-postgres/src/postgres.rs:10357-10362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:10357\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":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":5513}}}],"partialFingerprints":{"codehealthFindingId/v1":"abffa678a36e795963dec0132e38cded3e62450790ee940528db83636cffbf87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-redis/src/lib.rs:515-519 | crates/dbx-driver-redis/src/lib.rs:604-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-redis/src/lib.rs:515\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb696dcdfed096d856f63e0676348fd3ce2f5fe33a460e441d816ac2ffaf2e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-sqlserver/src/sqlserver.rs:2141-2146 | crates/dbx-driver-sqlserver/src/sqlserver.rs:3955-3960 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b08c70fec35e9f0b9ee134c0bc9fa7fa1b6de441b26bbdaf3c2d4f730c4eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-drivers/src/db/couchdb_driver.rs:142-146 | crates/dbx-drivers/src/db/couchdb_driver.rs:387-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5adf94e4c98ecd1700849af98c22100352be7acfd6716538fb36e0a9e029949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-drivers/src/db/duckdb_worker_process.rs:777-781 | crates/dbx-drivers/src/db/duckdb_worker_process.rs:915-919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_worker_process.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abb72437bd6a880b4dd952201983915e93eebcd17391d1f273a013783dcdbf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-drivers/src/db/meilisearch_driver.rs:541-545 | crates/dbx-drivers/src/db/meilisearch_driver.rs:660-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/meilisearch_driver.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"110eb4080aa749cf36df68f93b976efe6d95ab26f98e1df6270661a9d9100c85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/dbx-drivers/src/db/questdb.rs:54-58 | crates/dbx-drivers/src/db/questdb.rs:85-89 | crates/dbx-drivers/src/db/questdb.rs:111-114 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/questdb.rs:54\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/questdb.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba2d21c34070b1acf5a8117554ae38b6933138de0df4b76aebd8250f71ff220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-mcp/src/server.rs:2886-2890 | crates/dbx-mcp/src/server.rs:3232-3236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"50030712046b3732209fe9033664c5578a8aa32fde74c6711f8d41222535386a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins.rs:336-340 | crates/dbx-plugin-runtime/src/plugins.rs:402-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c314400255691ee554111b3ffd603acf64aa8b9679fe225eac357e090076a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql.rs:258-262 | crates/dbx-sql-core/src/object_source_sql.rs:296-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql.rs:258\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba36d5e9efccb1ef478cad64775c9030c046d8cdf55f2c6fbf3a4a3f0d0ea38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:402-406 | crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:509-513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4559ccf2d0664212e0943fcdd5fe50163aa2ae4f04ee403250211ed98b816f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/dbx-sql-core/src/sql.rs:2253-2256 | crates/dbx-sql-core/src/sql.rs:3869-3874 | crates/dbx-sql-core/src/sql.rs:3945-3949 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/sql.rs:2253\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":2253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c87577ceb21cae6d5a94f2f17b38d9fce8c961229d57826e125e4790879062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-schema/src/native_job_changes.rs:412-416 | crates/dbx-sql-schema/src/native_job_changes.rs:531-535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/native_job_changes.rs:412\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f621fea4703c3251f8297902f4cf592b76ec29f0655c6937782c1c62903591e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:1896-1901 | crates/dbx-sql-schema/src/schema_diff.rs:1930-1935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:1896\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d78b72c994411026087c76fcf5e62e8bb1a1df8ee9681cfbce5147f6d45c9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:5968-5973 | crates/dbx-sql-schema/src/schema_diff.rs:5995-6000 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5968}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf02e0315deef7046cd30fb5c668d15a7be33a3dc1a6c303a1385af0e4d0c5cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/indexes.rs:421-425 | crates/dbx-sql-schema/src/table_structure_sql/indexes.rs:516-524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/indexes.rs:421\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/indexes.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b69ca1a08399edc02b7bc7c73dfcebafa06c68353d8f721dd4077111425cd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs:140-144 | crates/dbx-sql-schema/src/table_structure_sql/oracle_foreign_keys.rs:76-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs:140\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3be1ea16df98be30670f24a268b3c52e5f0f24a3aef54c68247b8a037f8f72d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/triggers.rs:121-126 | crates/dbx-sql-schema/src/table_structure_sql/triggers.rs:130-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/triggers.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"06684e1ed59a64669e8077e6c4f905b97e5ee93b1bf503b0e0bc2b989a1980f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-types/src/models/connection.rs:1820-1824 | crates/dbx-types/src/models/connection.rs:1831-1835 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"190a5c514df2698135f2ea6ad90cb9d882057d6d53e43014aee44456731926ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-web/src/auth.rs:204-211 | crates/dbx-web/src/auth.rs:276-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/auth.rs:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/auth.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f465194deb1de46add582d4bbd88d353a5f57298756281173113c4c07452e8af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-web/src/routes/connection.rs:1100-1108 | crates/dbx-web/src/routes/connection.rs:1127-1135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/connection.rs:1100\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"376329e2de1807b2583b4621f1727c1ce8692351031f6cbd97ac7ee59087e363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:292-297 | crates/dbx-web/src/routes/table_import.rs:322-328 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/mongodb_import_export.rs:292\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6fb83d9598db128218cc4c66b4b6d97616d92e5cdd6449bf6d14bdfead9311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:331-336 | crates/dbx-web/src/routes/table_import.rs:382-387 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38d2e5858551d0a25e4b853d3c1b20fa1371850c92d3710f085fdfb53b656a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:351-356 | crates/dbx-web/src/routes/table_import.rs:402-407 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e377247da0fdb9880f769d595030f4bb369a51b71744e0363b335806e37714d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:360-364 | crates/dbx-web/src/routes/table_import.rs:411-416 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"232ae7ef434e8341964520c761d0e6bf3b38a2dcd2af780ebd034e7b38001d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:373-386 | crates/dbx-web/src/routes/table_import.rs:425-438 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e083f23c3010f8587026c47d623ad7efebf12844e2f4138346d1ac4f904168e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-web/src/routes/query_result_export.rs:103-107 | crates/dbx-web/src/routes/table_export.rs:91-95 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/query_result_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/query_result_export.rs:103\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-web/src/routes/query_result_export.rs:101\u0060 calls \u0060drop\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs:89\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query_result_export.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce53ac8469b0a660e3fc2f4d1b083cfa605d5dbd8b9ea07c51e739e49a8fd5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-web/src/routes/query_result_export.rs:134-140 | crates/dbx-web/src/routes/table_export.rs:122-128 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/query_result_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_export.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query_result_export.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22cd14964e369e1a09539425ad1e250ae16dcf6bdc909a03c7435aee6b8bc94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): plugins/sdk/rust/dbx-plugin-sdk/src/lib.rs:132-137 | plugins/sdk/rust/dbx-plugin-sdk/src/lib.rs:356-361 \u2014 both copies are in the same file, so extract the block 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":"plugins/sdk/rust/dbx-plugin-sdk/src/lib.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e9da2c37ad7f340fce7f9dd6321b2c33f77285d62b8910a2d0fe6b9b59dc4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src-tauri/src/commands/app_settings.rs:568-572 | src-tauri/src/commands/app_settings.rs:592-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/app_settings.rs:568\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":"src-tauri/src/commands/app_settings.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e51f782093d98e522e5bf042c7aa59ef416a92abfe8b04fc2a8ab5502b74fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src-tauri/src/commands/connection.rs:2130-2136 | src-tauri/src/commands/connection.rs:2700-2706 \u2014 both copies are in the same file, so extract the block 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, \u0060src-tauri/src/commands/connection.rs:2129\u0060 calls \u0060is_some\u0060 and \u0060src-tauri/src/commands/connection.rs:2699\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":"src-tauri/src/commands/connection.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fbac1b2835d38de1703296bf4fd9d32404f52ec27bddfa5ee888fb3042825e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:67-72 | crates/dbx-drivers/src/db/duckdb_sql.rs:79-84 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-drivers/src/db/duckdb_sql.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 169 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e08bf4338e98633e36b26b8b69bf7953a0dec024f99bf742c12ebe249f7bb29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/duckdb/src/sql.rs:74-79 | crates/dbx-drivers/src/db/duckdb_sql.rs:86-91 \u2014 before extracting anything, compare \u0060agents/drivers/duckdb/src/sql.rs\u0060 and \u0060crates/dbx-drivers/src/db/duckdb_sql.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 169 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"24034947c20af50d6f14ace5ee15906193dd2d9c1fb964ee1eac73746e1ba93d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/tdengine/src/driver.rs:1059-1065 | crates/dbx-core/src/query/plugin_plan.rs:361-367 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/tdengine/src/driver.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b1a1b017c291db8f41cf9b09cbe02ba9e99cde4f57c767fed05b93c98013cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:77-82 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:154-159 | crates/dbx-ai-provider/src/ai_grok_cli.rs:124-129 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060command\u0060 to \u0060\u0026ClaudeCodeCommandSpec\u0060 in one and \u0060\u0026CodeBuddyCommandSpec\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"741e41d08196c13af74a86449cc6e8ed00adc37846a99971424ffe3afc9471d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:139-144 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:219-224 | crates/dbx-ai-provider/src/ai_codex_cli.rs:226-231 | crates/dbx-ai-provider/src/ai_grok_cli.rs:189-194 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:71-76 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316062907402940c932f09a798066bfaa7f6d62ab37f97fce846f41ecda54d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:166-171 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:246-251 | crates/dbx-ai-provider/src/ai_codex_cli.rs:247-252 | crates/dbx-ai-provider/src/ai_grok_cli.rs:216-221 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:98-103 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d3c47baf290f12112a2af93a5673663a7e5fdc4b096fc111898ad6ed49ecc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:177-185 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:257-265 | crates/dbx-ai-provider/src/ai_codex_cli.rs:478-486 | crates/dbx-ai-provider/src/ai_cursor_cli.rs:148-156 | crates/dbx-ai-provider/src/ai_grok_cli.rs:227-235 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:219-227 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:109-117 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4a0767f93a9ced738da7eff7c18f175d91c8ac56efa1c95934473fca2bb9c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:187-193 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:267-273 | crates/dbx-ai-provider/src/ai_codex_cli.rs:488-494 | crates/dbx-ai-provider/src/ai_cursor_cli.rs:158-164 | crates/dbx-ai-provider/src/ai_grok_cli.rs:237-243 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:229-235 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:430-436 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:119-125 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b3e0ae81ae1bed23fe802768288def845fe0a2d98f60dccc593069c4f7f23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:480-486 | crates/dbx-ai-provider/src/ai_codex_cli.rs:1013-1019 | crates/dbx-ai-provider/src/ai_grok_cli.rs:702-708 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"729c2a4aadd0f9b9adaa237377e4143aa30858829e4c995fef9274beea9dcd59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:695-700 | crates/dbx-ai-provider/src/ai_grok_cli.rs:613-618 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_grok_cli.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0e73ebe85a6ca75b810534401f76e0ce503b566c2a94eeb1761a67b9d22c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-ai-provider/src/ai_codex_cli.rs:434-439 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:411-416 | src-tauri/src/commands/mcp.rs:1647-1652 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_pi_agent_cli.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c59f33bb216b0b3d4457a975252e0d3c3d6ac485572957eee236f0b03c577a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-ai-provider/src/ai_cursor_cli.rs:127-132 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:198-203 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_cursor_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_opencode_cli.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea7022a2898e6ef87d5b21cf6ec106f74ebba3b9b8bc6b8a3efef73ec8a944c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/dbx-core/src/admin/consul/agent.rs:604-611 | crates/dbx-core/src/admin/consul/health.rs:173-180 | crates/dbx-core/src/admin/consul/kv.rs:448-455 | crates/dbx-core/src/admin/consul/session.rs:213-220 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/agent.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54bee8482231cb385b21cfe105147e83da61dd0336c3de81ab6473e41f1638c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:351-362 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:573-584 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"59102cc2f827b9667f503a1d175ed486fee8a370b9014b5f54c4fe0f3ec0b929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/connection/connection_secrets.rs:707-716 | crates/dbx-core/src/persistence/storage.rs:3699-3708 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/persistence/storage.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"3753afe7d8cf56b0f0af04bc69d3b136aee2e7b5550c2290a31e6bcffd80cc0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/connection/connection_secrets.rs:796-806 | crates/dbx-core/src/persistence/storage.rs:3710-3720 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/persistence/storage.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3adc854509500c09f74eecad42505e51b19f99498ea798c8cc1a5268720569b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-core/src/connection/connection_secrets.rs:903-907 | crates/dbx-core/src/persistence/cloud_sync.rs:2849-2853 | crates/dbx-core/src/persistence/storage.rs:10448-10452 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/persistence/cloud_sync.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8150c7d85c55d650d3928b5ef55a1717c295d5c3985d2bc2a502db9d6d1d90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/connection/connection_secrets.rs:933-939 | crates/dbx-core/src/persistence/storage.rs:3579-3585 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/persistence/storage.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"c097e87d88dac4583d653c55893022322d33d6e1aec318d4932bcb101dfb7d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-core/src/connection/connection_secrets.rs:949-956 | crates/dbx-core/src/persistence/cloud_sync.rs:2961-2968 | crates/dbx-core/src/persistence/storage.rs:3595-3602 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/persistence/cloud_sync.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"64998dd0908978c077e9b1f7270fd847dd842898e7410c4f0ebcfc9206f8f823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-core/src/data/database_export.rs:357-361 | crates/dbx-core/src/data/table_export.rs:1108-1112 | crates/dbx-formats/src/export_split_zip.rs:170-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"53351210e006359df8f1a41438331e787955a23c32355d02f9c05401df1750f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:1256-1263 | crates/dbx-sql-data/src/data_grid_sql.rs:3300-3307 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/data/database_export.rs\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060parts\u0060 to \u0060\u0026ExportRfc3339Parts\u0060 in one and \u0060\u0026Rfc3339Parts\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91c0317db2203eaf4ec2bcce30f78a3b8cb49ca76daafcf56b0646e6ff53991"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:1443-1447 | crates/dbx-core/src/data/transfer.rs:4129-4133 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"662db6d008cab0cccd1dd4b3a3318f8926fe4129c9f4db10cc548fef2d927971"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:3838-3845 | crates/dbx-sql-core/src/object_source_sql.rs:1465-1472 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":3838}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2831b4ca06db32c71d11dcdcbb47186744a764b60fb3240a8f8e0b36c19156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/data/transfer_rebuild.rs:120-129 | crates/dbx-drivers/src/db/salesforce_driver.rs:622-631 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_rebuild.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b2271cfa23608ef79542a6ffc33f9eb062f51d9e66c4f8e0f2858b6e7c8081"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:137-147 | src-tauri/src/commands/mqtt_cmd.rs:17-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060message\u0060 to \u0060\u0026MqttMessage) -\u003E (String\u0060 in one and \u0060\u0026MqttMessage\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4892a7efaebcac948e626d2a8d0095bbb029f44b79f223d838e27eb7a67cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:3195-3207 | crates/dbx-core/src/schema/providers/native.rs:336-348 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc65736998c30d52f0179b7f8b5775a594364f1baef3b2164814af2dcc3a313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:12088-12094 | crates/dbx-core/src/schema/providers/native.rs:378-384 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:12088\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12088}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c11ca77b7bd3f8880935a2e5bccf71e2e09c12f67eab7d359ec20ac8618d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:165-171 | crates/dbx-types/src/models/connection.rs:2436-2442 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d33513006ab64d13a61367239c5acd474fe3a3f1b8ad7084cb93e45c6e3661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mongodb/src/mongo_driver.rs:173-179 | crates/dbx-types/src/models/connection.rs:2444-2450 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"48265e3e18f6d1bbb2a70b1732d4985f45053df56d7246662d26a4a76d72b670"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:348-353 | crates/dbx-web/src/routes/mcp_policy.rs:30-35 | src-tauri/src/commands/mcp_bridge.rs:1538-1543 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4062410e2bccd5e07377ff319820920dc0b32fd2f91107383a77e14bc3e8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:537-541 | crates/dbx-web/src/routes/mcp_policy.rs:219-223 | src-tauri/src/commands/mcp_bridge.rs:1727-1731 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d119f14f496a9ef28ef77f0c04363cf7eb914f7fec64e76cb916bbdf6594c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:543-547 | crates/dbx-web/src/routes/mcp_policy.rs:225-229 | src-tauri/src/commands/mcp_bridge.rs:1733-1737 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b1915e8b6113088ce6fc28d99f157be378664ccf245037dd3b802fb2085d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-mysql/src/manticoresearch.rs:31-35 | crates/dbx-driver-mysql/src/ob_oracle.rs:33-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/manticoresearch.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbae4931734c51344082ea4aa9a3c525f3c557fd5f8587eac7b7568541c9e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-mysql/src/manticoresearch.rs:169-176 | crates/dbx-driver-mysql/src/mysql.rs:5679-5686 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/manticoresearch.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b659105d3a26db4711e2c28fa00a03a67cb211c68a1a603919f4d7dd1cac564"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:714-721 | crates/dbx-driver-redis/src/lib.rs:1403-1410 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060String\u0060 in one and \u0060\u0026str\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ebf900fd4e6daa6778c101b699f04ed7831c1c3453cc98066bd99681da226d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-mysql/src/oceanbase_mysql.rs:78-84 | crates/dbx-driver-mysql/src/starrocks.rs:125-131 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/oceanbase_mysql.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/oceanbase_mysql.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5858d16647d22a698aa38633d9715090212ee72e8158a0ebc75cde063500f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-support/src/db.rs:203-207 | crates/dbx-mcp/src/backend.rs:2917-2921 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/db.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df8566cc81d9f746b9772da2ffa5465bf767da078f05a85d4a4df940c46bc65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-support/src/http_tunnel.rs:118-122 | crates/dbx-drivers/src/db/proxy_tunnel.rs:79-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/http_tunnel.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa08347b4f628adfbfdaff87a44ac6209814cfdb53eba340c100bcf1404d96ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-support/src/http_tunnel.rs:134-139 | crates/dbx-drivers/src/db/proxy_tunnel.rs:95-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/http_tunnel.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d430b808555fcd47083087ef9ca5c9b4cf9c0a684f012455d348c176ba7007fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-drivers/src/db/cloudflare_d1/mod.rs:558-564 | crates/dbx-drivers/src/db/rqlite_driver.rs:408-414 | crates/dbx-drivers/src/db/turso_driver.rs:653-659 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/cloudflare_d1/mod.rs\u0060 and \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/mod.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d336b65456a9fdcf5e31412f1c0d46e3bb2ad0dc54d2cda9d72caeaf9524dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-drivers/src/db/rqlite_driver.rs:399-406 | crates/dbx-drivers/src/db/turso_driver.rs:644-651 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/rqlite_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/turso_driver.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 255 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060result\u0060 to \u0060RqliteResult\u0060 in one and \u0060TursoExtractedResult\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/rqlite_driver.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fc02db19c70b661221de4fad1620bf5faaa90c53d5af35cbf01ba6ea88aa7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/dbx-plugin-runtime/src/plugins/assets.rs:114-121 | crates/dbx-plugin-runtime/src/plugins/installer.rs:1280-1287 | plugins/sdk/packager/src/main.rs:637-644 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/assets.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e338738f66370dba3dc5f8b6c16c650456c065a566abfd14ee01430e944e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-tauri-consul/src/commands.rs:11-19 | src-tauri/src/commands/connection.rs:3137-3145 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src-tauri/src/commands/connection.rs:3137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-tauri-consul/src/commands.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1b29d74aee2763fc5598e60d5b8b7e7009e5265f0357966c77b102c14a6553"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-tauri-consul/src/lib.rs:117-126 | crates/dbx-tauri-schema/src/lib.rs:90-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-tauri-consul/src/lib.rs:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-tauri-consul/src/lib.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94a482e6972aa7607f56a439c065a6e8b2938011488d274d91aec79a4b2c5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-web/src/routes/agents.rs:432-441 | crates/dbx-web/src/routes/jdbc.rs:180-189 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/agents.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5248831e1e55fc593049118e7220176a907be636a0f09620efbe50803c3565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): crates/dbx-web/src/routes/consul.rs:14-22 | crates/dbx-web/src/routes/document_store.rs:35-43 | crates/dbx-web/src/routes/etcd.rs:16-24 | crates/dbx-web/src/routes/hbase.rs:15-23 | crates/dbx-web/src/routes/mongo.rs:49-57 | crates/dbx-web/src/routes/redis.rs:17-25 | crates/dbx-web/src/routes/zookeeper.rs:14-22 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/document_store.rs\u0060 and \u0060crates/dbx-web/src/routes/mongo.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/consul.rs:14\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d4696e3535575724dece1e819539c95ba38dce76137cece53e9fbf8ce30b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-web/src/routes/docs.rs:28-38 | crates/dbx-web/src/routes/mcp_policy.rs:328-338 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/docs.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc135d4bd2db4ae237a9553a4e3f4849df615bd2896a7f936719d70dce6d5b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src-tauri/src/commands/database_export.rs:16-22 | src-tauri/src/commands/table_export.rs:16-22 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/database_export.rs:16\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060emit\u0060 to \u0060impl FnOnce(ExportProgress)\u0060 in one and \u0060impl FnOnce(TableExportProgress)\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/database_export.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ab6374d6838481dd5d0d1ae1351cf89b860fb514c4dd6604f3b261b019759a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src-tauri/src/commands/external_db.rs:12-19 | src-tauri/src/commands/external_sql.rs:147-154 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src-tauri/src/commands/external_db.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea90b923cceae7867c0771a73ed6f27392fbc49e540982c75db54d558eae9cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src-tauri/src/commands/external_db.rs:63-71 | src-tauri/src/commands/external_sql.rs:388-396 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src-tauri/src/commands/external_db.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5967a958ff102c16f8d38ae5cec13a79f19beb8e71a7d55d5d56ef043de88b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-ai-provider/src/ai_codex_cli.rs:96-103 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:176-183 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_opencode_cli.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5414ebe290c43d5fc8bb8ef25549b3c03d7e9a6caf71bb30afae02f70e19a9b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-ai-provider/src/ai_cursor_cli.rs:218-224 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:359-365 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_cursor_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_opencode_cli.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_opencode_cli.rs:359\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04899bf146fc63f425e18ffb64290efceabc39218a9a4ac71034dedde3f4348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/mongodb_import_export.rs:3065-3070 | crates/dbx-core/src/data/table_export.rs:1101-1106 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":3065}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec7700f0b374474c4aba64fa72a0f03f0d037fe9093511b88367c15fabeee4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/mongodb_import_export.rs:3072-3077 | crates/dbx-core/src/data/table_export.rs:1114-1119 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":3072}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05db3fb263452cc0a0bf2a2fe20f9d815e73e63828ff1c770e621d603327dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/dbx-web/src/routes/consul.rs:252-257 | crates/dbx-web/src/routes/consul.rs:282-287 | crates/dbx-web/src/routes/consul.rs:292-297 | crates/dbx-web/src/routes/etcd.rs:197-202 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/consul.rs:252\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/consul.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddd5db7b6e2acf9c28ec192864c7a81cc2f8d1e3ea002eef337d36c5727f19c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:76-81 | crates/dbx-web/src/routes/table_import.rs:71-78 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5acd77ecf26774e80873eecca1c43903c4a0233fc1960324cca54aaf6cffeae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:6733-6758 | crates/dbx-core/src/persistence/storage.rs:6863-6888 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:6733\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6733}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee2147f3e271cfb706fb518aa89926c9690df6506876b15c3927e0427e810d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:6218-6238 | crates/dbx-sql-schema/src/schema_diff.rs:6263-6280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:6218\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6218}}}],"partialFingerprints":{"codehealthFindingId/v1":"590469c87c9137bac2d87fdb58bf9f9173371d3de200fcdb2774a6b0c279f9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-core/src/ai/agent_tools.rs:466-482 | crates/dbx-core/src/ai/agent_tools.rs:630-645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/ai/agent_tools.rs:630\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea564b67ce635a911a07cd2b990f4fa2e6f18a9d33914d5e066cee0d4f2e0406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-drivers/src/db/ssh_tunnel.rs:666-681 | crates/dbx-drivers/src/db/ssh_tunnel.rs:693-704 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/ssh_tunnel.rs:666\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf1ba2f0a1dc1d7def1589942fabb82bd77e2791238e2527f946df754c60bc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:2969-2983 | crates/dbx-core/src/connection/mod.rs:3004-3019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:2969\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":2969}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb4ccd0e6d32440fdcea57f60d85ed2c59bbf2af0af1694061fb2927c98e661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:5091-5106 | crates/dbx-core/src/connection/mod.rs:5121-5136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:5091\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":5091}}}],"partialFingerprints":{"codehealthFindingId/v1":"819055d13860872693eecd0765e33a298049405a455513da0b28a6ccb8f4a5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-core/src/data/transfer_runner.rs:392-405 | crates/dbx-core/src/data/transfer_runner.rs:458-472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer_runner.rs:392\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"795a85ae55fd535f61ddc313682d3116e7911a158b898f745bd62c2a7f78ad66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-elasticsearch/src/lib.rs:1650-1663 | crates/dbx-drivers/src/db/solr_driver.rs:687-698 \u2014 before extracting anything, compare \u0060crates/dbx-driver-elasticsearch/src/lib.rs\u0060 and \u0060crates/dbx-drivers/src/db/solr_driver.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-elasticsearch/src/lib.rs:1650\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae345995aa61a1cc239695a9c72e37a600bd5a49972c62186036e0764bdc2936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-driver-support/src/http_tunnel.rs:38-51 | crates/dbx-driver-support/src/http_tunnel.rs:80-93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-support/src/http_tunnel.rs:38\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/http_tunnel.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8af26abce169a6b1cc3aa3a6ee822cad721d7580049232706760ddac89a44d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/dbx-mcp/src/backend.rs:2424-2437 | crates/dbx-mcp/src/backend.rs:2447-2460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/backend.rs:2424\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4897b16088a9e7c8d9302b405cc65aa93086272da18cf0723d07d66ca2475e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:5271-5283 | crates/dbx-core/src/data/database_export.rs:5359-5371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:5271\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3404036aabc350f74a8354b90cc31b2a58da57cb9613b55f324def3eed9b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-sqlserver/src/sqlserver.rs:2292-2303 | crates/dbx-driver-sqlserver/src/sqlserver.rs:2365-2376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-sqlserver/src/sqlserver.rs:2292\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f13cc55b4874f92ba90d1e0506ca870dff068508b04365fa835825de2f39c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-drivers/src/db/dynamodb_driver.rs:1162-1173 | crates/dbx-drivers/src/db/dynamodb_driver.rs:1195-1204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/dynamodb_driver.rs:1162\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ccf55a9fb93c33f1214add96fb1dfef49925139436db85a12f848505810934"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dbx-driver-agent/src/agent_service.rs:748-759 | crates/dbx-driver-agent/src/agent_service.rs:2455-2466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-agent/src/agent_service.rs:748\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e423f83f9788dca9e911896d66b605d9417b2b5cd0aa925eefcab025a8fa7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:11238-11248 | crates/dbx-core/src/data/transfer.rs:11270-11280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:11238\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":11238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1553b5258febc8462686cdbefcf4b3f0a1532094d1eb7aa2375669a19646da8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:5731-5739 | crates/dbx-driver-postgres/src/postgres.rs:5794-5804 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":5731}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca65d8809d97e8162cf457f9bfcc09caf48aa805797d113fc03b213937f089d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/dbx-driver-postgres/src/postgres.rs:5731-5739 | crates/dbx-driver-postgres/src/postgres.rs:5794-5804 | crates/dbx-driver-postgres/src/postgres.rs:10980-10990 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":5731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16b93f5ae3ed7751c63a103315db1566521a7647a88efb8ede4673bc1cdf4f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:6773-6782 | crates/dbx-core/src/persistence/storage.rs:6924-6934 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:6773\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":6773}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebb750170da9a7b886003a2addf9512e21bad07d9738a2cfa0dafbe78ed348e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/data/transfer_runner.rs:724-734 | crates/dbx-core/src/data/transfer_runner.rs:796-806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer_runner.rs:724\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"258242b658290cf4ced3c708a224850401209552a1177df6db2dadf4fed243e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-drivers/src/db/sqlite.rs:1563-1569 | crates/dbx-drivers/src/db/sqlite.rs:2652-2662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/sqlite.rs:1563\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d555967a1ccc5b4713d2cbf24728b0efeed9fbd879df953f71efaac57f3dae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/dbx-core/src/admin/mqtt/client.rs:538-548 | crates/dbx-core/src/admin/mqtt/client.rs:680-690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mqtt/client.rs:538\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c35fc0538c6f8df23fda0daf50f3e7fffe1539e35a0b27072696b075c1c917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-agent/src/agent_offline_export.rs:739-749 | crates/dbx-driver-agent/src/agent_offline_export.rs:851-858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-agent/src/agent_offline_export.rs:739\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68211f80d1ddcc9ea50bc197c3721378f12be5c20922f6061255c4bd7e34f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:1982-1992 | crates/dbx-core/src/persistence/storage.rs:2607-2616 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ae74e9ebd1de43fbcf61da7aa0eeda75cfd279745461e42c0248194ecb9514"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201310 lines \u00D7 3): crates/dbx-web/src/routes/schema.rs:623-625 | crates/dbx-web/src/routes/schema.rs:698-707 | crates/dbx-web/src/routes/schema.rs:783-792 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/schema.rs:623\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-web/src/routes/schema.rs:698\u0060 calls \u0060external_doris_catalog\u0060, \u0060as_deref\u0060 and \u0060crates/dbx-web/src/routes/schema.rs:623\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/schema.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c296f89c1e6719903b7e52ce44c89e58052c7270d5344042d86cad470f0c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/query/document_ops.rs:279-288 | crates/dbx-core/src/query/document_ops.rs:291-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/document_ops.rs:279\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f7b7ded607bef2037c8143d0790a527912e6db83f42ea1964df525ff233a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src-tauri/src/commands/cc_switch.rs:18-27 | src-tauri/src/commands/cc_switch.rs:63-72 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/cc_switch.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0493a08e7dfa4ddf58191c869afd2c7ead951031675f7b0909d08058b0c794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:12193-12201 | crates/dbx-core/src/schema/mod.rs:12223-12232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:12193\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cf7b23353e4ccf8d882ae53c01dd247406123890ed83d399de96eb573a11c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:14798-14807 | crates/dbx-core/src/data/transfer.rs:14936-14945 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:14798\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14798}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b071ef60928a4a0e2b457c7d48aab284b0d93af6d01e3d95dcd9c354ef0b309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:4115-4122 | crates/dbx-core/src/persistence/storage.rs:4491-4500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25b52a57aee9ab0f006e627ddd605e1178cf1c583fb08b2a5e68b6816636fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-agent/src/agent_service.rs:2613-2620 | crates/dbx-driver-agent/src/agent_service.rs:3635-3644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":2613}}}],"partialFingerprints":{"codehealthFindingId/v1":"27925e5020132693183cbc7f7c9509dc4927181d8e638ecdefca84e3e9d1482f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:2927-2936 | crates/dbx-core/src/persistence/storage.rs:9448-9455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:2927\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2927}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c631d8688c6d4871543a7516a6e56eeef7ea4e2a44cb6dd303df8420febc97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/create_table.rs:451-460 | crates/dbx-sql-schema/src/table_structure_sql/create_table.rs:462-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/table_structure_sql/create_table.rs:462\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/create_table.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3666e32ce3db6be1c1a6e3ce5b13822753ccec8afe367c271f9f1e41e2927e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-core/src/admin/mqtt/client.rs:446-455 | crates/dbx-core/src/admin/mqtt/client.rs:564-573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mqtt/client.rs:446\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mqtt/client.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2f7de3e13d575137a7b7bf879ecf21c6758641fabd09b2834a29a818bd4616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:7461-7475 | crates/dbx-core/src/data/transfer.rs:7554-7568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:7461\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":7461}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23b04eaabd494df453b1be968da3c21cd30387dceb13aa7858fa91c68231bfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/dbx-sql-data/src/data_grid_extractors/sql.rs:189-198 | crates/dbx-sql-data/src/data_grid_extractors/sql.rs:240-249 | crates/dbx-sql-data/src/data_grid_extractors/sql.rs:333-342 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_extractors/sql.rs:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_extractors/sql.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"179aae42cf52db0310282d4800ddb4cb4b088463b860f13ff2e500202b8a8e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src-tauri/src/commands/mcp_bridge.rs:1817-1826 | src-tauri/src/commands/mcp_bridge.rs:2267-2276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/mcp_bridge.rs:1817\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":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0488e0646fee90faf4b78672d46e8f9717f4714080dd471e4fdbad136676f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-mcp/src/transaction.rs:622-631 | crates/dbx-mcp/src/transaction.rs:633-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/transaction.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5469f5fc396f7ad5b09526f7e5f575c38f184e820edfe34de2fcc5243603b55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs:738-747 | crates/dbx-sql-core/src/oracle_view_rename.rs:765-774 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs:738\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs:748\u0060 calls \u0060as_ref\u0060, \u0060is_some_and\u0060, \u0060is_empty\u0060 and \u0060crates/dbx-sql-core/src/oracle_view_rename.rs:775\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a458a97fa183d1754cb00053d8fc8b2de0e9dbedd0ddd87f75815eefd01151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-mcp/src/server.rs:2459-2467 | crates/dbx-mcp/src/server.rs:2528-2536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:2459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4094ec018232899ad3bc37e2663fb51a35f6e889f1a654320c864a02ddbce8a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/dbx-core/src/data/transfer.rs:14718-14726 | crates/dbx-core/src/data/transfer.rs:14742-14750 | crates/dbx-core/src/data/transfer.rs:14766-14774 | crates/dbx-core/src/data/transfer.rs:14795-14803 | crates/dbx-core/src/data/transfer.rs:14996-15004 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:14718\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":14718}}}],"partialFingerprints":{"codehealthFindingId/v1":"7136b172046b6806d4c0095be97098516cf588176ae75d6750c8ceac84b7f5cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-drivers/src/db/sqlite.rs:1532-1540 | crates/dbx-drivers/src/db/sqlite.rs:2698-2705 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/sqlite.rs:1532\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-drivers/src/db/sqlite.rs:2697\u0060 calls \u0060to_string\u0060 and \u0060crates/dbx-drivers/src/db/sqlite.rs:1531\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d09cf81b68f5a366a9c9f8259920b91a79bb6b4e4da989fb24b1973f8552b17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/data/sql_file_import.rs:370-376 | crates/dbx-core/src/query/mod.rs:2030-2038 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/sql_file_import.rs:370\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3ed22ab5cc5305d1ac8310560d96917c0fc2c1555b187384a2a32b734acaad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:1733-1741 | crates/dbx-core/src/data/transfer.rs:1750-1758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:1733\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"28aa497b80dd04c3ff5b2136952187f25ec42ad706136d0f6e643c7c3ff500d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:4451-4459 | crates/dbx-ai-provider/src/ai.rs:5018-5026 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:4451\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"321088e5d1ca479de789cd1666925379a8b03e0ca13cae55d214bfb8617b9d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src-tauri/src/commands/connection.rs:2988-2994 | src-tauri/src/commands/connection.rs:3036-3044 | src-tauri/src/commands/plugins.rs:150-156 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/connection.rs:2988\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, \u0060src-tauri/src/commands/connection.rs:3000\u0060 calls \u0060emit\u0060 and \u0060src-tauri/src/commands/connection.rs:3046\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":"src-tauri/src/commands/connection.rs"},"region":{"startLine":2988}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4beb8f74c5464634d412364cb63f77877e17069878132fbbc205361450409a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:5877-5885 | crates/dbx-core/src/data/transfer.rs:5904-5912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:5877\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":5877}}}],"partialFingerprints":{"codehealthFindingId/v1":"823907448aa0c41cc3ca64e8e4126ea43aec6fdca0471d3d0a5b1d4b89c2f2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/data/transfer/mysql_xugu.rs:744-750 | crates/dbx-core/src/data/transfer/mysql_xugu.rs:764-772 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/mysql_xugu.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"468a0e71e62eb5550e519a12062d3fe43431a195af67abd98f84fd81eb119766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:1145-1151 | crates/dbx-core/src/connection/mod.rs:1243-1251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/mod.rs:1145\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"089a03c2b56199193c2522f9d7d099810a6cb3a49f0061d837cb83c54d8d3e37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/duckdb_export.rs:195-203 | crates/dbx-drivers/src/db/duckdb_query_sessions.rs:120-128 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/duckdb_export.rs:195\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/duckdb_export.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e511bc92de96e857fc3eb62673b3ef30098ad20976d2af7c018ef4e49b8a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins/manifest.rs:1772-1780 | crates/dbx-plugin-runtime/src/plugins/manifest.rs:1784-1790 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-plugin-runtime/src/plugins/manifest.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"988788ca2b59d22141142e385da0624423cc950854170e2f28e6cc38efb53953"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-drivers/src/db/dynamodb_driver.rs:730-738 | crates/dbx-drivers/src/db/dynamodb_driver.rs:742-750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/dynamodb_driver.rs:730\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439890df90c588d4f08cfed0be195f0c1ad18fe079e001b105c7425c4d27f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-driver-redis/src/lib.rs:4936-4944 | crates/dbx-driver-redis/src/lib.rs:4952-4960 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":4936}}}],"partialFingerprints":{"codehealthFindingId/v1":"621faf29554d524e0a4243c0858f2359dbf46d0829ecea5990cb93477881cf6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/persistence/cloud_sync.rs:2828-2836 | crates/dbx-core/src/persistence/cloud_sync.rs:2838-2846 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/cloud_sync.rs:2828\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfef8c5a6a1eb36c6ddcb2959dab3793929b350064f92d3792872f3b964b0518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:12864-12872 | crates/dbx-core/src/data/transfer.rs:12901-12909 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:12864\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":12864}}}],"partialFingerprints":{"codehealthFindingId/v1":"58284f828dc777a0241931c1de87e45ea0eb2ef275f3e34968ad786ecfcf2b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins/installer.rs:1252-1260 | plugins/sdk/packager/src/main.rs:589-597 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-plugin-runtime/src/plugins/installer.rs:1252\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"45629c872ce613bb98008ea7ca86aa03e426a25fd26431460df6625100514a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/admin/consul/client.rs:62-70 | crates/dbx-core/src/ai/agent_kv.rs:1262-1270 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/client.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"497c8d50e31f5dcdde654d4fd27245fc712d6d98fedfdda63f2f55a3965eaf2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/dbx-sql-schema/src/native_job_changes/dameng.rs:40-47 | crates/dbx-sql-schema/src/native_job_changes/dameng.rs:293-300 | crates/dbx-sql-schema/src/native_job_changes/dameng.rs:302-309 | crates/dbx-sql-schema/src/native_job_changes/dameng.rs:311-318 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/native_job_changes/dameng.rs:40\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes/dameng.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5b6908d0491cf5d782c0fa44f2c36cb0fa2451a5ce1339c1c7e65cb06f08df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-drivers/src/db/dynamodb_driver.rs:864-871 | crates/dbx-drivers/src/db/dynamodb_driver.rs:887-894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/dynamodb_driver.rs:864\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bd093ee9cf15f785d2e8f510ba03061df94657e639793dee367a97fbbe5e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:3325-3332 | crates/dbx-ai-provider/src/ai.rs:3376-3383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:3325\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3325}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a160f1430d180c83b12d377bf2a6de1d6dff2bc174d25ff5580b17355d81cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:7044-7051 | crates/dbx-driver-mysql/src/mysql.rs:7082-7089 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:7044\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7044}}}],"partialFingerprints":{"codehealthFindingId/v1":"805187d7f382cf430f211fb194676cd8e37fa4282f55a5ebd360ce6ecd6d39a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:7056-7063 | crates/dbx-driver-mysql/src/mysql.rs:7094-7101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:7056\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7056}}}],"partialFingerprints":{"codehealthFindingId/v1":"88450435ff625267d1a8b8c5b34870967890089733d990ddb8dfe0828abe1c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-web/src/routes/agents.rs:112-118 | crates/dbx-web/src/routes/agents.rs:130-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/agents.rs:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-web/src/routes/agents.rs:128\u0060 calls \u0060starts_with\u0060 and \u0060crates/dbx-web/src/routes/agents.rs:110\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/agents.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"101c24becfa90f08461598baf6125957ad4dddf7b1a2de5c973f711d878d62aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:1956-1963 | crates/dbx-core/src/persistence/storage.rs:1966-1973 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:1956\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6174f6fd218316bde5f9747ef6e0b2e5bb553081cf61a361c189a6261ef599"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins.rs:346-353 | crates/dbx-plugin-runtime/src/plugins.rs:411-418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-plugin-runtime/src/plugins.rs:346\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"8375b17c60d1cc43e6b133ec86f15c5b41f6eeb665d30325a0cacb69c500d5fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:264-271 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:348-355 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:374-381 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:396-403 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:264\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7eafca16b7c4a359643e4ff40fdade2faf1d73dccfb4dbaeb03ece48bd5036e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): plugins/sdk/packager/src/main.rs:521-526 | plugins/sdk/packager/src/main.rs:529-536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/packager/src/main.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c6870e9486f705c4817540553d836719a3360cb6267fd3620dca9baee87b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/dbx-plugin-runtime/src/plugins/marketplace.rs:559-568 | crates/dbx-plugin-runtime/src/plugins/marketplace.rs:671-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-plugin-runtime/src/plugins/marketplace.rs:559\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/marketplace.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f99d0c3a61c340f66d095b9399bb28e0cb3aef206de32a8e2a003aae6e2016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 3): crates/dbx-driver-mysql/src/manticoresearch.rs:79-82 | crates/dbx-driver-mysql/src/oceanbase_mysql.rs:22-29 | crates/dbx-driver-mysql/src/starrocks.rs:77-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/manticoresearch.rs:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/manticoresearch.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d968555cc43064971d608f8c4f9c13b5d5674efe77d78be33285ccd8a4253864"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src-tauri/src/lib.rs:3334-3341 | src-tauri/src/lib.rs:3351-3358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/lib.rs:3334\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":"src-tauri/src/lib.rs"},"region":{"startLine":3334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef8d424ea89c42690e0257d7ccc0755417e09fa67928866c35b852ab7367a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_dump.rs:348-353 | crates/dbx-web/src/routes/mongodb_import_export.rs:509-515 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/mongodb_dump.rs:348\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_dump.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feeea5e632f789ebf285aecdef9c0be061b1f68aa5a3255e4e248610b5497cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): crates/dbx-ai-provider/src/ai_cli_agent.rs:685-691 | crates/dbx-ai-provider/src/ai_cli_agent.rs:813-816 | crates/dbx-ai-provider/src/ai_cli_agent.rs:945-951 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs:685\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec22959ded38913380e36cbb69f8d401dc57f31bcbe5629780d8adefbbc2a570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/dbx-mcp/src/server.rs:3466-3472 | crates/dbx-mcp/src/server.rs:4038-4044 | crates/dbx-mcp/src/server.rs:4383-4389 | crates/dbx-mcp/src/server.rs:4424-4430 | crates/dbx-mcp/src/server.rs:4515-4521 | crates/dbx-mcp/src/server.rs:4545-4551 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:3466\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-mcp/src/server.rs:4432\u0060 calls \u0060tool_error\u0060 and \u0060crates/dbx-mcp/src/server.rs:4045\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":3466}}}],"partialFingerprints":{"codehealthFindingId/v1":"514d8ea4c5fd8250121c6318ee3ec20c022a1e25f9b65de3ee9534ed7eeea0c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:4727-4733 | crates/dbx-core/src/persistence/storage.rs:5382-5388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:4727\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":4727}}}],"partialFingerprints":{"codehealthFindingId/v1":"6613568d4c8f57c546419e6b0c788dc9148883e5bbe35a64cf61b9f8e9b9f54a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-ai-provider/src/ai_codex_cli.rs:837-843 | crates/dbx-ai-provider/src/ai_codex_cli.rs:896-902 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs:837\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd7d30de03ef3b1e3abb1ab7789bc259cf74310d98f6e74910eb653d2f9a4a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/cloud_sync.rs:1633-1639 | crates/dbx-core/src/persistence/cloud_sync.rs:2947-2953 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/cloud_sync.rs:1633\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"9479b34b4506990ed819147699237578b7d978cbbd13113566e5a7872aa3870a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-agent/src/agent_offline_export.rs:1110-1116 | crates/dbx-driver-agent/src/agent_service.rs:3663-3669 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-agent/src/agent_offline_export.rs:1110\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_offline_export.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d697ddeddfa43ae917bd833a68da6f7b453e86c88c1c64cb825951d2e595891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-ai-provider/src/ai.rs:1659-1665 | crates/dbx-ai-provider/src/ai.rs:1674-1680 | crates/dbx-ai-provider/src/ai.rs:1689-1695 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e7d0b1698a57e8ff30def1959cf139b96cf4b53c2942e6efcc49a8e040f284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-agent/src/agent_service.rs:4358-4364 | crates/dbx-driver-agent/src/agent_service.rs:4381-4387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-agent/src/agent_service.rs:4358\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":4358}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2ea9b3df6356a1a44f3c4d47d6a7f547a8dd685ff280f97cd1f5d9bb499531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:122-128 | crates/dbx-ai-provider/src/ai_grok_cli.rs:172-178 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:54-60 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_grok_cli.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac369a4b70e49820f4aa8f520fae8ff33c086185d5ab2a5f8352ff34696faa73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:6024-6030 | crates/dbx-driver-postgres/src/postgres.rs:10516-10522 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":6024}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25358ea44104be668bf1b4cdceaa1720b947193ed23ebb9a7569ae687d48d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-drivers/src/db/couchdb_driver.rs:459-465 | crates/dbx-drivers/src/db/couchdb_driver.rs:473-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/couchdb_driver.rs:459\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"404ea2868f9d6acf6902556d6120421cc1c883a06e547b90b4574dc1aab4f732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:23-29 | crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:60-66 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_neo4j_sql.rs:23\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_neo4j_sql.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f76cf074e2969e093424003bf69da68f77f48f802f4bc3050f80368b365af9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:122-128 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:199-205 | crates/dbx-ai-provider/src/ai_grok_cli.rs:172-178 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:54-60 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7735e61979c03636b2739b38b4fc9bf6b9f3c267ac429eb066b6a8c9f14cb961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:3153-3159 | crates/dbx-core/src/persistence/storage.rs:7351-7357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":3153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f905ccd9ad74a63166039e13bd10f249a3c0a88f160354a90f6f1d52c4e76489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-drivers/src/db/dynamodb_driver.rs:921-926 | crates/dbx-drivers/src/db/dynamodb_driver.rs:942-948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/dynamodb_driver.rs:921\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/dynamodb_driver.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"370f2507984e1f5f9ca69e3320b30e3d739e29d2a058d53014109990156bb08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/cloud_sync.rs:2778-2784 | crates/dbx-core/src/persistence/cloud_sync.rs:2788-2794 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/cloud_sync.rs:2778\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2778}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d61cd031c4b906df2cfada338808646d04413348531034900a7345f3aee6589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-drivers/src/db/couchdb_driver.rs:321-327 | crates/dbx-drivers/src/db/couchdb_driver.rs:454-460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/couchdb_driver.rs:321\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"00216a407df57eedabb59617da2a1040e3fe73f57b25f173430a1ec2edd70e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:9879-9885 | crates/dbx-core/src/persistence/storage.rs:9947-9951 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:9879\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":9879}}}],"partialFingerprints":{"codehealthFindingId/v1":"9861ea11d2623b2d01d52c8bcde5ee4a15576007985dc82a130a7c5c05d3d11e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 3): crates/dbx-core/src/persistence/storage.rs:2189-2195 | crates/dbx-core/src/persistence/storage.rs:2827-2828 | crates/dbx-core/src/persistence/storage.rs:4143-4149 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:2827\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0394c239e24f2d97a442b1435943e841c533b1a6736f68a894fee3c652caad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/schema/native_jobs/details.rs:89-95 | crates/dbx-core/src/schema/native_jobs/details.rs:115-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/details.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d025d7647a385857db36007907453a6c6742e74a5fe70871af61b2a9f5ae7f4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/dbx-web/src/routes/mongodb_import_export.rs:258-264 | crates/dbx-web/src/routes/nacos.rs:934-940 | crates/dbx-web/src/routes/table_import.rs:280-286 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/mongodb_import_export.rs:258\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"947cfcf09c2763be389a999bcef3aae4bf49720c93f071e54a96fe9b4b36f9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src-tauri/src/commands/mcp_bridge.rs:1848-1854 | src-tauri/src/commands/mcp_bridge.rs:1943-1949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands/mcp_bridge.rs:1848\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"974b8aa05615210782e6c58aee470abbe0086d8755df6b2ca4dafa708b1ceb7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/admin/consul/kv.rs:311-316 | crates/dbx-core/src/admin/consul/kv.rs:339-345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/consul/kv.rs:311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/kv.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1bc0a6cf6a0722b60ac0772c462d2be00cf3e4bd3c0f59e6c767b6b73f394b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/schema/oracle_type_data.rs:131-137 | crates/dbx-core/src/schema/oracle_type_evolution.rs:423-428 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/oracle_type_data.rs:131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/schema/oracle_type_evolution.rs:430\u0060 calls \u0060yes_no\u0060, \u0060Some\u0060 and \u0060crates/dbx-core/src/schema/oracle_type_data.rs:139\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad9d497b8ff5a1fab7d1be41c9ce897d3dd5146883c09ba88b9f1a049bb9beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-sql-core/src/object_source_sql.rs:233-238 | crates/dbx-sql-core/src/object_source_sql.rs:389-394 | crates/dbx-sql-core/src/object_source_sql.rs:2184-2189 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql.rs:233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f934a9be8363a7016bc4cf3b7a88a3fb41a83960051cf1d494b8b6a121e2ac15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-mcp/src/server.rs:6293-6298 | crates/dbx-mcp/src/server.rs:6309-6314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/server.rs:6293\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":6293}}}],"partialFingerprints":{"codehealthFindingId/v1":"696b9acb2a9aea0931a22b322fd8cf9bd8af3b1529b17c528f50463b2be92575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-mcp/src/backend.rs:1228-1233 | crates/dbx-mcp/src/backend.rs:1261-1266 | crates/dbx-mcp/src/backend.rs:1287-1292 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/backend.rs:1228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"793119f3c562ac01cd56174841f74a0f6d1e1794c157025264448d82f0e124d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/transfer.rs:7446-7451 | crates/dbx-core/src/data/transfer.rs:7538-7543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/transfer.rs:7446\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":7446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c9ff317ffadd39642b13709507d5ee43f7d4f543cf6c453525e38853fb4dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-ai-provider/src/ai_cursor_cli.rs:105-110 | crates/dbx-ai-provider/src/ai_opencode_cli.rs:156-161 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:229-233 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_cursor_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_opencode_cli.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87a0ab11ad62c6c324979ce9a52d44a806f802c0d330109986c273975ae438a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:3095-3100 | crates/dbx-driver-mysql/src/mysql.rs:3154-3159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"166a5f661a065cf0ee7b62bbc739f57d64e8a8b833d432ed4e0fd217dc510b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:2464-2469 | crates/dbx-ai-provider/src/ai.rs:2609-2614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:2464\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"b202af5143e3041162b9a06cddefc04cc1c34c6c2b06c0b255355b601e5ba165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-core/src/persistence/storage.rs:7666-7671 | crates/dbx-core/src/persistence/storage.rs:7749-7754 | crates/dbx-core/src/persistence/storage.rs:7809-7814 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":7666}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79c15bad2887101e96962742f32ce20a2b40feb64836206354961952c2ea8a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/data/table_export.rs:864-868 | crates/dbx-core/src/data/transfer.rs:12563-12568 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"201358133896f2360d93721eaab19396bf22504f7f4b47d573219cc3fe0a4e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-schema/src/schema_diff.rs:1824-1829 | crates/dbx-sql-schema/src/schema_diff.rs:1838-1843 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-schema/src/schema_diff.rs:1824\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b5609755553022ec69cebd279c5d2d2fbb3729f9a4e58a6ab7f704112c493a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-mcp/src/backend.rs:1236-1241 | crates/dbx-mcp/src/backend.rs:1295-1300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-mcp/src/backend.rs:1236\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/backend.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d9a8ebfd344ed36a8aa47117c9e842e8e79cfbb41b07154e41fcbe603f91aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-core/src/admin/consul/client.rs:50-55 | crates/dbx-core/src/ai/agent_kv.rs:1243-1248 | crates/dbx-mcp/src/backend.rs:698-703 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/consul/client.rs:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/client.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"402d4f9b7e21c0c8c5c6f6d5bbdbbb8b73713e0c678b5c6358ac7f2857144ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:669-674 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:1082-1086 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61cc5cd7f65e4d083607f6390c2776e2e6d985450a00a8e810c87278a540fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/query/pl_debug/results.rs:402-407 | crates/dbx-core/src/query/pl_debug/results.rs:423-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/pl_debug/results.rs:402\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug/results.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0113bf73bd86794fd70ee2550e2daf5bcdaf735cdca48ead1e19d406181fd2f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:672-676 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:717-722 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:717\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:678\u0060 calls \u0060Some\u0060, \u0060get\u0060, \u0060and_then\u0060 and \u0060crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:723\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_pi_agent_cli.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a4863f3d4678bc8b82a37d196bce7985c5f69b6f9e471aa320d1d921838a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-ai-provider/src/ai_codex_cli.rs:115-120 | crates/dbx-ai-provider/src/ai_pi_agent_cli.rs:255-259 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_pi_agent_cli.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5b89b2ce50820d010d556c93af24eea59c76f100904e4817d25200ba233b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/table_export.rs:802-807 | crates/dbx-core/src/data/transfer.rs:12561-12566 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_export.rs:802\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41f1085a7ac25eddf4ee77fb98ef74145c3c7160fb09cf2ac1f30412b0126ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:8159-8164 | crates/dbx-core/src/persistence/storage.rs:8172-8177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:8159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":8159}}}],"partialFingerprints":{"codehealthFindingId/v1":"561a2c3a6f007bf7d930857a6133a00d4d5a6831a27023e9976792388d1ff85d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/dbx-core/src/schema/oracle_ddl_indexes.rs:835-840 | crates/dbx-core/src/schema/oracle_ddl_indexes.rs:857-862 | crates/dbx-core/src/schema/oracle_ddl_indexes.rs:874-876 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/oracle_ddl_indexes.rs:835\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_ddl_indexes.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"581454f269d6969a1c0c9e75e46ce8f4692a0cccb81e73d1874961ed87056a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-ai-provider/src/ai.rs:4962-4967 | crates/dbx-ai-provider/src/ai.rs:4974-4979 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai.rs:4962\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4962}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bfacc89b57c7ced6b0368d5181a76c82ac45d6c590868de72d743d0ed8c680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql.rs:352-357 | crates/dbx-sql-core/src/object_source_sql.rs:481-486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql.rs:352\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"84303739ad1ec27d9baea6aa389b4e2a3ba7ea1fce00062aab1b33e8ce0405d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/script_generator.rs:1296-1301 | crates/dbx-core/src/data/script_generator.rs:1324-1329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/script_generator.rs:1296\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/data/script_generator.rs:1294\u0060 calls \u0060is_empty\u0060 and \u0060crates/dbx-core/src/data/script_generator.rs:1322\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"77eb0fcd130d23ebca2dbbf1f38476a61c3a1c6682e214662192888bdd4c0e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:3138-3143 | crates/dbx-core/src/data/table_import.rs:3212-3217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:3138\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3138}}}],"partialFingerprints":{"codehealthFindingId/v1":"14298372a5e74f9c608f4b6a5729d986ad81f0390188f01cded190ea4e6b9812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:525-529 | crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs:543-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b6d175f77b306c896a67954c4ebf89e53dd656ea1a2210ccfd33350f16894f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/duckdb/src/schema.rs:107-118 | agents/drivers/duckdb/src/schema.rs:127-138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/duckdb/src/schema.rs:107\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/duckdb/src/schema.rs:104\u0060 calls \u0060Err\u0060, \u0060to_string\u0060 and \u0060agents/drivers/duckdb/src/schema.rs:126\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":"agents/drivers/duckdb/src/schema.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c570b21a2895d55467613654bca32cfe36ff551bf424427ea283cdb65ac8b3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-drivers/src/db/influxdb3_driver.rs:80-84 | crates/dbx-drivers/src/db/influxdb_driver.rs:105-109 | crates/dbx-drivers/src/db/victoriametrics_driver.rs:144-148 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/influxdb3_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/influxdb_driver.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 \u0060crates/dbx-drivers/src/db/influxdb3_driver.rs:80\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/influxdb3_driver.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a647eaf768ec053b11ccbedc7836d1e6f941be9bdbfcfeada043eadb8d00f4fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src-tauri/src/commands/mcp_bridge.rs:1899-1903 | src-tauri/src/commands/mcp_bridge.rs:2050-2054 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: \u0060src-tauri/src/commands/mcp_bridge.rs:1899\u0060 is reached only past a guard at line 1851 that tests \u0060req.database\u0060 and leaves the function early, and \u0060src-tauri/src/commands/mcp_bridge.rs:2050\u0060 reads \u0060req.database\u0060 with no such check. What separates these copies is not which lines they run but which PRECONDITION they enforce, so one of them is operating on state the other one refuses. Decide which is intended BEFORE unifying them \u2014 extract the shared part and whichever copy is missing the check keeps running unchecked, and if the guard is the correct behaviour then that hole is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f791117510a4df291d2b86bdc16e74459be8e148c3af784267f7a6f0603578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs:118-122 | crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs:246-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_routines/analysis/package.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"77461d1a0bb56728952c1be92a7140552b7fa818b24c4b9a3026c592f519e4fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-redis/src/lib.rs:4829-4833 | crates/dbx-driver-redis/src/lib.rs:4848-4852 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-redis/src/lib.rs:4829\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":4829}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86b95af5bd7f1c76d87383bb1449a3303fde3590bb8295a749c49c4f454625f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:967-971 | crates/dbx-core/src/data/transfer.rs:4054-4058 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/database_export.rs:967\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0a861fba63a8baa67903d48eeb2ffc02f696c5cd567a41dcc4432494131c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/schema/oracle_type_data.rs:138-142 | crates/dbx-core/src/schema/oracle_type_evolution.rs:431-435 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/oracle_type_data.rs:138\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-core/src/schema/oracle_type_evolution.rs:429\u0060 calls \u0060yes_no\u0060, \u0060Some\u0060 and \u0060crates/dbx-core/src/schema/oracle_type_data.rs:137\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_type_data.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f376720c415e046eeb00718b65a1a308ba44163157abb6cfb7e41d1c49fc15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-core/src/persistence/state_persistence.rs:397-401 | crates/dbx-core/src/persistence/state_persistence.rs:425-429 | crates/dbx-core/src/persistence/state_persistence.rs:449-453 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/state_persistence.rs:397\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/state_persistence.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ff5e2031c0c4ab04e7b242ae996a108732996fcda32535fb7aa1b21662c05e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/dbx-drivers/src/db/clickhouse_driver.rs:56-60 | crates/dbx-drivers/src/db/influxdb3_driver.rs:77-81 | crates/dbx-drivers/src/db/influxdb_driver.rs:102-106 | crates/dbx-drivers/src/db/victoriametrics_driver.rs:141-145 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/influxdb3_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/influxdb_driver.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/clickhouse_driver.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"914e592a774a45e13ab31f8b5092eba983fb6429edce71c5fce1e6dfba33151f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-drivers/src/db/solr_driver.rs:171-175 | crates/dbx-drivers/src/db/solr_driver.rs:665-669 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-drivers/src/db/solr_driver.rs:171\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/solr_driver.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"949653bc39018e72ea06a7cff0583b14124568be45aeeaa65b4ab2f38702b0ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs:655-659 | crates/dbx-sql-schema/src/table_structure_sql/column_format.rs:287-291 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"016ed9027d2d97b59e373bc7aaab333a2b57ea74ea0a0cc62b67e513337d56c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-ai-provider/src/ai_cli_agent.rs:350-354 | crates/dbx-ai-provider/src/ai_cli_agent.rs:934-938 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs:350\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"51410b3cd9c8060ed355d9e534d20419838d47670cfa1eae55722b761816bd05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/dbx-drivers/src/db/couchdb_driver.rs:274-278 | crates/dbx-drivers/src/db/couchdb_driver.rs:326-330 | crates/dbx-drivers/src/db/couchdb_driver.rs:387-391 | crates/dbx-drivers/src/db/couchdb_driver.rs:410-414 | crates/dbx-drivers/src/db/vector_driver.rs:664-668 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74abb51d7321e1f39aa25034cd7ec210498024f23e6a9bf296a25a4ef9c47b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src-tauri/src/commands/saved_sql.rs:347-351 | src-tauri/src/commands/saved_sql.rs:372-376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/saved_sql.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f290377d6ec0b62ed42abf6d87e723cc0c0a1d355ad07e416fc0fd0bf96fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/schema/oracle_routines/readback.rs:306-310 | crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs:541-545 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/readback.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c8b3429694c3e5718e87d86aef1f020b352b7c7563d0af4d4bac26cdf85d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:825-829 | crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs:867-871 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql/oracle_indexes.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"324ebe1567ba0eeed45ff368dce7b6625f3c21b1d7c9691a3b0e33408482ed25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-data/src/query_result_sql.rs:2069-2073 | crates/dbx-sql-data/src/query_result_sql.rs:2122-2126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/query_result_sql.rs:2069\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"86122de5be2abf27479369e52d7525dd85949e717bcaec8fcb2fe1f7c78d870b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-dialect/src/sql_dialect/table_select.rs:395-399 | crates/dbx-sql-dialect/src/sql_dialect/table_select.rs:431-435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-dialect/src/sql_dialect/table_select.rs:395\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c445c3d4e45de9f5b117455f3df4967cebd0e689d21d6b79a7670ead47e1f8c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 15): crates/dbx-core/src/persistence/storage.rs:2867-2868 | crates/dbx-core/src/persistence/storage.rs:3027-3028 | crates/dbx-core/src/persistence/storage.rs:3038-3042 | crates/dbx-core/src/persistence/storage.rs:3048-3052 | crates/dbx-core/src/persistence/storage.rs:3488-3489 | crates/dbx-core/src/persistence/storage.rs:3510-3512 | crates/dbx-core/src/persistence/storage.rs:4796-4798 | crates/dbx-core/src/persistence/storage.rs:5061-5062 | crates/dbx-core/src/persistence/storage.rs:5344-5345 | crates/dbx-core/src/persistence/storage.rs:7377-7378 | crates/dbx-core/src/persistence/storage.rs:8104-8105 | crates/dbx-core/src/persistence/storage.rs:8135-8136 | crates/dbx-core/src/persistence/storage.rs:9020-9021 | crates/dbx-core/src/persistence/storage.rs:9839-9840 | crates/dbx-core/src/persistence/storage.rs:9931-9932 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:3038\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":2867}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e45f0c676cdd1b8bf280cd90d57f40de965fd17e32b8302e1d6a9b535d09566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/connection/jdbc.rs:1035-1039 | crates/dbx-core/src/connection/jdbc.rs:1111-1115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed3f636d9f2f4e41a5be9204ea1faf982ea11954f1591ae7984253e5ff7ca65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:481-485 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:718-722 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs:481\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94edceff7c85027a93afaaa142e1da5e0753d4ef82798a2d3a0324b6fda01a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-core/src/schema/oracle_routines/readback.rs:234-238 | crates/dbx-core/src/schema/oracle_routines/readback.rs:306-310 | crates/dbx-core/src/schema/oracle_routines/transfer/packages.rs:541-545 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/readback.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd0933ac9c0bba3a904f009df9a39bab646908284daa63ff16bffcab3444a33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/dbx-ai-provider/src/ai_claude_code_cli.rs:153-158 | crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:233-238 | crates/dbx-ai-provider/src/ai_grok_cli.rs:203-208 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:85-90 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_claude_code_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 179 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_claude_code_cli.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c971295e22ec477bd7fda1543b00ec895fb5cded049da35b5f9c54d2705e7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:306-311 | crates/dbx-ai-provider/src/ai_qoder_cli.rs:198-203 \u2014 before extracting anything, compare \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs\u0060 and \u0060crates/dbx-ai-provider/src/ai_qoder_cli.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-ai-provider/src/ai_codebuddy_cli.rs:306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026CodeBuddyRunOptions\u0060 in one and \u0060\u0026QoderRunOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6401a1055725c7bf6e226879f6ce5d76c437d77a8347616e61ab7fb5661f80aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/consul/blocking.rs:251-255 | crates/dbx-core/src/admin/consul/blocking.rs:313-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/consul/blocking.rs:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060\u0026ConsulBlockingRequest\u0060 in one and \u0060\u0026ConsulDomainWatchRequest\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/dbx-core/src/admin/consul/blocking.rs:257\u0060 calls \u0060append_pair\u0060 and \u0060crates/dbx-core/src/admin/consul/blocking.rs:318\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/blocking.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa83e5afc83532530ae516b00102ddd60bdf45995e52638876982d0ff523c710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/kafka.rs:393-397 | crates/dbx-core/src/admin/mq/adapters/rocketmq.rs:634-638 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs\u0060 and \u0060crates/dbx-core/src/admin/mq/adapters/rocketmq.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/admin/mq/adapters/kafka.rs:393\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7be6ff6bbbbf9b4dee672a7b401be428c8d29da8642c191bec4079468a1f06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:511-515 | crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs:582-586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/rabbitmq.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1b4d7ebf69738f9956ec0b87094b1badf75d04cd06bcc7349657c68c10fc1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/admin/mq/mod.rs:96-100 | crates/dbx-core/src/admin/nacos/mod.rs:91-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"31188c7e76527d163862ea588fff874aa98c396a67dac4c2796bbdae4d7f8a26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-core/src/admin/nacos/service.rs:57-61 | crates/dbx-core/src/admin/nacos/service.rs:533-537 | crates/dbx-core/src/admin/nacos/service.rs:545-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":"crates/dbx-core/src/admin/nacos/service.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8604fe10a47ea30b55d677fe9eaffc60dbc1360e0b124119b2ee920bbaaac2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/ai/agent_tools.rs:944-949 | crates/dbx-core/src/ai/agent_tools.rs:1070-1075 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fae448c93e6c1f07d305c7dc00903ff2ed32a109d3d901a2233c716ae11029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/ai/mcp_access.rs:684-689 | crates/dbx-core/src/ai/mcp_access.rs:735-740 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/mcp_access.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"52885b92e8bc82242e0ac7fc13a49ac9e363c65fc6b84f27ffc4d891c08c41d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/connection/connection_secrets.rs:264-268 | crates/dbx-core/src/persistence/storage.rs:8219-8223 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/persistence/storage.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/connection/connection_secrets.rs:264\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7484cae945a07deea4f00479f0a0a65bbc9ae07e79787d7777473e684bdfabe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/connection/jdbc.rs:450-455 | crates/dbx-core/src/connection/jdbc.rs:523-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbb93e9998afb884236791036223a743aad5b749b21aebdadcc632bd81737e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/connection/mod.rs:6946-6950 | crates/dbx-core/src/connection/mod.rs:6955-6959 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":6946}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9a7964b519b1c7194e8bd638a241c94599b07719f84e59a8d6edd292d7b184"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/data/database_export.rs:1846-1852 | crates/dbx-sql-data/src/data_grid_sql.rs:5112-5118 \u2014 before extracting anything, compare \u0060crates/dbx-core/src/data/database_export.rs\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fdb585e65aa42870557bcea0d04316a13cc0dfdbd902c32d902ce033b6119f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/data/mongodb_dump/metadata.rs:159-163 | crates/dbx-core/src/scheduled_backup/models.rs:279-283 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/mongodb_dump/metadata.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_dump/metadata.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"51be45388e175f346c4823e6fe738aa7ebd200354a69e1c9f1ec451c6c5aa032"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:1341-1349 | crates/dbx-core/src/data/table_import.rs:1445-1453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:1341\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"624286f474fa0a8e886fb37807a4ffe6bc0515189cda7817657d7a992478170c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:3699-3704 | crates/dbx-core/src/data/table_import.rs:4452-4457 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:3699\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3699}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdea2601008ae81e5fbf9fcf282f8d97505d5b3fae7ae907574670c4bf89cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/data/table_import.rs:3772-3776 | crates/dbx-core/src/data/table_import.rs:4512-4516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/data/table_import.rs:3772\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3772}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccd56f0e3b5aac0f021921da09dbf9c3812c121ed32cc2102dc74adff0a102e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/persistence/cloud_sync.rs:927-931 | crates/dbx-core/src/persistence/cloud_sync.rs:1325-1329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/cloud_sync.rs:927\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6f11110e85d736e76678b1313259c75ceeb4338fb9122303496c18b798676b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/persistence/cloud_sync.rs:3179-3183 | crates/dbx-core/src/persistence/state_persistence.rs:543-547 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/cloud_sync.rs:3179\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"716e2ece65b08489265565b9730594336d8a972d81b4a10a1b2913ae97c70423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/secret_codec.rs:574-580 | crates/dbx-core/src/persistence/secret_codec.rs:601-607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/secret_codec.rs:574\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/secret_codec.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c8193092b5a8f1108cb980d23cc91dab6731206377647bbccddf37d0306539"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:3361-3365 | crates/dbx-core/src/persistence/storage.rs:3550-3554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":3361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6c03fdb27739b49b271e3fd27f05266e90b798cb57128c99abfd9adff9ce2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:7185-7189 | crates/dbx-core/src/persistence/storage.rs:7563-7567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":7185}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e5f36d56d101fb70d6a1644b4b2746ad68a431ca93622e1608d3cf20a21e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-core/src/persistence/storage.rs:7875-7881 | crates/dbx-core/src/persistence/storage.rs:7969-7975 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/persistence/storage.rs:7875\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":7875}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ae41513e788817132db2471aef12ae86a3aa11776bf6f54110366fe0f520ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/query/document_ops.rs:253-257 | crates/dbx-core/src/query/document_ops.rs:311-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/document_ops.rs:253\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76beec679c2b86e30ce317c8e7af12ff1baca63b22d0dae46d867391ad4b5b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-core/src/query/mod.rs:885-892 | crates/dbx-core/src/query/mod.rs:911-918 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/query/mod.rs:885\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e076402fee7e96f08d9762dcafe8cc2e864a1b9dca19f87a7cb562a69e7b33e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/query/pl_debug.rs:549-553 | crates/dbx-core/src/query/pl_debug/compilation.rs:306-310 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b48e3c1bc2fbbf43fde4afecc9a121793ffcee2a7170ddb1c175464cb38591c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:8979-8983 | crates/dbx-core/src/schema/mod.rs:9849-9853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:8979\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":8979}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4389d0c48acf69eeafc752722eb80ab46bf37c840734b1c71220a02e77e202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-core/src/schema/mod.rs:10419-10423 | crates/dbx-core/src/schema/providers/native.rs:206-210 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10419}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff6bc16aff653604436deadace8c8ff0ddc2b5aeaf2582c6220fbfb358731ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-core/src/schema/mod.rs:11098-11103 | crates/dbx-core/src/schema/mod.rs:11133-11138 | crates/dbx-core/src/schema/mod.rs:11168-11173 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-core/src/schema/mod.rs:11098\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":11098}}}],"partialFingerprints":{"codehealthFindingId/v1":"5440b0126e2ba0e603220acf2aa40d9f1dab016a830015de6721d25ad05a65e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-driver-agent/src/agent_service.rs:1962-1966 | crates/dbx-driver-agent/src/agent_service.rs:1993-1997 | crates/dbx-driver-agent/src/agent_service.rs:3129-3133 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00072cb7de27512e86d04eaff3ee1b3dec2ede65a4e2a54bccb8c2aa4e9a978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_driver.rs:2339-2343 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2698-2702 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2808-2812 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2f333a88cc80815fdb7f9a8b9dddbe902c791591b73670b5d2f42613215f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_driver.rs:2526-2531 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2746-2751 | crates/dbx-driver-mongodb/src/mongo_driver.rs:2844-2849 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f588b7953f808bd02d32c1b3b9b48647f534f4f15f3df154b1a35cba6738b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/dbx-driver-mongodb/src/mongo_shell.rs:509-513 | crates/dbx-web/src/routes/mcp_policy.rs:191-195 | src-tauri/src/commands/mcp_bridge.rs:1699-1703 \u2014 before extracting anything, compare \u0060crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060 and \u0060crates/dbx-web/src/routes/mcp_policy.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"062f9c70456610185996ddd728bd6f739ba6c8485e3893ae5436bf8cad5357f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/dbx-driver-mysql/src/manticoresearch.rs:147-154 | crates/dbx-driver-mysql/src/mysql.rs:5635-5642 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/manticoresearch.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"40921d4a95486903bae796ebd41327fe340ff562ad7ea7836ba0c6773a5a4f8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:3848-3852 | crates/dbx-types/src/metadata_filter.rs:66-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/mysql.rs:3848\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3848}}}],"partialFingerprints":{"codehealthFindingId/v1":"42703a9fd762fdd5b147a964c0daccec87ddceb2864a26748bb3a7e2dae12c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-driver-mysql/src/mysql.rs:6107-6112 | crates/dbx-driver-mysql/src/mysql.rs:6561-6566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":6107}}}],"partialFingerprints":{"codehealthFindingId/v1":"205faa4da7f362f2cccb58c6e554856c7af4a74cdaf2d6061ac00fce789d0105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-mysql/src/ob_oracle.rs:496-500 | crates/dbx-driver-mysql/src/ob_oracle.rs:510-514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-mysql/src/ob_oracle.rs:496\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/ob_oracle.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9f5d72c251570067988b5f3694a0ed5ab10c1443d08049fd14a421640f0627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:4664-4668 | crates/dbx-driver-postgres/src/postgres.rs:5166-5170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-driver-postgres/src/postgres.rs:4664\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":4664}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45630869007b166844a1fdefd31762c5b4ac59027f4da026f15da042a29832d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-driver-postgres/src/postgres.rs:5496-5500 | crates/dbx-driver-postgres/src/postgres.rs:10340-10344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":5496}}}],"partialFingerprints":{"codehealthFindingId/v1":"84209b4937d4d8f9422fcc510a144a2844fd89ad80b1ce3ce215ff5f75dc6c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-drivers/src/db/couchdb_driver.rs:705-709 | crates/dbx-drivers/src/db/solr_driver.rs:1078-1082 \u2014 before extracting anything, compare \u0060crates/dbx-drivers/src/db/couchdb_driver.rs\u0060 and \u0060crates/dbx-drivers/src/db/solr_driver.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 161 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060client\u0060 to \u0060\u0026CouchDbClient\u0060 in one and \u0060\u0026SolrClient\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"92529ff2614fe16037c19174527009e027fa4467833252f01f16b445d1bf89cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-drivers/src/db/meilisearch_driver.rs:299-304 | crates/dbx-drivers/src/db/meilisearch_driver.rs:944-949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-drivers/src/db/meilisearch_driver.rs:943\u0060 calls \u0060insert\u0060, \u0060to_string\u0060, \u0060Array\u0060 and \u0060crates/dbx-drivers/src/db/meilisearch_driver.rs:298\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/meilisearch_driver.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae593eaf92053fae0e2ca3c4864e082fe00d630351872128a9b24b10f69209b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-drivers/src/db/solr_driver.rs:817-821 | crates/dbx-drivers/src/db/solr_driver.rs:829-833 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/solr_driver.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4ecf35633b713e217cb68b05bdfbadd3556ff8df9004502aad06ebcdacbc06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-core/src/sql.rs:1155-1159 | crates/dbx-sql-core/src/sql.rs:1161-1165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba13456bf6d84230f2be939170b88ed030fd0735bae01472186440132706a6d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_salesforce_sql.rs:24-28 | crates/dbx-sql-data/src/data_grid_salesforce_sql.rs:58-62 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_salesforce_sql.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae307b9f7c8c13503d454a65277630c70dede896a8152260b44d97ee7359d63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-sql-data/src/data_grid_sql.rs:1689-1695 | crates/dbx-sql-data/src/data_grid_sql.rs:1732-1738 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-sql-data/src/data_grid_sql.rs:1689\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/dbx-sql-data/src/data_grid_sql.rs:1688\u0060 calls \u0060effective_columns\u0060 and \u0060crates/dbx-sql-data/src/data_grid_sql.rs:1731\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8417481cf219554fd3075b1a78e6a72fb59f5ee77cc2b469365c8d675084c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dbx-web/src/auth.rs:180-185 | crates/dbx-web/src/auth.rs:219-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/auth.rs:180\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/auth.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a6828be283be4be53b5f5064f08d83662547d287b5f0f735851b001b1e8770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/dbx-web/src/routes/mongodb_import_export.rs:116-120 | crates/dbx-web/src/routes/table_import.rs:118-122 \u2014 before extracting anything, compare \u0060crates/dbx-web/src/routes/mongodb_import_export.rs\u0060 and \u0060crates/dbx-web/src/routes/table_import.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eba95c25eede151e7ccdcb7a678c1a99c1c812d4430b80b28628e144b715859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/dbx-web/src/routes/query.rs:1656-1662 | src-tauri/src/commands/query.rs:1276-1282 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dbx-web/src/routes/query.rs:1656\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"7871e29db56618d75483415955dc24f371a28af001b68b7979aef44c886dea94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201344 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2624-2667 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2680-2696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2624\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2624}}}],"partialFingerprints":{"codehealthFindingId/v1":"97aae099d2c9b6cd98ad5251d4fcbfd64d25e16a8c537a7dd858378e86ab4894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201342 lines \u00D7 13): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2158-2167 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2187-2210 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2269-2280 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2498-2533 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2559-2578 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2625-2666 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2681-2695 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2743-2752 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2772-2782 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3177-3188 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3340-3350 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:270-279 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:286-296 \u2014 there are 13 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 13 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2158\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, \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2534\u0060 calls \u0060equals\u0060, \u0060getString\u0060 and \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2579\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28ddf5fa4399928d012f6e470583e71fa6ed53052cd6ecc6df35edf766a8255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:182-210 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:108-136 \u2014 before extracting anything, compare \u0060agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java\u0060 and \u0060agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:182\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":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb1d5d557eee9a08d3af18de4cf18e0f688f3c180eab6e6af3230abf530f43d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java:92-120 | agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java:106-134 | agents/drivers/kylin/src/main/java/com/dbx/agent/kylin/KylinAgent.java:71-99 \u2014 before extracting anything, compare \u0060agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java\u0060 and \u0060agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"625e8d37130bf8003aba6bcd82e8848986fa65672b3af0f3fdc01fae03edea09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201327 lines \u00D7 4): agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java:30-52 | agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java:133-155 | agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:130-149 | agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java:199-225 \u2014 before extracting anything, compare \u0060agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java:30\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java:198\u0060 calls \u0060resolveSchema\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java:29\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":"agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e15fcdf941e7b619e2a95515f37962fde6a6337bef9e9c549c94219f3fb3ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:50-75 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:70-95 \u2014 before extracting anything, compare \u0060agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java\u0060 and \u0060agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a4b42a4209fee0eb6dae80a02eedaa2051ce6a5f84ff55cf33bfeca658aa6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3): agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:740-764 | agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:805-829 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:435-459 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:740\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fda4e7d680481d07899e5b5ce9e95395394fd2242202d609f16e8ed6072c9c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1055-1078 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1096-1119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1055\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1442e0423ce9c191ed5879a454999c73078832a3490af9cd86e8eeb0fde2b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201322 lines \u00D7 3): agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:411-425 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:485-506 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:562-580 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:411\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":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"579051df3164806dc09d9c70ed165d9877ccf7ec21622b1da871106f3bca95ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:753-778 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:1085-1110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71348de94fc59786948e4ded01e3c60ebfe2dd8f32d3c10d612fcb985126bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:279-298 | agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:598-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e42d6524bed7669db5e5f641af3673d1eb3dc4ff75e723821174903d7605af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:196-215 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:176-190 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:196\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bcdaae58bb8c67adfea7f21052f2595c12f97072cf31f11a9d6994f6c0d951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1717-1734 | agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:157-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5cadcce59bbe2754be235e8251171c2c7d6eabda37ad10a5d4260227d4789a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1174-1190 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1343-1359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1174\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"067a13439db3aeb4ece81a06dcde320f1489613fc64fee013e6157e1aa45e415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201317 lines \u00D7 2): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2302-2318 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2359-2368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2302\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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"290e1bcbdb51557ad4a9d264bc5dc4c3054dffa2618babbe82e3b3c9216482de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:207-222 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:339-354 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:291-306 \u2014 before extracting anything, compare \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java\u0060 and \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:207\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d1f5edfc08544ba3444e705bff11dd8cbc9e5ae8306fc6d7f4148bca1d76b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java:264-285 | plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java:385-404 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"033b80a4baaf7800f2fdf4e355dbc9202f80615258a68882ea34a272e6ea0685"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:919-934 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1484-1499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1a58c2a3d3e4a7da50a348c96704d2e6202a7586374f87cb543f841df2ff99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 5): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:821-835 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1090-1101 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1133-1144 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1263-1274 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1298-1311 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:821\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, \u0060agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:838\u0060 calls \u0060loadColumnNamesByNumber\u0060 and \u0060agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1145\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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c028426e1d928b9f4f5136fe6fdfecaed28b1c97651faff46527e0e79547c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:757-770 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2663-2677 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2692-2706 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:367-381 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:757\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. 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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"231b4624c72500623e0c01ce25a365cd3411ac080efb9468656d5644a262e50b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:941-955 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1506-1520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:941\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"f246b94d6c68c4c3e74559ba3641f34a0ad41e88df0be11bf9f529229429902a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:655-669 | agents/drivers/yashandb/src/main/java/com/dbx/agent/yashandb/YashandbAgent.java:119-130 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:655\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":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"5728aef29a3e9c4ecf3a986e09659b0eed9df6fc13eb3ab47355a4e1417521cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 4): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:111-124 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:237-246 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:118-131 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:122-135 \u2014 before extracting anything, compare \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java\u0060 and \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:111\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":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7548714d66f0cced7f7baac98fc45bc088802511bc0aaf933918b9c41e4a53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:247-259 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:157-170 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:228-240 \u2014 before extracting anything, compare \u0060agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java\u0060 and \u0060agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:247\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"db49d5ff2b8cfae63c02fec9b89deb3089de72e718585a34dcda41302f5c2a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:247-260 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:509-522 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:663-676 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e38f2296b050808dd324dea75de929558a4436cdff04667b7fee7d389ba9ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:344-357 | agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:657-669 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b38ab507b65d38cd43baf3c77614e3ef034a11ec498b0ec8de278a1f69abb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:612-625 | agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java:780-793 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18fcd203f09edbb4d61d98f5f56cafceddd2ba84b05fdb3a6890be4889dbc5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:172-185 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:301-314 \u2014 before extracting anything, compare \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 and \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:172\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":"agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"39eedcae93744aeed1a6a3a71b59c9e090a5b88d38d3e79437bede70d1009d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 2): agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:320-328 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:200-213 \u2014 before extracting anything, compare \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java\u0060 and \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:320\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":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2d58ffe0a7532a5f3c492a9c1368d0538bc82290fafb343a944e5cd82a0523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:132-144 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:89-101 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:211-223 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:239-251 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:93-105 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:97-109 \u2014 before extracting anything, compare \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:227\u0060 calls \u0060resolveSchema\u0060 and \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:148\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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2672889acff9782e4e31b9fee2c6ca1a5d589516699ac13fa7a2457a7d857460"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:191-203 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:149-161 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:274-286 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:293-305 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:159-171 \u2014 before extracting anything, compare \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40b8cf0734519766c459fb22c5fa008530a8609ceaeb99a7d751eaa3e8cd569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 4): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:1097-1109 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:399-411 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:579-591 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2401-2409 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:1097\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"63981063da528fd9343c25a567fd5d1d7374e429816afc746b02ead4ed41075f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java:74-88 | agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java:88-102 | agents/drivers/kylin/src/main/java/com/dbx/agent/kylin/KylinAgent.java:53-67 \u2014 before extracting anything, compare \u0060agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java\u0060 and \u0060agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d856ee163c488eb07d0c1eb8699d0001bb2e1e1383ac5b84bf6a86593bdd4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:370-382 | agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java:192-204 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:370\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":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18ec7fd9ada8f5ec03d180a36ff24e545c5cd37bf3a8811f87d923eeb9974de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1704-1715 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1839-1851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1704\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8615735455ca477ef5a2614888530d3010a58f664a7deeeab0f8ba020647cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1985-1997 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2073-2085 \u2014 both copies are in the same file, so extract the block 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, \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1982\u0060 calls \u0060isEmpty\u0060 and \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2072\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"04df4d1c38a1a49297daf605ab96630f170e99e86d136f464d859cff249b83ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:156-168 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:186-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:156\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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e1f946593a080d666cc5033e9dab9d69be03d376a2e4fb233f830c9aa16bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:249-261 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:268-281 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:358-371 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:389-400 \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 \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:249\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":"agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6352a60cd82c153bf0a482609a435b68bb22b5f18465ad3b6925b574935ff0e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:124-135 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:652-663 | agents/drivers/yashandb/src/main/java/com/dbx/agent/yashandb/YashandbAgent.java:116-127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:124\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"362adc4a1d3aefac84c3c5c016232f3a39ecd6fe9e5d785ef0a8ae7953dfbbc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3550-3561 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3564-3575 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5621-5632 \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 \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3550\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3550}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c0015234f32c7f540980d4fdb97664040ed6523e2fdef2a5af18f72c8b5b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:840-851 | agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:883-894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:840\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de1a4318c9aead1a60f632f89cdeee5a602fad5d9b249992bb7792eefc7e33a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:390-401 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:473-480 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java: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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba7a41750fb2c7c171c4c49512b7a3d5c2eab486e32362dde58045d0f829276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:177-187 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:376-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:177\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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1624d7e0df868e325d62f4798bb67db6410254943924cc9456041436bcd8d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1234-1245 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:133-144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadc03b44122e2da28c22cb59a88660cc195fcfa72d9d8fececd3d2d797bae01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 5): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:1097-1107 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2781-2788 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:399-409 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:579-589 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2401-2407 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:1097\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. 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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12ecfbc03bd31f2991285e9acb503c3ef8189647064b0f7c08a37d6d9c1ee6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:654-664 | agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:227-237 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1359-1369 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:493-503 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:574-584 \u2014 before extracting anything, compare \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83f8cb95cf7cc80528c6b5fcff0bcd82422ef04154b2d4b93c8bd70c7349f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:125-135 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:653-663 | agents/drivers/yashandb/src/main/java/com/dbx/agent/yashandb/YashandbAgent.java:117-127 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5973-5983 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:125\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":"agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e79126329804de44363d836d07900ec23757f652d3fb8d18718c598f8d56591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java:412-422 | agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java:441-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java:412\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":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"842a70421a7498f04b3c445388125692b9b0c148da73e4846797e9ba7f471f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:550-560 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:576-586 \u2014 both copies are in the same file, so extract the block 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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"768b89d391bd74160bbfe879443c1769acc82ffe2beef0bc38d88aa4107af9d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:740-749 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:783-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:750\u0060 calls \u0060contains\u0060 and \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:794\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4214da4e744a81be74429cfdb855ee9695a0d7c1abcb9345dccf24d26236306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:479-489 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:917-927 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:479\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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0af115cdec7d8e4682c27002e451840ac5aa822adeca8dd4f8ccfea5b65fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:257-267 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:422-431 \u2014 before extracting anything, compare \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 and \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:257\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":"agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"398f49985b4c77798a1576abade41ebe04ba8eb681c71d508cb756c6c86d8709"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java:60-70 | agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java:74-84 \u2014 before extracting anything, compare \u0060agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java\u0060 and \u0060agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5044c8f5495e2bb40593705c2cbe4746fa278b759de3eccb1c74a07bef4e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:127-136 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2654-2664 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:137\u0060 calls \u0060logger\u0060, \u0060warn\u0060 and \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2665\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc5c5a84ecab7a4146df95a034c7dff927ef82206392e66f5579aae6e0865f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:914-926 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:953-965 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eabcb2616c6a4cfd337f619047f26e206eb876ea742f15e106384a607977e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:2649-2660 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:2663-2674 \u2014 both copies are in the same file, so extract the block 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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdd9bd888b1c86379693f5b0d9fc0cfc281bbef81e8f515207114c7255afc9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3417-3427 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3439-3449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3417\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3417}}}],"partialFingerprints":{"codehealthFindingId/v1":"433bc07e7dd666122a1b4a548b6fdffb6320f10303f44feeb205b4e016e5ef10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:213-222 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:655-664 | agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:228-237 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1360-1369 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:494-503 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:575-584 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:345-354 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:297-306 \u2014 before extracting anything, compare \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:210\u0060 calls \u0060tableTypeAllowed\u0060, \u0060add\u0060 and \u0060agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:227\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":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc0d35da4bb63d03468fbaaf21ba10504a16c8008629eee80058c85b021f6cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 4): agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:200-207 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:125-133 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2652-2661 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2780-2787 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:200\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, \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:123\u0060 calls \u0060parseString\u0060, \u0060getAsJsonObject\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:198\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":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"de511aaefcb987b9d578ff6edb1d23368671bade2a35c0a74bccdb7b0d9b1ad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:209-218 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1040-1049 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:341-350 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:293-302 \u2014 before extracting anything, compare \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java\u0060 and \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeb438b844894b241e332a147baa2d621ed83b6ed4d6772e61f36b2905542ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5405-5414 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5428-5437 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5459-5468 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5514-5523 \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 \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5405\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, \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5402\u0060 calls \u0060oracleListObjects\u0060, \u0060createArrayNode\u0060 and \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5457\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5405}}}],"partialFingerprints":{"codehealthFindingId/v1":"1088447f6fbb68c99de59ab915bbf3953cce65ea42d04341db426438fa0f1749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:23-32 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1147-1156 | agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:274-283 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:23\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:22\u0060 calls \u0060orNone\u0060 and \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1146\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":"agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa1a23cecd15e7c0889853249d810d547b93f34530678fcf70cc7a63776b8f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java:202-211 | agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:845-854 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fa7eea4068d0bb1bad38e7ef367103ecfa8e9e3c94e4994e931d522a9728bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/JdbcAgentProfile.java:260-269 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5258-5267 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/common/src/main/java/com/dbx/agent/JdbcAgentProfile.java"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e712c5b34ece6b6f5efcb68a6aec586db4bfad8a3e1f2fc2090ce2f5cb1fbd9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:84-94 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1163-1173 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac3a6f9e2a2c2556249b0d7b022f8de668c65748ab4e67a11de2e4a4d03450c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:522-531 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:785-794 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:522\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42f113383d2f6d97ef6afe34c3942bfdc2be18436b74ab368797f892560ba27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:216-225 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:197-206 \u2014 before extracting anything, compare \u0060agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java\u0060 and \u0060agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"744ea7cb3b5fdbf48be82a5229fddb17c9e9b91258d91e95a2d05bd9bed9884f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:233-242 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:214-223 \u2014 before extracting anything, compare \u0060agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java\u0060 and \u0060agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b832c17167ab9c605f30977541558aa0b8ae964dbb11e3370b67f7d45e9c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1781-1790 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1935-1944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1781\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, \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1933\u0060 calls \u0060setString\u0060, \u0060equals\u0060, \u0060normalizeObjectSourceType\u0060 and \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1780\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5363f34ae7c8b22e5c5c509c06ab52c239b2496491a3bf5d2d1b8812d149db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:438-447 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1050-1058 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:438\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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"02781d6e9142b8477695fa7168120ab1d0fa0305a09784e231fc3932fda1e706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1192-1220 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:99-127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1192\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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07315282ad83e30a731d289cced9e11c2e192182c171d7152bb97261181875e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201310 lines \u00D7 3): agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:182-191 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:340-342 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:191-200 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:182\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":"agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5429266cd8dfaefab4ed93e0e669e3c01a0862396785532205a3cc33c43dcebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2065-2074 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2229-2238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2065\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, \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2239\u0060 calls \u0060commitLatestPeekRange\u0060 and \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2075\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59dd14a6fbadb2ff1f8b68816ae5a701d4a88f96ff0eb2a321c4beb29a7ea1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:836-844 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:1811-1820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:836\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3623702aaa30fae9c62481da3ef8d47291600f2d704614560732e0f358f4498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2118-2127 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2389-2398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2118\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, \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2128\u0060 calls \u0060get\u0060 and \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2399\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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f32e83ab38e98f174985917fd87e02c8c452b5846076209f40cd45f22500bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4001-4010 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5410-5418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4001\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4001}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2dd2064eb3e3c297b7ce63d488b086f90d49ceb857343242fffcbf79697eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5468-5477 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5483-5492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5468\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":5468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3a7170322fd890c47bf3d777d4e5c8ec472e5a96b42b739be467f84d21dedf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:217-225 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:659-667 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:498-506 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:517-525 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:652-660 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:671-679 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:349-357 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:301-309 \u2014 before extracting anything, compare \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:217\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":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"145efcbf5f39ae5f2a0bb8a2966ff2213fa128783a89f558be631b3b83914be0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:234-242 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:137-145 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:262-270 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:147-155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:234\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fcee0f9b6e681d9f89f734f0096d6ca1de65f9acc97e45ec3835bfd186cd5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:224-232 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:179-187 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:308-316 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:188-196 \u2014 before extracting anything, compare \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:224\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, \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:178\u0060 calls \u0060appendRoutineTypePredicate\u0060 and \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:187\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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a3b2c74a4f76d175f6453227f907353d63fda684e59f2fd11a004ca0f41d49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:327-334 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:676-683 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:1088-1096 \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 \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:327\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, \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:674\u0060 calls \u0060catalogRelation\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:1088\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a71b627dba777cb63c78d7151e2fdcb7a3419a8e0941273face204b342abeda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:457-464 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:277-285 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:255-262 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:457\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a0330a1ec4ef252397049fd1c6fff0044b46cbda4455f1e06348e0a493672b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:37-45 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:46-54 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:47-55 \u2014 before extracting anything, compare \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:37\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":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3496139d77d87f250b97ccf96cdfe6661b423e8fea284fa1a378db11dd68cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3391-3399 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5706-5714 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6115-6123 \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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a4b0cbf622bdf6f4760c15fc8a08a9f6305c66192c3129bb6d8944b5a93787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:566-574 | agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:615-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:575\u0060 calls \u0060appendJdbcIdentity\u0060, \u0060connectionUrl\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:624\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":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"da630f028cf4ca72a116e68c5077815ce4beee8b80f54f3bdcd99e733f32e49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:312-320 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2043-2051 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:312\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c21b8eb77ff2c9d244afe4ddb9c0b5e73e489670fa08ee76bb34ff1ef993b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:395-405 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3859-3869 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:395\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"056469c79abc94b14a82ff506e8fcd3a259538cc58b8fecb79323e97caa4153f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:736-744 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:854-862 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:736\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, \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:734\u0060 calls \u0060isDamengMetadataPermissionError\u0060, \u0060getCause\u0060 and \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:853\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26249609f6b2fba83b9dd1bded0da940a7b188ce1f3449fc985762b2bcf4449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3613-3620 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:2411-2419 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3613\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3613}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d56c8cbc4c1a7e068a707f2f89f397ed6029384a74b8c3973a87dff6bb6c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/databend/src/main/java/com/dbx/agent/databend/DatabendAgent.java:142-150 | agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:329-337 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"agents/drivers/databend/src/main/java/com/dbx/agent/databend/DatabendAgent.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b067b9e4aa3460ace0f47660818c46149e563c9cd4148556ea638037d07ead0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:517-525 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:528-536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060result\u0060 to \u0060QueryResult\u0060 in one and \u0060QueryPageResult\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b479430c038797eedab12b275893d720a65d32303f5313e20bd8e77f3a4010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:92-100 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:196-204 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:92\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":"agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90fc067ff92998c3a4e2e2981d2b87fe76d788c5e458f740b2b56ca80914dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:232-240 | agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:255-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:232\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":"agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c56d5c91d0336e3aa67b6d8a126f58c895b00930f771d3e83638f21e779a9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:70-78 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:187-200 \u2014 before extracting anything, compare \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 and \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c5ae2fe7c8bca2d1fa9b7d8806c29a9e2c5a1c3327d13992752365e6a8fdda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:344-352 | agents/drivers/saphana/src/main/java/com/dbx/agent/saphana/SapHanaAgent.java:57-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:344\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a5eb089bc1d36168841d4e47db677e0f6d811a1d71d4fa9e4dcd91a696c96a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1972-1980 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2062-2071 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1972\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"b108dce89470378b102e6043bf8678032da4e9f91405b488773d034af9e12ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2755-2766 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6210-6221 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2755\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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"820f16a4e7da1b1d92191502ee1d38d3b4ebda0e8edeec279c6ff913fe9945df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:1382-1390 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3362-3370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:1382\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f177dadbd2ab7a408be8d7e6da578b7cf05c60469ef6d91d4ba0fb4082e3fa3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3317-3324 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5446-5454 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5446\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3317}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a87d6c220cf035135111ac17742507c67b473e24a37bc60a0fe475af8a9a0cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4507-4515 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5343-5351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4507\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4507}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d90f3e0710398d3611815b2f6f859f2c1bfb69cf728f1adab4920da453227cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 9): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:330-336 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:453-460 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:498-505 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:591-597 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:679-685 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:753-760 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:789-796 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:863-870 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:1092-1098 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:330\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, \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:496\u0060 calls \u0060catalogRelation\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:329\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a971deb05af460d738639516441ef08c5d6db96061bce60ccb8a93b5f0a52b2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:451-459 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:497-504 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:525-532 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:752-759 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:788-795 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:451\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb37f40538e01b64553d6b8dad5ab84ad162cc7c0856d866582eb48e11183bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:35-42 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:44-51 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:39-46 | agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:96-103 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:45-52 \u2014 before extracting anything, compare \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:35\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, \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:47\u0060 calls \u0060sort\u0060, \u0060comparing\u0060 and \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:43\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":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03fba00a5804f7e936f7e73e6c50e4b8298f5e25a8c2ecc34d8a09d7eed20ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:281-288 | agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java:102-109 | agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java:116-123 | agents/drivers/kylin/src/main/java/com/dbx/agent/kylin/KylinAgent.java:81-88 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:258-265 \u2014 before extracting anything, compare \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 and \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:281\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":"agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a3da8343d76ebe246f648101593263d1f5436cff8f4b265664da0d6f2facc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 4): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:207-214 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:165-170 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:294-299 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:175-180 \u2014 before extracting anything, compare \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:207\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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cda25cfae27db2fbcea0d432606ea8069e024d7ed5b5f1541f364932ec3419f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 4): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:206-213 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:164-169 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:308-313 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:174-179 \u2014 before extracting anything, compare \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:206\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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"306da5d2451c3fe0e6f79505b21e8637cb346e2e2b546aec2ca5f31b7da35739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:503-509 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1764-1771 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4640-4646 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5570-5577 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:503\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":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"25066abd66b55ed25dffedc9e4e4d69c95dde81eaba0461e81944985faef9d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:187-194 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:213-221 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:227-235 \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 \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:187\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:186\u0060 calls \u0060catalogBuiltinFunction\u0060, \u0060catalogRelation\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:213\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"72928ca6a5e7635792c24c692f4cff6f7b33efbf76e9f5c275f45b1307e98af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:427-434 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:581-588 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:672-678 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:590\u0060 calls \u0060catalogRelation\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:680\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9191b0fdc35fadc92a2680689b14e041c6bca225106e43ab280f4337af801199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:502-509 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2164-2171 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:422-429 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:502\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b58b3dd4e8fee28112753c09573bf8beeadebbc040fa2bd01ae8f8897d683e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:854-861 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:923-930 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1451-1458 \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 \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:854\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, \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:862\u0060 calls \u0060put\u0060, \u0060partitions\u0060, \u0060size\u0060 and \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1459\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dff074ccdff4d84faa3f6ea87d3a6efa800517d83a644fb06fce73656f04075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1974-1981 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2065-2072 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2229-2236 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1982\u0060 calls \u0060isEmpty\u0060 and \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2073\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"115f4c102f448b841c3935710aef0db99a264fcf98e5d1f49655e7ac05742f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1987-1994 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2075-2082 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2240-2247 \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 \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1987\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:2239\u0060 calls \u0060commitLatestPeekRange\u0060 and \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1986\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e459e1f89c657db7245d1a1c8bf1ecd1a6daa366d8b184f4b3a652afff7d673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1775-1782 | agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:121-128 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:1775\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"e805c4bd6da913be08eda028a943f2d0085ffa4cf8a5f8ff2dd9139952b41015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3305-3312 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3398-3405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3305\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5811771408e4e8e2ddd13ac160aacae88590ef2b5b29f4c36b428b8f3ff75b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:714-721 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1308-1315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:714\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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f95b11146459031d2ed22f26727431685cf5ec6ea4d6c39f64127cdb2a9620"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1227-1240 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1486-1499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1227\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, \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1500\u0060 calls \u0060put\u0060 and \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1241\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"82481a242d749d2f005a069cc5241089f7126dba19c2ed6f96772675aa8e14a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:54-61 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:59-66 \u2014 before extracting anything, compare \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java\u0060 and \u0060agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:54\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, \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:62\u0060 calls \u0060sort\u0060 and \u0060agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:67\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":"agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7190d97cab37da3f60775a53cf325b96eab4fd1241f0c1a54606d854ebd5c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:423-429 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:1089-1096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:423\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":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3d4458e5f20884bc60be5cd4593d659e075dda044f40cd83d5f34e33b3fce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:219-225 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:233-239 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:136-142 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:261-267 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:146-152 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:261\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8f8f378a403eeb03a9246861525c157d686c5c19143d7faec9481ac6291b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:627-633 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:473-479 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:795-803 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:810-816 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:808\u0060 calls \u0060contains\u0060 and \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:472\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":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"981b525a912898444c047014b594737553d9029098826f1a8e1b435952824c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:278-284 | agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:940-946 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3046-3052 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6613-6619 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:278\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a0ff5a8d00eda5f563a6a72cb55a4174682957364c6d88ef77bb9c55819fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20137 lines \u00D7 6): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:936-942 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:969-970 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:989-995 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:1001-1007 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:1056-1062 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:1067-1067 \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 \u0060agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:969\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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7616cc60a0a5f894b593ef58daaddb6d71ce283ce76932172f2440d03818772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:1382-1388 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:2975-2981 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3362-3368 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4805-4811 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:1382\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"161201d5e8be4b0ef081f947df34992cdbc1c1055884c530caa7a3c723378fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3416-3422 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3438-3444 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5479-5485 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5494-5500 \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 \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3416\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"08927d55aaa8efceb012d2a2fe66c9dde5683d7e1a651d2a5aba276ff765f7ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java:659-665 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:218-224 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2DriverLoader.java:36-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb36c098460a1acf1edbc13260aa86c27dc787a5653dc5fad0e5c68d8da8aa17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java:19-44 | plugins/jdbc/src/main/java/app/dbx/jdbc/JdbcConnectionParameters.java:19-44 \u2014 before extracting anything, compare \u0060agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java\u0060 and \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/JdbcConnectionParameters.java\u0060 as WHOLE FILES: 97% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3375ece96c656c893871a2574a863fd38df4fa7df3544107e2e6f031a2b3b565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3228-3235 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6380-6386 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3228\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. 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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3228}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfe9135fd51ba644167d93d6fed7126be15ed2992b840ff8774c36ff7d8ee75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java:128-134 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java:150-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java:128\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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1c90cff017b163ebeeec77e10469ee8b211730a2123bb5976b5a9ce000a925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1072-1078 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1141-1147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1072\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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d4388f94024f21b4c29d6a4bb5fb105d22cb970d0cd44e58f0d7435a555a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:267-273 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:304-310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:267\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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab3ead6a95447ab6b5fcc1066c63e6c08d4671cd5a2ac8c7d55131afd541bb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:148-155 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:236-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:148\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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4d0a879214a69a09d80e1b03572ec2d54623c66b0a8f669f7fe3b77a6f8d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:148-154 | agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:193-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java:148\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d3097e16c084985d6ccacb126bd0c69bc97f2fc1742bf4f35551a53d9c5c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4026-4037 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4055-4066 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4026\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, \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4067\u0060 calls \u0060putNullable\u0060 and \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4038\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4026}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68fc72b2e6c65560b1828008a9277ddf5185a8588eefb89532bbe7d7c38d300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3480-3485 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4554-4559 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4610-4615 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5407-5412 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5430-5435 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5461-5466 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5476-5481 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5491-5496 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5516-5521 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5537-5542 \u2014 all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3480\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3480}}}],"partialFingerprints":{"codehealthFindingId/v1":"299385f4be697ddacc392267cf8845efe78c419215a38134307a4ac4117822cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:594-599 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3347-3352 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:503-508 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2085-2090 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:531-536 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4640-4645 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5570-5576 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6169-6175 \u2014 there are 8 copies across 6 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:594\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3f1f342d6eb1152acd0febdb427709c6df666e7ed6e898e7bbef5c7dc422ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3414-3419 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3436-3441 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3481-3486 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5477-5482 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5492-5497 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5538-5543 \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 \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3414\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":3414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86c3b3c1b6b3e91648fe1512b8861a661443236504ee659ed6ef2a9cc2a7415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java:130-135 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3551-3556 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:3565-3570 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5622-5627 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java:130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"921d55f02c0d29cc704bb641b35b22a4409ade134a85b616b91de2e532046ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:326-331 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:356-361 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:385-390 \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 \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:326\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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8be97d35eb20cd05353cf03917724661a21cca0dbdfa578ca24f33956b4486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:91-96 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:73-78 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:195-200 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a8f3d1b30f1cf78fb011a492ce601bebc73e877acca111837549805801a82e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:228-233 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2800-2805 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:228\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, \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2806\u0060 calls \u0060closeAllSessions\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:234\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":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd9ddc9cbc9d73753e69fc2af196b6348cc8af33d48abc0fca0a380bba57a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:382-387 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:256-261 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:382\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5951fa08092ca1153e341c4aa7e7f0dc2b79a49b252e4a0c681fb2cb7a021364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/QueryPageResult.java:75-80 | agents/common/src/main/java/com/dbx/agent/QueryResult.java:73-78 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/QueryPageResult.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a971fa137afc0e325beb9394147e58e7d31d9b8291a1fba791cf4a4da9e2fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java:144-149 | agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java:143-148 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java:144\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":"agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbc697343e56c5947e59b5eb2f7784fc3193c6fa54a6a739ba8ab843a064072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2058-2063 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2294-2299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2058\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"7149670fa0f706aa661a8b1dcb82912a7abf15023e072a7f0986030bfe725781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java:269-274 | agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java:158-163 \u2014 before extracting anything, compare \u0060agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java\u0060 and \u0060agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cfb99ac5cf7dee55000469f4aea33366edbd0443743a98a272147e67477536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:224-232 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:264-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"404a552bc48873ad6ee6e0737546c9c5fb770dc43611b6c3fa1dfc87bddbc1e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:1037-1042 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:1881-1886 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"b517b48f924cc47ac642ec690ba4b306ab362f8a7cadac3386b620839aa351ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2084-2089 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2196-2201 \u2014 both copies are in the same file, so extract the block 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, \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2083\u0060 calls \u0060get\u0060, \u0060getAsBoolean\u0060 and \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2195\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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"7768b4ba0dc1c94e3f6f948bca8366ccf739c31b6cb1602bb560f1be8fa7e6e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:858-863 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:916-920 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:858\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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4c2fb101075539bbd98bcd8db4a51054b5c4afeee439f7c97e715be5b26888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/saphana/src/main/java/com/dbx/agent/saphana/SapHanaAgent.java:56-61 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:472-477 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/saphana/src/main/java/com/dbx/agent/saphana/SapHanaAgent.java:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"agents/drivers/saphana/src/main/java/com/dbx/agent/saphana/SapHanaAgent.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7195b5efe2ae5dc9e8b34946173ac8110085295c3dcf71da1a7b9e1c9acb0dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4398-4403 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4849-4854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4398\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4398}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d68228d13a52abfcaffe176ebb4eb70a9965d96995776405be9b7f8e1c8d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:457-461 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:594-598 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1847-1851 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1902-1906 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2085-2089 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:531-535 \u2014 there are 6 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 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 \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:457\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b374e1f92f187ca441e422dc184ba6cdecf826a650caff476df3879a33ea71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:594-598 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3347-3351 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:440-444 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:503-507 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2085-2089 | agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java:531-535 \u2014 there are 6 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 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 \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:594\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"514b0359296f0597e05f711ba5b21232279a7a14b95d41515f006a293b3f90f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:255-259 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4640-4644 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4724-4728 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5570-5575 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5973-5977 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6169-6174 \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 \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:255\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5576\u0060 calls \u0060getString\u0060, \u0060createArrayNode\u0060, \u0060add\u0060 and \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4729\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":"agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b93b15abc018b9e21b475bedcd11a590edc06efe4857d3ce85bf5b870953c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4611-4615 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5380-5384 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5408-5412 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5431-5435 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5462-5466 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5517-5521 \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 \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4611\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, \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5379\u0060 calls \u0060setString\u0060 and \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:5430\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4611}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1477171784dfaf4195a109494dc11867a2ee191b02612704c5e7e92bc6c4b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2277-2281 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3185-3189 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3347-3351 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:440-444 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:503-507 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2277\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4ecfe6c24073da01978fdd496292c2545cb99a60fdf4e4d8a8b3b856c9b981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:108-112 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:111-115 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:115-119 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:119-123 \u2014 before extracting anything, compare \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:108\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":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed07277ea417c224efbec947c6e2219bf2b6175f2140d5b1988e70cdda141e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2662-2666 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2691-2695 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2778-2782 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:386-390 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2662\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2662}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a77dbb2dbc0e4b7a824876c184d096d7b3c232b7c83c4f5a8f6da31a91285d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:457-461 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1902-1906 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:255-259 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:457\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":"agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd975482b09d766b8f573334ad6ffa05e307988d62b42fcc42ea530e704a4e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2127-2131 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3304-3308 | agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:3397-3401 \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 \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2127\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9c585631632b10577dbbabcd3824be2d9ec75b0fd2e6929e1f7f7ec684104f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:224-228 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:264-268 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:531-535 \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 \u0060agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:224\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":"agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"80436e4a980b702ceb6b4be4ad1ee2b0db07b77cd691ef3b75c8742e326bdd92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1828-1831 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1901-1905 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2012-2016 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:2398-2402 \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 \u0060agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1828\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":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b5578b5ce82ca7672789bd4347a9ab640b355cadc12e97e6a9feb6ab34cce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4397-4402 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4848-4853 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:6181-6186 \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 \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:4397\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":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4397}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc77ea896232a2203db7338870ff5864a2aa60bc7200858afdb694b547a3b72c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 8): agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java:12-16 | agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:89-93 | agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:207-210 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:171-174 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:128-131 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:252-255 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:280-283 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:136-139 \u2014 before extracting anything, compare \u0060agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java:12\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:251\u0060 calls \u0060resolveSchema\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java:206\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":"agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b4e0ac68a7add2174e4658959502572687f480a42eecc450ce256c160c0f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:351-355 | agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:383-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:351\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"8940c8ed0ff87aacc151eb2cd2f14b96c955dbb36957fa31c85c5ac4a85366c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:707-712 | agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:725-730 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:707\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b54a3b5537d8809769c30833e2ba9dcf0dde06799e73a563bfbe5d71ff3994"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java:390-395 | agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java:425-430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"528766ecdce1afeae732e25b26023bb9a80e84f76461feec365440fa8ea0bc89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java:71-76 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:898-903 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/common/src/main/java/com/dbx/agent/MetadataSqlSupport.java"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cea7908083ebbd7fffb91ecd01a8c3ac52be6cb5c4749f6e38c8f3ac07f741e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2277-2281 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java:1847-1851 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java:2277\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":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43aa003159be8507e146cece23f1ca08c4043f7a2253a99512cdffcdcf8abef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:155-159 | agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:233-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java:155\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":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b6e81c7176254b09a2f0d2ead889bb5c6fdca7f5f81204680e4712654388c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:89-93 | agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1104-1108 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:89\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ee4e5f7c12a92eec847d9930e54c46912a08abdde2f9db4c870f3835a810b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:88-92 | agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:156-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java:88\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":"agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0508cfcfceca4f2957ccd5f809b89b4bc4a8c15e547f32bbdd760ac8535591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1314-1319 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:433-437 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:1314\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":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f66b8498868a611034d2c0c6fd1b280b928f376d11141272a6b313cf460f8e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:235-239 | agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:317-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java:235\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":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4b31a3e0370180f380f578f6ff0754b80cc84a8cd86d9c6e719fe49a603862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:846-851 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:915-920 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"695a1bbd9507c7f1aa72cd1089cb514b2123e05eccd54b4e71d57e8c7f3c9467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:721-726 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:731-736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:721\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":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"d456e7f516ef5c715159ffe3570e7613414e47075154c6172a9269c1604de35c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2051-2055 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2412-2416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8713904a7109e627a54f2b30a60d2d708937b9a442ea82ffdee68f7e4bd704"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2194-2200 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2212-2218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b753221a256d76b9666ac2c1e281f4fa6c7fe448dfd76ccb326f3678d8b9556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseSchemaObjects.java:14-18 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseSchemaObjects.java:40-44 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseSchemaObjects.java:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseSchemaObjects.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"812d2002220406151e57ec0092d8c147aa3eab924868d37e36896a4b99df7ab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:759-764 | agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java:770-775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTarget.java"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e5021472c61778546fef15905e1ae311d4bfb5c38e0c88885447f597484f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java:201-210 | plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java:262-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java:201\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a35509efe96bc10d10ab8808ff2be5afb15e376e94f52af686b88a57e4f03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java:138-146 | agents/common/src/main/java/com/dbx/agent/BatchExecutor.java:157-165 | agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java:560-568 | agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java:1291-1299 | agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:904-912 | agents/common/src/main/java/com/dbx/agent/TransactionExecutor.java:150-158 \u2014 before extracting anything, compare \u0060agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/common/src/main/java/com/dbx/agent/TransactionExecutor.java:161\u0060 calls \u0060run\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/BatchExecutor.java:167\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":"agents/common/src/main/java/com/dbx/agent/BaseDatabaseAgent.java"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ea1a0486a6a842c5756c57bc8654efb402a10849faeb2d35ed67f81ffd2837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java:217-221 | agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:898-902 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b688e75fae2b723c196f101f2596f5176a40e280cf91031902a2bfb5ec3969f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java:300-306 | agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:393-399 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionPoolRegistry.java"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f26698f8c84f939e68ac680d9ea7e30d3e3277513ed2bb72155163b0f7f25a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:309-315 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2845-2851 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2842\u0060 calls \u0060singletonMap\u0060 and \u0060agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:306\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":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c321d721180b4740d030436df0744ce1415bb6a0786ff8bc42584d8ce6f17c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:442-447 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2859-2864 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f088c32da4c7f5db049d6a174b0179e0d3cbdfb6b58d4e94b278888285b2d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java:291-298 | plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java:366-373 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c77e191e967468046e9dae98e2b06ff41b85c6f9dd71d573bc77b567e181723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java:591-597 | agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java:764-770 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ca179e6136134f3fca3f724906018fd99a266cbae6dedb4593fe86f5bc56c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:48-54 | agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java:57-63 | agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:116-122 \u2014 before extracting anything, compare \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java\u0060 and \u0060agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"215b007c46bc19ff43cb28d8e9d7c1a270e463132a80d0ab58a9d4c592873368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java:191-199 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:359-367 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:382-390 \u2014 before extracting anything, compare \u0060agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java\u0060 and \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ba048980d8dcb200e2917ab7542e3321b8f5809bacea0e1f2452be0c843522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:261-272 | agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:300-311 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:172-183 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:242-253 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:281-292 \u2014 before extracting anything, compare \u0060agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java\u0060 and \u0060agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c752840ac9cf1b9af38e635907010090f0cf74094f6a2c3d21680a2d99091e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:274-281 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:255-262 \u2014 before extracting anything, compare \u0060agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java\u0060 and \u0060agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4e0505cfa9ad1e1a82336aaadae80ed19ba9f5915230e428d238781e94ba45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java:292-298 | agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java:273-279 \u2014 before extracting anything, compare \u0060agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java\u0060 and \u0060agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94cb4ed24baf41342ff4b816cd530df9796a01a5257f3eb32c3317328d6181d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:950-956 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:588-594 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"50595967b49453356c6578063c404dec8753b18912f7328c013a9b475b29a5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java:958-964 | agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:596-602 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d7c5ebcff15537fc79022dd3539790357d428efd00f1bfecac68644ca69ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java:39-49 | agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java:53-63 \u2014 before extracting anything, compare \u0060agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java\u0060 and \u0060agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c957538a08be937efb456ad140d448e573d0c8478d9b5d03415b536451a7ae58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:508-513 | agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:318-323 | agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:250-255 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:271-276 \u2014 before extracting anything, compare \u0060agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java\u0060 and \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java:325\u0060 calls \u0060buildUrl\u0060, \u0060getHost\u0060, \u0060getPort\u0060 and \u0060agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java:515\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":"agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cbcd89f0b0afb1d99a4c19e39cea17e1b80b9eb4699b64cf6687b866ae5ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:341-347 | agents/drivers/trino/src/main/java/com/dbx/agent/trino/TrinoAgent.java:315-321 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"387c5c24165750b462c36e7a6099b039f173e2d9d8aadbfca4db33baa2b609bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/JdbcDatabaseInfo.java:57-62 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:1071-1076 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060target\u0060 to \u0060Map\u003CString, String\u003E\u0060 in one and \u0060ObjectNode\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcDatabaseInfo.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"229f4d8eec288bcf96085df93124d8aa3670fbc4ffa212ad2cc0a2bcb08994c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:716-720 | agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:742-746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java:716\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":"agents/common/src/main/java/com/dbx/agent/EwkbWktDecoder.java"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f97f9e9f9ed743021fa2ee1bf6259407ccf93815ef810d8d6e3ab62323fa5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:215-219 | agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java:2791-2795 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java:215\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":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a940fad079c56bc95f86b51cc26a90e1f99406b9a8477b7b958c4eb993d89334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java:178-182 | plugins/jdbc/src/main/java/app/dbx/jdbc/OracleTriggerMetadataReader.java:175-179 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/OracleTriggerReader.java"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c308a339e8e47c708d7efc4a0eef156723d4654883decbb0a6df69dedf03b60a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1149-1153 | agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1312-1316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1149\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, \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1317\u0060 calls \u0060put\u0060 and \u0060agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java:1154\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":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"802ca6f52c787df3a2d5a52c33b63597db50c3985747c44dd892594411b4e742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:147-151 | agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:302-306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java:147\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":"agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"807a2d1c368e9616e6927424d0e87889b0fd307e82b0e44fd01edefd99fa8bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/transwarp/src/main/java/com/dbx/agent/transwarp/TranswarpAgent.java:204-208 | agents/drivers/transwarp/src/main/java/com/dbx/agent/transwarp/TranswarpAgent.java:218-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/transwarp/src/main/java/com/dbx/agent/transwarp/TranswarpAgent.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"657314cca2b8badb94be731599f7073f549cf20fc017e6f97fd192b967e85b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:1616-1620 | plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java:1922-1926 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22a4100135f6ce0b0a02842abd7dab74c70581e11883d07f5d99fe4736af1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java:162-166 | plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java:230-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DeferredLobValues.java"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d72c5d1695333baaa09a43feac0e12f179c7d6ac083f6d9a8a5f6058883bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (95 lines \u00D7 2): agents/drivers/argo-go/query.go:84-178 | agents/drivers/hive-go/query.go:84-178 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fd6850df7714988541652450dab2c79a86fcaf43c86526c3ea3cf690de587b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (92 lines \u00D7 2): agents/drivers/argo-go/config.go:174-265 | agents/drivers/hive-go/config.go:180-271 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/config.go:174\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1653c877a408d4d7c631e0219943647e573fbf7a2145892419d062d90f095c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (86 lines \u00D7 2): agents/drivers/argo-go/main.go:19-104 | agents/drivers/hive-go/main.go:19-104 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea27e5c7f3bd67ddf38647ae1fd2aecbd24cd250e844377fef228326d3b3030f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (79 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:573-651 | agents/drivers/vastbase-go/vastbase_metadata.go:402-480 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45cf9098b52b25deb43135aa9b3ca267e5ebd694cdcdff78822afefabc317ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (76 lines \u00D7 2): agents/drivers/argo-go/config.go:1042-1117 | agents/drivers/hive-go/config.go:1082-1157 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfccd07591fb38dc787d3dc77f1b6448aed73bafedbeb97b74e50428161ba856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (156 lines \u00D7 2): agents/drivers/argo-go/config.go:528-683 | agents/drivers/hive-go/config.go:535-690 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbed95a92e065c9ee036d38455cd2a45f11dbc9610c1c745ad0669122c406c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 2): agents/drivers/argo-go/config.go:68-140 | agents/drivers/hive-go/config.go:71-143 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7d76e1990996b47d231c54fdd07a363c1302dc4adce38a6a33ba5260b862b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 2): agents/drivers/argo-go/discovery.go:96-163 | agents/drivers/hive-go/discovery.go:96-163 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac01c6a38401da91757c5a0ba8ac43a590f578c6818c39e7dfbd81e874b5cd80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67 lines \u00D7 2): agents/drivers/argo-go/main.go:391-457 | agents/drivers/hive-go/main.go:391-457 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:391\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a1486dd08c84a8fca0025e2aaf23a9e1e2acadc75c149482260b1689dfdb72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): agents/drivers/argo-go/zookeeper_tls.go:61-117 | agents/drivers/hive-go/zookeeper_tls.go:61-117 \u2014 \u0060agents/drivers/argo-go/zookeeper_tls.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_tls.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"312ed3f8ffb5d290bc9a7036c97338857996453364824f969b773312e5a63bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (77 lines \u00D7 2): agents/drivers/argo-go/config.go:296-372 | agents/drivers/hive-go/config.go:302-378 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"104082cd8022891babec69174ccf31c4bb1eb5bef0ff7ca84b0ad7e5f97e29bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2): agents/drivers/argo-go/metadata.go:378-433 | agents/drivers/hive-go/metadata.go:384-439 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0775888c270c2ebf128c3a0d153c05e27f043d02dd2fffa6d3fbe33720f215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): agents/drivers/argo-go/query.go:27-81 | agents/drivers/hive-go/query.go:27-81 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7531be7ac759c3fec6de2452f989dc150e9cfbba7651ddb168c2139d5f3e7eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:513-567 | agents/drivers/vastbase-go/vastbase_metadata.go:342-396 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"cade852bd898117d111a6b7ac6e9c529183c275a1d3a89c9776b43328a970163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): agents/drivers/argo-go/zookeeper_tls.go:120-173 | agents/drivers/hive-go/zookeeper_tls.go:120-173 \u2014 \u0060agents/drivers/argo-go/zookeeper_tls.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_tls.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a65c30f78310914caeb6b752aa05d4b5a5f6d170513b2426402f8c5833e9135"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): agents/drivers/argo-go/metadata.go:16-67 | agents/drivers/hive-go/metadata.go:16-67 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:16\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a7695fefd0eda42e98f482e1d6bbc478057197d4e41171cd9e798456de49d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): agents/drivers/argo-go/config.go:904-954 | agents/drivers/hive-go/config.go:944-994 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c624cacdf6ad8cd2d326e12c00b1b01e8482463b8539d43e29da088162e8df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): agents/drivers/etcd-go/main.go:200-250 | agents/drivers/etcd2-go/main.go:170-220 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/main.go"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb433109605a591f3eb053488ae67a43085fc8585033abd925b9ef729751eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:21-70 | agents/drivers/hive-go/zookeeper_protocol.go:21-70 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fea335ea6d2b95f36c47bb1fb5c11f07f1d9f2c21621907e642bf141081a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (86 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:769-854 | agents/drivers/vastbase-go/vastbase_metadata.go:594-679 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e80dcd1f08175402a93069f0df60e6a90aa0759c09bf2ac85738ffba192fcc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:987-1035 | agents/drivers/vastbase-go/vastbase_metadata.go:812-860 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"89efc5637bd676c96996c28ce7ed07cea4687c3895dd54b17e9efdd62ea747a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1543-1588 | agents/drivers/vastbase-go/main.go:1243-1288 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"873eed7ac27f047fb2d57ebd15b591ee873cc1153b459e2fb7c8407bc7a4374c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1788-1831 | agents/drivers/vastbase-go/vastbase_metadata.go:1108-1151 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1788\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed100d147097f997cb84215a5f80da385ff59a066ea140672049d3332d4471c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): agents/drivers/argo-go/config.go:754-796 | agents/drivers/hive-go/config.go:794-836 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e380db3624ca0e8c3efa4b6afec4af9df1eccba34add349d75f0f1e04743ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): agents/drivers/argo-go/connector.go:28-70 | agents/drivers/hive-go/connector.go:28-70 \u2014 \u0060agents/drivers/argo-go/connector.go\u0060 and \u0060agents/drivers/hive-go/connector.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 105 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/connector.go:28\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":"agents/drivers/argo-go/connector.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d601435123a46965dbf26ff8da2fbcec4163e4561791c8c148104267878bf583"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): agents/drivers/kingbase-go/main.go:63-105 | agents/drivers/vastbase-go/main.go:56-98 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"713518bbe0953f47f7cdfdae7b3009a57c1034fee9e490935aad34f8a62772bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): agents/drivers/argo-go/query.go:217-256 | agents/drivers/hive-go/query.go:217-256 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5d5c368ec062ff8dd0e8112d58500cffb868f2ed0f5ec322416f6d60360092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:92-131 | agents/drivers/hive-go/zookeeper_protocol.go:92-131 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f775390c1dbeb845b4fb1249943c737f6726742ba6e5b7ad52235b7484f8ae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): agents/drivers/argo-go/zookeeper_tls.go:19-58 | agents/drivers/hive-go/zookeeper_tls.go:19-58 \u2014 \u0060agents/drivers/argo-go/zookeeper_tls.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_tls.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b64395d0ac52e532022dffcd60acaccd110760c549b45d7431171d027244ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:945-984 | agents/drivers/vastbase-go/vastbase_metadata.go:770-809 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43fafb08adf1f750d59db4f84f90657eb3c35288c549c3a6342bacc8e57a23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1425-1464 | agents/drivers/vastbase-go/main.go:1163-1202 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:1425\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91cc018f07a34d812b34f62d3a704c8acd5e1351779917296c23bda86c51dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:142-180 | agents/drivers/hive-go/zookeeper_protocol.go:142-180 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa18e0b391aa8deefb55bf10bddf48773f5fcce861ff58c65a6405c42861dd19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:298-336 | agents/drivers/hive-go/zookeeper_protocol.go:298-336 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"613d5c00b539f0ad4043d65b8f12c1846562bf563db6d2c2ae27c560e696c53e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): agents/drivers/argo-go/config.go:25-62 | agents/drivers/hive-go/config.go:28-65 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/config.go:25\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc915c93a795b8e0f4fd121d7b48c1cc6753519f6e72843082dcb94008874214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): agents/drivers/argo-go/metadata.go:815-852 | agents/drivers/hive-go/metadata.go:826-863 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b58b5245065844b7ab29627f1dc92c133460cd34da0146628ecf7c30e51969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): agents/drivers/argo-go/query.go:298-335 | agents/drivers/hive-go/query.go:298-335 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/query.go:298\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"326db6593aaebf79c7d6e7db7ebb8613222cfea1a50a9dbc00f815d07591f984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): agents/drivers/argo-go/config.go:959-995 | agents/drivers/hive-go/config.go:999-1035 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c04c664fdb96434213fbe1769375b52551f224682b3dbd56f699226f5ccbf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): agents/drivers/argo-go/connector.go:132-168 | agents/drivers/hive-go/connector.go:133-169 \u2014 \u0060agents/drivers/argo-go/connector.go\u0060 and \u0060agents/drivers/hive-go/connector.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 105 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/connector.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1af1ef6563a3a3405c8531cc21ecaa6c35543c56ffe22903e6beb45a0f972a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): agents/drivers/argo-go/metadata.go:339-375 | agents/drivers/hive-go/metadata.go:345-381 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:339\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10417a4b0d5d72c3aaf8de1f4d7a3227670bee51a66fb4f5491993dadedcda4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:194-230 | agents/drivers/hive-go/zookeeper_protocol.go:194-230 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44b8e257c23f34a005856fac25f76506a568f96b7827c2546ac191cf559245a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:528-564 | agents/drivers/hive-go/zookeeper_protocol.go:528-564 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae345770e4434d3c0ba91c99fe687bb831ff9d61a40d5651d36f402329bd97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): agents/drivers/argo-go/metadata.go:297-330 | agents/drivers/hive-go/metadata.go:303-336 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:297\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b506ddb65ad946fc6c2042b03a98e6d6dbe4d9a92822d9327fa205401fb70d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): agents/drivers/argo-go/protocol_error.go:37-70 | agents/drivers/hive-go/protocol_error.go:37-70 \u2014 \u0060agents/drivers/argo-go/protocol_error.go\u0060 and \u0060agents/drivers/hive-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 136 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/protocol_error.go:37\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"531839653c501dca205ecaaaf80f3567a91ca1d85240e6f8246dba92ad9bb13e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): agents/drivers/argo-go/query.go:181-214 | agents/drivers/hive-go/query.go:181-214 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"339a1b091958e214feaa0900d6e3029b36a57aa5d102c5b5767f07d6fbd25365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:134-167 | agents/drivers/vastbase-go/vastbase_metadata.go:54-87 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:134\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafea5b895dc794e4ba7666ee06507a59c3b8cec76602dbca3717f89911f5b2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): agents/drivers/argo-go/metadata.go:87-119 | agents/drivers/hive-go/metadata.go:87-119 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cadb569bd956e980ae5fe31cb06a748d5af70ddf104faa25c9f57ae92f80847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): agents/drivers/etcd-go/main.go:400-432 | agents/drivers/etcd2-go/main.go:354-386 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/main.go:400\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060s *etcdSession) handle(method\u0060 in one and \u0060s *etcd2Session) handle(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/etcd2-go/main.go:387\u0060 calls \u0060isEtcd3OnlyMethod\u0060 and \u0060agents/drivers/etcd-go/main.go:433\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":"agents/drivers/etcd-go/main.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"253b6985b9c86821403395674730bfe3775d967b7ff1a222c2533e3af71c5866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): agents/drivers/argo-go/metadata.go:436-466 | agents/drivers/hive-go/metadata.go:442-472 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56a9288c8d9497077888047371ee76cee89964d18f0d11aa76dcb1a17cd288b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): agents/drivers/argo-go/metadata.go:942-972 | agents/drivers/hive-go/metadata.go:953-983 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b91588997afae3858ac124a550f713c76bcf726091da38bc4583ec1962cb8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1172-1202 | agents/drivers/vastbase-go/vastbase_metadata.go:997-1027 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1172\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"34823ddbd0865b0aefd21c67f313506bd412e31fa3c36b0604d1d2e98f6eeacf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 7): agents/drivers/argo-go/metadata.go:107-136 | agents/drivers/cassandra-go/metadata.go:101-130 | agents/drivers/hive-go/metadata.go:107-136 | agents/drivers/iotdb/metadata.go:86-115 | agents/drivers/kingbase-go/main.go:72-101 | agents/drivers/neo4j-go/metadata.go:69-98 | agents/drivers/vastbase-go/main.go:65-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caa16f1e43a0a2c7663730d711be822a54ca5a38e1d0dc7b1e881d817557643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): agents/drivers/argo-go/config.go:143-172 | agents/drivers/hive-go/config.go:146-175 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcbf6ba6b5491ae064be546dd991a9422790cc38588ef462f8535fe034afe26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): agents/drivers/argo-go/discovery.go:64-93 | agents/drivers/hive-go/discovery.go:64-93 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f18e1fd37c57036ab0f6074af4503984dfcf00c6729e8311bb3309adcc84e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): agents/drivers/iotdb/metadata.go:23-52 | agents/drivers/neo4j-go/metadata.go:18-47 \u2014 \u0060agents/drivers/iotdb/metadata.go\u0060 and \u0060agents/drivers/neo4j-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 9 separate duplicated blocks between them, totalling at least 185 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/iotdb/metadata.go:23\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, \u0060agents/drivers/iotdb/metadata.go:20\u0060 calls \u0060MustCompile\u0060 and \u0060agents/drivers/neo4j-go/metadata.go:16\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/metadata.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2e083ad18b8c8965ba01faf3ffefcc63d8a942d0fe19a425f25658d868fb9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): agents/drivers/argo-go/config.go:386-414 | agents/drivers/hive-go/config.go:392-420 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba42dbccdda389ba8f2aea74ea110f33837362fac093b5501e857e4e237d8c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): agents/drivers/argo-go/config.go:1168-1196 | agents/drivers/hive-go/config.go:1208-1236 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d441e50a17bbcf838e2ba1581901a4cf96c0cc23f95141da089a5c6dcba7ced9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:186-214 | agents/drivers/vastbase-go/vastbase_metadata.go:112-140 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b989c90b011454414771f1552aad14f2265653ac69fc62134f2548a764e3e27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 5): agents/drivers/argo-go/main.go:42-69 | agents/drivers/cassandra-go/main.go:56-83 | agents/drivers/hive-go/main.go:42-69 | agents/drivers/iotdb/main.go:57-84 | agents/drivers/neo4j-go/main.go:55-82 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0908679f0bf10308a3964c037f303fc86f67f543d1c3d8db852c1071e5925b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): agents/drivers/argo-go/discovery.go:247-274 | agents/drivers/hive-go/discovery.go:247-274 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"975067bb8df65aee5bc8552cfea8bbf52504e5489bbef0f424479037e81fecc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): agents/drivers/argo-go/main.go:240-267 | agents/drivers/hive-go/main.go:240-267 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/main.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe6dd5a855ae1fe0eb5ac004256358aefd1498cb24a9f6891f5be786dbd5aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): agents/drivers/argo-go/config.go:821-847 | agents/drivers/hive-go/config.go:861-887 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"feac8d12f29d066e0467653194180e70f5810e9a70fb818b3f29adc7a7c8b5e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): agents/drivers/argo-go/main.go:332-358 | agents/drivers/hive-go/main.go:332-358 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/main.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d46f4da68c9a95fd08c07e3050692d574681ff1abe80a84b0c7fc60d895986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1849-1875 | agents/drivers/vastbase-go/vastbase_metadata.go:1169-1195 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"631fc3623e90c6799c266b78ad4695ff41291ebbc90a3bdc3eab2be056be9fb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): agents/drivers/argo-go/config.go:862-887 | agents/drivers/hive-go/config.go:902-927 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cfc1c287598adb1fa138f084b9d522aa5a74fd30535f44b37dbe9ff977083b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): agents/drivers/argo-go/discovery.go:191-216 | agents/drivers/hive-go/discovery.go:191-216 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbf1bdca39705c8793ea372fc83331d568977c8ab7696683891c97790c5291d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): agents/drivers/argo-go/discovery.go:219-244 | agents/drivers/hive-go/discovery.go:219-244 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6369b14e31bfd0ee4be7f75360917f936f89fe1618a90ae4e2291499b0913a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): agents/drivers/argo-go/main.go:508-533 | agents/drivers/hive-go/main.go:508-533 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/main.go"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"363f9ae5dde8ad59505a30b54ab2675f06b30b2e799697a9d3ed1d2eac82be49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3): agents/drivers/cassandra-go/metadata.go:28-52 | agents/drivers/iotdb/metadata.go:35-59 | agents/drivers/neo4j-go/metadata.go:30-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/metadata.go:28\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":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5c288c30d09c5e52be7e93df7c8676f1aaf4c7095370213e680b3890cf46ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): agents/drivers/cassandra-go/main.go:245-269 | agents/drivers/neo4j-go/main.go:273-297 \u2014 \u0060agents/drivers/cassandra-go/main.go\u0060 and \u0060agents/drivers/neo4j-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 21 separate duplicated blocks between them, totalling at least 280 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/main.go:245\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1648916f2793ebfda69c4e31ddeb5a443505f01b5c5674b6cc2d3bfb5ac0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): agents/drivers/neo4j-go/internal/neo4jcompat/modern.go:20-44 | agents/drivers/neo4j-go/internal/neo4jcompat/windows_legacy.go:21-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060agents/drivers/neo4j-go/internal/neo4jcompat/modern.go:20\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/internal/neo4jcompat/modern.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d503acea5ac3cdd6db8b1c36499cf9e6d5ca74c01086f49a7bac2bdf3248c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): agents/drivers/oracle-go/main.go:1215-1239 | agents/drivers/xugu/main.go:1150-1174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb057f032be4eee9a270dcc7706d48854df9ae87a86aa2e82e0d8fb9237b88d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): agents/drivers/argo-go/metadata.go:517-540 | agents/drivers/hive-go/metadata.go:528-551 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:517\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3fffb99289b5e07cc4f1d38ebb82b5ec0a824a3ca174a3a4ad8852d1e191ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): agents/drivers/argo-go/metadata.go:651-676 | agents/drivers/hive-go/metadata.go:662-687 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:651\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0ed6dbbddf2986b9b86789ba16d3ad2139ecb398ac52bbf288d8be9b7a31eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): agents/drivers/argo-go/metadata.go:896-919 | agents/drivers/hive-go/metadata.go:907-930 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecf67f5f6f1a71bf49443af680ac1b90adfae77ef2a297ffe2c90a5c5f365c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1702-1725 | agents/drivers/vastbase-go/vastbase_metadata.go:1066-1089 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1702\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"05565cbc9cf08717fd8e9db35d819f62a5a20d8d2ff18bbcc2205142eb14ffd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3344-3367 | agents/drivers/vastbase-go/vastbase_metadata.go:2165-2188 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:3344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4221bea96741f37677edb2a59c6d20fce3f75835308f734902578ffe16178de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 8): agents/drivers/argo-go/metadata.go:107-129 | agents/drivers/cassandra-go/metadata.go:101-123 | agents/drivers/hive-go/metadata.go:107-129 | agents/drivers/iotdb/metadata.go:86-108 | agents/drivers/kingbase-go/main.go:72-94 | agents/drivers/neo4j-go/metadata.go:69-91 | agents/drivers/oracle-go/main.go:318-340 | agents/drivers/vastbase-go/main.go:65-87 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 8 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b26f3e169c811c131ed6409afa634ae2e941c4a389e838d8af0949a46379c1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 4): agents/drivers/cassandra-go/main.go:22-44 | agents/drivers/iotdb/main.go:27-49 | agents/drivers/neo4j-go/main.go:26-48 | agents/drivers/vastbase-go/main.go:25-47 \u2014 \u0060agents/drivers/cassandra-go/main.go\u0060 and \u0060agents/drivers/iotdb/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 384 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/main.go:22\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":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5181bf3df15175bf7d39c280102182b2006ee37cd02831a5f8ca7170f950ab6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): agents/drivers/argo-go/discovery.go:328-350 | agents/drivers/hive-go/discovery.go:328-350 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a83bfca52ba522ec992403ad3b40c1c70ab9cee985a04d0bb858be8ddeb41d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): agents/drivers/argo-go/metadata.go:679-701 | agents/drivers/hive-go/metadata.go:690-712 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df37d771f2cb70b4887d19ef6c032d06719d3cfa617361f3c6a83d04faca46f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): agents/drivers/etcd-go/main.go:143-165 | agents/drivers/etcd2-go/main.go:113-135 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/main.go:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c0d4d19c8f01452f99611d90f2a74af124b54b4b69133b702df7d98d78f1ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3139-3161 | agents/drivers/vastbase-go/vastbase_metadata.go:2050-2072 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0623211940338c985a1a173fe543fe2e177da06d81a381c6637c496f2138580e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): agents/drivers/oracle-go/main.go:1904-1926 | agents/drivers/oracle-go/main.go:1995-2017 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/main.go:1904\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"9173e9d62567490caf56c0b8872a0f7cf437ee9c2c1b0c674a423b188e018463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): agents/drivers/oracle-go/pldebug_rows.go:102-124 | agents/drivers/oracle-go/pldebug_statement.go:34-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug_rows.go:102\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_rows.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3cc38fa8b0c2d739f0ac8d2a3c563461a99251121fd597f3047f0ae3bbd6c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): agents/drivers/rabbitmq/main.go:45-67 | agents/drivers/zookeeper/main.go:18-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/main.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2deb3c11db5417c527000a3c5dc32d8838841dc7f4bd58d338d4d2c46d77d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:220-241 | agents/go-common/iotdb-client-go/client/session.go:282-304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/go-common/iotdb-client-go/client/session.go:242\u0060 calls \u0060GetSessionId\u0060, \u0060RequestStatementId\u0060, \u0060Background\u0060 and \u0060agents/go-common/iotdb-client-go/client/session.go:305\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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf1fbe6094d6ddf247c1a416711a358171a1f7178b97ede940544e24519b571"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): agents/drivers/argo-go/metadata.go:542-563 | agents/drivers/hive-go/metadata.go:553-574 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:542\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a246e7bb468564b08406f6a8f8134d97a9d84cd5ec4f7797db8879bee1db9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): agents/drivers/argo-go/metadata.go:727-748 | agents/drivers/hive-go/metadata.go:738-759 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"90debb2b3010188c1a6bb3126f714e27b9f037e3a2af69bf51b475d585276498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): agents/drivers/argo-go/metadata.go:775-796 | agents/drivers/hive-go/metadata.go:786-807 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:775\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba7a6c239701c74b3c0d80cf952202160e8b12f383e8c6214dd54dafed9a97f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): agents/drivers/etcd-go/client.go:274-295 | agents/drivers/etcd2-go/client.go:177-198 \u2014 \u0060agents/drivers/etcd-go/client.go\u0060 and \u0060agents/drivers/etcd2-go/client.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 71 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/client.go:274\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/client.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"44adafd26719c77a005be9feb1265ab977cd8be740ee771df35d12bc20937264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): agents/drivers/etcd-go/client.go:337-359 | agents/drivers/etcd2-go/client.go:404-426 \u2014 \u0060agents/drivers/etcd-go/client.go\u0060 and \u0060agents/drivers/etcd2-go/client.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 71 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/client.go"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea3b87b88bdbf52890e9ec151c86442a4e7c03e742d1d00779ee0135d2798a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): agents/drivers/etcd-go/watch.go:218-237 | agents/drivers/etcd2-go/watch.go:213-234 \u2014 \u0060agents/drivers/etcd-go/watch.go\u0060 and \u0060agents/drivers/etcd2-go/watch.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/watch.go:218\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":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f402d881b520f678a19cd0677a776f7469318cf2f7d3212190c3277dfb9e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:331-352 | agents/drivers/vastbase-go/vastbase_metadata.go:182-203 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:331\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ecacf2e2b7e12f265b161563335c7b52f2dbcffb290c9309697614e0d73a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): agents/drivers/oracle-go/pldebug.go:3866-3883 | agents/drivers/oracle-go/pldebug.go:3904-3925 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug.go:3866\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":3866}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b981836d296b667156f658b5f1ab0a75580e7e844b3d710b4b52291f2447584"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): agents/drivers/vastbase-go/bench/direct/main.go:139-160 | agents/drivers/vastbase-go/main.go:1320-1341 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/vastbase-go/bench/direct/main.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c363d15b59a6ca863bb000d04cbad94ff49f339c9de833f7d275b294d0cc61c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 7): agents/drivers/argo-go/main.go:122-142 | agents/drivers/cassandra-go/main.go:129-149 | agents/drivers/hive-go/main.go:122-142 | agents/drivers/iotdb/main.go:126-146 | agents/drivers/kingbase-go/main.go:200-220 | agents/drivers/neo4j-go/main.go:150-170 | agents/drivers/vastbase-go/main.go:196-216 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:122\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbff90413289830a7e875504eb273b72873294539b9a3fe1f3dbe0b28c34024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/argo-go/config.go:433-453 | agents/drivers/hive-go/config.go:440-460 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/config.go:433\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/hive-go/config.go:439\u0060 calls \u0060TrimLeft\u0060, \u0060TrimSpace\u0060 and \u0060agents/drivers/argo-go/config.go:432\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":"agents/drivers/argo-go/config.go"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70d291105a6ff92cec9a50a2296a0889056e3cdba1f0ec365ada79af07aecc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/argo-go/metadata.go:485-505 | agents/drivers/hive-go/metadata.go:496-516 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f180e51e5dd4f640b67ddf2f16095889a76f7b53b8ad5dcfb35553bf2f1808"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/argo-go/metadata.go:627-647 | agents/drivers/hive-go/metadata.go:638-658 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:627\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ab26dfd8b78eaee6e9ed75ececbe587e481f7154ad2e72e7cb114c6ff5172b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/argo-go/zookeeper_tls.go:207-227 | agents/drivers/hive-go/zookeeper_tls.go:207-227 \u2014 \u0060agents/drivers/argo-go/zookeeper_tls.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_tls.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a461fc7854c1d4ed7dc463314cab8cb8099489ae2e62c7d61d19829fbefaccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:710-730 | agents/drivers/vastbase-go/vastbase_metadata.go:535-555 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8d1d4b81bbe5bb7a4cbd536f84911923650b84f4fee4201fd3d48a7fa82806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:922-942 | agents/drivers/vastbase-go/vastbase_metadata.go:747-767 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b9591a7884f4ac3992a5f718c8eb406b26ffd30942e9207838a45655389abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2996-3016 | agents/drivers/vastbase-go/vastbase_metadata.go:1945-1965 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2996\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2996}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f32c576ea544069a0e9f27cd50c550cb64cc34e9ff17a930f3ed4c44f04b04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1012-1032 | agents/drivers/oracle-go/main.go:4965-4985 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee87c281a368a3604b8b17ecb90d7330ae791865328cc1690bb4ca9a32417723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/oracle-go/main.go:377-397 | agents/drivers/oracle-go/main.go:413-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/main.go:377\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"080d4af91b1b7ff257a7c55eb9e57d0885d2220efa3993a37c442b7fea894da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:974-994 | agents/go-common/iotdb-client-go/client/session.go:1020-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"619b58e24b525bb8464f89d5a74990a0f671b495254de1e68c438b87108567dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 5): agents/drivers/argo-go/metadata.go:51-70 | agents/drivers/cassandra-go/metadata.go:36-55 | agents/drivers/hive-go/metadata.go:51-70 | agents/drivers/iotdb/metadata.go:43-62 | agents/drivers/neo4j-go/metadata.go:38-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:51\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c15978aea7f0dab5aa34ab40fbb58b6821c209377ca13e57d16178c9c29f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/argo-go/config.go:799-818 | agents/drivers/hive-go/config.go:839-858 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfea8923668e32e6880c05bef9b7b148b25ab93f75e3e8a9aa382f944c835de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/argo-go/discovery.go:277-296 | agents/drivers/hive-go/discovery.go:277-296 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d372c639ab0f9b9715d1f7dc13eb81bfa79cc39ce81b59fddf03c40e91c9b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/argo-go/main.go:369-388 | agents/drivers/hive-go/main.go:369-388 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/main.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f53f304f8b26bf0d750dd15e92f3dbade950403ddb2f2c52cdb57457a6dfa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/argo-go/metadata.go:234-254 | agents/drivers/hive-go/metadata.go:240-260 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"445a70e060c1a4dc3c64bb1a9df41802dfc73d0b9a18c9aab9d48699817d945f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/argo-go/metadata.go:275-294 | agents/drivers/hive-go/metadata.go:281-300 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a87b9e7a52ca6769a941087c827ce5265b435146acff1bb8c6dc7fd90c89f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:506-525 | agents/drivers/hive-go/zookeeper_protocol.go:506-525 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"81566d99d74967f3e31b6d86b6aaef71e74f40ddb6f6b73015963fb166f4f962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/etcd-go/watch.go:49-68 | agents/drivers/etcd2-go/watch.go:52-71 \u2014 \u0060agents/drivers/etcd-go/watch.go\u0060 and \u0060agents/drivers/etcd2-go/watch.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"916f67eaf5817dc7873452bebeb9d857d2227ff173804c4d8ca3e941a98b4486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:671-690 | agents/drivers/vastbase-go/vastbase_metadata.go:496-515 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:671\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60d007e9fd4d6e071fef91285c9a8eae25a5bcacb42ed6642ecea94e3288a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:900-919 | agents/drivers/vastbase-go/vastbase_metadata.go:725-744 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"856a265c2d25811c62d5818dffa40aebbe5d2ed6c09fd8121f28f54667a37432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/kingbase-go/main.go:22-41 | agents/drivers/vastbase-go/main.go:19-38 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcb8268b618c412d083c9251a8037a11a8b231ae3ec2d1227f71e1fbc437f5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1139-1158 | agents/drivers/vastbase-go/main.go:1002-1021 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:1139\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f8bbd9435a99d664a5a76d0ac9539491337fe1dbaa8a60b6c74dcede6774c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/oracle-go/main.go:329-348 | agents/drivers/xugu/type_members.go:111-130 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/main.go:329\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b166c64279775ab009533af67bfa7c994ef0aa5d2dc44cc08105e44e947cf55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 7): agents/drivers/argo-go/metadata.go:54-72 | agents/drivers/cassandra-go/metadata.go:39-57 | agents/drivers/hive-go/metadata.go:54-72 | agents/drivers/iotdb/metadata.go:46-64 | agents/drivers/kingbase-go/kingbase_metadata.go:151-169 | agents/drivers/neo4j-go/metadata.go:41-59 | agents/drivers/vastbase-go/vastbase_metadata.go:71-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:54\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9cbeb40a80d4a8e3443b5ada6d2601fe77ef2639befd2357ec67114649c841"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 5): agents/drivers/cassandra-go/main.go:24-42 | agents/drivers/iotdb/main.go:29-47 | agents/drivers/neo4j-go/main.go:28-46 | agents/drivers/vastbase-go/main.go:27-45 | agents/drivers/xugu/main.go:318-336 \u2014 \u0060agents/drivers/cassandra-go/main.go\u0060 and \u0060agents/drivers/iotdb/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 384 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/main.go:24\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"99be42e9545cd45b99141f19ed9263ee013a0374bd0ade1a71b2f636120f867c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/argo-go/metadata.go:177-195 | agents/drivers/hive-go/metadata.go:177-195 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d03e8ba953d4bf465a5e3f77dbd543a40c62a388c0d6e5c8df0be1b3ad88e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): agents/drivers/argo-go/metadata.go:597-625 | agents/drivers/hive-go/metadata.go:608-636 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:597\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"36360ec962f5839a4e6442a05b469347345e2e44560cbf6674cf5625296c9657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/argo-go/protocol_error.go:104-122 | agents/drivers/hive-go/protocol_error.go:104-122 \u2014 \u0060agents/drivers/argo-go/protocol_error.go\u0060 and \u0060agents/drivers/hive-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 136 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2e987d3b2c6076d667934b6e841969dfa3843c4a991711ed5ec912e90439ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/argo-go/query.go:425-443 | agents/drivers/hive-go/query.go:428-446 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"627c67ff13620b50a6404fe81f4112e34570533a6adc431a3f904f9b01d82124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:387-405 | agents/drivers/hive-go/zookeeper_protocol.go:387-405 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7115a2825d6a6572685d6607fdf74519c9a056ffb9700656fd64ff259e55eafd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/argo-go/zookeeper_tls.go:176-194 | agents/drivers/hive-go/zookeeper_tls.go:176-194 \u2014 \u0060agents/drivers/argo-go/zookeeper_tls.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_tls.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c1902b50a1d79043b6f7ba372209102a24dc369804eb2c644c8cab10bea651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/etcd-go/kv.go:371-389 | agents/drivers/etcd2-go/kv.go:287-305 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"684aaa70871aa71a812e7dd45cc74368c3b4883c6be6088e0c88c53b5781ca47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/etcd-go/protocol_error.go:37-55 | agents/drivers/etcd2-go/protocol_error.go:34-52 \u2014 \u0060agents/drivers/etcd-go/protocol_error.go\u0060 and \u0060agents/drivers/etcd2-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 81 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/protocol_error.go:37\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":"agents/drivers/etcd-go/protocol_error.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a757319b5c9353613bcea174889b091b1386c3ce5df2b11328a610663e9d5c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:469-487 | agents/drivers/vastbase-go/vastbase_metadata.go:302-320 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:469\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59fc434c1b186eab329e0753352da5adb17139edd4bc5df247e8fd4a6c378cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:879-897 | agents/drivers/vastbase-go/vastbase_metadata.go:704-722 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a2322047f5d66190e21284fdbd588c731881380a51d9fbf4da904b29f722dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2395-2413 | agents/drivers/vastbase-go/vastbase_metadata.go:1470-1488 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"641b7f0592bfb5da31d85e0f80be88bd002e72d572d995daf97a57033c3f31e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2674-2692 | agents/drivers/vastbase-go/vastbase_metadata.go:1756-1774 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5327275eb3bee9c9072835d326bfb4e6d0ce5b55e091fdecc846c3ebdf3ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): agents/drivers/oracle-go/pldebug_collection_initialize.go:94-111 | agents/drivers/oracle-go/pldebug_object_initialize.go:31-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug_object_initialize.go:31\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":"agents/drivers/oracle-go/pldebug_collection_initialize.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5c95e59cf6e2ad7ec3d93c7f84c79fa8e8154390ce222de8de8d23b0a38f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): plugins/sdk/go/dbx-plugin-sdk/sdk.go:225-243 | plugins/sdk/go/dbx-plugin-sdk/sdk.go:302-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/go/dbx-plugin-sdk/sdk.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe377cc8f2ad4dcec39526d1814898fb48c8bff9210f2df26d0359191c06597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): agents/drivers/argo-go/main.go:202-219 | agents/drivers/cassandra-go/main.go:200-217 | agents/drivers/hive-go/main.go:202-219 | agents/drivers/iotdb/main.go:206-223 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:202\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060runtimeServer *runtimeServer) dispatch(method\u0060 in one and \u0060r *runtimeServer) dispatch(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c765a3d718f599c1e1d5d8fb9a0eea49c0df41a774c857c1259cdd4f29545bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): agents/drivers/argo-go/main.go:451-468 | agents/drivers/cassandra-go/main.go:379-396 | agents/drivers/hive-go/main.go:451-468 | agents/drivers/iotdb/main.go:372-389 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:451\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f16cba6aaea23311b8b59752297ef5f896a5a8f08a4f21fc5569d149899317f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/argo-go/connector.go:182-199 | agents/drivers/hive-go/connector.go:183-200 \u2014 \u0060agents/drivers/argo-go/connector.go\u0060 and \u0060agents/drivers/hive-go/connector.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 105 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/connector.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eda2645933795c4a5c74c142f084d4a5dbdcf0770dc19e73ad07324bed85cc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/argo-go/main.go:296-313 | agents/drivers/hive-go/main.go:296-313 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/main.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4744446e3ceb4a42a46296bb8bc2cfcca91a3c2d2f9dfc4d331e47c1e5ebac9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/argo-go/metadata.go:756-773 | agents/drivers/hive-go/metadata.go:767-784 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:756\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe2b8d5462a8aa5d298ffb6449a38ec9d99da2ff3fd37b2f17e4f9bc2a8598d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:242-259 | agents/drivers/hive-go/zookeeper_protocol.go:242-259 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15c89f3780ceaa1b9936bf43d9c5f0649958a315fd47ee492a058a721e01c16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:262-279 | agents/drivers/hive-go/zookeeper_protocol.go:262-279 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3567e06e735a78f3b7034fd53433fcfcfacf0ac753944d30fc79efca677733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/cassandra-go/main.go:325-342 | agents/drivers/iotdb/main.go:327-344 \u2014 \u0060agents/drivers/cassandra-go/main.go\u0060 and \u0060agents/drivers/iotdb/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 384 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/main.go:325\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8995e2992637f77047c55655235788b5d8cb598354cc0e066d9a5aa6867da5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/cassandra-go/metadata.go:563-580 | agents/drivers/iotdb/metadata.go:517-534 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/cassandra-go/metadata.go:563\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":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"096496691acd87259b3e70139445409937d069c379141d3ff95111b770284a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:375-392 | agents/drivers/vastbase-go/vastbase_metadata.go:226-243 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:375\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea8479a5478a70bf564f16f4159b39b863853bdfff93791e741a6c2ac8500df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/kingbase-go/main.go:511-528 | agents/drivers/kingbase-go/main.go:716-733 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2f6182092452726397a357f36d40c9196662e62a818189411e2cd08d675de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/argo-go/config.go:456-472 | agents/drivers/hive-go/config.go:463-479 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"92463d1532a720b8e47a519cf7ba057e226f177e07b1bde158c4c60d9f05d39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/argo-go/metadata.go:1009-1025 | agents/drivers/hive-go/metadata.go:1020-1036 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"87edc68b8c2df3537da32a7209559e275bbb3e8ff690c905fadf84f0a5864572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/etcd-go/kv.go:533-549 | agents/drivers/etcd2-go/kv.go:444-460 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"f089064d9b9a56b9db912de0b2b7f0a4b82af9fcf35914a5119181ceb68d4834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1043-1059 | agents/drivers/vastbase-go/vastbase_metadata.go:868-884 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc0ca0d101d541f7547a14bf1710c3a782cfcf8e0557cae7a98fca378621a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1095-1111 | agents/drivers/vastbase-go/vastbase_metadata.go:920-936 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1095\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa9950f4f7dc4ac22dc23304aa6e9b43eb792776be13ceef57e0a3f53f7d0c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2915-2931 | agents/drivers/vastbase-go/vastbase_metadata.go:1864-1880 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7c9fc2fe633608700b8bb8da8d2f2e398d998e7f3886489a172ea12ffc8f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/kingbase-go/main.go:460-476 | agents/drivers/neo4j-go/main.go:467-483 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/neo4j-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 23 separate duplicated blocks between them, totalling at least 248 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:460\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e1afff80047b4acbc0d706977233a474b6a0811c95127674fc33ac2d0ce602"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/oracle-go/main.go:2140-2156 | agents/drivers/xugu/main.go:2446-2462 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oracle-go/main.go:2140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/oracle-go/main.go:2157\u0060 calls \u0060boolParam\u0060 and \u0060agents/drivers/xugu/main.go:2463\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6d2706e4810c34f4ae2a213515996cc70818ed8e34bcb81459a4edcf92dabf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/oracle-go/main.go:2303-2319 | agents/drivers/xugu/main.go:2731-2747 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7af33c66d485a724aa9f2cfb8494a529ee34d36c38dedddbc49bf011d8b234"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/oracle-go/main.go:4661-4677 | agents/drivers/xugu/main.go:3960-3976 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oracle-go/main.go:4661\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4661}}}],"partialFingerprints":{"codehealthFindingId/v1":"327dafd915bbafc7978eb034dda120ca29f772466c01209a75630cf801dc8dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/rabbitmq/thrift_binary.go:326-342 | agents/drivers/rabbitmq/thrift_binary.go:364-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/rabbitmq/thrift_binary.go:326\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/thrift_binary.go"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9afd27612583c531092c3af9a78c8bd503b20ea7fa8e97b54b7af8442f2dea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:908-924 | agents/go-common/iotdb-client-go/client/session.go:928-944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/go-common/iotdb-client-go/client/session.go:908\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"136c71c40905044fb14bd996e9b9b12d5b070c2e8e9dac10959a5374ccd8f00a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): agents/drivers/cassandra-go/metadata.go:543-558 | agents/drivers/kingbase-go/kingbase_metadata.go:1778-1793 | agents/drivers/vastbase-go/vastbase_metadata.go:1098-1113 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/metadata.go:543\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6e2ff469372ca329fd7281f09bc0246bda023ecb4da2c96a129a6d76427872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/argo-go/config.go:736-751 | agents/drivers/hive-go/config.go:776-791 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea4774c675980efdd59670055533e034080b9305ffc3ddf07b1c0ee764de548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/argo-go/discovery.go:31-46 | agents/drivers/hive-go/discovery.go:31-46 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"18af2c4cd1d6060f04e14333e2ac16315e0f3b6fd31b7f1d3053a1436afb4b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/argo-go/main.go:220-235 | agents/drivers/hive-go/main.go:220-235 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:220\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bfbe5ab91252b1e152fa9ff9bfb018294243a87574061b9964a2d4b0d63c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/argo-go/metadata.go:709-724 | agents/drivers/hive-go/metadata.go:720-735 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:709\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"290ec3631b5e3728e0b7c95f74bd737d54c5af38b26387397298f039496b9d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/argo-go/query.go:391-406 | agents/drivers/hive-go/query.go:394-409 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41cd1a8000f2187a04727079ea73245379b3e684862c7066a38e00c3e9d5be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/argo-go/query.go:446-461 | agents/drivers/hive-go/query.go:449-464 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"98afb751cdb82d7600f91425dc45a4a73d6f04da026fc6bca538d7177615f047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:354-370 | agents/drivers/hive-go/zookeeper_protocol.go:354-370 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e79e95c2823eb770d54a64fe6474a51fb2c1d6aafd9fa779e2828d500f9d97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:483-498 | agents/drivers/hive-go/zookeeper_protocol.go:483-498 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b544acbd6edd1298517c470ae6abfc6592e1add4a65ee0527ebb930a880d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/etcd-go/kv.go:482-497 | agents/drivers/etcd2-go/kv.go:393-408 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e025f93857d9ca5e463f5b3f145673e82526a716c1078bb724aa9109f1b4b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1062-1077 | agents/drivers/vastbase-go/vastbase_metadata.go:887-902 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f26489a5690a5a9b1ca19ca4ae9cffff566ac4460747e9c0b9e9db80636358b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1117-1132 | agents/drivers/vastbase-go/vastbase_metadata.go:942-957 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0284b022bafc09aeb3623d02018a0f1123deeecbaf43410fc72c62df139ab894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1878-1893 | agents/drivers/vastbase-go/vastbase_metadata.go:1198-1213 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17cc7f50fc35e3a9a9018a4bbbd3838eb0c2f0a36f04f75dd3cf72d8d5ddad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2346-2361 | agents/drivers/vastbase-go/vastbase_metadata.go:1687-1702 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2346\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb3e54ca5c7efb87c297ac3100447cb960c7e1a86486e95137fb72a2c2305ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2853-2868 | agents/drivers/kingbase-go/kingbase_metadata.go:2893-2908 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2853\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2853}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe9f8e3f963c168e184dc1fdbf8fd09d7fba57a0eace6b497dec38282c975cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3075-3090 | agents/drivers/vastbase-go/vastbase_metadata.go:1986-2001 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:3075\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"272660a0e08cca9258f6c3ebf00dfa9742c9cff6795e01f12392d83f886d9c9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/rabbitmq/main.go:88-103 | agents/drivers/zookeeper/main.go:52-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/zookeeper/main.go:50\u0060 calls \u0060closeClient\u0060 and \u0060agents/drivers/rabbitmq/main.go:87\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":"agents/drivers/rabbitmq/main.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3075ceb7b693a3a4ede9043d1998a392f4288fa5c80ac1ff37773bcab53a19ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/xugu/main.go:5053-5068 | agents/drivers/xugu/main.go:5322-5337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/xugu/main.go:5053\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":"agents/drivers/xugu/main.go"},"region":{"startLine":5053}}}],"partialFingerprints":{"codehealthFindingId/v1":"18688e21d1a45beff865d364e047995e577af07dd63f5330544687b8c93de3b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/xugu/main.go:5733-5748 | agents/drivers/xugu/main.go:5770-5785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/xugu/main.go:5733\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":"agents/drivers/xugu/main.go"},"region":{"startLine":5733}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7e7b95e1bf39be0be597d9f1a8c37f7d5608c50369857014e2a730ffced703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:1082-1097 | agents/go-common/iotdb-client-go/client/session.go:1103-1118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/go-common/iotdb-client-go/client/session.go:1082\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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c736d8eb9f89c26b908a97ce91b399d95534f171a1c332c6cec208e210299e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 11): agents/drivers/argo-go/main.go:109-123 | agents/drivers/cassandra-go/main.go:116-130 | agents/drivers/etcd-go/main.go:130-144 | agents/drivers/etcd2-go/main.go:100-114 | agents/drivers/hive-go/main.go:109-123 | agents/drivers/iotdb/main.go:113-127 | agents/drivers/kingbase-go/main.go:187-201 | agents/drivers/nebula-go/main.go:68-81 | agents/drivers/neo4j-go/main.go:137-151 | agents/drivers/vastbase-go/main.go:183-197 | agents/drivers/xugu/main.go:710-724 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:109\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/argo-go/main.go:107\u0060 calls \u0060configureRuntimeParallelism\u0060 and \u0060agents/drivers/cassandra-go/main.go:114\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":"agents/drivers/argo-go/main.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a45f8a1bfe4de58142258f71c5751cf2a6d43dad194f5735c5d8c9d9967570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201315 lines \u00D7 6): agents/drivers/argo-go/protocol_error.go:105-113 | agents/drivers/cassandra-go/protocol_error.go:121-135 | agents/drivers/etcd-go/protocol_error.go:74-83 | agents/drivers/etcd2-go/protocol_error.go:66-74 | agents/drivers/hive-go/protocol_error.go:105-113 | agents/drivers/neo4j-go/protocol_error.go:122-130 \u2014 \u0060agents/drivers/argo-go/protocol_error.go\u0060 and \u0060agents/drivers/cassandra-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/protocol_error.go:105\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04bc65004cac0bbfbc89b7d7e5b2632fcbd273d0d8f760c0278edcb18977334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): agents/drivers/cassandra-go/main.go:218-232 | agents/drivers/iotdb/main.go:224-238 | agents/drivers/kingbase-go/main.go:283-297 | agents/drivers/neo4j-go/main.go:251-265 | agents/drivers/vastbase-go/main.go:284-298 \u2014 \u0060agents/drivers/cassandra-go/main.go\u0060 and \u0060agents/drivers/iotdb/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 384 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/main.go:218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91e08f723e6abf6360ae79d4373c41d8151ce74ac98b258f10820869ac147cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/argo-go/config.go:703-717 | agents/drivers/hive-go/config.go:715-729 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/config.go:703\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/hive-go/config.go:714\u0060 calls \u0060TrimPrefix\u0060 and \u0060agents/drivers/argo-go/config.go:702\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":"agents/drivers/argo-go/config.go"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef48121d6d690ce1e63bc69700367f31bdba129b218aaa1abc36014fdef5e819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/cassandra-go/protocol_error.go:34-48 | agents/drivers/vastbase-go/protocol_error.go:35-49 \u2014 \u0060agents/drivers/cassandra-go/protocol_error.go\u0060 and \u0060agents/drivers/vastbase-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 98 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/protocol_error.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a0deb01ba4c707904f70c95172027d370d5c246f6a90e90f08e5843d171e6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/cassandra-go/runtime.go:154-168 | agents/drivers/neo4j-go/main.go:354-368 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/cassandra-go/runtime.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"07891764e9d52c75d076ccf2a601beb8c1dd0961ec6f4365522c1a86828a6fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/cassandra-go/runtime.go:171-185 | agents/drivers/neo4j-go/main.go:371-385 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/cassandra-go/runtime.go:171\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":"agents/drivers/cassandra-go/runtime.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57fd0167f1ce78a53ffb8d312adaad6c32dc8cafd2e7151e5058c9b579d74d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/etcd-go/history.go:146-160 | agents/drivers/etcd-go/watch.go:326-340 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"agents/drivers/etcd-go/history.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"15959e2112def160343a0bca762f7541c5b91b3a7405441aa7bb7410ebeca0fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/etcd-go/watch.go:352-366 | agents/drivers/etcd2-go/watch.go:374-388 \u2014 \u0060agents/drivers/etcd-go/watch.go\u0060 and \u0060agents/drivers/etcd2-go/watch.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec27a23153a083ebe8f7aa06c385a193a34d00aeedca6458527806686d2a4bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3177-3191 | agents/drivers/vastbase-go/vastbase_metadata.go:2090-2104 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c01ce3c600c787850730492e83d1c192380caef4dafd293bdf343e6c8f4ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/kingbase-go/main.go:267-281 | agents/drivers/vastbase-go/main.go:268-282 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d008450863c1f4607144b388de4504550cd29dc3091f3b8de06129a85ab9a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/kingbase-go/main.go:828-842 | agents/drivers/kingbase-go/main.go:1126-1140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bf8c9fac758cfd8d1855663cb9233c7de840f61719114b7b484280b189bc21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/neo4j-go/main.go:480-494 | agents/drivers/vastbase-go/main.go:470-484 \u2014 \u0060agents/drivers/neo4j-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 282 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/main.go"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e7b81c87d76aea2f80708d78b942ee90fecf6c539b7791166556a53d7423cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/rabbitmq/operations.go:43-57 | agents/drivers/rabbitmq/operations.go:422-436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/rabbitmq/operations.go:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a59db6dcd4deabfaa2b052f78e5fa0d375bf8235349d42f627fbb47bccbf5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/rocketmq/topics.go:331-345 | agents/drivers/rocketmq/topics.go:355-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/topics.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"2496f1dad36bca998c1bfa04a0d442ea0d216f24127379eb1ea5f119a9a80e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/xugu/main.go:2265-2279 | agents/drivers/xugu/main.go:2408-2422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af74e3f99c900e7c06189e35fdcaa3d43fb9ef53d015ad106114e4c3e44fa14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:1134-1148 | agents/go-common/iotdb-client-go/client/session.go:1159-1173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/go-common/iotdb-client-go/client/session.go:1134\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c790959417697998b3b594924ca30e5b7cacaf977f6b40f0824dcce42efe7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 9): agents/drivers/argo-go/main.go:128-141 | agents/drivers/cassandra-go/main.go:135-148 | agents/drivers/etcd-go/main.go:150-163 | agents/drivers/etcd2-go/main.go:120-133 | agents/drivers/hive-go/main.go:128-141 | agents/drivers/iotdb/main.go:132-145 | agents/drivers/kingbase-go/main.go:206-219 | agents/drivers/neo4j-go/main.go:156-169 | agents/drivers/vastbase-go/main.go:202-215 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:128\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/etcd-go/main.go:149\u0060 calls \u0060closeAll\u0060 and \u0060agents/drivers/cassandra-go/main.go:134\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":"agents/drivers/argo-go/main.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d5d9c59c320d813d5061aee43feac5b60f561135da0ba007aa881f9de31494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): agents/drivers/cassandra-go/metadata.go:544-557 | agents/drivers/iotdb/metadata.go:494-507 | agents/drivers/kingbase-go/kingbase_metadata.go:1779-1792 | agents/drivers/vastbase-go/vastbase_metadata.go:1099-1112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/metadata.go:544\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":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"157f64353f9de4e86d00c05e92b436f1d72a7d99c62b2525aa285102e1de00bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): agents/drivers/etcd-go/auth.go:229-242 | agents/drivers/etcd-go/auth.go:267-280 | agents/drivers/etcd2-go/auth.go:104-117 | agents/drivers/etcd2-go/auth.go:149-162 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"834194b03088040c7b3c9ac8b5dc39feb05021854d17b6fe35ca19821dd92eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): agents/drivers/argo-go/main.go:492-505 | agents/drivers/hive-go/main.go:492-505 | agents/drivers/iotdb/main.go:413-426 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/main.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1a422fda903c58830ab0ba53b58132486cba57a2951b50adfb8437d1d88019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): agents/drivers/argo-go/zookeeper_protocol.go:51-64 | agents/drivers/hive-go/zookeeper_protocol.go:51-64 | agents/drivers/zookeeper/tls.go:32-45 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/zookeeper/tls.go:32\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4286e8c71913a39871047b5491b12471cbd73569413ddc53481303cb9caf4ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 3): agents/drivers/kingbase-go/main.go:1151-1158 | agents/drivers/vastbase-go/main.go:1014-1021 | agents/drivers/xugu/main.go:3966-3979 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:1151\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5020ef1f2eabbbd6cb92899c5ba27be665ca9dae7dc48be4215269b6534867af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): agents/go-common/iotdb-client-go/client/session.go:1411-1424 | agents/go-common/iotdb-client-go/client/session.go:1437-1450 | agents/go-common/iotdb-client-go/client/session.go:1463-1476 \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 \u0060agents/go-common/iotdb-client-go/client/session.go:1411\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/go-common/iotdb-client-go/client/session.go:1409\u0060 calls \u0060getColumnCategories\u0060 and \u0060agents/go-common/iotdb-client-go/client/session.go:1435\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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab4ef0210e394934c31bc0468622e3d5f40780434796c004877bb10d2afff4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/config.go:1026-1039 | agents/drivers/hive-go/config.go:1066-1079 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"89191a0a150eff98c706ff135bd9ee908be2e76d0ca3d7905c5b3639d0d7b4ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/config.go:1216-1229 | agents/drivers/hive-go/config.go:1256-1269 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dc37d74928bd023bbff18eeb7acefc6166edc0444de3a16aaf4b97aca44910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/discovery.go:312-325 | agents/drivers/hive-go/discovery.go:312-325 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e11a780108c618be539f8a2a42671fd22d604c919d3addb42d979137cae25fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/discovery.go:353-366 | agents/drivers/hive-go/discovery.go:353-366 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"692672b27895afb1598046c60a458b6bf4282ebd9e451cf40a6b75a7acb056da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/main.go:280-293 | agents/drivers/hive-go/main.go:280-293 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/main.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eeb92c685cd9c21f7a690f6c46279e10681e09de1a029ca9c7f5d7168727080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/main.go:316-329 | agents/drivers/hive-go/main.go:316-329 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/main.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c44e04bd3c199c79667f8610486c272be96345fab720d551a68202ba499267c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/metadata.go:148-161 | agents/drivers/hive-go/metadata.go:148-161 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6c135b99ddf9ec58c3c6c1d162691294eceea6137c906fbb0378e516fb50ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/metadata.go:799-812 | agents/drivers/hive-go/metadata.go:810-823 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"046494a46459653a5e4fc33441709bd981e10db1e72aa14ea2d0fd3648591149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/argo-go/metadata.go:1037-1051 | agents/drivers/hive-go/metadata.go:1048-1062 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"21462c10d7bd3b4d365e14136b429548dac52e16dc16a80f8c0503951b70292c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/query.go:340-353 | agents/drivers/hive-go/query.go:343-356 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/query.go:340\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba57ee12124a07a2c9f6592181fee4dc459a8157ab554f6ba5c22b771084b71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/query.go:409-422 | agents/drivers/hive-go/query.go:412-425 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1397ff61b2653ef8ae6eb3b8d70d38feb423fe84b4bc1e4064d4426763b55c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:282-295 | agents/drivers/hive-go/zookeeper_protocol.go:282-295 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"655647aa6a00e3bb45e958fca53abe8ea836cd49aa806d50f5c65d06597a2064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/etcd-go/auth.go:288-301 | agents/drivers/etcd2-go/auth.go:171-184 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc593308a716b373738aaba3d330467c70f41d706b2a3135a6678ba1a3f90c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/etcd-go/kv.go:230-243 | agents/drivers/etcd2-go/kv.go:179-192 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"820ca0ce6a34d2aa4e750aef9e86d69c4b88627e7804e59c12af60426c6c2ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/etcd-go/watch.go:90-103 | agents/drivers/etcd2-go/watch.go:92-105 \u2014 \u0060agents/drivers/etcd-go/watch.go\u0060 and \u0060agents/drivers/etcd2-go/watch.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/watch.go:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f8984bdf9513a9feb5c5bdeaf717b52f90bfc21ebd82e26fdebb822627931d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/etcd2-go/kv.go:230-243 | agents/drivers/etcd2-go/kv.go:266-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/kv.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34291b74f4509acce2f5c537a291e87d78a2239d0b2c0b924344c5ff92bee7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2326-2339 | agents/drivers/vastbase-go/vastbase_metadata.go:1706-1719 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2326\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c977bfc45e849fe0548429964983392669b3859b48e1d3286a90335a46495b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2590-2603 | agents/drivers/vastbase-go/vastbase_metadata.go:1594-1607 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2590\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, \u0060agents/drivers/vastbase-go/vastbase_metadata.go:1592\u0060 calls \u0060parseVastbaseConstraintValid\u0060, \u0060parseVastbaseConstraintEnabled\u0060 and \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2589\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"689468a992019041ab15fb354c7259d9f073254351c7da6b6a935562440c62b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/kingbase-go/main.go:423-436 | agents/drivers/vastbase-go/main.go:438-451 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a80552160b4907af6f590332085a27c24992e601cc5b13ddcc3f591ac259975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/oracle-go/main.go:895-908 | agents/drivers/xugu/main.go:821-834 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oracle-go/main.go:895\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62ee594d1744defa7b1877e2bfcf02da9b5a368b32b2bd3626fb31eee9b9a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/oracle-go/pldebug_routine.go:260-273 | agents/drivers/oracle-go/pldebug_routine.go:336-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug_routine.go:260\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_routine.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0d1efa2d959fe61368ac972b6744717c45af95fb6bed81095bb1ec5e72ee06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:443-456 | agents/go-common/iotdb-client-go/client/session.go:491-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0cb681936235fe90294338b61a516974453fde365789691e42a876a466d5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:1004-1017 | agents/go-common/iotdb-client-go/client/session.go:1051-1064 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/go-common/iotdb-client-go/client/session.go:1004\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c612b58ab272d463fa55f508238c009a35aea22597d634859cab357296738f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): agents/drivers/argo-go/main.go:191-203 | agents/drivers/cassandra-go/main.go:189-201 | agents/drivers/hive-go/main.go:191-203 | agents/drivers/iotdb/main.go:195-207 | agents/drivers/kingbase-go/main.go:259-271 | agents/drivers/neo4j-go/main.go:223-235 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:191\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060runtimeServer *runtimeServer) dispatch(method\u0060 in one and \u0060r *runtimeServer) dispatch(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b301a952678cf5b1e7fc1e56cac77c1cf6353cc6fe2a1ad85d1a6d82104da035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): agents/drivers/cassandra-go/main.go:349-361 | agents/drivers/iotdb/main.go:352-364 | agents/drivers/kingbase-go/main.go:414-426 | agents/drivers/vastbase-go/main.go:429-441 \u2014 \u0060agents/drivers/cassandra-go/main.go\u0060 and \u0060agents/drivers/iotdb/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 384 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/main.go:349\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4224e97d2b8e8cfc80480aa3599b9eb0a6abd751755a82fdb11099027c0da637"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): agents/drivers/cassandra-go/metadata.go:658-670 | agents/drivers/kingbase-go/kingbase_metadata.go:1834-1846 | agents/drivers/vastbase-go/vastbase_metadata.go:1154-1166 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"8455f57a442ce24b5eecfd25aae8387331c8afe5ba675f2fc94e77566d8029b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): agents/drivers/iotdb/protocol_error.go:56-68 | agents/drivers/neo4j-go/protocol_error.go:70-82 | agents/drivers/vastbase-go/protocol_error.go:67-79 \u2014 \u0060agents/drivers/iotdb/protocol_error.go\u0060 and \u0060agents/drivers/neo4j-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 66 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/iotdb/protocol_error.go:56\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/protocol_error.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd508b9e1b75f1b7b2c1f7c2e87186ccf6d44b12b74c049e26e6cb17d68fbc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/argo-go/discovery.go:49-61 | agents/drivers/hive-go/discovery.go:49-61 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc33ed98f993de0c706d26dc8ebd9882cd4a07f9edefcfd11ac81a95dd72770a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/argo-go/metadata.go:260-272 | agents/drivers/hive-go/metadata.go:266-278 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"835d0616ed43afc880ed66d962256e336acfdc731b77ef2af2e12882ecff3c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/argo-go/query.go:270-282 | agents/drivers/hive-go/query.go:270-282 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eec5b711f39326f4655bd63a130fd729e122fdac53f6869701398f8c8d3ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/argo-go/query.go:356-368 | agents/drivers/hive-go/query.go:359-371 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04395a4e7f444374d7b895f46174f73edf4884b212d45235e34843ed8c6e406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:339-351 | agents/drivers/hive-go/zookeeper_protocol.go:339-351 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"16835a70cd91f1e0138ef0b16a115808ceec08784ef1c0a508bbf95a4208b172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/cassandra-go/runtime.go:92-104 | agents/drivers/vastbase-go/runtime_pool.go:89-101 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/cassandra-go/runtime.go:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/runtime.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb9bfc48d66dadd5a3365428f7449546ed4e6a756c8c67556a0ff869d5be500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/etcd-go/main.go:305-317 | agents/drivers/etcd2-go/main.go:275-287 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/main.go"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f62540b3a7dd983eba4f00946c0fc202f03e64df383484b763858b5b9efbe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/etcd-go/status.go:90-102 | agents/drivers/etcd2-go/status.go:98-110 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/status.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ea4c5a228c2e2f99fea6f07c982eccf6e4138b2ae950f1e8b5cde13bdb781f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1728-1740 | agents/drivers/kingbase-go/kingbase_metadata.go:2735-2747 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1728\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b29441a2098cc672acd5e26d8d44acd03ab993f9ef536a111e3476a48d64a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3124-3136 | agents/drivers/vastbase-go/vastbase_metadata.go:2035-2047 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:3124\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b817e15bcf52749f4bd5ed1c9aaacf508da168c0e11c951ad7227d2ca056947f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/kingbase-go/main.go:394-406 | agents/drivers/vastbase-go/main.go:409-421 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:394\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32210dc1127d9b4f1e81662c5a8da42d80588a60d35729ac07dd8595a685b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1068-1080 | agents/drivers/oracle-go/main.go:5159-5171 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/kingbase-go/main.go:1068\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34f5c27e5645a07d466011dbdb04cb528f5da12a3be51d917a03c147873cbd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/oracle-go/pldebug_frame_value.go:92-104 | agents/drivers/oracle-go/pldebug_frame_write.go:126-138 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_frame_value.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaaec4da75b2eb68623981d66f2e786dda9e75678dcc966ff9bfc717faf9c430"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/rocketmq/consumers.go:156-168 | agents/drivers/rocketmq/consumers.go:175-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/rocketmq/consumers.go:156\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf8e12748b95f0bb14cd0bf05d393bf6463622a39ed0cef6960895ad3576188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 10): agents/drivers/argo-go/main.go:162-173 | agents/drivers/cassandra-go/main.go:160-171 | agents/drivers/etcd-go/main.go:186-197 | agents/drivers/etcd2-go/main.go:156-167 | agents/drivers/hive-go/main.go:162-173 | agents/drivers/iotdb/main.go:166-177 | agents/drivers/neo4j-go/main.go:194-205 | agents/drivers/vastbase-go/main.go:220-231 | agents/drivers/xugu/main.go:762-773 | agents/drivers/xugu/main.go:1038-1049 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:162\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba01b079d4515714a23425d447b3620772089fd909cbb68a923d8d8ca4cae265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): agents/go-common/iotdb-client-go/client/column.go:228-239 | agents/go-common/iotdb-client-go/client/column.go:300-311 | agents/go-common/iotdb-client-go/client/column.go:372-383 | agents/go-common/iotdb-client-go/client/column.go:444-455 | agents/go-common/iotdb-client-go/client/column.go:516-527 | agents/go-common/iotdb-client-go/client/column.go:588-599 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/column.go"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4518d743b5607e8911bbbb62c107a8d1a2fa9e8b96ceb49e883b3a09ebfd6fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): agents/drivers/argo-go/main.go:226-237 | agents/drivers/hive-go/main.go:226-237 | agents/drivers/iotdb/main.go:229-240 | agents/drivers/kingbase-go/main.go:288-299 | agents/drivers/neo4j-go/main.go:256-267 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:226\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8ef1cf291825e998c4aa052e7575e8e63fd7c3d43b925a06097a85bdb35ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): agents/drivers/argo-go/main.go:176-187 | agents/drivers/cassandra-go/main.go:174-185 | agents/drivers/hive-go/main.go:176-187 | agents/drivers/iotdb/main.go:180-191 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:176\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7e6de8978813c12993751113c60e9a4a5981087ea91abdc3c0b4cd6a4b391d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): agents/drivers/cassandra-go/protocol_error.go:73-84 | agents/drivers/iotdb/protocol_error.go:60-70 | agents/drivers/neo4j-go/protocol_error.go:74-85 | agents/drivers/vastbase-go/protocol_error.go:71-82 \u2014 \u0060agents/drivers/cassandra-go/protocol_error.go\u0060 and \u0060agents/drivers/iotdb/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 53 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/protocol_error.go:73\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/protocol_error.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"123866bbb1d46e4712ab09b47606cb3d652ca01fd3f380811da2dc09ffe8d8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): agents/drivers/kingbase-go/main.go:379-390 | agents/drivers/oracle-go/main.go:1119-1130 | agents/drivers/vastbase-go/main.go:393-404 | agents/drivers/xugu/main.go:1058-1069 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:379\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6a051d999c32cf107c9a08fb82f614e8a5ab5bd2dca44d10900c03fe39aa9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): agents/drivers/argo-go/zookeeper_tls.go:139-150 | agents/drivers/cassandra-go/tls_stores.go:136-147 | agents/drivers/hive-go/zookeeper_tls.go:139-150 \u2014 \u0060agents/drivers/argo-go/zookeeper_tls.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_tls.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/zookeeper_tls.go:139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c91aee9ea5f8afda0b07567e132051556ed98dd68181b0d6f80e56fbb0d90d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): agents/drivers/kingbase-go/main.go:769-780 | agents/drivers/neo4j-go/main.go:502-513 | agents/drivers/vastbase-go/main.go:647-658 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/neo4j-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 23 separate duplicated blocks between them, totalling at least 248 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef430e1cb80f5aba864461910574dc81afd9fa6b0b6e11cc272fda43995f7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/argo-go/config.go:1154-1165 | agents/drivers/hive-go/config.go:1194-1205 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"732e9ac1f26cdfc48ce06e733b8b37627114b1955b7ae65fa3cdfc227b6106aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:73-84 | agents/drivers/hive-go/zookeeper_protocol.go:73-84 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3130a443ec1bb48837cdc31b55ea0ecae2071044499a0196356e53bc8a3e433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/etcd-go/client.go:51-62 | agents/drivers/etcd2-go/client.go:55-66 \u2014 \u0060agents/drivers/etcd-go/client.go\u0060 and \u0060agents/drivers/etcd2-go/client.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 71 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/client.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7836f34a3c72c59f6460c4ddad944f98563105da786405caa6da9173a18160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/etcd-go/kv.go:455-466 | agents/drivers/etcd2-go/kv.go:379-390 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"35466322f6268520b8a4b5f9d0f5a56c99cd2fa48bc5e5ae3778ec70dbd52c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/etcd-go/main.go:267-278 | agents/drivers/etcd2-go/main.go:237-248 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/main.go:267\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"111d7abcc4331274dab85187ee903ecebf131e01ba393221d02ea94395e6373f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/etcd-go/main.go:291-302 | agents/drivers/etcd2-go/main.go:261-272 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/main.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a2cd5773dbe6d38def28f9ae01c5fd402fab64cc531ff14cbff643b5912642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/etcd-go/main.go:364-375 | agents/drivers/etcd2-go/main.go:334-345 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/main.go:364\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/etcd-go/main.go:377\u0060 calls \u0060history\u0060 and \u0060agents/drivers/etcd2-go/main.go:347\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":"agents/drivers/etcd-go/main.go"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae6d758470769288903a5de44eff1df77a7561ac679c92bcbbc507e8470519e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/iotdb/main.go:301-312 | agents/drivers/kingbase-go/main.go:355-366 \u2014 \u0060agents/drivers/iotdb/main.go\u0060 and \u0060agents/drivers/kingbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/iotdb/main.go:301\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/main.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24512bd532e64f62459c90a4dd5e6499844b8702fb13b3c586156a22d95314b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1135-1146 | agents/drivers/vastbase-go/vastbase_metadata.go:960-971 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1135\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9e35c48cc45caca2c6d352069c49fef580b5f771e47a696fccb396ec0e1e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1149-1160 | agents/drivers/vastbase-go/vastbase_metadata.go:974-985 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3664e3da0b6df28f06394f4428b8a7f7da17729230efb1645385a6aa622120f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1671-1682 | agents/drivers/vastbase-go/vastbase_metadata.go:1030-1040 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1671\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"4646f43eafa50c4c7146a623192b6524a8b64e3215b7ae72eca2f317d4774b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3231-3242 | agents/drivers/vastbase-go/vastbase_metadata.go:2127-2138 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"204edac1290632d333635ec081b15a07b01c5cb1a78defe07ff87c8a537624a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/kingbase-go/main.go:2109-2120 | agents/drivers/kingbase-go/main.go:2206-2217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:2109\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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":2109}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe94565b5884c1c9f33d077bf9b3f51546771fafb1ec34cbd41735daa27621f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/oracle-go/main.go:4047-4058 | agents/drivers/oracle-go/main.go:4070-4081 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/main.go:4070\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4047}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af038eb7acb9ec94dab4689c4eddb094b96b7c934cb3ef25b8590a6cb54079f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/oracle-go/main.go:6018-6029 | agents/drivers/oracle-go/main.go:6054-6065 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/main.go:6018\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6018}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a3e0e4b5c218bcf1c6697069575a89381d4d79664438680d15e776824775bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/rabbitmq/operations.go:682-693 | agents/drivers/rabbitmq/operations.go:741-752 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/rabbitmq/operations.go:682\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/rabbitmq/operations.go:740\u0060 calls \u0060stringOrEmpty\u0060 and \u0060agents/drivers/rabbitmq/operations.go:681\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":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0004a877e77f5b2ed28bca9cda16d98fc8dfcbf7ff569918285ea56bd56b9ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/rabbitmq/thrift_binary.go:316-327 | agents/drivers/rabbitmq/thrift_binary.go:346-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/thrift_binary.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0228126483526c70371ed5db90d8d8e25fef1c1d7e7215da9f4f1732696390f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/vastbase-go/spatial.go:79-90 | agents/drivers/xugu/spatial.go:148-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/vastbase-go/spatial.go:79\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d42466fad975f6d6e2af7e67bbb7950e886fd971302fb0401267ae1ba2fc00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/xugu/main.go:364-375 | agents/drivers/xugu/main.go:392-403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/xugu/main.go:364\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f688beeba1fc6f95e271d853724c16c99606e981f3522776a1586cb819d45187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:619-630 | agents/go-common/iotdb-client-go/client/session.go:666-675 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/go-common/iotdb-client-go/client/session.go:619\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b0f9dd47ab37f8ffe6d157e1506393fa80e64e8950ab8d6d0b157fb898a777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:798-809 | agents/go-common/iotdb-client-go/client/session.go:832-843 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/go-common/iotdb-client-go/client/session.go:798\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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"131bebe2a859301ee2775be28ad873dfef77c255ce710e2179c3133177708d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8): agents/drivers/argo-go/main.go:179-189 | agents/drivers/cassandra-go/main.go:177-187 | agents/drivers/hive-go/main.go:179-189 | agents/drivers/iotdb/main.go:183-193 | agents/drivers/kingbase-go/main.go:247-257 | agents/drivers/neo4j-go/main.go:211-221 | agents/drivers/vastbase-go/main.go:243-253 | agents/drivers/xugu/main.go:783-793 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:179\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060runtimeServer *runtimeServer) dispatch(method\u0060 in one and \u0060r *runtimeServer) dispatch(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0699b5495a2f147b56eda338120e7a22d848c3ce19fc12ca539a80ec35029bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): agents/drivers/argo-go/main.go:419-429 | agents/drivers/cassandra-go/main.go:349-359 | agents/drivers/hive-go/main.go:419-429 | agents/drivers/iotdb/main.go:352-362 | agents/drivers/kingbase-go/main.go:414-424 | agents/drivers/vastbase-go/main.go:429-439 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:419\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/cassandra-go/main.go:360\u0060 calls \u0060listIndexes\u0060, \u0060stringParam\u0060 and \u0060agents/drivers/argo-go/main.go:430\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":"agents/drivers/argo-go/main.go"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"45353fb3d6e7b0bed84294b2bfd907f40ade63402f5acacc7b78630aa81f70a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): agents/drivers/argo-go/protocol_error.go:35-45 | agents/drivers/cassandra-go/protocol_error.go:33-43 | agents/drivers/hive-go/protocol_error.go:35-45 | agents/drivers/iotdb/protocol_error.go:34-44 | agents/drivers/neo4j-go/protocol_error.go:38-48 | agents/drivers/vastbase-go/protocol_error.go:34-44 \u2014 \u0060agents/drivers/argo-go/protocol_error.go\u0060 and \u0060agents/drivers/cassandra-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"000f5b0e9a11e684281ad2251ecd6914e293babca1d829b87596b7311d8acdbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): agents/drivers/cassandra-go/main.go:222-232 | agents/drivers/etcd-go/main.go:236-246 | agents/drivers/etcd2-go/main.go:206-216 | agents/drivers/vastbase-go/main.go:288-298 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/main.go:222\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdf853216746965b07db99662464339b15e66bc5bcb93a4ccf3b6ba42ba36a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): agents/drivers/oracle-go/main.go:5466-5476 | agents/drivers/oracle-go/main.go:6011-6021 | agents/drivers/oracle-go/main.go:6047-6057 | agents/drivers/oracle-go/main.go:6078-6088 \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 \u0060agents/drivers/oracle-go/main.go:5466\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5466}}}],"partialFingerprints":{"codehealthFindingId/v1":"29da5c17529c871f3446612b821f0d1480e7b4176aeb9e3e6da99494e06447ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): agents/drivers/argo-go/zookeeper_tls.go:230-240 | agents/drivers/cassandra-go/tls_stores.go:171-181 | agents/drivers/hive-go/zookeeper_tls.go:230-240 \u2014 \u0060agents/drivers/argo-go/zookeeper_tls.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_tls.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3420b151c5480c05d7b2e9671dddc95bad6e3c2b862ba9a39a5b5a3dd64247b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): agents/drivers/oracle-go/main.go:1908-1918 | agents/drivers/oracle-go/main.go:1999-2009 | agents/drivers/xugu/main.go:1739-1749 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/main.go:1908\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"31234c1bc0f238e92d335b5df7b0dfc81e0005e458499152fbe7451fce96871f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/argo-go/config.go:421-432 | agents/drivers/hive-go/config.go:427-438 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/config.go:421\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, \u0060agents/drivers/hive-go/config.go:439\u0060 calls \u0060TrimLeft\u0060, \u0060TrimSpace\u0060 and \u0060agents/drivers/argo-go/config.go:433\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":"agents/drivers/argo-go/config.go"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"31532c184b22e194a45103d8bc9394e10e8060b976809f84dd24a88b2f1f0f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/argo-go/discovery.go:178-188 | agents/drivers/hive-go/discovery.go:178-188 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"080bff1093de1f24bd49634c9f646a25ef88ae6672d0f82f62fd22b496a36d86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/argo-go/discovery.go:369-379 | agents/drivers/hive-go/discovery.go:369-379 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c21e0b7e0ae635a8bbae248fe4b2c21e1c4211cc3a773ef2522658519737be8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/argo-go/discovery.go:382-392 | agents/drivers/hive-go/discovery.go:382-392 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9dc76815aa24450f447d66ab01dd136b10ffa7e9a201731e48ba12e57654ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/argo-go/query.go:285-295 | agents/drivers/hive-go/query.go:285-295 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c38985dcd539ce8d4f9d382112617ead74c0163a7113e42b8d04e5a5ba30a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/argo-go/query.go:481-491 | agents/drivers/hive-go/query.go:484-494 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"a331722ac4187861d0c8d8b468d9800edad1c38974c530027ca541d5ccf979ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/iotdb/main.go:286-296 | agents/drivers/kingbase-go/main.go:340-350 \u2014 \u0060agents/drivers/iotdb/main.go\u0060 and \u0060agents/drivers/kingbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/iotdb/main.go:286\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/main.go"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eb0e0ec95a9101aeef4e82dbc75cf8f61cb435944c2b512b70affba97a5d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/kingbase-go/main.go:560-570 | agents/drivers/vastbase-go/main.go:564-574 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:560\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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9aaf112ec09ef3cdcbebd0f52e90de2e95e46cfdcd7cf0b0a0628fdfd04030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1086-1096 | agents/drivers/oracle-go/main.go:5176-5186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/kingbase-go/main.go:1086\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"c654c757f6dee887af358ff4b1206d5eeaa6e3120b35997350c12cc7b8124a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1698-1708 | agents/drivers/vastbase-go/main.go:1307-1317 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e1f2a8a5037a14c19d736834c83ccb07fd6542eecbea4050ad8abfa4fee0c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/oracle-go/main.go:376-386 | agents/drivers/xugu/main.go:363-373 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6557b1b7f43eabf06c172c225d892bed623c95fb0c9bd8f61bf06ed4b221767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/oracle-go/main.go:412-422 | agents/drivers/xugu/main.go:391-401 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5701fcf1ae2e3b5a9eed3d2beeffe9a1312e620b6b54c53ae00fabf46a4aae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/oracle-go/main.go:3810-3820 | agents/drivers/xugu/package_members.go:99-109 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3810}}}],"partialFingerprints":{"codehealthFindingId/v1":"32db24f07d092c578e3cde4c01b507b34d45ba4951c46f42cfe1f591bf04f977"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/rocketmq/consumers.go:214-224 | agents/drivers/rocketmq/consumers.go:261-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6e79227eb4e7c782937faf86e2dcb47fde29edd6b830b5b6589f771de81e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/xugu/package_members.go:266-276 | agents/drivers/xugu/package_members.go:291-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/xugu/package_members.go:266\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":"agents/drivers/xugu/package_members.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f43e3a8165f37bb50488317d2272772d01c337b49582e8d9ae3a31296600a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7): agents/drivers/argo-go/main.go:213-223 | agents/drivers/cassandra-go/main.go:211-221 | agents/drivers/hive-go/main.go:213-223 | agents/drivers/iotdb/main.go:217-227 | agents/drivers/kingbase-go/main.go:276-286 | agents/drivers/neo4j-go/main.go:244-254 | agents/drivers/vastbase-go/main.go:277-287 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:213\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060runtimeServer *runtimeServer) dispatch(method\u0060 in one and \u0060r *runtimeServer) dispatch(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b12b121819e5a05c0f1d43cd4f50fdb535c17e85c09d6636a610814c6f569d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): agents/drivers/iotdb/main.go:301-310 | agents/drivers/kingbase-go/main.go:355-364 | agents/drivers/neo4j-go/main.go:331-340 | agents/drivers/vastbase-go/main.go:366-375 \u2014 \u0060agents/drivers/iotdb/main.go\u0060 and \u0060agents/drivers/kingbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/vastbase-go/main.go:376\u0060 calls \u0060closeConnectionRuntimes\u0060 and \u0060agents/drivers/iotdb/main.go:311\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":"agents/drivers/iotdb/main.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"086128870d1578afda2d3e0f96769bc82f18233fe3d29101c7033253b03c3c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): agents/drivers/argo-go/main.go:394-403 | agents/drivers/hive-go/main.go:394-403 | agents/drivers/oracle-go/main.go:1142-1151 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:394\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8f4236aaeb6498d5fd723ec90ce25c42ea70e02765e00abefb7603c06e3dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): agents/drivers/argo-go/query.go:494-503 | agents/drivers/hive-go/query.go:497-506 | agents/drivers/oracle-go/main.go:6656-6665 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0579c07498d4b754724c248f3bcce2a2938737aa7deb4e581bd93755ed8f1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): agents/drivers/etcd-go/main.go:169-178 | agents/drivers/etcd2-go/main.go:139-148 | agents/drivers/neo4j-go/main.go:174-183 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/main.go:169\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":"agents/drivers/etcd-go/main.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac16c89e7fe026bf1c7503b19d052fa35e632c4f43ee19df178e3b771aed777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): agents/drivers/iotdb/main.go:285-294 | agents/drivers/kingbase-go/main.go:339-348 | agents/drivers/vastbase-go/main.go:348-357 \u2014 \u0060agents/drivers/iotdb/main.go\u0060 and \u0060agents/drivers/kingbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/main.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f0d44c75f8a1bc8cdcc98e4757faadea9e0d50b9e3e6652d46fd2f6516eb20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/config.go:850-859 | agents/drivers/hive-go/config.go:890-899 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6845f263b3f8759738430a14491908f32b70bcbe567597e2300c11e4f22a167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/discovery.go:166-175 | agents/drivers/hive-go/discovery.go:166-175 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"517c0dc866f95fb283b6f0d523bc682878a4c9a08a2593882b33cc056d28a866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/query.go:464-473 | agents/drivers/hive-go/query.go:467-476 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/query.go"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"acee540f14aca1c3a0f3171aad1f2ca2d0e8acb05418cd5ca814ad9b8e4abef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/cassandra-go/query.go:213-222 | agents/drivers/iotdb/query.go:52-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/cassandra-go/query.go:213\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/query.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ed1c2a8b88d4195b3d0ad36c16f61750c4999e22dac34d7e6fc48aff19000d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/etcd-go/auth.go:363-372 | agents/drivers/etcd-go/auth.go:380-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac10088296c5f91bdb480236d4c8f7a7a71d211ba7507946e6db02656f811c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/etcd-go/kv.go:500-509 | agents/drivers/etcd2-go/kv.go:411-420 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"944a53d7e498d559209797d1b9bffc785c4267f0a18d8ee5b38ca61b593a00f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/etcd2-go/client.go:283-292 | agents/drivers/etcd2-go/client.go:331-340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd2-go/client.go:283\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/client.go"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec1854ecb7ae705e6ca3bc1c17a574acb2e86c0233d853b542b3529424ba6a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1922-1931 | agents/drivers/vastbase-go/vastbase_metadata.go:1241-1250 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1922\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"89648dd907ef939d9fa5f2bbb0f1150a83a508113036beb46b2324be0a890710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2613-2632 | agents/drivers/vastbase-go/vastbase_metadata.go:1613-1632 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2613\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2613}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46e1bda72bc58423a8b0ca6f8088fa7280c6d34479d748916106792da38a5e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2933-2942 | agents/drivers/vastbase-go/vastbase_metadata.go:1882-1891 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2933\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2933}}}],"partialFingerprints":{"codehealthFindingId/v1":"de62dbcd1f75cf3fad26f82586f48e996c060e8c5bc41bfa54955f678ec3497f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/oracle-go/main.go:2338-2347 | agents/drivers/xugu/main.go:2142-2151 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oracle-go/main.go:2338\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/xugu/main.go:2138\u0060 calls \u0060readXuguTableRows\u0060 and \u0060agents/drivers/oracle-go/main.go:2337\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"af26a648d770d0927a3d838265292ae86aab61397b2703c7768b97896ca8878d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/oracle-go/main.go:4705-4714 | agents/drivers/xugu/main.go:3990-3999 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oracle-go/main.go:4705\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4705}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f047255fbb324d4f9737755b59b43919346672a245c9a4f60c2f9443f6f980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/oracle-go/main.go:5022-5031 | agents/drivers/xugu/main.go:4138-4147 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oracle-go/main.go:5022\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5022}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ab430cb0da017efbfa4c6463eea6a76e09a78f31f292751944a500d60e7a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/oracle-go/main.go:5196-5205 | agents/drivers/xugu/main.go:4213-4222 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b55aa50bce772b3cee5d6faf78a5283f4eb3e6a5642e3fc1b0e6ba0e014f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/rabbitmq/operations.go:59-68 | agents/drivers/rabbitmq/operations.go:438-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/rabbitmq/operations.go:59\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":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdb15641c394f591aac3bd5816db555c4a9a9f8aaed9bee4493d02465b5e766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/rocketmq/acl.go:94-103 | agents/drivers/rocketmq/acl.go:147-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/acl.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13c673149dce1516712f44dcbb62c6cb7e7de9c12fd81ff21da9d2b7187f761"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/rocketmq/cluster.go:11-20 | agents/drivers/rocketmq/topics.go:416-425 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/cluster.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d59318a9ef1771f49a1c23dd5608c6cc79a80758b9ad4e59be872e09d0064e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/vastbase-go/main.go:932-941 | agents/drivers/xugu/main.go:4181-4190 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/vastbase-go/main.go:932\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":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf9bd0dc91e78a8de6a2ed835eaa8a1d0a4f697b10b57cf4ed19c40bd8805e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/xugu/main.go:3479-3488 | agents/drivers/xugu/main.go:3819-3828 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/xugu/main.go:3479\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":"agents/drivers/xugu/main.go"},"region":{"startLine":3479}}}],"partialFingerprints":{"codehealthFindingId/v1":"267785fdbefa1dd92bb0ce1ff33417d4365162d0f26df5cb98fabe60583f1154"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): agents/drivers/argo-go/main.go:198-206 | agents/drivers/cassandra-go/main.go:196-204 | agents/drivers/hive-go/main.go:198-206 | agents/drivers/iotdb/main.go:202-210 | agents/drivers/kingbase-go/main.go:266-274 | agents/drivers/neo4j-go/main.go:230-238 | agents/drivers/vastbase-go/main.go:267-275 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060runtimeServer *runtimeServer) dispatch(method\u0060 in one and \u0060r *runtimeServer) dispatch(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/kingbase-go/main.go:275\u0060 calls \u0060newServer\u0060, \u0060dispatch\u0060 and \u0060agents/drivers/argo-go/main.go:207\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":"agents/drivers/argo-go/main.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d8d23e22e81c502220bda2094008e0e24f54c4faad5965716e435d77506a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): agents/drivers/argo-go/main.go:392-400 | agents/drivers/cassandra-go/main.go:328-336 | agents/drivers/hive-go/main.go:392-400 | agents/drivers/iotdb/main.go:330-338 | agents/drivers/kingbase-go/main.go:392-400 | agents/drivers/neo4j-go/main.go:432-440 | agents/drivers/vastbase-go/main.go:407-415 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:392\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060server *server) dispatch(method\u0060 in one and \u0060s *server) dispatch(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/cassandra-go/main.go:327\u0060 calls \u0060handshakeResult\u0060 and \u0060agents/drivers/argo-go/main.go:391\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":"agents/drivers/argo-go/main.go"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b046ac267da3b9830053fc363ee6719ddd58348ce9f6a9094f5fe1d7842cb71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): agents/drivers/argo-go/main.go:467-475 | agents/drivers/hive-go/main.go:467-475 | agents/drivers/iotdb/main.go:388-396 | agents/drivers/kingbase-go/main.go:491-499 | agents/drivers/neo4j-go/main.go:491-499 | agents/drivers/vastbase-go/main.go:481-489 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:467\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060server *server) dispatch(method\u0060 in one and \u0060s *server) dispatch(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"040fad70cb54fa1bc0e3447d150ac5c40bac165a3b8b958c89869ffed3a13c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 5): agents/drivers/argo-go/main.go:402-410 | agents/drivers/hive-go/main.go:402-410 | agents/drivers/iotdb/main.go:340-347 | agents/drivers/kingbase-go/main.go:402-409 | agents/drivers/vastbase-go/main.go:417-424 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:402\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"2665c745df9116712e6bb2930cd53931ede77c48d5dd3b8d87b2032b11fadd0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): agents/drivers/cassandra-go/main.go:244-252 | agents/drivers/iotdb/main.go:245-253 | agents/drivers/kingbase-go/main.go:304-312 | agents/drivers/neo4j-go/main.go:272-280 | agents/drivers/vastbase-go/main.go:310-318 \u2014 \u0060agents/drivers/cassandra-go/main.go\u0060 and \u0060agents/drivers/iotdb/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 384 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9e694c1e79c7abdebc70f81e677d4577c0fc84e6c9b5f3b456adf81b025888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): agents/drivers/cassandra-go/protocol_error.go:121-133 | agents/drivers/etcd-go/protocol_error.go:74-82 | agents/drivers/etcd2-go/protocol_error.go:66-74 | agents/drivers/neo4j-go/protocol_error.go:122-130 | agents/drivers/vastbase-go/protocol_error.go:119-131 \u2014 \u0060agents/drivers/cassandra-go/protocol_error.go\u0060 and \u0060agents/drivers/etcd-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 40 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/protocol_error.go:121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/protocol_error.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6b50087275e7fdd1959c576287b38bb3855b2dad89103ebce5b9d022575783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): agents/drivers/oracle-go/main.go:4569-4577 | agents/drivers/oracle-go/main.go:5471-5479 | agents/drivers/oracle-go/main.go:6016-6024 | agents/drivers/oracle-go/main.go:6052-6060 | agents/drivers/oracle-go/main.go:6083-6091 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/main.go:4569\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4569}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3875bd199e76a9985c0bcfae70b1e0b8eb05c9de468cd5dc8763d9cc7a2a5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): agents/drivers/argo-go/main.go:443-451 | agents/drivers/hive-go/main.go:443-451 | agents/drivers/kingbase-go/main.go:453-460 | agents/drivers/vastbase-go/main.go:456-463 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:443\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060server *server) dispatch(method\u0060 in one and \u0060s *server) dispatch(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"41398cac1cace4665256b01d1b705d10498d8a19b1d29b1531c5ac2f5815287f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): agents/drivers/argo-go/main.go:146-154 | agents/drivers/hive-go/main.go:146-154 | agents/drivers/iotdb/main.go:150-158 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:146\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3198551fa46f2d3afda240a1b6741c88374861b6ab9fff20a0979b3e352b1b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): agents/drivers/kingbase-go/main.go:267-275 | agents/drivers/vastbase-go/main.go:268-276 | agents/drivers/xugu/main.go:808-816 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/xugu/main.go:818\u0060 calls \u0060closeAllSessions\u0060 and \u0060agents/drivers/kingbase-go/main.go:277\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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bd0594c0efb8b0cc28a3ececb47f14931db3d2615aa1176683d89ef52b643e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): agents/drivers/rocketmq/acl.go:32-40 | agents/drivers/rocketmq/acl.go:95-103 | agents/drivers/rocketmq/acl.go:148-156 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/acl.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"779b2b07a158a40d0770dcedeec282d7c4940f1d30af1865ffb8b8076a23a691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/argo-go/config.go:375-383 | agents/drivers/hive-go/config.go:381-389 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"779890d61247e4e72e205c1347c02c67cd669338484648631704e4c0d3ac3fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/argo-go/config.go:517-525 | agents/drivers/hive-go/config.go:524-532 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/argo-go/config.go"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"9576bb1a3c85b2a005d3007d152578e2a3a4a424b60b61141381b7a856d88ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/etcd-go/main.go:257-265 | agents/drivers/etcd2-go/main.go:227-235 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08cbcc7afe6e850c2fef5439a0a5e823898b6175e7a0971588aaf440b260a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/etcd2-go/auth.go:77-85 | agents/drivers/etcd2-go/auth.go:221-229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/auth.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b749ec266f16d693678443146010a36ce5bf6f53e224bb42f370ea67f7c0523a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1747-1755 | agents/drivers/kingbase-go/kingbase_metadata.go:2752-2760 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdaf6bbed2cf97e8b349f6fe90156dde043a5d07fc367065047dd4e7a98f1d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1378-1386 | agents/drivers/vastbase-go/main.go:1122-1130 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"db962eb826710659f3a6ccf0a7b68e7f4e7e01b364fb6aa23614b62ad5b0447f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/oracle-go/main.go:1303-1311 | agents/drivers/xugu/main.go:1231-1239 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oracle-go/main.go:1303\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15e763fec0fd3bf86d4a52b3bae017dbf1103161a7fe805703ed1b37b080fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/oracle-go/main.go:5174-5182 | agents/drivers/xugu/main.go:4198-4206 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oracle-go/main.go:5174\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5174}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ee06ccde4979760acbd7e805588b1053a893df8b412e2dc906db4c00318c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/vastbase-go/spatial.go:43-51 | agents/drivers/xugu/spatial.go:88-96 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c050f6c04e9003b9d41fd6176ebee2e4f74bb1531ab1c3b1667759e169d1e5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/go-common/iotdb-client-go/client/column_decoder.go:117-125 | agents/go-common/iotdb-client-go/client/column_decoder.go:129-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/column_decoder.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dc4216456b2b1897dce1342c24fc9380fa0d5278fa73f9702f7458a02fbe3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:644-652 | agents/go-common/iotdb-client-go/client/session.go:693-701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4a9061dfa9a7efd9dc4e5daf4b2ee56bf4963e2949bae07997035cf0ee8434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12): agents/drivers/argo-go/main.go:115-122 | agents/drivers/cassandra-go/main.go:122-129 | agents/drivers/etcd-go/main.go:136-143 | agents/drivers/etcd2-go/main.go:106-113 | agents/drivers/hive-go/main.go:115-122 | agents/drivers/iotdb/main.go:119-126 | agents/drivers/kingbase-go/main.go:193-200 | agents/drivers/nebula-go/main.go:73-80 | agents/drivers/neo4j-go/main.go:143-150 | agents/drivers/oracle-go/main.go:719-726 | agents/drivers/vastbase-go/main.go:189-196 | agents/drivers/xugu/main.go:716-723 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:115\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, \u0060agents/drivers/oracle-go/main.go:728\u0060 calls \u0060closeAllSessions\u0060 and \u0060agents/drivers/argo-go/main.go:123\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":"agents/drivers/argo-go/main.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1900196cff049a68f862b1471e3f81cc822d9e035a6988221eb10e80be90d7a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): agents/drivers/cassandra-go/main.go:244-251 | agents/drivers/iotdb/main.go:245-252 | agents/drivers/kingbase-go/main.go:304-311 | agents/drivers/neo4j-go/main.go:272-279 | agents/drivers/oracle-go/main.go:927-934 | agents/drivers/vastbase-go/main.go:310-317 \u2014 \u0060agents/drivers/cassandra-go/main.go\u0060 and \u0060agents/drivers/iotdb/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 384 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"964f95a0c20fbe99acf2c266609ed12a281c3b8e06d35bdccae25e2add9ad338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 5): agents/drivers/argo-go/metadata.go:249-255 | agents/drivers/argo-go/metadata.go:264-271 | agents/drivers/hive-go/metadata.go:255-261 | agents/drivers/hive-go/metadata.go:270-277 | agents/drivers/iotdb/metadata.go:174-180 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:249\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc38955a042dae17bc74574a7af2da28522ad8276fb3845b9c95713e080e3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): agents/drivers/iotdb/main.go:299-306 | agents/drivers/kingbase-go/main.go:353-360 | agents/drivers/neo4j-go/main.go:329-336 | agents/drivers/oracle-go/main.go:1054-1061 | agents/drivers/vastbase-go/main.go:364-371 \u2014 \u0060agents/drivers/iotdb/main.go\u0060 and \u0060agents/drivers/kingbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/iotdb/main.go:299\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":"agents/drivers/iotdb/main.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f99684211d4e52503e52ddfdc908d0a1b3b82d48089f459ec42f6218142c84e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): agents/drivers/argo-go/config.go:333-340 | agents/drivers/argo-go/config.go:462-469 | agents/drivers/hive-go/config.go:339-346 | agents/drivers/hive-go/config.go:469-476 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"25792027a836adafb4d71933e979c625697a606322a4780b862c99ffa7d35c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): agents/go-common/iotdb-client-go/client/session.go:778-785 | agents/go-common/iotdb-client-go/client/session.go:811-818 | agents/go-common/iotdb-client-go/client/session.go:845-852 | agents/go-common/iotdb-client-go/client/session.go:877-884 \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 \u0060agents/go-common/iotdb-client-go/client/session.go:778\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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6d21da89b9f570cb4f80905bc17e62c6369b8052dcb7aa57fa060ba6e68135"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/drivers/argo-go/main.go:441-448 | agents/drivers/cassandra-go/main.go:370-377 | agents/drivers/hive-go/main.go:441-448 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/main.go:441\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb7ed4dae024a84362591dad60749807e7c43a72091ca15614d394376f1862c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/drivers/kingbase-go/kingbase_metadata.go:3000-3007 | agents/drivers/vastbase-go/vastbase_metadata.go:1949-1956 | agents/drivers/vastbase-go/vastbase_metadata.go:1985-1992 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:3000\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3000}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9385c9228e64c63d742ac87ee5f2aa8b796dbe45847ae1237dfa82b2b86ac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/cassandra-go/metadata.go:365-373 | agents/drivers/cassandra-go/metadata.go:395-402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/metadata.go:365\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":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36e815c20ce7f2be415d19c9d04f24e30483b68e67f1c0a3e2aaf2c278c3f4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/etcd-go/kv.go:75-82 | agents/drivers/etcd-go/kv.go:169-176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/kv.go:75\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":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3965ba88974ab3a5bc746e546833a27a27579620a919066e297baaf1642c7683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2077-2084 | agents/drivers/vastbase-go/vastbase_metadata.go:1331-1338 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2077\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cce9e084cdac9d61272f21b893b966aeeb1b4c77044224e3ddc080f7f7c959a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2957-2964 | agents/drivers/vastbase-go/vastbase_metadata.go:1906-1913 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2957\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"3213d8434032a96f21cfa18a82623ccfb4faa0519ffbf83fb4d43cc37bc9e7c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/oracle-go/main.go:4703-4710 | agents/drivers/oracle-go/main.go:4869-4876 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/main.go:4703\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4703}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86dca92551f1f6f68ed18022b1b4a92077fda24f77c21611ed8469d9ec37dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/oracle-go/main.go:6334-6341 | agents/drivers/xugu/main.go:4327-4334 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oracle-go/main.go:6334\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, \u0060agents/drivers/xugu/main.go:4336\u0060 calls \u0060killSession\u0060 and \u0060agents/drivers/oracle-go/main.go:6342\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6334}}}],"partialFingerprints":{"codehealthFindingId/v1":"37542407aa0c82f052aac3abf8458ac1758c356e7cb3f4a982cac4ae72ec1885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/oracle-go/pldebug_breakpoint_write.go:125-132 | agents/drivers/oracle-go/pldebug_frame_write.go:146-153 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug_breakpoint_write.go:125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint_write.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9a8aecfcdb6d29cf6673fd179570494e06e47d9f4beb1dd18532050a939683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/oracle-go/pldebug_target_invoke.go:261-268 | agents/drivers/oracle-go/pldebug_target_invoke.go:284-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug_target_invoke.go:261\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":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"da066a4322019fdee5626bca80c4500f5e6d315794b8faf2426c1e3b75ba0e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/rabbitmq/thrift_binary.go:215-222 | agents/drivers/rabbitmq/thrift_binary.go:247-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/thrift_binary.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9f1d5366d4c3a5263d14b52c49f79225d37c10d37a8d1541a9e08aaa1c90fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/vastbase-go/spatial.go:153-161 | agents/drivers/xugu/spatial.go:229-237 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/vastbase-go/spatial.go:153\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7c51d992ed4dd5a49f44d0dbd570900d3e9611da78a7b2b3bc17cd28706dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/xugu/main.go:2495-2502 | agents/drivers/xugu/main.go:2623-2630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/xugu/main.go:2495\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":"agents/drivers/xugu/main.go"},"region":{"startLine":2495}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3a2991d9aa58f947dc028455c2ef63b8fa9e347f9a2aa71b9df4bd370a34a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/go-common/iotdb-client-go/client/column_decoder.go:173-180 | agents/go-common/iotdb-client-go/client/column_decoder.go:184-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/column_decoder.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0b9de75759908304fd229f5777986a80762ea3b974fd177819a5c22c76c7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): agents/drivers/argo-go/main.go:185-191 | agents/drivers/cassandra-go/main.go:183-189 | agents/drivers/hive-go/main.go:185-191 | agents/drivers/iotdb/main.go:189-195 | agents/drivers/kingbase-go/main.go:253-259 | agents/drivers/neo4j-go/main.go:217-223 | agents/drivers/oracle-go/main.go:850-856 | agents/drivers/vastbase-go/main.go:249-255 | agents/drivers/xugu/main.go:789-795 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060runtimeServer *runtimeServer) dispatch(method\u0060 in one and \u0060r *runtimeServer) dispatch(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/oracle-go/main.go:858\u0060 calls \u0060New\u0060 and \u0060agents/drivers/xugu/main.go:796\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":"agents/drivers/argo-go/main.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"847fa32c2284e92dfdc9f008f65bc87c2c3e95b2783d9f21c45b05345ba46c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): agents/drivers/cassandra-go/main.go:243-249 | agents/drivers/iotdb/main.go:244-250 | agents/drivers/kingbase-go/main.go:303-309 | agents/drivers/neo4j-go/main.go:271-277 | agents/drivers/oracle-go/main.go:926-932 | agents/drivers/vastbase-go/main.go:309-315 | agents/drivers/xugu/main.go:848-854 \u2014 \u0060agents/drivers/cassandra-go/main.go\u0060 and \u0060agents/drivers/iotdb/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 384 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/main.go:243\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"049fc0525301966134af8c6836335af3e6a51474f4c3d305015884b3f026910e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): agents/drivers/argo-go/main.go:456-462 | agents/drivers/cassandra-go/main.go:384-390 | agents/drivers/hive-go/main.go:456-462 | agents/drivers/iotdb/main.go:377-383 | agents/drivers/neo4j-go/main.go:480-486 | agents/drivers/vastbase-go/main.go:470-476 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c84ba7555e0da4cd99792b0c6cb2b3a29a60c1a9b74f9a296c5acaa62bb7614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/drivers/cassandra-go/metadata.go:573-580 | agents/drivers/kingbase-go/kingbase_metadata.go:1809-1815 | agents/drivers/vastbase-go/vastbase_metadata.go:1129-1135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/cassandra-go/metadata.go:573\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0445c36d3f235b5bcfac05f73ff6bc6fb8a4b97105b675ad73d5f231330ade8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/argo-go/config.go:1000-1006 | agents/drivers/hive-go/config.go:1040-1046 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/config.go:1000\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"396c36a0546e83e947336fae02fcd38856d1b35adc32964542a5304d1d152f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/etcd-go/history.go:64-70 | agents/drivers/etcd-go/history.go:194-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/etcd-go/history.go:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/history.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36e4b113200e926dfb60aef1966e7766f767faf9740f549353c7d077e6000bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/etcd-go/watch.go:183-191 | agents/drivers/etcd2-go/watch.go:178-186 \u2014 \u0060agents/drivers/etcd-go/watch.go\u0060 and \u0060agents/drivers/etcd2-go/watch.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"936e646567024f06ade5da389361839df699083b34745aa7e7b8461726c0333b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/etcd2-go/auth.go:91-97 | agents/drivers/etcd2-go/auth.go:209-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/auth.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"255dc2aa3252077dd80555246deb00300346f76dfa75d4b0f16e09f7a5d878a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1598-1604 | agents/drivers/kingbase-go/kingbase_metadata.go:1638-1644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1598\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, \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1645\u0060 calls \u0060WriteString\u0060 and \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1605\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f71ec36cb722c44ba697fd0892c38b97431277285b1b0c1b02b8b40e637987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 4): agents/drivers/kingbase-go/main.go:841-847 | agents/drivers/oracle-go/main.go:5067-5070 | agents/drivers/vastbase-go/main.go:704-710 | agents/drivers/xugu/main.go:4159-4162 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/main.go:841\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":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b96f0f15eea46b4f284d6cc3e54085a14a7a3242ca8f079fcd06518acbf6e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/nebula-go/graph_display.go:10-17 | agents/drivers/neo4j-go/graph.go:76-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/nebula-go/graph_display.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ad9f2b160a63e6fa6d67373e29fef4471ed3ead889f5142fcd66352ae8b718"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/oracle-go/main.go:5594-5600 | agents/drivers/oracle-go/main.go:5609-5615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5594}}}],"partialFingerprints":{"codehealthFindingId/v1":"0181737151c2adace63e64a911ee35ce14a1c1822e3ceb09863f25adec0a4948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/oracle-go/pldebug_breakpoint.go:153-159 | agents/drivers/oracle-go/pldebug_breakpoint_write.go:135-141 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"915dbd9b92637aa4924c45a931575f0132e25b8527e32d03d6b78a5233b7a7de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/oracle-go/pldebug_execute.go:162-168 | agents/drivers/oracle-go/pldebug_frame_write.go:83-89 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_execute.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0c62c91480b05e079b2e03d952d0ca77eaf207e44bd0b388ab455a61f97f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/oracle-go/pldebug_stack.go:204-210 | agents/drivers/oracle-go/pldebug_variables.go:17-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_stack.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c5cc25f7e435ed8b4b9ed103e61fcda16f48f601f3c4450f5a9c94f03c9419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/oracle-go/pldebug_statement.go:101-107 | agents/drivers/oracle-go/pldebug_statement.go:125-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_statement.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"878372c7bc8169558fcf34869366eb48cfd73dcd4d1d689d1ae3dc1fd8492720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/drivers/oracle-go/pldebug_target.go:602-608 | agents/drivers/oracle-go/pldebug_target.go:624-630 | agents/drivers/oracle-go/pldebug_target.go:645-651 \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 \u0060agents/drivers/oracle-go/pldebug_target.go:602\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e39d9ad047ad65b8f8eca4cc198375926bb32fa5e33e111f5e5f96b44eb9cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/rabbitmq/operations.go:157-163 | agents/drivers/rabbitmq/operations.go:217-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/rabbitmq/operations.go:157\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":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"30927958537b7bc8a748a42a2aa30bb78d082fd959a53e95638d03bf7c806e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/rocketmq/consumers.go:96-102 | agents/drivers/rocketmq/consumers.go:129-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9869469136de4a9bf217da51e13b607f1e78fdc0f12e3bcac7e9ce4fd220fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/rocketmq/messages.go:104-110 | agents/drivers/rocketmq/messages.go:288-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d023b8a76ede51166a23967e946afe2f25a2b37ca065224bfb760250735c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/rocketmq/messages.go:201-207 | agents/drivers/rocketmq/messages.go:289-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e83cc1903a4aa8856fb487ff0524a3aae6f4b41ed5bf7e0f7b654f53fe496ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/rocketmq/topics.go:197-203 | agents/drivers/rocketmq/topics.go:235-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/topics.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"761f9b0599ca5733017628d1f6b5268af896d01a9dfdc091cb8b3dc65ead2e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/vastbase-go/spatial.go:458-464 | agents/drivers/vastbase-go/spatial.go:484-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/vastbase-go/spatial.go:458\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":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b454a8b31b7b9fcac4ae17f62f97c9beea9b0985494071d266920767fdddfd9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/xugu/main.go:3025-3031 | agents/drivers/xugu/main.go:3044-3050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/xugu/main.go:3025\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":3025}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e1325dbe3ca11d8303beffcbcb540033e9fa370bfedd088980e25f51c7e069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:634-640 | agents/go-common/iotdb-client-go/client/session.go:680-689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/go-common/iotdb-client-go/client/session.go:634\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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d10568e6dd5c71e094ad8fc3bedd15a0e2e92b0c72084a8486fd98d8b73cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): agents/drivers/kingbase-go/main.go:472-477 | agents/drivers/neo4j-go/main.go:479-484 | agents/drivers/vastbase-go/main.go:469-474 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/neo4j-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 23 separate duplicated blocks between them, totalling at least 248 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aeb2951792cf08078fa8b1eb6200fd52e9547c4736aa0b80d005dd1190b413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): agents/go-common/iotdb-client-go/client/session.go:798-803 | agents/go-common/iotdb-client-go/client/session.go:832-837 | agents/go-common/iotdb-client-go/client/session.go:864-869 \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 \u0060agents/go-common/iotdb-client-go/client/session.go:798\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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bcda09539428a3a39640e7cda6e4ff53fd582b1dbfc21a754d670c63cb975f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/argo-go/config.go:688-693 | agents/drivers/hive-go/config.go:696-701 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/config.go:688\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":"agents/drivers/argo-go/config.go"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"f762084fc27833ebad60e54bd25a9550d12c2e742e7ef51999bff1f0a195fce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/nebula-go/metadata.go:122-127 | agents/drivers/neo4j-go/metadata.go:152-157 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/nebula-go/metadata.go:122\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":"agents/drivers/nebula-go/metadata.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6eea1f5e5ccf9ff5c48171928c5a6f6d19e0a8816fad99e2a05e39d00d4187a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/oracle-go/main.go:2286-2291 | agents/drivers/xugu/main.go:2704-2709 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/oracle-go/main.go:2286\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a219cd40b4df247bac761674af00511f3ed974bd00136d3fa048628e58b76e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/oracle-go/main.go:2846-2851 | agents/drivers/oracle-go/main.go:2954-2959 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2846}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d823f37b00bf6d188611a259bd347161e75ef41f60f30a2d924d7408b1e8b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/oracle-go/pldebug_breakpoint.go:133-138 | agents/drivers/oracle-go/pldebug_frame_value.go:82-87 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e33862461083f812c8a57cc44c02310b5cd58d86cc2df5016b059ab2f544e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/oracle-go/pldebug_frame_value.go:118-123 | agents/drivers/oracle-go/pldebug_frame_write.go:156-161 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_frame_value.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c95837856f674194ce45a1d94055ba6c9a73b9bb46b802f2a9633facde301a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/xugu/type_members.go:595-600 | agents/drivers/xugu/type_members.go:634-639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/xugu/type_members.go:595\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/type_members.go"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc880ad0a37d2f4d29f425bccc77e5fc6f51331f3e5b9d0ec5d05aa5e512d86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): agents/drivers/argo-go/metadata.go:596-600 | agents/drivers/argo-go/metadata.go:650-654 | agents/drivers/hive-go/metadata.go:607-611 | agents/drivers/hive-go/metadata.go:661-665 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:596\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"f903f3071ce5458073861b8c9cb7a37284f8a65b294f43eb46f6d1901661ef62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agents/drivers/oracle-go/pldebug_entry.go:257-261 | agents/drivers/oracle-go/pldebug_stack.go:207-211 | agents/drivers/oracle-go/pldebug_variables.go:20-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_entry.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a412b3109aa3229e2bb975d897b2eaf619388a9f186b68414a73a43030317bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/go-common/iotdb-client-go/client/session.go:221-227 | agents/go-common/iotdb-client-go/client/session.go:283-289 | agents/go-common/iotdb-client-go/client/session.go:1621-1627 \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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"31af0207ee686170decdfd0394f8b6ef9326e90a977cf2f0d01dbd07f0f87d63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agents/go-common/iotdb-client-go/client/session.go:805-809 | agents/go-common/iotdb-client-go/client/session.go:839-843 | agents/go-common/iotdb-client-go/client/session.go:871-875 \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 \u0060agents/go-common/iotdb-client-go/client/session.go:805\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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5057653e1e1b8aaa557235576fc0980ed9f746e8ea6359734922cae93d6cf42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1938-1942 | agents/drivers/kingbase-go/kingbase_metadata.go:2098-2102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1938\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"196bb001b3212beec0a18877fd32a7871557e68751327d76e6f300a814d03a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/oracle-go/pldebug_breakpoint.go:153-157 | agents/drivers/oracle-go/pldebug_execute.go:224-228 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"993c602fe3711d99609557cb6b3623ba2bcb63f16c435817322d96d4aeb6db7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/oracle-go/pldebug_collection_input.go:85-89 | agents/drivers/oracle-go/pldebug_object_input.go:207-211 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060agents/drivers/oracle-go/pldebug_collection_input.go:85\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_collection_input.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"76712b429c3f73e036e1677d080a6cf0fcbeb52c1c5ca5437ddae1831a082e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/oracle-go/pldebug_entry.go:29-33 | agents/drivers/oracle-go/pldebug_stack.go:248-252 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_entry.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cec8a6925639aab97c9bdb93d9efe201157bde15bc4ab91f3dbc9266fe911d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): agents/drivers/argo-go/kerberos_defaults_windows.go:10-19 | agents/drivers/hive-go/kerberos_defaults_windows.go:10-19 | agents/go-common/go-gssapi/krb5/default_paths_windows.go:10-23 \u2014 \u0060agents/drivers/argo-go/kerberos_defaults_windows.go\u0060 and \u0060agents/drivers/hive-go/kerberos_defaults_windows.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 14 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/kerberos_defaults_windows.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c0ca14e7a3e2bbb4a86e157e53be4a60223d9be5d89d0cd13d699eff429176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/drivers/argo-go/config.go:271-285 | agents/drivers/hive-go/config.go:277-291 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b79d71f353ec47f8dd21cae659a9f9439164c71384186f8c5e368256229f44a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/argo-go/config.go:287-293 | agents/drivers/hive-go/config.go:293-299 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c83689d34b2f02f5540bdcc2f25805e3387104c73c5a729fcb705f25479a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/config.go:474-483 | agents/drivers/hive-go/config.go:481-490 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"467de4108b685eb2d1282502c828b0d54874acf38565f3c965baa5d17dcca764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/config.go:485-492 | agents/drivers/hive-go/config.go:492-499 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b842e7f51becc532d1bac3b4e936e88ee2900fe2bba90167311299141328dde4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/config.go:494-503 | agents/drivers/hive-go/config.go:501-510 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5aa20690536c5c58782c2dd288d500865c5f222cf79903b2325f42415bd68dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/config.go:505-514 | agents/drivers/hive-go/config.go:512-521 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"79062a2603ee27b1a67005948090c7df2d4dab7605c2b8b631867e95fc40cd53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/config.go:726-733 | agents/drivers/hive-go/config.go:738-745 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e95641ab8cc2457cd4f5ffa2b11eea049153e013cb056400e1c5d4719552b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/argo-go/config.go:889-895 | agents/drivers/hive-go/config.go:929-935 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5a63a21c677a18c6ebfa3a9c164183dca7962955212f9c7ee7a8cdec341fc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/config.go:1008-1015 | agents/drivers/hive-go/config.go:1048-1055 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe423ac5b7c2e80666d37adec437eb41dc4c56fec792528edf16bca8ae895f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/argo-go/config.go:1017-1023 | agents/drivers/hive-go/config.go:1057-1063 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faaa730aacbe827d56e53f9698e4ec5a607c7fe8c647785fa00bfafc936af2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/config.go:1119-1126 | agents/drivers/hive-go/config.go:1159-1166 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9f2e694e22c341bf9a76882083a15e3e288af268484f43baa6a43469bd79c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/config.go:1137-1146 | agents/drivers/hive-go/config.go:1177-1186 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3acc4d897f1129e80f381920dc64c22729d25ac695bdaca0849c228111fa8b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/config.go:1198-1205 | agents/drivers/hive-go/config.go:1238-1245 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d85b887e55842b52eec6108044aab04f0ee810583a4b8e518fe9a054997758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/argo-go/config.go:1207-1213 | agents/drivers/hive-go/config.go:1247-1253 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e8547bec64ccef240d2cee77335b5bfb39cfb0fd4be874d992877e9a14fae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/argo-go/config.go:1231-1236 | agents/drivers/hive-go/config.go:1271-1276 \u2014 \u0060agents/drivers/argo-go/config.go\u0060 and \u0060agents/drivers/hive-go/config.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 1103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f744a4f30fed9f577efbe9a90a65943efe53962b201c5929f87ef8c71985842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/argo-go/connector.go:123-129 | agents/drivers/hive-go/connector.go:124-130 \u2014 \u0060agents/drivers/argo-go/connector.go\u0060 and \u0060agents/drivers/hive-go/connector.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 105 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be46ad675f83018b4d11a8f3c7ceeaac4820c5f0a5e61c3907bf037540870f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/argo-go/discovery.go:19-25 | agents/drivers/hive-go/discovery.go:19-25 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4518d5ff4f8baccb0569626649050d1e2ae620a7acae346e267fb6061769f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/argo-go/discovery.go:298-309 | agents/drivers/hive-go/discovery.go:298-309 \u2014 \u0060agents/drivers/argo-go/discovery.go\u0060 and \u0060agents/drivers/hive-go/discovery.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 340 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"86df58afdc97e369e9ca3290e78297ab4e62366be0ea2625bcf2d2613b7bc1e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/argo-go/main.go:269-277 | agents/drivers/hive-go/main.go:269-277 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fd07f6a68111d8299afaa3c53c1693e1221fc03befaa581d33d9d3b2702ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/argo-go/main.go:360-366 | agents/drivers/hive-go/main.go:360-366 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a45f338b545b9713e81f0180b2abb9d23865fd3caa97262afe44dc16e3d8e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): agents/drivers/argo-go/main.go:477-489 | agents/drivers/cassandra-go/main.go:407-419 | agents/drivers/hive-go/main.go:477-489 | agents/drivers/iotdb/main.go:398-410 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060server *server) dispatch(method\u0060 in one and \u0060s *server) dispatch(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"166cdf7ea6c39a5b475224a73c3e49321dea2571b3291319c8d09eea2603e14c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/argo-go/main.go:535-543 | agents/drivers/hive-go/main.go:535-543 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63cfd1a98881a1a0837894e70131348317f849dfe876732886edb20cfa568db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): agents/drivers/argo-go/main.go:558-565 | agents/drivers/cassandra-go/main.go:482-489 | agents/drivers/hive-go/main.go:558-565 | agents/drivers/iotdb/main.go:456-463 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0b615702acd95aaf4c397783d7e0a2fd68fdaf12b41dbdfcff9a91901fefa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): agents/drivers/argo-go/main.go:586-594 | agents/drivers/cassandra-go/main.go:510-518 | agents/drivers/hive-go/main.go:586-594 | agents/drivers/iotdb/main.go:484-492 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed86a984d6147177e4966a03bd5afc971e833faabc547515361de073bd26aaa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): agents/drivers/argo-go/main.go:596-604 | agents/drivers/cassandra-go/main.go:520-528 | agents/drivers/hive-go/main.go:596-604 | agents/drivers/iotdb/main.go:494-502 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/cassandra-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 22 separate duplicated blocks between them, totalling at least 271 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6b99c70c243ecd06dcfe0359a0f63e90c82248d766d73fa10c36a97840a4f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/argo-go/main.go:606-616 | agents/drivers/hive-go/main.go:606-616 \u2014 \u0060agents/drivers/argo-go/main.go\u0060 and \u0060agents/drivers/hive-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 43 separate duplicated blocks between them, totalling at least 695 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be7e70f5727923046f794438d6c67054686c44e178dd48190dcd6dfc95ee20f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7): agents/drivers/argo-go/metadata.go:75-85 | agents/drivers/cassandra-go/metadata.go:60-70 | agents/drivers/hive-go/metadata.go:75-85 | agents/drivers/iotdb/metadata.go:67-77 | agents/drivers/kingbase-go/kingbase_metadata.go:174-184 | agents/drivers/vastbase-go/vastbase_metadata.go:100-110 | agents/drivers/xugu/main.go:509-519 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd21663d48c5f48b71bbd8584f6d47f8faf6ed2903b402cebd6b07ca74551585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/metadata.go:163-170 | agents/drivers/hive-go/metadata.go:163-170 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1142f06e3536a6236005141cfaaefafcfa29814dbc918720f17448168c81e72d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/metadata.go:575-582 | agents/drivers/hive-go/metadata.go:586-593 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e0392920bdc442d121e777bfa3fda28907e35f1accf1744831c450f237b3e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/metadata.go:854-861 | agents/drivers/hive-go/metadata.go:865-872 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4a15ce149ca13257aa548c693487567196bab9fc9518c1455a61794493aa3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/argo-go/metadata.go:874-884 | agents/drivers/hive-go/metadata.go:885-895 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1958345101ea0dd575256eb1cf79aa1ec65e13bd8957898fa88c6bf85ced6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/argo-go/metadata.go:928-939 | agents/drivers/hive-go/metadata.go:939-950 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e899682eeb23c138b1c42db9176c8c1f1e91c68972e40bac87e7beb709ae318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/argo-go/metadata.go:974-984 | agents/drivers/hive-go/metadata.go:985-995 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca833369e687128e61395ee003638b419acba5441babf698a4017be8f04ef9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/argo-go/metadata.go:986-992 | agents/drivers/hive-go/metadata.go:997-1003 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f23aed7ef33426909a8db6d5981bac7c72a9759f4f35192d4e384cb783025d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): agents/drivers/argo-go/metadata.go:994-1006 | agents/drivers/hive-go/metadata.go:1005-1017 | agents/drivers/rocketmq/helpers.go:196-208 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"4012b028e76d0c07c1b6a6aa19947131a2257f1d6f7d3d9fb1651bb81e3f0948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/argo-go/metadata.go:1053-1058 | agents/drivers/hive-go/metadata.go:1064-1069 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d343864b3656cd9a98c5ec7e2cea1ddf4942609bee91d4a7995bdb150eadbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): agents/drivers/argo-go/protocol_error.go:15-32 | agents/drivers/hive-go/protocol_error.go:15-32 | agents/drivers/iotdb/protocol_error.go:14-31 \u2014 \u0060agents/drivers/argo-go/protocol_error.go\u0060 and \u0060agents/drivers/hive-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 136 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66e7e103043ab4ffb1f857db8a4455458987e4e0ff29328ffa6a8ba93e2980c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 7): agents/drivers/argo-go/protocol_error.go:72-89 | agents/drivers/cassandra-go/protocol_error.go:86-103 | agents/drivers/hive-go/protocol_error.go:72-89 | agents/drivers/iotdb/protocol_error.go:72-89 | agents/drivers/neo4j-go/protocol_error.go:87-104 | agents/drivers/vastbase-go/protocol_error.go:84-101 | agents/drivers/xugu/protocol_error.go:131-148 \u2014 \u0060agents/drivers/argo-go/protocol_error.go\u0060 and \u0060agents/drivers/cassandra-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"33df6448afaacdb6a18fd22270600cfb78e3435cd3fa31fe60114f5580d3dd46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/argo-go/protocol_error.go:124-132 | agents/drivers/hive-go/protocol_error.go:124-132 \u2014 \u0060agents/drivers/argo-go/protocol_error.go\u0060 and \u0060agents/drivers/hive-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 136 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef5173a9f932e27b387ab4879693f5efe4434a0f124cfdea69add8ce1d4a576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 9): agents/drivers/argo-go/protocol_error.go:134-145 | agents/drivers/cassandra-go/protocol_error.go:145-156 | agents/drivers/etcd-go/protocol_error.go:132-143 | agents/drivers/etcd2-go/protocol_error.go:124-135 | agents/drivers/hive-go/protocol_error.go:134-145 | agents/drivers/iotdb/protocol_error.go:127-138 | agents/drivers/neo4j-go/protocol_error.go:140-151 | agents/drivers/vastbase-go/protocol_error.go:143-154 | agents/drivers/xugu/protocol_error.go:222-233 \u2014 \u0060agents/drivers/argo-go/protocol_error.go\u0060 and \u0060agents/drivers/cassandra-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13526ee8b3da663ad5d0169235627a2159f8cf90f647c336072561672ec775c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/argo-go/query.go:16-24 | agents/drivers/hive-go/query.go:16-24 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b113825fb300fb4e3d72469173f381d652a3249303787fabaad5036b3e9ebd84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/query.go:258-267 | agents/drivers/hive-go/query.go:258-267 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a2c465b6f846889be487fa5c62e7176bb6fa79a0a73ebef79149d321b53906"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/query.go:370-379 | agents/drivers/hive-go/query.go:373-382 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b3421d6f6bd4b4d47fdb3e43be37ca451b6adcae6fbfb0c83d954e56681366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/argo-go/query.go:505-510 | agents/drivers/hive-go/query.go:508-513 \u2014 \u0060agents/drivers/argo-go/query.go\u0060 and \u0060agents/drivers/hive-go/query.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 444 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cea99c77c21f88ef751156b1b89a890ca5fab2d62967b2ef86b669da3e4de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:182-191 | agents/drivers/hive-go/zookeeper_protocol.go:182-191 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eb806f7a4995452465b2f1716fe837d83c47576ab68e0661b9525a862dbf6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:232-239 | agents/drivers/hive-go/zookeeper_protocol.go:232-239 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a107de5e72f12437a02a0fd40e55280fdcdb36ca593a1c14f75e04a343ab23f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): agents/drivers/argo-go/zookeeper_protocol.go:372-384 | agents/drivers/hive-go/zookeeper_protocol.go:372-384 | agents/drivers/zookeeper/sasl.go:182-194 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"696467251ccba252fb75bb0c0a6e79739d8a333f35ba1c07b655d5cf129d7ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:411-415 | agents/drivers/hive-go/zookeeper_protocol.go:411-415 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4aafa5fec9d10844d5937ee718b4aca3b73b297f874149d81940a749b749df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:417-421 | agents/drivers/hive-go/zookeeper_protocol.go:417-421 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b834889f97671d8ba86fdbf5870f77adeb17ce38744f5874f522ca476ebca5ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:435-442 | agents/drivers/hive-go/zookeeper_protocol.go:435-442 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1abb2b2e40a2d5edab47b64dcbf7bf7385775c1ee63735e62ca54ad67b6799f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/argo-go/zookeeper_protocol.go:457-464 | agents/drivers/hive-go/zookeeper_protocol.go:457-464 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15ae7f7a6a3de3611b3bd92f01d57373e2274cc2a1831f72b2f21aeb90aea3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/drivers/argo-go/zookeeper_protocol.go:466-472 | agents/drivers/hive-go/zookeeper_protocol.go:466-472 | agents/drivers/rabbitmq/thrift_binary.go:81-87 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d373e6949ae9828b1a28d12e726e44ce3deb7c94a632aed61e4a30b41ada304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/drivers/argo-go/zookeeper_protocol.go:474-480 | agents/drivers/hive-go/zookeeper_protocol.go:474-480 | agents/drivers/rabbitmq/thrift_binary.go:97-103 \u2014 \u0060agents/drivers/argo-go/zookeeper_protocol.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_protocol.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 25 separate duplicated blocks between them, totalling at least 474 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0d018abba38ece39ee741c3d09ee327a953c963f667fb80abb763597d40995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/argo-go/zookeeper_tls.go:196-204 | agents/drivers/hive-go/zookeeper_tls.go:196-204 \u2014 \u0060agents/drivers/argo-go/zookeeper_tls.go\u0060 and \u0060agents/drivers/hive-go/zookeeper_tls.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_tls.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5801d8ca17fd9879fc4e08c23c0c2ccd0f7d56907fcb58e6b50da1c68f7416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): agents/drivers/cassandra-go/main.go:274-282 | agents/drivers/iotdb/main.go:274-282 | agents/drivers/kingbase-go/main.go:328-336 | agents/drivers/nebula-go/main.go:268-276 | agents/drivers/neo4j-go/main.go:302-310 | agents/drivers/vastbase-go/main.go:337-345 \u2014 \u0060agents/drivers/cassandra-go/main.go\u0060 and \u0060agents/drivers/iotdb/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 30 separate duplicated blocks between them, totalling at least 384 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/main.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"20903adbd644930059024683b81c5427ae104aa502a5b9609d9b149916c6d236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/cassandra-go/metadata.go:217-227 | agents/drivers/iotdb/metadata.go:184-194 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfc3bd36ce96e373d899c64222a146f84ae785657a46817930591fcd52e2444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): agents/drivers/cassandra-go/metadata.go:596-603 | agents/drivers/iotdb/metadata.go:553-560 | agents/drivers/kingbase-go/main.go:1999-2006 | agents/drivers/neo4j-go/metadata.go:338-345 | agents/drivers/vastbase-go/main.go:1388-1395 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"241ac5499ffaec9d91cb2dc4acc568bb443ef21eccec529c3f605059b44a1f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): agents/drivers/cassandra-go/metadata.go:626-638 | agents/drivers/iotdb/metadata.go:579-591 | agents/drivers/neo4j-go/metadata.go:364-376 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5ea667a2a678f3dadbce444167c59822d258ee250f7b2aa3f13f0c785ad04d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/cassandra-go/metadata.go:640-647 | agents/drivers/rocketmq/helpers.go:187-194 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"358861b4d92d48dfb49982eb2b2b0f814d65caadffbf6b4b636f1611660eeaed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/cassandra-go/metadata.go:649-655 | agents/drivers/iotdb/metadata.go:612-618 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2360351f06167c29fad78091990c090928f0a32c151e901e360b8828e4c043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): agents/drivers/cassandra-go/protocol_error.go:14-30 | agents/drivers/neo4j-go/protocol_error.go:15-31 | agents/drivers/vastbase-go/protocol_error.go:15-31 \u2014 \u0060agents/drivers/cassandra-go/protocol_error.go\u0060 and \u0060agents/drivers/neo4j-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 98 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/neo4j-go/protocol_error.go:33\u0060 calls \u0060errorResponse\u0060, \u0060classifyRPCError\u0060 and \u0060agents/drivers/cassandra-go/protocol_error.go:32\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":"agents/drivers/cassandra-go/protocol_error.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f7c769d73750eb581e60abab6e7a826d4a288271c927a82162cd7485ed496b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/cassandra-go/query.go:326-332 | agents/drivers/iotdb/query.go:557-563 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/cassandra-go/query.go"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e2f946fefcdd4e757c45ea4838a0a23e9467bdf5cb833fe5638c678658c362"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/cassandra-go/runtime.go:190-194 | agents/drivers/neo4j-go/main.go:390-394 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/cassandra-go/runtime.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed341b2c3ef5a6aeba92ccaae01e413b8159c1d35adcf13f395bc5b9cb62588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/etcd-go/client.go:106-110 | agents/drivers/etcd2-go/client.go:105-109 \u2014 \u0060agents/drivers/etcd-go/client.go\u0060 and \u0060agents/drivers/etcd2-go/client.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 71 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/client.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8309c746bde66a8d305393912a47333b09d04da9b4cae0c224f2ce2f4d5b90ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/etcd-go/kv.go:518-523 | agents/drivers/etcd2-go/kv.go:429-434 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"19631982e12a9940390ed3bb412f0ceb76fd965a19e40d361cb4e6af0f2df96d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/etcd-go/kv.go:580-590 | agents/drivers/etcd2-go/kv.go:482-492 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aa285cbec622975ec75e2483e539db2cc7e6d06e975e1a052a49f30bd55559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/etcd-go/kv.go:592-602 | agents/drivers/etcd2-go/kv.go:494-504 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe856150e89b8d0f6e818f9f809b4ef651b02c2a52330c400f077c8a610fa87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/etcd-go/kv.go:604-614 | agents/drivers/etcd2-go/kv.go:506-516 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe142fc8eed00efa2716abf71e88bc698a116dc2799d7bd3894e8b4cfe9a4948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/etcd-go/kv.go:624-630 | agents/drivers/etcd2-go/kv.go:518-524 \u2014 \u0060agents/drivers/etcd-go/kv.go\u0060 and \u0060agents/drivers/etcd2-go/kv.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54d402cd80d089ca809787862ba44794c974f5c2655ca2baf62aa296c3ea6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/etcd-go/main.go:67-75 | agents/drivers/etcd2-go/main.go:59-67 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"455e83cc663439d0dc7987076e8ff3f759000114e9128b49267ae4f7d3176f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/etcd-go/main.go:77-84 | agents/drivers/etcd2-go/main.go:69-76 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060int64\u0060 to \u0060s *etcdSession) releaseWatchBuffer(bytes\u0060 in one and \u0060s *etcd2Session) releaseWatchBuffer(bytes\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"543f5e81e13a15b1b1d5e7d0c7547f189d4ffa8744258d9c650c99dafa470eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/etcd-go/main.go:113-120 | agents/drivers/etcd2-go/main.go:83-90 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"544dfc3952d1b3490c15c6ae8151dadd62003f877394c93f8c716ab4043be7c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/etcd-go/main.go:280-288 | agents/drivers/etcd2-go/main.go:250-258 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66e8fbab4a46efe968fa562af475644886b76f6cd62b43177f4072ac447c4e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): agents/drivers/etcd-go/main.go:437-446 | agents/drivers/etcd2-go/main.go:404-413 | agents/drivers/oracle-go/main.go:6439-6448 | agents/drivers/xugu/main.go:5965-5974 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060s *etcdSession) handle(method\u0060 in one and \u0060s *etcd2Session) handle(method\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa1f36d03cb907fa2afb6ad531545b6fc855f05ac9cf9c7adeb033923847308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/etcd-go/protocol_error.go:15-30 | agents/drivers/etcd2-go/protocol_error.go:12-27 \u2014 \u0060agents/drivers/etcd-go/protocol_error.go\u0060 and \u0060agents/drivers/etcd2-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 81 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/protocol_error.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1431b985886c698e5e7cdcbb8330179382720bbd92d26c67a5489d42f7f51762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/etcd-go/protocol_error.go:92-97 | agents/drivers/etcd2-go/protocol_error.go:84-89 \u2014 \u0060agents/drivers/etcd-go/protocol_error.go\u0060 and \u0060agents/drivers/etcd2-go/protocol_error.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 81 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/protocol_error.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a792f69afffa741ad682d932d94aa696a3d3fce98aa1b3adab110637b1e9e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/etcd-go/watch.go:139-146 | agents/drivers/etcd2-go/watch.go:134-141 \u2014 \u0060agents/drivers/etcd-go/watch.go\u0060 and \u0060agents/drivers/etcd2-go/watch.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38fee54a136814bfdaa55d99c13baa7d83546a2e6693442b1028b465bd40253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/etcd-go/watch.go:199-207 | agents/drivers/etcd2-go/watch.go:194-202 \u2014 \u0060agents/drivers/etcd-go/watch.go\u0060 and \u0060agents/drivers/etcd2-go/watch.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2342321b5ea927c1491d03041d18cf8671903801425d609b3dd196ba7ec90c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/etcd-go/watch.go:209-215 | agents/drivers/etcd2-go/watch.go:204-210 \u2014 \u0060agents/drivers/etcd-go/watch.go\u0060 and \u0060agents/drivers/etcd2-go/watch.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb534b061c9f1545ecef15abe260e4d495211f662592359ec793a01e3530136"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/etcd-go/watch.go:368-373 | agents/drivers/etcd2-go/watch.go:390-395 \u2014 \u0060agents/drivers/etcd-go/watch.go\u0060 and \u0060agents/drivers/etcd2-go/watch.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fac36038045fdb67941076f62fdc56d208d3ada319211aca08ea94e8340b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:234-242 | agents/drivers/vastbase-go/driver.go:95-103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e7c9a2e19d74a1d1bdb019f21d35688ef7b8ea27bd0ef218b961444c8f80e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:859-876 | agents/drivers/vastbase-go/vastbase_metadata.go:684-701 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c93d6993adf07350b9bffe6573027437bbfefeb1ba4ecc36fb8c86c371dec24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2970-2976 | agents/drivers/vastbase-go/vastbase_metadata.go:1919-1925 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c872bb52b5dcbb62ddb2547c0400cd7a287e445446f912f3791ce20f701abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2978-2984 | agents/drivers/vastbase-go/vastbase_metadata.go:1927-1933 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cc044abececdf417d4e31298dcf7a7b8331d4c049670edb6d51921ad4d4e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3099-3112 | agents/drivers/vastbase-go/vastbase_metadata.go:2010-2023 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3099}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebb7cb1bcfadb58c716cf3e9c4328f66ba56540c667f3817f30de05c66dcd47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3114-3120 | agents/drivers/vastbase-go/vastbase_metadata.go:2025-2031 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3114}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c12e1d271813e1b467317bb362093b579c99f9df6eb7ac45940e450864ff30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3410-3418 | agents/drivers/vastbase-go/vastbase_metadata.go:2259-2267 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b88c5e7e4361d2e00ef6d66fd865870d03e6a2585513ff470e137d052e23f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3457-3468 | agents/drivers/vastbase-go/vastbase_metadata.go:2300-2311 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a820b8150ea346613e8edb64cb3f128a0384fc51c40dabe7f4f4edbe3706464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3544-3556 | agents/drivers/vastbase-go/vastbase_metadata.go:2353-2365 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f71e55dfbe06c7373686bf349bfd63511e0b827b6c8d83cf21724ef929d327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:3581-3587 | agents/drivers/vastbase-go/vastbase_metadata.go:2388-2394 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d16ef7cade47ff2e9391ca03ac373638cabaa0431fb19557a7e7e106477fed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/drivers/kingbase-go/main.go:789-796 | agents/drivers/neo4j-go/main.go:522-529 | agents/drivers/vastbase-go/main.go:667-674 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/neo4j-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 23 separate duplicated blocks between them, totalling at least 248 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2d8c99cb64260db315c5f57c1bacc7cb5cce1fe3989671cfce1e468709c378"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1105-1115 | agents/drivers/vastbase-go/main.go:977-987 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a0aaa719868efb4412fffd02b84eb8e43f613d5cd10f30781cba0c37d757be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1179-1187 | agents/drivers/vastbase-go/main.go:1038-1046 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2827f880ac99d86239fac2bfd6a7602fccf859882d5e1067afb9ad005f8293dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1590-1596 | agents/drivers/vastbase-go/main.go:1290-1296 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"4234563145589d9a5469f4baf7559f30464d6aebb8917b7332f10e901d4d3aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/drivers/kingbase-go/main.go:1954-1961 | agents/drivers/vastbase-go/bench/direct/main.go:162-169 | agents/drivers/vastbase-go/main.go:1343-1350 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e61a369a807aa69ae513d96ca269d921a8b5d0401dbfaef5ea53dc03784276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/main.go:1983-1989 | agents/drivers/vastbase-go/main.go:1372-1378 \u2014 \u0060agents/drivers/kingbase-go/main.go\u0060 and \u0060agents/drivers/vastbase-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 48 separate duplicated blocks between them, totalling at least 645 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47f14f0bade556ce7b8f46dd2c9af92a17ad8258614bfe58882bf3eeca5fbf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/oracle-go/legacy_charset.go:292-297 | agents/drivers/oracle-go/pldebug_statement.go:89-94 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"agents/drivers/oracle-go/legacy_charset.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6233dd8c681d3e8aea4c55fbcf0a483b72c2e83a27a76acf376084f5dc520f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/drivers/oracle-go/main.go:6425-6437 | agents/drivers/xugu/main.go:4420-4432 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6425}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae47898e5e37ef0f188efe159bcb3f96d619f85d4304a4895601e3dca05ffc2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/oracle-go/main.go:6450-6457 | agents/drivers/xugu/main.go:5976-5983 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6450}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a6f9e5bf832c124157755bbe8b50626d8540ffb7074caa87d5e7362e57ccd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/oracle-go/main.go:6470-6477 | agents/drivers/xugu/main.go:5985-5992 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6470}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5a90e4406cd94aeafe8d19f0ef44514469a080b83cd887da11ad25532f3235"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/go-common/go-gssapi/krb5/krb5.go:907-914 | agents/go-common/gosasl/gssapi.go:225-232 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/go-common/go-gssapi/krb5/krb5.go"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"602c7fb50d73ae2050d7344db3e5c89f9bd4f9b32533eb698715a50c7ad6d10c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/go-common/go-gssapi/krb5/krb5.go:929-936 | agents/go-common/gosasl/gssapi.go:253-260 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/go-common/go-gssapi/krb5/krb5.go"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10885c27b4d67083fe9fb9ccc39a3bcd0787ed4467e520a89f3e527322f68ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/etcd-go/client.go:96-104 | agents/drivers/etcd2-go/client.go:95-103 \u2014 \u0060agents/drivers/etcd-go/client.go\u0060 and \u0060agents/drivers/etcd2-go/client.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 71 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/client.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8b465299691f5bad3244f8c4c2d08a30ec3f4604abc142075d8187855725d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/drivers/etcd-go/main.go:319-326 | agents/drivers/etcd2-go/main.go:289-296 \u2014 \u0060agents/drivers/etcd-go/main.go\u0060 and \u0060agents/drivers/etcd2-go/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 20 separate duplicated blocks between them, totalling at least 287 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9884e3168d27617eca81ad430074f13f05bad898ed96854b6bc232e825af67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/etcd-go/watch.go:148-156 | agents/drivers/etcd2-go/watch.go:143-151 \u2014 \u0060agents/drivers/etcd-go/watch.go\u0060 and \u0060agents/drivers/etcd2-go/watch.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7182e4ac5b6348a32d7a34f6ea9063b3a2cc70928c150acb1ca5bdcd94d42966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:354-371 | agents/drivers/vastbase-go/vastbase_metadata.go:205-222 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdde2f59f744412a40e19a11b8189e62129cdc62ea7b4a45764843387bb62c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/oracle-go/pldebug_target.go:90-96 | agents/drivers/oracle-go/pldebug_type_graph.go:24-30 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"70940d90c56f1468bf9293ffe3c2ace45d9ebacb63f36b1801c3bd330b5ffd0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): agents/drivers/oracle-go/main.go:3214-3246 | agents/drivers/oracle-go/main.go:3387-3422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3214}}}],"partialFingerprints":{"codehealthFindingId/v1":"be00c642abe5c4005a1994eb391c6c5f3e1d2a4cc2f7b5b2583a65447ec5d7bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): agents/drivers/oracle-go/main.go:3214-3246 | agents/drivers/oracle-go/main.go:3308-3332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf6b60ee23bab69a287efdca0b26cf7f57843cd54768c977e331a4eafd5b878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:744-760 | agents/drivers/vastbase-go/vastbase_metadata.go:569-585 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cabc071fea6c2c94d1a0fc6514e49aeb5d4d1a4a5d719a52033e484e123313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 8): agents/drivers/argo-go/metadata.go:56-72 | agents/drivers/cassandra-go/metadata.go:41-57 | agents/drivers/hive-go/metadata.go:56-72 | agents/drivers/iotdb/metadata.go:48-64 | agents/drivers/kingbase-go/kingbase_metadata.go:153-169 | agents/drivers/neo4j-go/metadata.go:43-59 | agents/drivers/vastbase-go/vastbase_metadata.go:73-89 | agents/drivers/xugu/main.go:476-492 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 8 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:56\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2c47271762b7da9ccfba3c5cad6364ca6db073fb36b10478c7907e25e75f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): agents/drivers/kingbase-go/kingbase_metadata.go:193-208 | agents/drivers/vastbase-go/vastbase_metadata.go:119-134 | agents/drivers/xugu/main.go:533-548 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3d1f39cd873640b88468eeeb0433b9dc9a8d6fed560b7fb05fef18c998bb67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): agents/go-common/go-gssapi/krb5/krb5.go:587-601 | agents/go-common/go-gssapi/krb5/krb5.go:663-677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/go-common/go-gssapi/krb5/krb5.go:587\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, \u0060agents/go-common/go-gssapi/krb5/krb5.go:586\u0060 calls \u0060Errorf\u0060 and \u0060agents/go-common/go-gssapi/krb5/krb5.go:662\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":"agents/go-common/go-gssapi/krb5/krb5.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"7134594a3ba6c3bc97fcf8eb5f08ce355d6a817eccdc359e1aa1d2a841da3eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): agents/drivers/argo-go/metadata.go:1009-1020 | agents/drivers/hive-go/metadata.go:1020-1031 | agents/drivers/iotdb/metadata.go:594-605 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:1009\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1924660ee822363bf340b8225ded3b3272a169624e94ad7b610a5221741dd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/etcd-go/kv.go:188-198 | agents/drivers/etcd-go/kv.go:339-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc50fb1b200256ef7cdb2e5362a279263950467be357588b01af3bdb1850edc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/drivers/oracle-go/pldebug_rows.go:133-143 | agents/drivers/oracle-go/pldebug_statement.go:65-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug_rows.go:133\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_rows.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9952b42e9a0d0d35625d3da7bf3b878dfe36f642a65309a1152de01b3f8deb69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): agents/drivers/etcd-go/auth.go:250-259 | agents/drivers/etcd-go/auth.go:363-372 | agents/drivers/etcd-go/auth.go:380-389 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c5c349de8601fc964c9bdc423233f1e4cedbfd71e7ec78841b49f29ae3acd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): agents/drivers/rabbitmq/operations.go:320-329 | agents/drivers/rabbitmq/operations.go:915-924 | agents/drivers/rabbitmq/operations.go:1399-1408 \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 \u0060agents/drivers/rabbitmq/operations.go:320\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":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a742e36a8f6282319b71221777b3de617e90ffbfc709b2fe62c45d96fc61fc0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/xugu/main.go:1674-1683 | agents/drivers/xugu/main.go:1685-1694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/xugu/main.go:1674\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8b1c0d3806b555820060cf1890aaa8a08dc8e68b84b4cc92c700b160036273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/oracle-go/main.go:2831-2840 | agents/drivers/oracle-go/main.go:2945-2954 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/main.go:2831\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":"agents/drivers/oracle-go/main.go"},"region":{"startLine":2831}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7813d9f3c6dcfcce5f7ed44e378c7f2ab3b9521a7aa45b3a84604e365b5207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/etcd2-go/auth.go:130-139 | agents/drivers/etcd2-go/auth.go:291-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/auth.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfb225d129cadb70a7bb4a6e289e62d9ef4346906db44019879efb945db85ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2451-2459 | agents/drivers/kingbase-go/kingbase_metadata.go:2586-2594 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2451\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2451}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5219adaa484cd04d0ac94cb2c3a14934abb7d444bd7aa940401cbcfd6d8cc88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/xugu/package_members.go:40-48 | agents/drivers/xugu/type_members.go:166-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060agents/drivers/xugu/package_members.go:40\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/package_members.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c34c7fa6fe0d82536c7bb268c59414110870c480351adf36d608d98333d74eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/etcd2-go/auth.go:53-61 | agents/drivers/etcd2-go/auth.go:197-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/auth.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4757d8022b378e8b3a50a17e11f34723e86d0b578431ee3b973a0cf06da1e160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/nebula-go/graph_display.go:71-79 | agents/drivers/neo4j-go/graph.go:99-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/nebula-go/graph_display.go:71\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":"agents/drivers/nebula-go/graph_display.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd291fb5512ba6e18bc4555a29cdaeadb14eac6f2a94c2a732af754ed63b2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/rocketmq/consumers.go:263-271 | agents/drivers/rocketmq/messages.go:152-160 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/rocketmq/consumers.go:263\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6951ddf960d7979bb0f41600923c799569ca8575edf7e2dd0429a2856f0bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/rabbitmq/operations.go:1003-1011 | agents/drivers/rabbitmq/operations.go:1144-1152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/rabbitmq/operations.go:1003\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/operations.go"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a51982c8be024d94d9eb097e94ef8ee8ba9c52ec01ad2606d4315496dbabf34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/xugu/main.go:5011-5019 | agents/drivers/xugu/main.go:5050-5058 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/xugu/main.go:5011\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":"agents/drivers/xugu/main.go"},"region":{"startLine":5011}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba7ab300110eb256cf0f6d2959ac49d188ed0836df8c66a03acdae266cde891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/oracle-go/pldebug_probe.go:92-100 | agents/drivers/oracle-go/pldebug_target.go:252-260 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_probe.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6081002f2688940437d389672edf9375d2b830e83527d3447f73ae42030d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/argo-go/metadata.go:204-211 | agents/drivers/hive-go/metadata.go:204-208 \u2014 \u0060agents/drivers/argo-go/metadata.go\u0060 and \u0060agents/drivers/hive-go/metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 47 separate duplicated blocks between them, totalling at least 950 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/argo-go/metadata.go:204\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":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c6cdb2cef828c46f407fb671d9d1e20c272296ea7b306182ab59483e63ce58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/drivers/oracle-go/pldebug_target.go:587-593 | agents/drivers/oracle-go/pldebug_target.go:609-615 | agents/drivers/oracle-go/pldebug_target.go:631-637 \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 \u0060agents/drivers/oracle-go/pldebug_target.go:587\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":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"79068591611a2dfa8e84fe95cf2de38bc4c8cd5f552a40ab3f05cbc4ccb3ad16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/rocketmq/consumers.go:129-135 | agents/drivers/rocketmq/topics.go:146-152 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53cc7bade2d6c76549bf8ad034766550cd29eb9821dcf83dc196441191b3768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2843-2849 | agents/drivers/kingbase-go/kingbase_metadata.go:2875-2881 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2843\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":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b1384e91e86bf2ae3225898964fc2b26244a3e0e2c5fb16faa88583c266159"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/oracle-go/pldebug_breakpoint.go:117-123 | agents/drivers/oracle-go/pldebug_stack.go:96-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060agents/drivers/oracle-go/pldebug_breakpoint.go:117\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":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dc3b4366f12c5e0eec9fa7f9ceb0b2addcefeab9327678843482e030da0c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/xugu/main.go:1142-1148 | agents/drivers/xugu/main.go:1189-1195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c247e446eba6b38484fdd4f793902f8546e122035ff5a76549b3be42c23ff6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/oracle-go/pldebug_compile.go:195-201 | agents/drivers/oracle-go/pldebug_compile.go:332-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_compile.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a09ba80b7f04322d3f1c92a08c18cb97ab9cf90c0c0606711bf593f7b029f0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/drivers/rocketmq/consumers.go:156-162 | agents/drivers/rocketmq/consumers.go:175-181 | agents/drivers/rocketmq/topics.go:169-175 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e9d7ad0b2b2b82a2f652eaea8816d50bcf386c366148025430fd2fe8ca4733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): agents/drivers/oracle-go/pldebug_breakpoint_write.go:79-84 | agents/drivers/oracle-go/pldebug_execute.go:186-191 | agents/drivers/oracle-go/pldebug_frame_write.go:106-111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug_breakpoint_write.go:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint_write.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7548e1a4f33b839147b0c4c89fc9ee1fcf011d95b1eb682d2c86581bdac3b5df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/oracle-go/pldebug_collection_input.go:30-35 | agents/drivers/oracle-go/pldebug_object_input.go:28-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_collection_input.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1535277cca4b26e75d648675a50b507e4c282f48fc341ed58e48325f68cc7b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): agents/drivers/oracle-go/pldebug_collection_input.go:30-35 | agents/drivers/oracle-go/pldebug_object_input.go:28-33 | agents/drivers/oracle-go/pldebug_record_input.go:42-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_collection_input.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fab5a7598ff016fe791d50a77b04f4011dce829762a4b1af8ab4d8905fd702"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/oracle-go/pldebug_execute.go:203-207 | agents/drivers/oracle-go/pldebug_frame_write.go:136-140 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug_execute.go:203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_execute.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37e9708f8d6e704ea7b81a083f7ac100cc69d14dc4a2373de575092e91471e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agents/drivers/oracle-go/main.go:1228-1232 | agents/drivers/xugu/main.go:1163-1167 | agents/drivers/xugu/main.go:1175-1179 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd13b91489e3f68bee7e70831f3740dee342255b6ba26070b136c555a462842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/go-common/iotdb-client-go/client/session.go:1367-1371 | agents/go-common/iotdb-client-go/client/session.go:1376-1380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/go-common/iotdb-client-go/client/session.go:1367\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":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8024df5a6bf7db231c134595816faad6a21e3068337b955b002b269f1c4aa51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/oracle-go/pldebug_execute.go:199-203 | agents/drivers/oracle-go/pldebug_frame_write.go:119-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug_execute.go:199\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":"agents/drivers/oracle-go/pldebug_execute.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e954a0e41367cb2f2650a0032cee78fddf59777d08f5b8f6c9a2daa0d2e9cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): agents/drivers/oracle-go/pldebug_breakpoint.go:146-150 | agents/drivers/oracle-go/pldebug_execute.go:217-221 | agents/drivers/oracle-go/pldebug_frame_write.go:149-153 | agents/drivers/oracle-go/pldebug_manager.go:798-802 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/pldebug_breakpoint.go:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c18c969b7694b32f8a0cb9fc3507ac3ec83fc9939133f6cc7dc6a0212e93754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:1996-2000 | agents/drivers/vastbase-go/vastbase_metadata.go:1266-1270 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:1996\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060generated\u0060 in one and \u0060expression\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"da870c9cc243d1d57ef1dcf8dc17683a15ccaf452a93187a5aa5c69628479f9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/kingbase-go/kingbase_metadata.go:2004-2008 | agents/drivers/vastbase-go/vastbase_metadata.go:1274-1278 \u2014 \u0060agents/drivers/kingbase-go/kingbase_metadata.go\u0060 and \u0060agents/drivers/vastbase-go/vastbase_metadata.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 67 separate duplicated blocks between them, totalling at least 1316 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/kingbase_metadata.go:2004\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060generated\u0060 in one and \u0060expression\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"206d486280e0fe40d08bf2c956c9c7ffa02ca0f1fae627f1fa2eabaf9890ba2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/oracle-go/main.go:4843-4848 | agents/drivers/oracle-go/main.go:4892-4897 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/oracle-go/main.go:4843\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060s *server) fetchQueryPage(sessionID\u0060 in one and \u0060s *server) fetchTableReadPage(sessionID\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4843}}}],"partialFingerprints":{"codehealthFindingId/v1":"265dc4b6ee2df7ac173bf9b7528da8afed7d0a9f17cd5de03b028e66b0e334cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/oracle-go/pldebug_probe.go:77-82 | agents/drivers/oracle-go/pldebug_target.go:175-180 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060agents/drivers/oracle-go/pldebug_probe.go:77\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_probe.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d0119ce5d24eb75f537a50285c46b1730cb90f71958b712ed88b45116a47ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/xugu/main.go:3151-3156 | agents/drivers/xugu/main.go:4637-4642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":3151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9269ad20b822017f3f2582d1f00af25f967c16d47f204435a399b42a2c84b31f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (23 shared lines): agents/drivers/rabbitmq/bench/agent_compare.go:140-216 | agents/drivers/vastbase-go/bench/agent_compare.go:216-272 \u2014 These two members are variants of one another: 23 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":"agents/drivers/rabbitmq/bench/agent_compare.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b505b84ffe6588b08341de2c25fba0946da31eae7323c7dd09fe7e8bc6e14f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): agents/drivers/kingbase-go/bench/agent_compare.go:183-211 | agents/drivers/rabbitmq/bench/agent_compare.go:299-331 | agents/drivers/vastbase-go/bench/agent_compare.go:546-576 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 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":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d59916cefeeeb220d2daf540476277bc588aaf184f62f3d03e24e6ab88df4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): agents/drivers/kingbase-go/bench/agent_compare.go:225-251 | agents/drivers/vastbase-go/bench/agent_compare.go:590-617 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe612f6c71e8fbd10a7d39ac854bc2fe7d418d96054349f1332b25831434210f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): agents/drivers/kingbase-go/bench/agent_compare.go:381-397 | agents/drivers/vastbase-go/bench/agent_compare.go:836-851 \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":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad5d48fb0b1b54da0f7021418e0f490d814e233ade38267fced545c8c0d9e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/drivers/rabbitmq/bench/agent_compare.go:466-473 | agents/drivers/vastbase-go/bench/agent_compare.go:735-742 \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":"agents/drivers/rabbitmq/bench/agent_compare.go"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a63622ce1e9a7dc2df36fee3e97f27b2922371581cda99e075d289cd69aa471"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agents/drivers/vastbase-go/bench/agent_compare.go:704-713 | agents/drivers/vastbase-go/bench/agent_compare.go:715-724 \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":"agents/drivers/vastbase-go/bench/agent_compare.go"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"aece7f9cad6792e370cd849ec999aee9e343b84c0db8bae3c572d8a99e91ad07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): agents/drivers/kingbase-go/bench/agent_compare.go:331-338 | agents/drivers/rabbitmq/bench/agent_compare.go:475-485 | agents/drivers/vastbase-go/bench/agent_compare.go:726-733 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c548e319933da6a34c0e83bd322d511eab292d0ba11d95b2fb458d65a9dd0fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): agents/drivers/argo-go/bench/agent_compare.py:605-608 | agents/drivers/cassandra-go/bench/agent_compare.py:290-293 | agents/drivers/hive-go/bench/agent_compare.py:605-608 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc65010159c4b3825379850b0d5673751654266b2a3754d5a58ac33d8b3e6fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agents/drivers/kingbase-go/bench/agent_compare.go:162-181 | agents/drivers/rabbitmq/bench/agent_compare.go:420-438 \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":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bd23d530a4af79d54aa60636e3b21d7c9d72c453c801e217ae3f604a442b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): agents/drivers/argo-go/bench/agent_compare.py:151-152 | agents/drivers/cassandra-go/bench/agent_compare.py:123-124 | agents/drivers/hive-go/bench/agent_compare.py:151-152 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dfa5ec300a48abb62b1387d280875102a42e51fa3422e4420e6a5d3305ada9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): agents/drivers/argo-go/bench/agent_compare.py:157-160 | agents/drivers/hive-go/bench/agent_compare.py:157-160 \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":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cc66033bdc008f74cd2e1192c88a94dc3eb795b18aa4c75eb0143ec1a9e9a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): agents/drivers/argo-go/bench/agent_compare.py:630-633 | agents/drivers/cassandra-go/bench/agent_compare.py:311-314 | agents/drivers/hive-go/bench/agent_compare.py:630-633 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"a512da22820b04934e82e9cc328773316951d79687c325a637e2afcbc5d04b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): agents/drivers/argo-go/bench/agent_compare.py:74-76 | agents/drivers/cassandra-go/bench/agent_compare.py:52-54 | agents/drivers/hive-go/bench/agent_compare.py:74-76 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cef967b7fe9f2e363779772e7a90b650d4a154963819d524a530ebb3972c6fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): agents/drivers/argo-go/bench/agent_compare.py:645-648 | agents/drivers/cassandra-go/bench/agent_compare.py:318-321 | agents/drivers/hive-go/bench/agent_compare.py:645-648 | agents/drivers/iotdb/bench/run.py:239-242 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"82682c1e1c36ca3f04f890bf13cd2267286a752e7d34f9cffeb5a98ffe38de8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (94 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:185-278 | agents/drivers/hive-go/bench/agent_compare.py:185-278 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6d8299f9e93d4b1e4ddf2d96baa172d5ae74680168386e8d4a90d2fcd75687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): agents/drivers/argo-go/bench/functional_probe.py:37-88 | agents/drivers/hive-go/bench/functional_probe.py:37-88 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/functional_probe.py\u0060 and \u0060agents/drivers/hive-go/bench/functional_probe.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \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":"agents/drivers/argo-go/bench/functional_probe.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2570b5187f3f470b480cbf4aa128aa875f583b2f0576a917824643a6d29ff10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:414-463 | agents/drivers/hive-go/bench/agent_compare.py:414-463 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"5735dfdb4190e7bb36b7b78e8c79c3da95bc506de8ac96d8d81371f20fbc54fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:485-531 | agents/drivers/hive-go/bench/agent_compare.py:485-531 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad128cdccf7b1b37540b90d767b4cf367bd9521367ea2a7b7d9e26459b5fd29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): agents/drivers/argo-go/bench/functional_probe.py:92-125 | agents/drivers/hive-go/bench/functional_probe.py:92-125 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/functional_probe.py\u0060 and \u0060agents/drivers/hive-go/bench/functional_probe.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/functional_probe.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"892df43842991f8fb540a94eeafec7d6e42737cebb07a4b904aa8840bff14b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:79-110 | agents/drivers/hive-go/bench/agent_compare.py:79-110 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \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":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"477bc0d91dce27f3924792132828c5a9c1a2dd7e7e862092063e155fa83b6222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:282-308 | agents/drivers/hive-go/bench/agent_compare.py:282-308 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \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":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a762d345d76a224b9a420a844b9eeaee5aea6db20dbfad361201b5415bfb75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): agents/drivers/argo-go/bench/functional_probe.py:157-184 | agents/drivers/hive-go/bench/functional_probe.py:157-184 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/functional_probe.py\u0060 and \u0060agents/drivers/hive-go/bench/functional_probe.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/functional_probe.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"79176ee10d63843ff52aae90f761c6dd549e8721fbeea5d79b70d87aea44f93a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:49-71 | agents/drivers/hive-go/bench/agent_compare.py:49-71 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0750a6a2b1dc3268b86d18980104a7ea42108a4125007b26263f753020d215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/argo-go/bench/functional_probe.py:12-32 | agents/drivers/hive-go/bench/functional_probe.py:12-32 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/functional_probe.py\u0060 and \u0060agents/drivers/hive-go/bench/functional_probe.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/functional_probe.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6e725c95e78508656bd23fbac16f47d2a11fa6e3104926f9595166ccd54a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:26-46 | agents/drivers/hive-go/bench/agent_compare.py:26-46 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"54557f6e129d699d47c099bd62f9ed5f7ea56256e9f0c5af31443ed4c04edd51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): agents/drivers/argo-go/bench/agent_compare.py:132-148 | agents/drivers/cassandra-go/bench/agent_compare.py:104-120 | agents/drivers/hive-go/bench/agent_compare.py:132-148 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/cassandra-go/bench/agent_compare.py\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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf8c39254f1cd057d9082623f4712574de6e9b1b778046e174c1c26feedb048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:113-129 | agents/drivers/hive-go/bench/agent_compare.py:113-129 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd50180605cd3b5876e4139d7bd7880660ef3a9a1353385af53888e7cc0640a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:560-575 | agents/drivers/hive-go/bench/agent_compare.py:560-575 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \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":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da439d1d22595fc7023e70272baf976457431cc87e79408a7da0565e7cd7f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:396-405 | agents/drivers/hive-go/bench/agent_compare.py:396-405 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \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":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e3c42d3d4200e2cea295b28b20c0b680e5ea408f323a3b0848817816e02eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): agents/drivers/argo-go/bench/agent_compare.py:652-660 | agents/drivers/cassandra-go/bench/agent_compare.py:325-333 | agents/drivers/hive-go/bench/agent_compare.py:652-660 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/cassandra-go/bench/agent_compare.py\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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74149dae6ebfb2d63ef272c54d2e57cc316842daac4ea1c5ab25b80cc1dfff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:168-173 | agents/drivers/hive-go/bench/agent_compare.py:168-173 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9014445e3d6049eafb3db456ed428c414d058e8285fa32d4cf5908b16f6074bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:176-181 | agents/drivers/hive-go/bench/agent_compare.py:176-181 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \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":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ccdb0b06e4ffc6a9fcef7d87bd0007eb7b3e8eead2c09affef76ae2f4c3943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:386-392 | agents/drivers/hive-go/bench/agent_compare.py:386-392 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7f914fd8a6424112ddacbfe23916588f9ab0a74be719989649c5c1f867c114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:472-477 | agents/drivers/hive-go/bench/agent_compare.py:472-477 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \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":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb29a1e23bad8fed3529e5e62df0818cf79c37ded6114d6e9613bdaef012824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/drivers/argo-go/bench/agent_compare.py:616-622 | agents/drivers/cassandra-go/bench/agent_compare.py:297-303 | agents/drivers/hive-go/bench/agent_compare.py:616-622 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/cassandra-go/bench/agent_compare.py\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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/argo-go/bench/agent_compare.py:611\u0060 calls \u0060elapsed_ms\u0060, \u0060perf_counter\u0060 and \u0060agents/drivers/cassandra-go/bench/agent_compare.py:293\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":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f4d608be17c6b177a1c76cc4c1563e05ddcee047599f08b6e5c472bd29fd51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/argo-go/bench/functional_probe.py:129-144 | agents/drivers/hive-go/bench/functional_probe.py:129-144 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/functional_probe.py\u0060 and \u0060agents/drivers/hive-go/bench/functional_probe.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/functional_probe.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecfa5e6a5326ee398b5bbca163e5ca55b7edca10a2804d789de5abd31746822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/argo-go/bench/functional_probe.py:195-199 | agents/drivers/hive-go/bench/functional_probe.py:195-199 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/functional_probe.py\u0060 and \u0060agents/drivers/hive-go/bench/functional_probe.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/functional_probe.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"02153e5a595e90d869882dd2eebffbacf0cdc4138dbbf8f2edec55e2bbe95f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/argo-go/bench/agent_compare.py:637-641 | agents/drivers/hive-go/bench/agent_compare.py:637-641 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/agent_compare.py\u0060 and \u0060agents/drivers/hive-go/bench/agent_compare.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 400 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \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":"agents/drivers/argo-go/bench/agent_compare.py"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55fae187d4525139978038da0070319e0a2266939e399175639fc25eb265485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 2): agents/drivers/argo-go/bench/kdc_fixture/main.go:27-99 | agents/drivers/hive-go/bench/kdc_fixture/main.go:27-99 \u2014 before extracting anything, compare \u0060agents/drivers/argo-go/bench/kdc_fixture/main.go\u0060 and \u0060agents/drivers/hive-go/bench/kdc_fixture/main.go\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/bench/kdc_fixture/main.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece03fd9ba7c3ce46143ef8a38f5285abf0fe429ab253c037612b3a19e656e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:232-251 | agents/drivers/vastbase-go/bench/agent_compare.go:598-617 \u2014 before extracting anything, compare \u0060agents/drivers/kingbase-go/bench/agent_compare.go\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/bench/agent_compare.go:232\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/vastbase-go/bench/agent_compare.go:597\u0060 calls \u0060Delete\u0060 and \u0060agents/drivers/kingbase-go/bench/agent_compare.go:231\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":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"68268a7deb3f44491cf2b83fee56679f95cfc7dbe6e122bb8715bd89b3852e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:189-204 | agents/drivers/rabbitmq/bench/agent_compare.go:306-321 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/drivers/rabbitmq/bench/agent_compare.go:305\u0060 calls \u0060sanitizedEnv\u0060 and \u0060agents/drivers/kingbase-go/bench/agent_compare.go:188\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":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf859a67fee59e512419926f85c716fbc8c7e0812a6028d7bc1feba512b2ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:266-279 | agents/drivers/vastbase-go/bench/agent_compare.go:489-502 \u2014 before extracting anything, compare \u0060agents/drivers/kingbase-go/bench/agent_compare.go\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9945741747eca316d983543bdf11e46361686d8bbf077cf4a65b2fd0a3198dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:214-223 | agents/drivers/vastbase-go/bench/agent_compare.go:579-588 \u2014 before extracting anything, compare \u0060agents/drivers/kingbase-go/bench/agent_compare.go\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5415f2d7e27cbb2fc4222aa1531e10841d1f05aa068d8ff0af5229e1a88331e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:281-290 | agents/drivers/vastbase-go/bench/agent_compare.go:504-513 \u2014 before extracting anything, compare \u0060agents/drivers/kingbase-go/bench/agent_compare.go\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/bench/agent_compare.go:281\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/kingbase-go/bench/agent_compare.go:291\u0060 calls \u0060sessionID\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go:514\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":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f214214924eefcd1b82712ddf6e35a8ed2abbe675cbce235e2ebe48ebafca0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/rabbitmq/bench/agent_compare.go:155-163 | agents/drivers/vastbase-go/bench/agent_compare.go:227-235 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060agents/drivers/rabbitmq/bench/agent_compare.go:155\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":"agents/drivers/rabbitmq/bench/agent_compare.go"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd633e45cb6caa6504227b3eef76242e0f33154951886b779bf19ea7bac596b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agents/drivers/rabbitmq/bench/agent_compare.go:172-180 | agents/drivers/vastbase-go/bench/agent_compare.go:238-246 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/drivers/rabbitmq/bench/agent_compare.go:181\u0060 calls \u0060Since\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go:247\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":"agents/drivers/rabbitmq/bench/agent_compare.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c92991d40040f1a2b323a46115181580125d5fc718a66792f7e6086139c7caa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:332-338 | agents/drivers/vastbase-go/bench/agent_compare.go:727-733 \u2014 before extracting anything, compare \u0060agents/drivers/kingbase-go/bench/agent_compare.go\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b396de5551db7370a5d77515c6458547f56815dc36b13335af1e15fb64d19039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/rabbitmq/bench/agent_compare.go:467-473 | agents/drivers/vastbase-go/bench/agent_compare.go:736-742 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"agents/drivers/rabbitmq/bench/agent_compare.go"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"251283cbee41a3bb368f092527bdb19c70f6d4e9df31d7a7f8431be0266bcbd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:226-231 | agents/drivers/vastbase-go/bench/agent_compare.go:591-596 \u2014 before extracting anything, compare \u0060agents/drivers/kingbase-go/bench/agent_compare.go\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/kingbase-go/bench/agent_compare.go:226\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, \u0060agents/drivers/vastbase-go/bench/agent_compare.go:597\u0060 calls \u0060Delete\u0060 and \u0060agents/drivers/kingbase-go/bench/agent_compare.go:232\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":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"440ab66b1ece368c32419ec728130ebe0636e523a87930dcec0b4513e39ae5b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:253-257 | agents/drivers/vastbase-go/bench/agent_compare.go:619-623 \u2014 before extracting anything, compare \u0060agents/drivers/kingbase-go/bench/agent_compare.go\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"acee594d6b7012a2762794ee298c1ded3025df328ecd38add2734a9416488d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:340-346 | agents/drivers/vastbase-go/bench/agent_compare.go:686-692 \u2014 before extracting anything, compare \u0060agents/drivers/kingbase-go/bench/agent_compare.go\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c0bccd889a59cd5102a9cb3f79e1943da47d536c016644959718551eb81ecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:350-356 | agents/drivers/vastbase-go/bench/agent_compare.go:752-758 \u2014 before extracting anything, compare \u0060agents/drivers/kingbase-go/bench/agent_compare.go\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd10e14469cae1ba707c6d885ff00a124afa4e83ee26d8a6ed890648c239389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agents/drivers/kingbase-go/bench/agent_compare.go:373-379 | agents/drivers/vastbase-go/bench/agent_compare.go:808-814 \u2014 before extracting anything, compare \u0060agents/drivers/kingbase-go/bench/agent_compare.go\u0060 and \u0060agents/drivers/vastbase-go/bench/agent_compare.go\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62d0b306c409178699694ed4aad271c31a530a81e7dd3bc9287ed02911a9841"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agents/drivers/rabbitmq/bench/agent_compare.go:147-151 | agents/drivers/vastbase-go/bench/agent_compare.go:219-223 | agents/drivers/vastbase-go/bench/agent_compare.go:277-281 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/drivers/rabbitmq/bench/agent_compare.go:147\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":"agents/drivers/rabbitmq/bench/agent_compare.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb0656463913c6ae98d3d8fe787c453b222392889374d38b1300ec97d094b32"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dbx-drivers: dbx-drivers has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b60c0df59e7d25a7258cdb3245cda8d4115e8b1bbceb6f91842c6c4662970431"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dbx-sql: dbx-sql has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e898b717b692df19ea8a13aace2f8f413a2fad7a106626ad00b679321ab921fe"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dbx-formats: dbx-formats: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4e0f9dfc4abd37d3467179fee3dc8d386bacb7b2c830144b2c32d5bce16a5bff"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dbx-platform: dbx-platform: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"983db708bb6ac533a95cba8059e11d0ee66358a06b3e8bc4fc21eefa8d1372ce"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dbx-plugin-packager: dbx-plugin-packager: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f56925a33c9fc876539178bb7de3c343f833c7ff0c16f150ef4670215851e68"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dbx-sqlite-worker: dbx-sqlite-worker: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4ccd6c1a7a0be455a75432c986cc0b39c9d1f35db87103e6de0afb99fe88b056"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dbx-types: dbx-types: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"041a08e6489df63ff86de2a5725c7eb90de5a14545eb461a14e6ac331d2c2ca3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: github.com/apache/iotdb-client-go/v2: github.com/apache/iotdb-client-go/v2: abstractness 0.07, instability 0.00, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e0df6e4774b99bb1d8bcab4286498fa7ec757cbada14a46fa48ea823eb6ea369"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: github.com/golang-auth/go-gssapi/v2: github.com/golang-auth/go-gssapi/v2: abstractness 0.09, instability 0.00, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a33539fbfacd01efa98dcd52402bd688b3bf14ab30508956054877344ba7eb35"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dbx-sql-core: dbx-sql-core: abstractness 0.00, instability 0.11, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ed3ba55273495a7255e41f0d4c00502a57568bf4fa17bae17419b612e6e4e5f9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dbx-sql-dialect: dbx-sql-dialect: abstractness 0.02, instability 0.17, distance 0.81 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7b6bd60297b50f2c8b2edf04e91221badb402703cc3041b937aee696d87beb83"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dbx-driver-support: dbx-driver-support: abstractness 0.00, instability 0.22, distance 0.78 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fd4b338092a93e3714b9d5a85246cd5e42e3557a964502d8cf22089882b20b46"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dbx-mcp: dbx-mcp: abstractness 0.02, instability 0.25, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a775f0f4be2fe7abce497b76822537a3ba57be96fd7e9e3d9f866128cf432064"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MqAdminConfig (LCOM4 6): MqAdminConfig\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/config.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31715a172eb8c012f6c266ac92d03033a375199c26ab0f8d6020650bb7c0703"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ConnectionConfig (LCOM4 6): ConnectionConfig\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c4a9a2f68915159fee0e28e1001da9cd7e0871acf17e5faf75caf3750210a3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MqttOptions (LCOM4 6): MqttOptions\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rumqttc/src/v5/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f19dff590676a92bc4184b8ade17305324164c5883ced81129c0db10789d78"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AgentManager (LCOM4 4): AgentManager\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_manager.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdb9995781c82504403a9686915fc8e7cf6fb48c659b9cae4021bd70c4f151b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Connection (LCOM4 4): Connection\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/tiberius/src/client/connection.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6495af505a1340bbb3baba36c75d00057ab792f10a1762eb94edc607c7bf94e5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TlsStream (LCOM4 4): TlsStream\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/tiberius/src/client/tls_stream/rustls_tls_stream.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ecc11878b293da463d76d9f0912c944c7e7e096ce5ca025ac64608eba42d76"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: QueryStream (LCOM4 4): QueryStream\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/tiberius/src/tds/stream/query.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd432852fa04edf7f5f8858831f8834dbf4cb5b2c4ed04282898a7bf18df29c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: preserves all original parameter bytes for every exported connection: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/__tests__/connectionParameterExport.live.spec.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0898bbd8f18aa676c22c47e82f592486e1c8d8009c61e4068addf849a998fad3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: removes a previous mode\u0027s function signature when the mode changes: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/QueryEditor.kingbase.integration.spec.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4044b36f195eb18ae889961b3d2edf9d4b52c4c17fe6722b7234f2e708a1a44"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: compiled UI output waits for a successful build signal: This test starts work it did not wait for (\u0060revision\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 650))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/tests/server.test.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49c5df5628fdba651a0af6d517b1a269ca95407fa723c8232bd68a94947df1f"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: clears sticky subtree loading when health-check reconnect bumps revision: This test starts work it did not wait for (\u0060store\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 2100))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/connectionStore.metadataLoading.spec.ts"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e65c7879457293c106c6c85dd927ad43d1608c0537402510a6177d2f634fa5"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: cancels source and target schema compares and drains metadata before disconnecting pools: This test starts work it did not wait for (\u0060disconnecting\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/connectionStore.oneTimeCleanup.spec.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a001a7592aa88b8d632bfd0d22f8394daf7b1b2900251792e02c24bcac5e85"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: waits for the other namespace when %s fails: This test starts work it did not wait for (\u0060outcome\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/__tests__/objectDdlCache.spec.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8052f10c6b2ac016ae4210e6eced0ae3073ed7aed06eed472722097c332f90fa"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: reports an in-flight DDL outcome as unknown after its generation changes: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleConstraints.spec.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"752c37b2cdeb0550d3b84fb09fb16c61f387e82e32d1470e4a80ad237c63b1ba"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: reports an in-flight DDL outcome as unknown after the generation changes: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5d38ed893748feeef3db1f5d710cfe5401589cd67e0cef0be15980cb53e080"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: keeps a resolved DDL committed when only the UI target changes in flight: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1fcdf3cc66c6b81ad54af70882b7a44e4d56c5697441dd377ea841d10fded7"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: preflights self-reference before CREATE and executes each statement once: This test starts work it did not wait for (\u0060pendingLateCreate\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0187e0b29a4e6537928d74464b3afe16885f97cbd9df4d93cb6e19d5f5d2481"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: stops queued metadata after cancellation and waits for every issued request: This test starts work it did not wait for (\u0060rejection\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/schema/schemaDiffMetadataLoad.spec.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffbf115444e58c010c0237b22d21a0e45a3ce989e44dfcc72118412323d606a"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: disconnecting either side stops the compare after its issued table-list requests settle: This test starts work it did not wait for (\u0060cancellation\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSchemaDiffSession.spec.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"055f31057878c0cdd8f6475f65ec804f1c9a94300b1bbd5372f7bb6b7529daba"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: detaches a reused tab only after the fresh reload settles, not on its stale errored result: This test starts work it did not wait for (\u0060opened\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarDataOpenRuntime.spec.ts"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ab875c41ee87a3de90f919a72a2829bba5d9cd63ad91b0639d094d81823aad"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: retains search filter results after editing a cell on a paginated table: This test starts work it did not wait for (\u0060gridRef\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 100))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/__tests__/DataGridSearchCellEditRetention.spec.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf8d19564e2f66f0efd183aefe8a65e8b2ad366bad202d6bc569d2c7484ad27"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: does not accumulate page styles while repeatedly restoring cached SQL tabs: This test starts work it did not wait for (\u0060activate\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 150))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/QueryEditor.componentSplit.integration.spec.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76d34c2abfbeb1f069def983b1fe303e9a1986913cec0aaa985f6ab728c463d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: skips the substring lookup when the prefix search fills the result budget or the filter is short: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/connectionStore.completion.spec.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c433fe0c451cea43b499694ec6e1bd1ddb339e86ee74f5077f3f91d71cf5e0d3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: normalizes unquoted Oracle aliases while preserving quoted case before catalog lookup: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/connectionStore.completion.spec.ts"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"e003f82a695f9fa3872beae10ce1da881e693a3c15724854a9f06537c29bcbcb"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: prefers an explicit SQL Server routine schema over the current default schema: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/connectionStore.completion.spec.ts"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0171da464330f5daa12ab93d09ec249ec9c07e14253c154c02f8dcfc1a78ff6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: uses the bounded fuzzy-search budget for external catalog tables: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/connectionStore.dorisCatalog.spec.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2f2de0d5eec0d92348206f1cbcdec37266c04be0c27605da0b427056d303b3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not fetch object DDL or column metadata during a connection refresh: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/connectionStore.refresh.spec.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f8bd08d0c2233f2cf7fcfb80991ca5b82b06d5e6c2aa5bc9226143bba5739b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: immediate %s waits beyond the pool timeout for retirement and prompts even with stale status: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/connectionStore.savePassword.spec.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5534ea243561418cc88c985e38ba992877365fc534e0e89daad4ddd06c92d9f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: migrates historical disabled-encryption configs and installs the legacy component: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/connectionStore.sqlserverLegacy.spec.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9bd306432afbe0e509a8daa822baa1ee42d017ed5ab420c042ccb8ffbbeeaf"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reconnects persisted legacy profiles without reinstalling an installed component: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/connectionStore.sqlserverLegacy.spec.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cbdd7d91a21bbf423d46a59207c943c38de58ca9d2d0de5e7b1af9783bdd25"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: covers functions with the same flow: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/queryStore.mysqlRoutineSourceRun.spec.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ddaf304789f6cc78b4494255a103eaff2c8180d617cd17f7fa472db435e0a7"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: leaves a plain query tab alone, so CREATE keeps its normal semantics there: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/queryStore.mysqlRoutineSourceRun.spec.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d209b4f5c42c5223c2fd4402f58e14815ec9598a0a46c7ff46cd590b7c7827c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: leaves scripts with other statements and other routines to run exactly as written: This test sets up 4 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/queryStore.mysqlRoutineSourceRun.spec.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac71c5530a6257bfdaa1e6f75940187242a63e9b97d233dbbb999dfcf0eb12f9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not apply to non-routine source tabs or other databases: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/queryStore.mysqlRoutineSourceRun.spec.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a89cda0b1b54366e34e6ffe08ffeefa457e0b9e9ad57b18de2f7f3f474857e9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: still runs the statement when the backend cannot build the replace sequence: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/queryStore.mysqlRoutineSourceRun.spec.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5e8d35db0077a46b1a75b9f3f54fe24e2c783326e415b28c3136c07d29fdc0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: continues from update all into the prepared app install: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/updates/__tests__/componentUpdateOrchestration.spec.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21c5880a8d2129b19c796216a3c98510fb275479d884ac6e38172c952a7175f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: falls back to component updates without restarting when the restart plan cannot be persisted: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/updates/__tests__/componentUpdateOrchestration.spec.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ce3b2932687272fcf6dee08f83eb74c5d6dcf84915b90874eae9b21c1182f9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: allows only a metadata DDL export to carry its same-target state appendix: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/__tests__/objectSourceLoad.spec.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef30cbe9d51ca2a696bd3583ef51d7f3bc3937fecf3d47596b37b676183d280d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reports a missing workbench explicitly without falling back to the backend: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginContext.spec.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41922b2ccda73b26734486a14b32705442fbd4a076b6a0163d6dbe3edfc50cc"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancels unfinished native downloads when the workbench is disposed: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.spec.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c68bf0c60424af207710648e21168a208220b199988c8a50617996cc603dbc"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancels active streams when the workbench is disposed: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.spec.ts"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbf78e5657bdd23816bcb0adbe3e6755ce6d3a96bf7e6c7c48c973ee229bde9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: dispatches query and special-page entries to their handlers: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/navigation/__tests__/globalNavigationExecutor.spec.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d15f67f634a52098c379d5df7bb49484a9647a8e6767680cffc016d2d4efaa"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: writes only the path the save dialog just returned, after stamping the suggested name: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/docs/__tests__/saveDataDictionaryFile.spec.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"049fec8ecde6b4bffecb2069f7ce7643e3b5465c4c236aee3ccf685a48099a73"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: uses the document body when no dialog is active: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/__tests__/clipboard.spec.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fe3f86ab48f303b9429e1214c2e10a016f5b9d96aff78278e4497e698d6c50"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: passes the %s-second override through both adapters, including unlimited: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/__tests__/getExplainInfo.spec.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ef49293fa42283c10b571ad0e5bc9c19f23ee655f8ca90dc5a9b7b6619b50c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: filters query messages by execution and returns listener cleanup: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/__tests__/queryMessagesStreaming.spec.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb9e8ec88a8fbce9650732a47d085a6de09ad2343f6f20e157cbc557071c6be"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: serializes zoom IPC and only publishes the newest completed target: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 7 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/__tests__/uiScaleApplyQueue.spec.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d018b77b8307cde248f4fd402c9137ba2b0db6f5deb703a81d7562f53a03dc45"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: raises only detached-tab windows when pinning the main host: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/__tests__/windowAlwaysOnTop.spec.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"07285622248b2dc2dd8e6f63054758d95c57d8c066b5b81ccdda2afd8510149f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancels queued ordinary navigation for another target but preserves the same target and new-tab: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/sidebar/sidebarDataOpenCoordinator.spec.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f0a4458e357fbdf7d362cc23fd5e6cb6d9894ff7fa259deb7e3c70819e797e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: loads each side at most once for non-refreshing reads: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/schema/schemaDiffTableList.spec.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"567981a9778a46e63da206e8e35834a572f8d6b2cfa66c256539f9f2ea20a2be"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: no-ops when no batch selection session is active: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/editor/queryEditorBatchColumnSelectionRowGuard.spec.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0942239f9d894bf39bff3f2570b2f878d6c802d814918c2b41cfc82b0362dd9c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: restores offline and one click saves before installing and restarting without downloading: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useAppUpdater.spec.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"5748613f23733a81c7a704242a7ee4c1cebd9536dd492fa7b73d964cb7a1bcf2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancels a plain reorder drag released outside both the grid and the editor: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 6 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridColumnLayout.spec.ts"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd028e4c6ce35b965c9d5b86cd3f62f5e4f164bd28f33098e39119369bd59cd2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reloads after a pure row update, so database-computed columns (e.g. ON UPDATE CURRENT_TIMESTAMP) refresh without a manual page reload: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridEditor.spec.ts"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f77a5a8b60bfb408f91f8374609fd628296a2efe03d176c3fca9e5ad86fb7c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: saves query-result edits through the active manual transaction session: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridEditor.spec.ts"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaa79a2b0ec6e0205f62a8057ecd05f2f69472bf39365097d32ad51459694b6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: starts a manual transaction before saving an existing result grid: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridEditor.spec.ts"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"068b402b1856a15594c279e044b1d8e3b9de94cb914b664d480e3e5ecd639f73"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: checks a keyless edit on the newly opened manual transaction session: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridEditor.spec.ts"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a34e161554caa703e8d83ac4153b135e1aa98e208401067cfb6fca18bcabc19"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not reload when there are no pending changes to save: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridEditor.spec.ts"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1635d349aff50c7da15f11228bb755908d1231f392cf8d2d4956cb60c419fa6d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps the custom save path from reloading after a pure update: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridEditor.spec.ts"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e42870abddfa5a9123585f884c6345d1399541d6438fd9628f356704c42d388"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: selects the editor value only on the first frame so fast typing is not clobbered (#7336): This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridEditor.spec.ts"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"00afd6dcb10e91470fe0332f5e2ee674be2e510476f9c7c097fdc9f69525763d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: defers captured legacy values for %s and keeps the original formatter: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridExport.queue.spec.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac2c25b423ee975abbfce85c354f1f9f84b90a575b3e8e5abc5b9d79e9c9c7e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: queues captured full-provider data for %s without calling the active provider: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridExport.queue.spec.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f05b90f152655f25a58f829ea0d9c35e83ceb0e1c4c0f464cab35ead9ad2ec"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not re-exclude a projected case-distinct non-key in the %s fallback: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridExport.sqlColumns.spec.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc76553c076834c66ac630bfbce116bd247e51c7855fe7d4cf91067cb7ddad4e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: projects %s rows and types together without requerying: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridExport.sqlColumns.spec.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b84e699869f0660bc4cd5efadb5a12cca07af33f7622dff2d496112492905fe"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: routes a table-data grid column subset through the backend SQL stream (issue #14732): This test sets up 4 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridExport.sqlColumns.spec.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1664d9d2b87b8fb617f297d7cc94a8117692b96a0cc3c1dc928e6ac82b6a2e6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps the query-result SQL export on the backend for a grid column subset (issue #14732): This test sets up 4 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridExport.sqlColumns.spec.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"266a7698e4ce4949a914870ecf54c9f8ebfcbf7653bacb3af4f45c013c4c0c68"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps second duplicate, spatial metadata and raw types aligned after internal-key removal: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridExport.sqlColumns.spec.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e184da5908c2b6c63b81f2c1edd7686f51052eee1daaed7e4347f931d95348f8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: applies the selection to the Web full-result fallback: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridExport.sqlColumns.spec.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d17ed7ecaac6f1bb8907f558078ceee21efe2548b867a6c659874d0caca5945"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not remap reordered full-table results by visible positions: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridExport.sqlColumns.spec.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"30faebdf0d1faff95e1d5c590b15161de68702acfbb92b5e0c1685673e295886"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not export after cancellation or an invalid empty selection: This test sets up 5 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridExport.sqlColumns.spec.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2af06ef4e2c1a02a435724c0e674a0b935170b5aafb007de9f1443c56b05ce"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: invalidates synthetic context state for ordinary, Ctrl, and Cmd cell selection: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridSelection.spec.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef39b9257d6fae4980b575a0c54578048263950e30efb40399f0f664ab3470fd"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not fall back to database as schema for schema-aware database Kingbase (#11347): This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridTableMetadataLoaders.spec.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f00d431f90046c80f4e398eecc09358d1b7c85f469eca7668afc36b0f6e989"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: preserves explicit schema for schema-aware database Kingbase: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridTableMetadataLoaders.spec.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e3371fe14c8e3eaa0f7180db3c67151c9c34f8dda9b52b88fa3f21ea7b2e71"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: falls back to database as schema for non-schema-aware database MySQL: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useDataGridTableMetadataLoaders.spec.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3048296a0e2c61caa7066399b5f6d74480f3681fbf33e0d21c572f25272ca897"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: refreshes sidebar columns even without a data tab: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useNavigationTargets.spec.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b83b0bdff7d39ee72557939fbf1b06c64eb2b8d8e94076138712dc8ec88c24c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: translates direct executeQuery errors for sidebar JSON export: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65690660a971fc8dd2bfcadaa137fb8b0f461af82a0ca83c033c6e6654f4f42"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: closes a failed Cassandra cursor before disposing its client session: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5ec80eb99085484e7beaec329c02049b44b39d9bbeae6fadbdc67b298f84bc"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: exports a mongo collection through the save-file path without a setup dialog: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd4af1e73b6553e553aa3ef04495828ab3ed558eaae45b6227a04dc4c68cf54"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: exports an official-compatible %s collection dump: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0d2a578584749284fc4d4fee7374dcb9dc262387455318d6deafd3338044b1"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps the original table and export options when selection changes during XLSX preparation: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd3394bbcd9e7c9d489cf45e85aae3c2a2da251172a7ef06bccb4753840729f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps explicit column order and primary keys for keyset XLSX export: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f47c6e20cee95550364d42dd21a83771fd33d7f86986916ef3891eed4df8670"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: exports every selected table when multiple tables are selected: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"739b882023deeedb3d44e5106abc748d1d12f7868a06e295da358fefb4972f91"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: exports same-name tables from different schemas to distinct files: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0277fb55799f885baeff979f822ef9497167efa660b26787a6a4f789188b3539"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps unique table names unqualified when schemas differ without collisions: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdba94a5052db0d410961f5d0afab77fff479d8efe3b86cc79e793e2e6d8ebc"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: exports only tables in the active execution context when the selection spans connections: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eca30083ee56e26af43e2ae013226566f353770ee087a176e14cc39fe0cdfd"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps single-table export behavior when only one table is selected: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c4630d65851077eab24eb28c1265b9497940a20ab3722ab273f51200f185a9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: follows the include-database-name setting for SQL INSERT exports: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e0fd59dd8c22e3e88baa81433b501f141bbecf5e63647d651596b4b8aef190"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: rejects compatibility SQL export before creating output or connecting: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3d99ce0d678c909bb0ebcacd3de401be848b89675c2b57f61169f56edfb0f0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: serializes the %s SQL INSERT dialect for a table export: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSidebarTreeExportRuntime.spec.ts"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c606797a43792f2af01fb5dc97c320801a355980162bd24ff378ffff5e9500"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: prompts for a connection instead of executing when no connection is selected: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSqlExecution.spec.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a8bd2fb79535eae786f192b68d2b8a1aba7d10619f641f40a170b9f847ee16"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: invalidates object metadata after successful connection-level DDL: This test sets up 4 test doubles (for example \u0060vi.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSqlExecution.spec.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2f8bec5cb014877c2f86c4523391db6fcb0dbd022b930d2b9efd1902b4a6d3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: invalidates table facets after successful Kingbase constraint DDL: This test sets up 4 test doubles (for example \u0060vi.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSqlExecution.spec.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc191d92126067c1c5d7f52a46abebd4cd0896c078d1d6fa0af50e1952cad9a8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not record or refresh when a new-result execution restores the prior run: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSqlExecution.spec.ts"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef01aae2f93b6bd3bd91037acd13a9ba13770612a023bf48713620a781dfb656"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: records a later MySQL batch error and skips metadata refresh: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSqlExecution.spec.ts"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddf4f9add365025eec9c8880dd383e54842be526875c4c14eab396c4e038480"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: records a later PostgreSQL batch error and skips metadata refresh: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSqlExecution.spec.ts"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"05522d6d32bd267bf92ba4f9dd92c181f0c19ad458c31e1cd85565052a7d5b0d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: rolls back pending changes without writing a successful history entry: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useSqlExecutionManualMultiDb.spec.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"166eb1346d960b347b100330cdd0473352e9ec114383985fe124ff18a9ad426c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: routes the native macOS close-tab menu event to the active surface: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useTauriEvents.spec.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6141404872a0e0096d08e46cfb89b4aa6823e1c17b50588ec4217f05263a62cb"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: forwards replaced plugin runtimes to the workbench refresh hook: This test sets up 6 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/__tests__/useTauriEvents.spec.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9232e7fa8950a98edb7eee8dd8c98386217ee028379e69480a269d86a19cd8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: stops before loading the result when the write guard denies the transfer: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/__tests__/QueryResultTransferDialog.spec.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef9e881a5b11f5690e7c51a8f0d846c705f8f502c046a5d7465f62754d25c1a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reuses the source MySQL DDL when the result is a direct table projection: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/__tests__/QueryResultTransferDialog.spec.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"a861017bb489e1bd73d3c812c06b2996ccd56c637354eb75af9a8ff16d80b54d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: adapts MySQL 8 DDL to target collation %s before creating the table: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/__tests__/QueryResultTransferDialog.spec.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b57f986bbb7ba8c6cdc035e0cbc97207d5ebe88ca2ee4a21e3f60e07d6b8a2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: stops before CREATE when the target has no known compatible collation: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/__tests__/QueryResultTransferDialog.spec.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"c718bd2e8ecf41bb3becc5900640f25ab9d2da0b4fff572741d5a0d1deab44e2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: rejects fractional loss using an existing H2 %s declaration before overwriting: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/__tests__/QueryResultTransferDialog.spec.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9befe8828cf684601fdb76ea5db22905835ab4b237491c76ef5aca57a597de5"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: retains the declared precision when reusing a same-engine source DDL: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/__tests__/QueryResultTransferDialog.spec.ts"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d2585311761bff4e1616cfbb3c34c9dc401c3e1d17d6eaccb9eb6dac5d163d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: rejects an unknown bare temporal declaration instead of assuming wire precision: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/__tests__/QueryResultTransferDialog.spec.ts"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"176a170e49302660b64e446d303e3b23706c258e635139bae4cc188ffa4aeb7b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: matches a marked production database case-insensitively and stops on denied confirmation: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/__tests__/QueryResultTransferDialog.spec.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4aaf54d97946362c71eae753c99a93c9879f45583bb84190b2025e26984917"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: polls active tasks, emits completion once, then stops: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/__tests__/StarRocksAlterStatus.spec.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43bd5b602da5d9d34351b702b61f238233976037dc927f6adea1be9ad502561"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: locates column in data grid on single click in single-activation mode: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/__tests__/SidebarTreeRuntimeHost.columnLocate.spec.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f2852630e61f95d8e7c98d756f1aac01ecbddf4c81faf7db2ce139f0047e8d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opens the structure editor for a double-clicked column: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/__tests__/SidebarTreeRuntimeHost.columnLocate.spec.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e4be65d12fd988d3fc5d4694552ed2496d87f24445a4be07fab7f9368fd523"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: switches to the matching data tab using the rendered node\u0027s full identity: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/__tests__/SidebarTreeRuntimeHost.tableClickNavigation.spec.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e6fa9f4c499eab611c87d87b2ad85b090e0537f397066b8e4b0524da085e8e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: switches to an existing HBase tab using its SQL table name: This test sets up 4 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/__tests__/SidebarTreeRuntimeHost.tableClickNavigation.spec.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f964ba2a528d9a1ef1652e273624a57f22c131defca8526c631f0b566dcc0f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: preserves the search Enter action when the pointer-only argument is absent: This test sets up 4 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/__tests__/SidebarTreeRuntimeHost.tableClickNavigation.spec.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"763a277b13fb0494a233172d6636f781f98481c011b58f751857934986522906"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: preserves the usual click action when navigation is disabled: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/__tests__/SidebarTreeRuntimeHost.tableClickNavigation.spec.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7e9f8861f8da81043c0ea44076b302ec9441ba30aef33153dfdfcb8d0e3ce1"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: restores authorization trigger focus and falls back after the trigger disappears: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/__tests__/McpPluginCapabilities.spec.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e06561670ed299317718df26652402168d032fcddc8c98f14fce1247fb2054"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: pauses polling while the document is hidden and resumes when visible: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 2 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.expiry.spec.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2d65c9b783ac3e8a63c0ae4a945748e552ecf998af328197da5a0de50f3538"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: emits draft edits and explicit revalidation: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/__tests__/OracleTableRenamePreview.spec.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f01c708975d4dc9790bf321c3fb8d1b535adf566e92fb8bf5d5d4494a4dab77"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: waits for AI cancellation and persistence before closing the native window: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/__tests__/DetachedEditorAi.spec.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"5199fae862513c302f45d8cb04bdbec211cbbd18a3da7a699872a1b47f89129d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: edits, reorders, disables, removes, adds, resets, and applies sort rules: This test sets up 8 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 9 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/__tests__/DataGridSurfaces.spec.ts"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fad748958307516fec6f1d75cd55501e30a5763950faeeac47c359b8b37309d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: copies the presented value, emits edit, closes, and replaces the JSON result: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/__tests__/DataGridSurfaces.spec.ts"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27e6c1dccd5fe0cf0c3d1463b12d55e3f036ef3d499310aa29cc93e9588f7a2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: forwards panel actions and only starts JSON editing from preview whitespace: This test sets up 8 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/__tests__/DataGridSurfaces.spec.ts"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"773beeeebe250e805c2fa5addde7bd8066bd73fd3514f43b02cdb92ba6184ff0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not replace a failed full-index request with a simplified metadata reconstruction: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/useQueryEditorHover.spec.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f030484315816b8f0252bde19a9e882520b38f96f80b0ac124afc6a98b30966f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: falls back to column metadata when DDL loading fails: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 2 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/useQueryEditorHover.spec.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ea09ad16bc24fc0b743d43c66ab883b9d5a9345244ae68acd114607e201c7"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: shows an explicit structure failure instead of inventing an empty DDL: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 2 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/useQueryEditorHover.spec.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff533deec4232030b947b71fac56194406b9f68495fc08df2056810d83efd13"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opens cached routine metadata without changing its stored identifier case: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/useQueryEditorObjectNavigation.spec.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac04a4934019006e1c66b4a4c1f6bfd0761476ed9cb982ddfc54f315e17f7389"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: falls back across schemas for unqualified routines in fallback mode: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/useQueryEditorObjectNavigation.spec.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dd3dbc45f6a6d56920e6b5c0d6c9db1b56a68c1e670845577f5b43fc48f6f4"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not cross schemas for unqualified routines in current mode: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/useQueryEditorObjectNavigation.spec.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"155e15b786f311c443ea2d9bcfeb57bdbed8430118d49b2ccdd1d99ed22b863b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: searches all schemas first for unqualified routines in always mode: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/useQueryEditorObjectNavigation.spec.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4592e6698cd46d5f1dcfa94675c49ce069ca093f847f7f6a18aa27367373d073"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps qualified routine lookups scoped without global fallback: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/useQueryEditorObjectNavigation.spec.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b4122b6954563e620a16b74c661b73f78e972ccbfab32bfdf12ef2e78b4abb"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: uses the shared column cache for qualified column navigation: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/useQueryEditorObjectNavigation.spec.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b5f6ff78eb882015ec587574bb65c533677cbc1c1da1a72d94cc12e87529cd"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not emit a false column match when its metadata lookup fails: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/useQueryEditorObjectNavigation.spec.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"65620587d3f1ac7f61f1ca0939482959b265694fae160b16370b7288e65305b1"}},{"ruleId":"D12","level":"warning","message":{"text":"Dependency pinned to a stale untagged commit: github.com/jcmturner/krb5test: Direct dependency \u0060github.com/jcmturner/krb5test\u0060 is required at \u0060v0.0.0-20201230140143-102e4b78cdb8\u0060 in agents/drivers/argo-go/go.mod \u2014 a pseudo-version, which pins an UNTAGGED commit from 2020-12-30, 5.9 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of \u0060github.com/jcmturner/krb5test\u0060 and has not moved this requirement in 5.9 years: every fix the module has published since that commit \u2014 including any security fix \u2014 is absent from this build, whether the module went quiet or moved on without you. Check whether \u0060github.com/jcmturner/krb5test\u0060 now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1f8e40c66530faa027b5e8904ab75b839df35dd06b09b64366679b5b5c98cde2"}},{"ruleId":"D12","level":"warning","message":{"text":"Dependency pinned to a stale untagged commit: github.com/jcmturner/krb5test: Direct dependency \u0060github.com/jcmturner/krb5test\u0060 is required at \u0060v0.0.0-20201230140143-102e4b78cdb8\u0060 in agents/drivers/hive-go/go.mod \u2014 a pseudo-version, which pins an UNTAGGED commit from 2020-12-30, 5.9 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of \u0060github.com/jcmturner/krb5test\u0060 and has not moved this requirement in 5.9 years: every fix the module has published since that commit \u2014 including any security fix \u2014 is absent from this build, whether the module went quiet or moved on without you. Check whether \u0060github.com/jcmturner/krb5test\u0060 now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"84201d8e07c4c31b728836acc6d64e6f037d0e8a8e4c526d8034a81ce8df4fd9"}},{"ruleId":"D12","level":"warning","message":{"text":"Dependency pinned to a stale untagged commit: gitea.com/kingbase/gokb: Direct dependency \u0060gitea.com/kingbase/gokb\u0060 is required at \u0060v0.0.0-20201021123113-29bd62a876c3\u0060 in agents/drivers/kingbase-go/go.mod \u2014 a pseudo-version, which pins an UNTAGGED commit from 2020-10-21, 6.1 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of \u0060gitea.com/kingbase/gokb\u0060 and has not moved this requirement in 6.1 years: every fix the module has published since that commit \u2014 including any security fix \u2014 is absent from this build, whether the module went quiet or moved on without you. Check whether \u0060gitea.com/kingbase/gokb\u0060 now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c16d0bf9cae6f331fe5db3b1f872ca11a317a865b7c50f1a1832f91a1b5985fa"}},{"ruleId":"D12","level":"warning","message":{"text":"No go.sum committed (plugins/sdk/cli/templates/go/backend/go.mod): plugins/sdk/cli/templates/go/backend/go.mod requires 1 module(s) but no \u0060go.sum\u0060 is committed beside it, so nothing records the expected checksum of the code this module builds against \u2014 \u0060go build\u0060 accepts whatever the module proxy serves, and two builds of this commit are not guaranteed to be the same build. Run \u0060go mod tidy\u0060 and commit the resulting \u0060go.sum\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"59c4e9fe5f5516a6e5d279e46e3822216b984fa92cb2e24c5916db0acb9dd4cb"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46a0dad35967cb6a2fd1c70cf1cd716b9a3769821e2a1cb333cfa9cfec84b744"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63a22e2a58bfa7b842a74a654e83836e0290fad3f398bf79429d5158f29a0a63"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bba288553835c0d59d2b2f93995dc98011b1ba3a722a86f681a0515b9e8a613"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66ee722a2213761099d3ec93d26cce45bff43c68a97561faeece3c0445fe1964"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b9e67a9518147856539cce42e5ef7e41671c09f950164af67c546f4dc56ffe7"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d8a52ee3ab729da082debf806e45ae0595185e613716073d2dee4d5fbb1f111"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9435ed5d556cfec80c882885e9ee6deb3b22ac9d44fa0af54353638328b43d09"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"117f1dcdc9af82a54fa091376160cad160044941839d213016fecacc0493b288"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf65e2685ac8fe8ffcb041a837d04d52d806d3b4474f9d0a831a4f21171ce2aa"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c70013144f0d7503663ff56f9c2a608ece7740c9e0da2287ebbe2bdf4f997324"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eaaf9aff7395f7da71ad5671ca3cf51d5050ff5bb3f522026a208fe8cca171d6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4ad45feb3005e69b021be749130a1c5a771e13067921538c63b5ed0fdea85d0"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"277673bd12bec91cb63ef0451b4225874d083c74781fb6a43a13ac7a0db718d7"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4053866d0c2c1cbb8e22f5e34fe78f9947a06c83e572969ec13d585713e98dd"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"718bb956cb0a27e49a4a4aa885dc2c8e0f9f298c7ebf67c93bda79900ecd9372"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98bddfb9aaf9e1164e290da6ac4c5bf408ba4502dead9a964bcee56fcf5f5c30"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f26ccdec5a16579817509aaff86b56cef293385c4611135f39eabcb24e69092"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9083cfc05b566d0fdbaf494d15896ad111fd7f9155a1ea0da34f49733a90734a"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/stores/queryStore.ts: apps/desktop/src/stores/queryStore.ts changed 256 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 705 in queryStore.useQueryStore.executeTabSql at line 8415. 147 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/stores/queryStore.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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8415}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba5a6182c71a81ee4643a5ddc2590c3a7d851cd500b64e570135b82a4666e6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/stores/settingsStore.ts: apps/desktop/src/stores/settingsStore.ts changed 199 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 310 in settingsStore.useSettingsStore.applyEditorSettingsPatch at line 3117. 30 of those changes were fix/bug commits, and the other 169 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/stores/settingsStore.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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0818addd86271e0668087984115d08abb78c1b7cdd9dfea8167a4d693a279750"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/grid/DataGrid.vue: apps/desktop/src/components/grid/DataGrid.vue changed 371 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 129 in onGridKeydown at line 12005. 184 of those changes were fix/bug commits, and the other 187 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/grid/DataGrid.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":12005}}}],"partialFingerprints":{"codehealthFindingId/v1":"df10fdc28f1aadfcac729cf58ff18a127fc71113e6f3184509324684f58daad8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue: apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue changed 186 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 221 in toggle at line 1004. 72 of those changes were fix/bug commits, and the other 114 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e0a9cd40687c32dfe531e27dee8982fe472d6303641da4e484111cceae5de9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/connection/ConnectionDialog.vue: apps/desktop/src/components/connection/ConnectionDialog.vue changed 124 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 289 in connectionConfigForSubmit at line 5087. 58 of those changes were fix/bug commits, and the other 66 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/connection/ConnectionDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":5087}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdd89d51276211c03f28a3f8962d8f26b85198fa3f4cc8586c59783f3bc5898"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/App.vue: apps/desktop/src/App.vue changed 238 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 136 in handleKeydown at line 4831. 102 of those changes were fix/bug commits, and the other 136 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/App.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":4831}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95d4086b945a49f449c6490a7ea06a2eae153df5e5b65bb0e7bf484ff9bae19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/stores/connectionStore.ts: apps/desktop/src/stores/connectionStore.ts changed 180 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in connectionStore.useConnectionStore.loadTreeNodeChildren at line 8971. 89 of those changes were fix/bug commits, and the other 91 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8971}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca73a3b59b89431d95f9ef6f15e960a553e27fa48289ad848417c89450e8a336"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/transfer.rs: crates/dbx-core/src/data/transfer.rs changed 155 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 123 in dbx_core::data::transfer::transfer_table_inner at line 13155. 65 of those changes were fix/bug commits, and the other 90 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/transfer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer.rs"},"region":{"startLine":13155}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a0759b1575b4069af34b0b6b23afadb7d1f68bc404a49c42f938974e694f6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/AiAssistant.vue: apps/desktop/src/components/editor/AiAssistant.vue changed 68 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 241 in send at line 4100. 29 of those changes were fix/bug commits, and the other 39 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/AiAssistant.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":4100}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b2f4c733b07a4a220f694bcc73434d79689952f3dc66efd631c6c94c5fd94e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/schema/mod.rs: crates/dbx-core/src/schema/mod.rs changed 167 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in dbx_core::schema::list_tables_once at line 2729. 65 of those changes were fix/bug commits, and the other 102 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/schema/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"7219977c69360fec8616b5541070c51f018fc81b73aad7c49236fa3f4a749607"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/database_export.rs: crates/dbx-core/src/data/database_export.rs changed 82 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 152 in dbx_core::data::database_export::export_database_sql_core_inner_with_phases at line 5135. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/database_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/database_export.rs"},"region":{"startLine":5135}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ef6582544982d962f2a4252dd8c46660be9fbe1e7f7fa00a5525f32ddcc383"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/structure/TableStructureEditor.vue: apps/desktop/src/components/structure/TableStructureEditor.vue changed 96 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 126 in refreshSqlPreview at line 3511. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/structure/TableStructureEditor.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c333b63f1003b1c62a6516d548eebf79703a57cc6f65244e4e97f105930cadc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/connection/mod.rs: crates/dbx-core/src/connection/mod.rs changed 113 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in AppState::get_or_create_pool_for_session_inner_with_receipt at line 3526. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/connection/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f13aa08169640ee86b9080cf3aed3b585e37fc9a85cf83ac5f7f252d4423e07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/sidebar/ConnectionTree.vue: apps/desktop/src/components/sidebar/ConnectionTree.vue changed 93 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in ensureTreeLoadedForTarget at line 1977. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/sidebar/ConnectionTree.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"57831c8820619c1d1272e49a169c18e6a323f9cc3b182e81db8493847d26c252"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/sqlCompletion.ts: apps/desktop/src/lib/sql/sqlCompletion.ts changed 102 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in sqlCompletion.getSqlCompletionContext at line 3053. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlCompletion.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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3053}}}],"partialFingerprints":{"codehealthFindingId/v1":"45941ecb52c0bbc4217d86f22e6d30d8af2d331af11d501fb50a84de7f73793a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/query/mod.rs: crates/dbx-core/src/query/mod.rs changed 122 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in dbx_core::query::do_execute_typed at line 1916. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/query/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mod.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"424d630fb136b1c8d65637ca6a7d42d68b1e7368cdd00122ce03d70f1dd3ff0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src-tauri/src/lib.rs: src-tauri/src/lib.rs changed 156 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in dbx::run at line 1860. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lib.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc01a92e9c28ff2741665d9c22411065b9cf3c3a5a084f03d419d809f2a5eb5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-schema/src/schema_diff.rs: crates/dbx-sql-schema/src/schema_diff.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 181 in dbx_sql_schema::schema_diff::generate_schema_sync_sql_inner_with_oracle_ddl at line 6688. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-schema/src/schema_diff.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":6688}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adadbae792f3884d0701d483de2d6c121cd65a66e5ea3e86586635a40d3f7c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/sidebar/TreeItem.vue: apps/desktop/src/components/sidebar/TreeItem.vue changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in getIconInfo at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/sidebar/TreeItem.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"37287efed3a6f7f68407b170622c7a58b1d5d6bb1b21bb3292af67fb08eca51e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/objects/ObjectBrowser.vue: apps/desktop/src/components/objects/ObjectBrowser.vue changed 138 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in confirmRename at line 3111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/objects/ObjectBrowser.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"407af5877e7ac266e3f89231a648d3ebd460a502b8f819c4ce4416f2a6bd3eed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/plugins/pluginHostBridge.ts: apps/desktop/src/lib/plugins/pluginHostBridge.ts changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 178 in PluginHostBridge.dispatch at line 664. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/plugins/pluginHostBridge.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":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee2445344be464106b1339c00f7b85a0633ebdd01452e068343cc3e6a147765"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useDataGridExport.ts: apps/desktop/src/composables/useDataGridExport.ts changed 61 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in useDataGridExport.useDataGridExport.exportLocalSnapshot at line 1215. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridExport.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8aea5f9c9578e76db4c1f0043da7b313fa47da415233fb312adb9339c291c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/QueryEditor.vue: apps/desktop/src/components/editor/QueryEditor.vue changed 169 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in selectStarExpansionTargetForView at line 888. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/QueryEditor.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"57af454870873a85416b04e7826aa63b783923bcbc77540ad03263a1e7e8a713"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/table_import.rs: crates/dbx-core/src/data/table_import.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 117 in dbx_core::data::table_import::import_table_file_core at line 7844. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/table_import.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":7844}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6d1f249a86e575a1d3397b8778c9d41c2c69c5a12e4579b7183891f10f6dbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/settings/settingsTransfer.ts: apps/desktop/src/lib/settings/settingsTransfer.ts changed 84 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in settingsTransfer.parseSettingsTransferFile at line 661. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/settings/settingsTransfer.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":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e48148a32ee3d456b34052a9c0c462672b6e14d66dc552c0f8136bdf038ee7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-core/src/sql.rs: crates/dbx-sql-core/src/sql.rs changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in SqlStatementSplitter::push_chunk_with_control at line 753. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-core/src/sql.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"716af967913d100d43dd0a5ac204cb4f681685e8ad005f9a80cecdb378b4f623"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/EditorSettingsDialog.vue: apps/desktop/src/components/editor/EditorSettingsDialog.vue changed 239 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in currentAiEditConfig at line 7340. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/EditorSettingsDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7340}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b05e09d9a3f9e5b5a8333448a13db4c42ca3a12e4f427142c7c67bbbf39936"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useDataGridEditor.ts: apps/desktop/src/composables/useDataGridEditor.ts changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 114 in useDataGridEditor.useDataGridEditor.saveChanges at line 2464. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridEditor.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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec53c22871a7b0a77767f1cab1fea02fda8344ed8619fcfdc4d208e0f0172ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-types/src/models/connection.rs: crates/dbx-types/src/models/connection.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in ConnectionConfig::connection_url_with_host at line 1483. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-types/src/models/connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-types/src/models/connection.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d05672984e802938d8814635bf17dc56a284ab277447d1b13faee80a72739bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-data/src/data_grid_sql.rs: crates/dbx-sql-data/src/data_grid_sql.rs changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in dbx_sql_data::data_grid_sql::format_grid_sql_literal_with_spatial at line 2899. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-data/src/data_grid_sql.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/data_grid_sql.rs"},"region":{"startLine":2899}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dad4d09a06985d1da9fd42587cfab0eb49b770854ca9605cac96486925df1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/layout/ContentArea.vue: apps/desktop/src/components/layout/ContentArea.vue changed 181 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in focusSearch at line 1736. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/layout/ContentArea.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea6343c1f7632b9dc6566d98f87ca095d76f700f8b33760c98254d7fc262b00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/sqlStatementRanges.ts: apps/desktop/src/lib/sql/sqlStatementRanges.ts changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in sqlStatementRanges.splitSqlStatementRanges at line 411. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlStatementRanges.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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7e42259ce77ec1016b3493930896acdb7ac9bb2d8df770de4e1d83d2f18e8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/persistence/storage.rs: crates/dbx-core/src/persistence/storage.rs changed 84 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in Storage::inspect_data_migration_with_error_cache at line 1918. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/persistence/storage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cb3ff25059728cbcac217a8c087c019fe50c1f3733e4274593d4b596940021"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/useQueryEditorCompletion.ts: apps/desktop/src/components/editor/useQueryEditorCompletion.ts changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 147 in useQueryEditorCompletion.useQueryEditorCompletion.performAsyncCompletionWithResult at line 1700. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/useQueryEditorCompletion.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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c66176329145a7502c759abff4eb2059fb6e1a22de56cf4caa1853728fa0db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src-tauri/src/commands/connection.rs: src-tauri/src/commands/connection.rs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in dbx::commands::connection::test_connection_with_info_impl at line 1636. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-tauri/src/commands/connection.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d2b519f1e1c5abbfa20d4d9383cbdebf89682f56ead941de48f2ae443d54fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useSqlExecution.ts: apps/desktop/src/composables/useSqlExecution.ts changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in useSqlExecution.useSqlExecution.executeTargetSql at line 678. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useSqlExecution.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":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"6add95e88923c1d9973f6a504bcc756186e9c3ef2d7d7a1648a810aae1c98af0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/query_result_export.rs: crates/dbx-core/src/data/query_result_export.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in dbx_core::data::query_result_export::export_query_result_core_inner at line 1168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/query_result_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0643ebfef54b7f7cfeec5d74548a0a6799db584132623c5b59602030d4940022"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/table_export.rs: crates/dbx-core/src/data/table_export.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in dbx_core::data::table_export::export_table_data_core_inner at line 1691. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/table_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_export.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49ddac7470886490379439817fc4d09cea50ddb836adb5798d918a24e1de0bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-postgres/src/postgres.rs: crates/dbx-driver-postgres/src/postgres.rs changed 105 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in dbx_driver_postgres::postgres::completion_assistant_search_inner at line 4145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-postgres/src/postgres.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-postgres/src/postgres.rs"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d147d8ce5392947002caedeb982d4986d686583b24e58e6df94c5437e277567c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts: apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 144 in canvasDataGridRenderer.drawCanvasDataGrid at line 442. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.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":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4ac6efa048cd2ad8424501e25fba44650fcef792ac86633533552c1f496c94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-schema/src/table_structure_sql/create_table.rs: crates/dbx-sql-schema/src/table_structure_sql/create_table.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in dbx_sql_schema::table_structure_sql::create_table::build_create_table_sql_impl at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-schema/src/table_structure_sql/create_table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/create_table.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d678c70bb7497e8d35beea863dafc61b79ec2dc1427a80f9b1cda3a0a2ec859d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useDataGridActions.ts: apps/desktop/src/composables/useDataGridActions.ts changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in useDataGridActions.useDataGridActions.onReloadData at line 319. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridActions.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":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bf48815865dd615e6624f804be82b386d174c6b5862f26562b191de76944a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useSidebarDataOpenRuntime.ts: apps/desktop/src/composables/useSidebarDataOpenRuntime.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 134 in useSidebarDataOpenRuntime.useSidebarDataOpenRuntime.openData at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useSidebarDataOpenRuntime.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":"apps/desktop/src/composables/useSidebarDataOpenRuntime.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"19146f6337675d1d982b2ca3c14468eb5f574e90e2b2265ab730fc072ce7dc1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-mcp/src/server.rs: crates/dbx-mcp/src/server.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in DbxMcpServer::execute_query at line 2660. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-mcp/src/server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb3caf7024047552af075b2895456b2c05b9a5611e4f21775efcc559f72cc92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/settings/editorSettingsDraft.ts: apps/desktop/src/lib/settings/editorSettingsDraft.ts changed 99 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in editorSettingsDraft.normalizedDraftValue at line 224. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/settings/editorSettingsDraft.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":"apps/desktop/src/lib/settings/editorSettingsDraft.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"565b520d418a66336206bfb249fdd93272da7482714d61d94afef40d536808cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/oracle-go/main.go: agents/drivers/oracle-go/main.go changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in server.dispatch at line 1107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/oracle-go/main.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"813dfbf7cba5de4cca7e75c3d637dde7d6aa5861f76eedbd1d4208501ea716f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java: plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in DbxJdbcPlugin.handle at line 844. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb1c70a1bb32bf0c6a9525f88b156a4e215d019f2ce34cc5263018ebae5d3a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-mysql/src/mysql.rs: crates/dbx-driver-mysql/src/mysql.rs changed 77 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in dbx_driver_mysql::mysql::mysql_column_type_name at line 928. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-mysql/src/mysql.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1c9f4bb3d63411169199cad190061f518824a501243c9e66acfecb7e2f8b54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-data/src/query_result_sql.rs: crates/dbx-sql-data/src/query_result_sql.rs changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in dbx_sql_data::query_result_sql::build_query_pagination_execution_plan at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-data/src/query_result_sql.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/query_result_sql.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78ba216661381ddf9d635ecbfaadc70212579a08e4cc7611705dd94d8d66236"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/tabs/tabPresentation.ts: apps/desktop/src/lib/tabs/tabPresentation.ts changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in tabPresentation.tabDisplayTitle at line 311. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/tabs/tabPresentation.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":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86f9ca0eba3e66f9784e52aef1dcbeb3f248e00896e69de552250fb41894621"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java: agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 133 in JsonRpcServer.dispatch at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa2cb1e53dab1a72343d04be7652673b77f20f6cd8d7b36fdd10cc182363843"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/mongo/mongoCompletion.ts: apps/desktop/src/lib/mongo/mongoCompletion.ts changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in mongoCompletion.scanMongoCallArguments at line 871. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/mongo/mongoCompletion.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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"9447b50911b94f26f99954becad93d60ef8f533b67ae66e63455adf4825e3e7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-plugin-runtime/src/plugins/manifest.rs: crates/dbx-plugin-runtime/src/plugins/manifest.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in dbx_plugin_runtime::plugins::manifest::validate_contributions at line 1477. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-plugin-runtime/src/plugins/manifest.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/manifest.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e9c0c9035852a28b2348f3a2ef9c6e532dc526c43d85deced7113c5844252d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/sqlFormatter.ts: apps/desktop/src/lib/sql/sqlFormatter.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in sqlFormatter.compressSqlText at line 982. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlFormatter.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":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"6159e07a9a9c321949c9b8e814510be87924716861b842a6a15bc42aa3b322d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-mongodb/src/mongo_shell.rs: crates/dbx-driver-mongodb/src/mongo_shell.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 144 in dbx_driver_mongodb::mongo_shell::parse at line 549. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-mongodb/src/mongo_shell.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"551c42bf85d514bc88a136ece476f417f54a77ee3c0797cd7264590bf7ffac77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/persistence/cloud_sync.rs: crates/dbx-core/src/persistence/cloud_sync.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in dbx_core::persistence::cloud_sync::apply_sync_snapshot_with_selection at line 1236. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/persistence/cloud_sync.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"91336a2fe60489ffb71c97622ecb57aff2bf3cd7897b3f71d1472aea3fb4d96f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/document/DocumentBrowser.vue: apps/desktop/src/components/document/DocumentBrowser.vue changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in (anonymous) at line 681. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/document/DocumentBrowser.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ebd6197824e6830522d3890a4f1e85c706c23210f3c12b0619adf90c8e2a8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-schema/src/table_structure_sql/columns.rs: crates/dbx-sql-schema/src/table_structure_sql/columns.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in dbx_sql_schema::table_structure_sql::columns::build_column_sql at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-schema/src/table_structure_sql/columns.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/columns.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dfcd21155b1cf24efbfb200259cddc88c95f84bba8800ba17706106f8cca95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-web/src/main.rs: crates/dbx-web/src/main.rs changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dbx_web::serve at line 520. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-web/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e360e1cfea1347de453dfc135a8623df647b050257b5d0196f327fae704629"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-dialect/src/sql_dialect/table_select.rs: crates/dbx-sql-dialect/src/sql_dialect/table_select.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in dbx_sql_dialect::sql_dialect::table_select::build_table_data_select_sql_with_database at line 283. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-dialect/src/sql_dialect/table_select.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/table_select.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"030b9d4bbf04bd8ed5d4b1b651b9233a618bed5613d3d1faf9377222198209f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/redis/RedisKeyBrowser.vue: apps/desktop/src/components/redis/RedisKeyBrowser.vue changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in fetchAll at line 1854. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/redis/RedisKeyBrowser.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a68172fb98bd42c8953e2024d755a701b8e975d5a62a769d7d66b2a7ecffa19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useDataGridExtractor.ts: apps/desktop/src/composables/useDataGridExtractor.ts changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in useDataGridExtractor.useDataGridExtractor.buildRequest at line 186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridExtractor.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":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaf40ecd4940c260805e9c25f3ee4cade4c0ca7185e74c0d0b47bf5e69f465c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/redis/RedisValueViewer.vue: apps/desktop/src/components/redis/RedisValueViewer.vue changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in load at line 1817. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/redis/RedisValueViewer.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"459a95452f2ddb0c96970ea6d4bee519528d033a9f3b2eb20bf2e42be7570999"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-redis/src/lib.rs: crates/dbx-driver-redis/src/lib.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in dbx_driver_redis::parse_command_argv at line 2587. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-redis/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-redis/src/lib.rs"},"region":{"startLine":2587}}}],"partialFingerprints":{"codehealthFindingId/v1":"151f81b4a5f3e37b9bb7e064c3914747ef7dc17369d2092645bff51c64a48013"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useSidebarTreeExportRuntime.ts: apps/desktop/src/composables/useSidebarTreeExportRuntime.ts changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in useSidebarTreeExportRuntime.useSidebarTreeExportRuntime.exportTableData at line 553. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useSidebarTreeExportRuntime.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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc03f4e81398fdc806af324b739f4d9e5c701e56f438f573d60638042633ab7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/sqlParameters.ts: apps/desktop/src/lib/sql/sqlParameters.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in sqlParameters.findSqlParameterOccurrences at line 429. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlParameters.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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd8bc7685427ac868a9709c673e2aae987ad5e9b1feb4dd359198b693782b80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useNavigationTargets.ts: apps/desktop/src/composables/useNavigationTargets.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in useNavigationTargets.openTableTarget at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useNavigationTargets.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":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df92f85482d147363a9264bd55251c2c15332ae7c497da685d16f53f593d4d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-ai-provider/src/ai.rs: crates/dbx-ai-provider/src/ai.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in dbx_ai_provider::ai::stream_claude_with_tools at line 4433. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-ai-provider/src/ai.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":4433}}}],"partialFingerprints":{"codehealthFindingId/v1":"a818646fdcf0efe0abb586acaae09642d446d32f4e6f1663865e850ed2d92692"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue: apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in startExecution at line 858. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe77f436b9aaab982987fba1d2e60b2d3faeacd6260f61277bb6b789ca5f01dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/table/tableSelectSql.ts: apps/desktop/src/lib/table/tableSelectSql.ts changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in tableSelectSql.qualifiedTableName at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/tableSelectSql.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":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8132c8ce012eace71eb04cfb8c7eb99b11c8afbdde5bcc9db266307b33add2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-core/src/query_execution_sql.rs: crates/dbx-sql-core/src/query_execution_sql.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in dbx_sql_core::query_execution_sql::strip_sql_comments_and_literals_with_metadata at line 1365. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-core/src/query_execution_sql.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/query_execution_sql.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"726477845d2f6c29fca436ed9be8bb1e89d49656fb097eb9a50fe514db76bc84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-core/src/object_source_sql.rs: crates/dbx-sql-core/src/object_source_sql.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in dbx_sql_core::object_source_sql::validate_oracle_object_source at line 736. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-core/src/object_source_sql.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/object_source_sql.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c34deb2e8e45e96eee1665c0ae989b61dcba7c37da2ae53b6ae98a55c65f9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/mongo/mongoShellCommand.ts: apps/desktop/src/lib/mongo/mongoShellCommand.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in mongoShellCommand.parseMongoWriteCommand at line 912. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/mongo/mongoShellCommand.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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23775204a8aefd78cfedc7ed990fa955264bed9c1318213637cc6348678ee0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/app/openTabsPersistence.ts: apps/desktop/src/lib/app/openTabsPersistence.ts changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in openTabsPersistence.restoreOpenTabsArray at line 318. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/app/openTabsPersistence.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":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"263e7165e1417e21d721f9714f7bae1101804aedf24a6e3429e0d78645f413f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/import/TableImportDialog.vue: apps/desktop/src/components/import/TableImportDialog.vue changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in startBatchImport at line 1701. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/import/TableImportDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf58a956f0da6c92fe8896ca74f8d29092f075b04f01f0adfe75adabb6ba400d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/transfer/DataTransferDialog.vue: apps/desktop/src/components/transfer/DataTransferDialog.vue changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in loadConfigIntoForm at line 1249. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/transfer/DataTransferDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f634c146f5ca46f577d3648cf8132bd271040abbbad2ede786b7ecfedc685cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sidebar/treeNodeIcon.ts: apps/desktop/src/lib/sidebar/treeNodeIcon.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in treeNodeIcon.getTreeNodeIconInfo at line 10. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sidebar/treeNodeIcon.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":"apps/desktop/src/lib/sidebar/treeNodeIcon.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"14da126925dac331b8adb7b8af7938e082b36e8db736cce449b707465c9a09a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/sql_file_import.rs: crates/dbx-core/src/data/sql_file_import.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in dbx_core::data::sql_file_import::execute_sql_file_paths_inner at line 999. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/sql_file_import.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"395a6835fc192c2a91a8e166ba9233c4249066685ed6fd05785b7fb64d00117d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/table/tableTree.ts: apps/desktop/src/lib/table/tableTree.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in tableTree.buildGroupedObjectTreeNodes at line 1055. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/tableTree.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":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"26011b82a413047be686a6159d0282f2fbdc9c479224317e9178f06667720814"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/schema/schemaDiff.ts: apps/desktop/src/lib/schema/schemaDiff.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in schemaDiff.convertToSchemaDiffObjects at line 708. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/schema/schemaDiff.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":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e50b31a0e59c4e62d70a4e4e7aaae0a07755b7c797cdeb86750f936b6d18fe8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs: crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in dbx_sql_schema::table_structure_sql::column_alter::build_single_column_alter_sql at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a9bcaec7045ea80f77c89c5bc40e955c4bf70f8d5211e5f8d55ab7aa2bd4f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/queryEditorSqlExtensions.ts: apps/desktop/src/components/editor/queryEditorSqlExtensions.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in queryEditorSqlExtensions.configureQueryEditorSqlExtensions at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/queryEditorSqlExtensions.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":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43ad248ae6403a314f651f9088730bdbfdaf2413251d09c54213b99cad27182"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/editor/shortcutRegistry.ts: apps/desktop/src/lib/editor/shortcutRegistry.ts changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in shortcutRegistry.computeNormalizedShortcutSettings at line 1018. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/shortcutRegistry.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":"apps/desktop/src/lib/editor/shortcutRegistry.ts"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"a719005b1e9fe1e04fbbf06d93103f3e9f6deca4be7c3af7b34b641ea340d932"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/connection/connectionUrl.ts: apps/desktop/src/lib/connection/connectionUrl.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in connectionUrl.parseConnectionUrl at line 776. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/connection/connectionUrl.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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a9c775e5f045842efdb44a58a74d425ff883b97682ded6edc4063c4fc15fcb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-sqlserver/src/sqlserver.rs: crates/dbx-driver-sqlserver/src/sqlserver.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dbx_driver_sqlserver::sqlserver::sqlserver_completion_assistant_sql at line 2755. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-sqlserver/src/sqlserver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-sqlserver/src/sqlserver.rs"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94d3df43e41ad80273a5ff232bddb8bafa5a30a2c5120a19881caa4e9e3f215"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts: apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in useQueryEditorDiagnostics.useQueryEditorDiagnostics.refreshSemanticDiagnostics at line 357. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/useQueryEditorDiagnostics.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":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"293b980a2f816a2c90336be1888001dd09efe4662e038f57b18b50c59d1a6129"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/ai/ai.ts: apps/desktop/src/lib/ai/ai.ts changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in ai.buildAiContext at line 906. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/ai/ai.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":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ba61a54dd7de3bc702281af733b6114b4c3e1fd060272ddf48c9aba5d346c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/connection/connectionUrlBuilder.ts: apps/desktop/src/lib/connection/connectionUrlBuilder.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in connectionUrlBuilder.buildSpecialJdbcUrl at line 372. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/connection/connectionUrlBuilder.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":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad5f797afa360dfc20b3791145c3b7935bdcf8b2886c0a159840ec7124c70b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.ts: apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in dataGridCopyExtractor.normalizeDataGridExtractorOptions at line 239. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.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":"apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"28881e6b6fbabc79dc06bf77f9544dc85facd0be1a1b97fdd3a88d0102e62be0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-agent/src/agent_driver.rs: crates/dbx-driver-agent/src/agent_driver.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in AgentDriverClient::call_typed_with_timeout_and_cancel at line 2259. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-agent/src/agent_driver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_driver.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"933bf3c379583248792de00702fee471d6e27bb096d16c9cefe9008a943e0517"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/table/tableStructureEditorState.ts: apps/desktop/src/lib/table/tableStructureEditorState.ts changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in tableStructureEditorState.parseExtraToColumnExtra at line 884. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/tableStructureEditorState.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":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd69a655ca0d1ff1e3299ca403c5dc85dbcd0ef2f41eb6d96badeb8e3b85ff1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/dataGenerate.ts: apps/desktop/src/lib/dataGrid/dataGenerate.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in dataGenerate.buildDefaultGeneratorParams at line 1343. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGenerate.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":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b753a69679b91cca31fd37f34a097f741d0aa658825890220b0d19dfab9d5c1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/editor/keyboardShortcuts.ts: apps/desktop/src/lib/editor/keyboardShortcuts.ts changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in keyboardShortcuts.eventToShortcut at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/keyboardShortcuts.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":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86662635a23e25b27dadc392c9e4dbc7309da5138c54d560d756c5e9e1c7a88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/diff/SchemaDiffDialog.vue: apps/desktop/src/components/diff/SchemaDiffDialog.vue changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in applySchemaDiffSession at line 727. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/diff/SchemaDiffDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f994da02bee0142601d61dfeae8844cce339bed27571d85f656fa62f4044380"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/app/[lang]/drivers/DriversClient.tsx: docs/app/[lang]/drivers/DriversClient.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in DriversClient.DriversClient at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- docs/app/[lang]/drivers/DriversClient.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"504e06d83bb17032ecacfb664067eed8f2a39b3af199e329336eccd99b5d9ab1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/plugins/PluginWorkbenchHost.vue: apps/desktop/src/components/plugins/PluginWorkbenchHost.vue changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in onHostFileDrop at line 427. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/plugins/PluginWorkbenchHost.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9febe3187fa07e432e5bb11b1994b80cdad6a91459f6322ff4f3b18c532660f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useAppUpdater.ts: apps/desktop/src/composables/useAppUpdater.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in useAppUpdater.useAppUpdater.checkUpdates at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useAppUpdater.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":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a501ee6a479f80024e43186c8b872b1939e09fc5d92dac3c47305c5309d1ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/kingbase-go/main.go: agents/drivers/kingbase-go/main.go changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in server.dispatch at line 372. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/kingbase-go/main.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f71907410b796a6d6d053fdbdff86d7bac87a2b175cc88d6c2835add561b0be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useExportTracker.ts: apps/desktop/src/composables/useExportTracker.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in useExportTracker.useExportTracker.updateDataTransferTask at line 931. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useExportTracker.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":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"088c9d74bfca07d47a76090c7c58f50142b08a961331458345d6f26286bdd0d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-schema/src/db_admin_sql.rs: crates/dbx-sql-schema/src/db_admin_sql.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in dbx_sql_schema::db_admin_sql::build_duplicate_table_structure_sql at line 868. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-schema/src/db_admin_sql.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/db_admin_sql.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"e142f388fdff4dbc017196ba994238ed33ee52d12cb94960c6ce0cbce10c252c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java: agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in OceanBaseOracleAgent.formatDataType at line 2751. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"257da97d4e53f7b6859a15ea5260ad96dfb4f31152887e5c162fedff0cfc3171"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/semantic/tokens.ts: apps/desktop/src/lib/sql/semantic/tokens.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in tokens.tokenizeSqlSemantic at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/semantic/tokens.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":"apps/desktop/src/lib/sql/semantic/tokens.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2984aa7063d0074b75f5657435843ed3ed401b02c1716a29a919e0124f27b160"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sidebar/sidebarSearchTree.ts: apps/desktop/src/lib/sidebar/sidebarSearchTree.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in sidebarSearchTree.filterSidebarTreeWithMatcher at line 486. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sidebar/sidebarSearchTree.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":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed44dd34955f32edbf2759a3b307b4740f74891f859a9323cf5b465a51021edd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/sdk/dev-host/server.mjs: plugins/sdk/dev-host/server.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in server.createMockHost.bridge at line 267. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- plugins/sdk/dev-host/server.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3d9e76f1ecec961925b8242cdd13378947b62267885c1be7eee1997d9022b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/admin/ProcessListPanel.vue: apps/desktop/src/components/admin/ProcessListPanel.vue changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in load at line 345. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/admin/ProcessListPanel.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9d93959806b2d738269819c9e666bcfdc01b741b8d51c0fcf994398e2aa956"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/ai/agent_tools.rs: crates/dbx-core/src/ai/agent_tools.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dbx_core::ai::agent_tools::execute_get_columns at line 976. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/ai/agent_tools.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_tools.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8ec6ab3f98034b92d71d625ce29facad46e810d1640c5c0aaf3cff618b88b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-schema/src/table_structure_sql/indexes.rs: crates/dbx-sql-schema/src/table_structure_sql/indexes.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in dbx_sql_schema::table_structure_sql::indexes::build_create_index_statements at line 577. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-schema/src/table_structure_sql/indexes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/indexes.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff632d4740b2185bb0fa4b26931298d3d4d2816d934006f4f26e14cdc4b4338"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/query/mongo_ops.rs: crates/dbx-core/src/query/mongo_ops.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in dbx_core::query::mongo_ops::execute_mongo_command_core at line 1206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/query/mongo_ops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/mongo_ops.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfc28a0db13b272402d3f8bc08f2a232cf73b4398d3d5b955a4cda0385139cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/export/ExportProgressPopover.vue: apps/desktop/src/components/export/ExportProgressPopover.vue changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in rowsText at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/export/ExportProgressPopover.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f9453d1d4dfedcd0ae5b6ad03eb9a5192d8bf67c8ca49371ac7c5cf3dad436"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useDataGridLargeValues.ts: apps/desktop/src/composables/useDataGridLargeValues.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in useDataGridLargeValues.useDataGridLargeValues.hydrateVisibleLargeValuePreviews at line 292. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridLargeValues.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":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"541cf681f463ac209dd30220478c7fbded3b1184ed789f437732c5bca94b9502"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/ui-preview/record.mjs: .github/ui-preview/record.mjs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in main at line 593. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- .github/ui-preview/record.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/record.mjs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5e425d7fff29e59ac57ecfb51a91349693adeed79a80a3fd199877016279c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useSchemaDiffSession.ts: apps/desktop/src/composables/useSchemaDiffSession.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in useSchemaDiffSession.runSchemaDiffSession at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useSchemaDiffSession.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":"apps/desktop/src/composables/useSchemaDiffSession.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84edfa993916e9f16742400ddf733baf835ea691d50d96407c2990407603a1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-mongodb/src/mongo_driver.rs: crates/dbx-driver-mongodb/src/mongo_driver.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dbx_driver_mongodb::mongo_driver::json_filter_value_to_bson at line 3397. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-mongodb/src/mongo_driver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b38fa59de4203837854e01e126f1f2ce156d46eebbaa37fa65e7687788c73b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/ai/agent_loop.rs: crates/dbx-core/src/ai/agent_loop.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in dbx_core::ai::agent_loop::run_agent_loop_inner at line 210. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/ai/agent_loop.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_loop.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53ac96fadd7b745fe8a6e87b0d65a688b5286be4fe2b456b60f4139abb55dc7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts: apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in sidebarActiveTabTarget.matchesTarget at line 312. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.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":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"985db66aea87baf95702f787432887d8e380c549d5de0926f46dde1579c37dc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-web/src/routes/connection.rs: crates/dbx-web/src/routes/connection.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in dbx_web::routes::connection::run_prepared_temporary_connection_test at line 379. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-web/src/routes/connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7e1a36878c695a5028959c8ee296ecdf95b6f6577ba31cc97fbe7ed5034575"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-drivers/src/db/ssh_tunnel.rs: crates/dbx-drivers/src/db/ssh_tunnel.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in dbx_drivers::db::ssh_tunnel::connect_and_authenticate at line 439. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-drivers/src/db/ssh_tunnel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/ssh_tunnel.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f0d9d7ca16023b98d7159fa0c74abd6823a7364a49d52e0c0e119a5c7de8b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/sdk/dev-host/browser-bridge.mjs: plugins/sdk/dev-host/browser-bridge.mjs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in browser-bridge.installBridge at line 2. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- plugins/sdk/dev-host/browser-bridge.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/browser-bridge.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"60081ff84df2c3f44d2a00eb3dce7d4c4cc015b63582d44a69b00788ab1ceaea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/safety/production_safety.rs: crates/dbx-core/src/safety/production_safety.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in dbx_core::safety::production_safety::append_sql_target_safety_text at line 1025. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/safety/production_safety.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/safety/production_safety.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d5ab0c0ce6684c7d2b4f039367fd4dfa0019864fa8457e5ea175da2158192e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sidebar/treeNodeClick.ts: apps/desktop/src/lib/sidebar/treeNodeClick.ts changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in treeNodeClick.treeNodeRowDoubleClickAction at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sidebar/treeNodeClick.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":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bf81b5adbb03cf73a85b98278d943446c687741d742cea1458ebc5de9b472a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-agent/src/agent_service.rs: crates/dbx-driver-agent/src/agent_service.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in dbx_driver_agent::agent_service::download_with_progress at line 2177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-agent/src/agent_service.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb77c18b5b6d9b59fb997fbea2d238159ce4c9b2e569e99f6694a526649b491"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/objects/ObjectSourceDialog.vue: apps/desktop/src/components/objects/ObjectSourceDialog.vue changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in loadSource at line 185. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/objects/ObjectSourceDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectSourceDialog.vue"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd318b61212a8ee4f3ae54b9f03ab781dba91b199607d1b0bafdf38b3d657e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/editor/codemirrorSqlDialect.ts: apps/desktop/src/lib/editor/codemirrorSqlDialect.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in codemirrorSqlDialect.createDbxCodeMirrorSqlDialect at line 381. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/codemirrorSqlDialect.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":"apps/desktop/src/lib/editor/codemirrorSqlDialect.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedf890a85b9a4d0206adaf2ce0dcfe78639c21ed01e7c9991978220143b66b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java: agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DamengAgent.queryConstrainedTables at line 606. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e028383e57dabd7d8dac9c17d7efdd5132d05f1963caba6d58faf262d3783e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src-tauri/src/commands/mcp_bridge.rs: src-tauri/src/commands/mcp_bridge.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in dbx::commands::mcp_bridge::start at line 341. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/mcp_bridge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/mcp_bridge.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"280ec6df42cfbc1437753cd17350cb8d49cf9e0a93f45faa6859bede79379e0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useDialogSources.ts: apps/desktop/src/composables/useDialogSources.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in useDialogSources.useDialogSources at line 165. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDialogSources.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":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3221a808366c37a7a1f81dcafc141c034c2b239122ff223898af8052a2343817"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/kingbase-go/kingbase_metadata.go: agents/drivers/kingbase-go/kingbase_metadata.go changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in server.listIndexesWithoutOrdinality at line 2227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/kingbase-go/kingbase_metadata.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca42794fd7d818bc9e3c5720784b199390afa785d88a2a3c0af6c1fa7c882b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/database/jdbcDialect.ts: apps/desktop/src/lib/database/jdbcDialect.ts changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in jdbcDialect.connectionObjectTreeNodeSchema at line 394. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/database/jdbcDialect.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":"apps/desktop/src/lib/database/jdbcDialect.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c0bfd5d0b1ad2579a3f29992eeadab42c366e505abf775f73ebd6a298bfa3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/columnFormatter.ts: apps/desktop/src/lib/dataGrid/columnFormatter.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in columnFormatter.normalizeColumnFormatter at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/columnFormatter.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":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc2d2b73a4a8c4aab47db27349ea881713f36d33708d5e0fe64131400c4d332"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/semantic/model.ts: apps/desktop/src/lib/sql/semantic/model.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in model.buildCursorIntent at line 988. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/semantic/model.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":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66651c066170075a77e87561fbaf1189348b27d6c20b9a90bafba085a87b1e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/nacos/NacosAdminConsole.vue: apps/desktop/src/components/nacos/NacosAdminConsole.vue changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in selectConfig at line 1137. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/nacos/NacosAdminConsole.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79a5c7f2d8ad1c6a84c9209765eb23ddd741ed1d87355a1f7aa1035d9ece42d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-agent/src/agent_connection.rs: crates/dbx-driver-agent/src/agent_connection.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dbx_driver_agent::agent_connection::agent_connect_params_with_role at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-agent/src/agent_connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_connection.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f4b8e60231fd50001e6f1e0fba3e43c8d67315bbf5af56ef278f63d24c8657"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/database/databaseObjectCapabilities.ts: apps/desktop/src/lib/database/databaseObjectCapabilities.ts changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in databaseObjectCapabilities.normalizeSidebarObjectKind at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/database/databaseObjectCapabilities.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":"apps/desktop/src/lib/database/databaseObjectCapabilities.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c0e544ad9ad8a79eab1ffa5b795b4975fbfb4900caf8c53d78014b54d9a69c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/admin/DatabaseUserAdmin.vue: apps/desktop/src/components/admin/DatabaseUserAdmin.vue changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in execute at line 595. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/admin/DatabaseUserAdmin.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1215d8446e2391be71fcb42cd4ff525531c862d138ffe9e46535adb4d0f2ccc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/scheduled_backup/engine.rs: crates/dbx-core/src/scheduled_backup/engine.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in BackupService::export_job at line 154. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/scheduled_backup/engine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/engine.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"123d6919febcb097562e1940fa193d82ea868ceeb29d48a913d6b2253aa0d053"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/diff/DataCompareDialog.vue: apps/desktop/src/components/diff/DataCompareDialog.vue changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in applyDataCompareConfig at line 547. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/diff/DataCompareDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecc1e39f5b24f0d056e818b5c375b77ff7d4944d5d83698f9053ff0b7c10283"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/layout/printer.ts: apps/desktop/src/lib/sql/layout/printer.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in printer.printRuleElement at line 254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/layout/printer.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":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3f7975f74cb6863db1c8eac4a4ad998ce936020fc368aeea5d42fdec41903b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts: apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in dataGridContextMenu.createDataGridColumnContextMenuItems at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridContextMenu.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":"apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d9728651865bf7c580bf1ce3359dad7c80d22ca578c8e3c3e6120ca30cc75c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/plugins/frontendPlugin.ts: apps/desktop/src/lib/plugins/frontendPlugin.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in frontendPlugin.buildPluginConnectionConfig at line 270. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/plugins/frontendPlugin.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":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43de729a86cff9dacc5c158c5672fa16f882f6cdb57c173c4bbb6d763f0dadb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/sqlAnalysis.ts: apps/desktop/src/lib/sql/sqlAnalysis.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in sqlAnalysis.analyzeEditableQueryEditability at line 249. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlAnalysis.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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"13235192ee3f431a0d59fe9094a49cb78103be07e5426ed373a036a52e20ad03"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/ddlDisplay.ts: apps/desktop/src/lib/sql/ddlDisplay.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in ddlDisplay.collectDdlStatementNameTargets at line 208. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/ddlDisplay.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":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b24c84c5ce980bac52a6cd872e2d6fdbc768189650d6257eae2278a11300f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/transfer_runner.rs: crates/dbx-core/src/data/transfer_runner.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in dbx_core::data::transfer_runner::run_transfer at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/transfer_runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer_runner.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8572812359cef45266d9667fe392f3a011f0b0feedfc8a32cfaf62f419723f3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/database/dbAdminSql.ts: apps/desktop/src/lib/database/dbAdminSql.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in dbAdminSql.buildDuplicateTableStructurePlan at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/database/dbAdminSql.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":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae9af852ae69727a9779ca4135a59071bf602b2a820e0ac50207c51d2a9f4f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-elasticsearch/src/lib.rs: crates/dbx-driver-elasticsearch/src/lib.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in dbx_driver_elasticsearch::es_send_page at line 1233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-elasticsearch/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8062a2b5384257979cecd40d685aa848acb1d554b89e00aa1355ae3bdebb3dd7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/transfer/ddl_plan.rs: crates/dbx-core/src/data/transfer/ddl_plan.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in dbx_core::data::transfer::ddl_plan::prepare_table_ddl at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/transfer/ddl_plan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/ddl_plan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae43176994b72ea0ac52dff3e61d37b7ef01854c62c7d12e1692f9ab8d713f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/diff/SchemaDiffConfigStep.vue: apps/desktop/src/components/diff/SchemaDiffConfigStep.vue changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in (anonymous) at line 552. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/diff/SchemaDiffConfigStep.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff625c7519f6267daa44d4c4daf069f3e2a5d7e39508f8585ced73844e18429"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/insertValueHints.ts: apps/desktop/src/lib/sql/insertValueHints.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in insertValueHints.selectProjectionStarts at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/insertValueHints.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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e39d5c779e33f0ccec99336de5df95af67151c6aac7002e2690e1f81299876"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/sqlRisk.ts: apps/desktop/src/lib/sql/sqlRisk.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in sqlRisk.sqlSafetyText at line 252. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlRisk.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":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04baf136e9b6578e7bc6438b4ac2a68344d5443d89397b73c9592150979d4b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue: apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in resetFromCatalog at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b3991c0172a4616d577bf57788680fbe868a7a4bbb2c84b6588e14af94af38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/data_compare.rs: crates/dbx-core/src/data/data_compare.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in dbx_core::data::data_compare::build_sampling_select_sql at line 1890. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/data_compare.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd461bc84e333be3309773e9d939e689187f6c1dec5b30da32890b32dedbdb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-core/src/sql_analysis.rs: crates/dbx-sql-core/src/sql_analysis.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Analyzer::visit_expr at line 1869. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-core/src/sql_analysis.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_analysis.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"049baf0dfcbff6664a625188f0d60482f15e671499923117f72c4f2c8ce287de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/useQueryEditorHover.ts: apps/desktop/src/components/editor/useQueryEditorHover.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in useQueryEditorHover.useQueryEditorHover.resolveSqlHoverTooltip at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/useQueryEditorHover.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":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3adb399fe47a8a256f46e96720176a342897ef5e261b25c040b16227afddeab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/semantic/diagnostics.ts: apps/desktop/src/lib/sql/semantic/diagnostics.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in diagnostics.buildSqlSemanticDiagnostics at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/semantic/diagnostics.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e1300534dbe8f38fd12214959800a2ac623dee9808af970d986aa8ca9159b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/app/documentStoreProvider.ts: apps/desktop/src/lib/app/documentStoreProvider.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in documentStoreProvider.buildDocumentFilterCondition at line 560. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/app/documentStoreProvider.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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b8f2bd8d653f9a7b14928405deb774af3b6f48aee8e275c1a66a85da4e5283"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java: agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in KafkaAgent.peekMessages at line 1699. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"68783ce56844130731b4098b9fb9e26bcc85f31f77622396010f4307fbd4110a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/common/src/main/java/com/dbx/agent/DdlBuilder.java: agents/common/src/main/java/com/dbx/agent/DdlBuilder.java changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in DdlBuilder.buildTableDdl at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/common/src/main/java/com/dbx/agent/DdlBuilder.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc06289dad190946a01aecb312e067b722ee0c56c4b756f64936dd19ebac4b6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/dataGridPaintTheme.ts: apps/desktop/src/lib/dataGrid/dataGridPaintTheme.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in dataGridPaintTheme.resolveDataGridPaintTheme at line 270. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridPaintTheme.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":"apps/desktop/src/lib/dataGrid/dataGridPaintTheme.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d612c854f4d558a336e0a02074221e0c433e7ea0b0103360661751737523ad08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-schema/src/table_structure_sql/column_format.rs: crates/dbx-sql-schema/src/table_structure_sql/column_format.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in dbx_sql_schema::table_structure_sql::column_format::column_definition at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-schema/src/table_structure_sql/column_format.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_format.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bee951abf49806840bdbe8109e5d8edbb4d47b018658f5f9c806a9cb5208df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/backend/errorUtils.ts: apps/desktop/src/lib/backend/errorUtils.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in errorUtils.isBackendError at line 129. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/backend/errorUtils.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":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"753066637730352d73f350faea579c083ec711dfaa23149e53acfef99be06558"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/metadata/tableMetadataCache.ts: apps/desktop/src/lib/metadata/tableMetadataCache.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in tableMetadataCache.loadTableMetadata at line 361. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/metadata/tableMetadataCache.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":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e84006ed7ca658698838b0ebb4481dd931b2820f4623bf8e86838adf2cd5a94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/table/tableVGroup.ts: apps/desktop/src/lib/table/tableVGroup.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in tableVGroup.findTableVGroupContainerNode at line 629. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/tableVGroup.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":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3345148bf7d1e2b9b944ba2061924c17b6bb7cc3887f578199cb16ac2560a34d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/schema/agent_metadata_fixture.py: crates/dbx-core/src/schema/agent_metadata_fixture.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in agent_metadata_fixture.handle at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/schema/agent_metadata_fixture.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":"crates/dbx-core/src/schema/agent_metadata_fixture.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32f3b1506d12707c92ab834e7e7bcf06860feb3b630df1511eec5be3316361d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts: apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in dataGridCellCoercion.coerceDataGridCellValue at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridCellCoercion.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":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd47d8a34e410dbf21e7c5aa0c370603f6daed67fccf60a97512bd0089c9b047"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue: apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in (anonymous) at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1fcf350f45bf5c5e448b8b9b05868395c7a9128df8afc9ef480dff068197c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-schema/src/table_structure_sql/triggers.rs: crates/dbx-sql-schema/src/table_structure_sql/triggers.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in dbx_sql_schema::table_structure_sql::triggers::build_trigger_sql_with_operations at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-schema/src/table_structure_sql/triggers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/triggers.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6980f58aa06d4c5731c55e879b48852fb796fb5ab6b019f8a3b78a1adf802a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/i18n/index.ts: apps/desktop/src/i18n/index.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in index.localeFromLanguageTag at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/i18n/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/index.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2d0c717c109ca483193b5234b0470a00650f7b652034d69e42de2543524e86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useTauriEvents.ts: apps/desktop/src/composables/useTauriEvents.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in useTauriEvents.useTauriEvents.setupTauriListeners at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useTauriEvents.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":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9690a003a2e5efbda21d55cc7197f209f45730d9a978d9d537c05445790da4a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java: agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AbstractJdbcAgent.finishPooledRequest at line 421. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa58cdbe511e369c3447a4ef61f20ebb8370df7f78a762c957dffe67a6851a4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/transfer/structure_plan.rs: crates/dbx-core/src/data/transfer/structure_plan.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in dbx_core::data::transfer::structure_plan::build_structure_preview at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/transfer/structure_plan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/structure_plan.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b5d4347e07ead6c834036e5ab2aa1fe1430a563522e0b08792062e3ab07f2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-plugin-runtime/src/plugins/installer.rs: crates/dbx-plugin-runtime/src/plugins/installer.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in PluginPackageInstaller::install_bytes_locked at line 529. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-plugin-runtime/src/plugins/installer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60e6395d381f9178154de8fb4fcdb861a23de75973f5d3794e7ca95341eb484"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/query/document_ops.rs: crates/dbx-core/src/query/document_ops.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in dbx_core::query::document_ops::find_documents_core_with_total at line 479. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/query/document_ops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2b52615be6a3ccfefd35d024224a856b592162970e5294571590412bb6e262"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/mongo/mongoDocumentValues.ts: apps/desktop/src/lib/mongo/mongoDocumentValues.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in mongoDocumentValues.parseMongoDocumentInputValue at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/mongo/mongoDocumentValues.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":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"378471ba4e4d210234916fbb39c336cec6afc58bb50c9111327d782d80e04510"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/objects/DatabaseBrowser.vue: apps/desktop/src/components/objects/DatabaseBrowser.vue changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in refresh at line 463. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/objects/DatabaseBrowser.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"7600a61c72f0f6aa5790e793fbebd7dc488a04ccc9e3e5ea18b0d1b02bac625a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useFileDrop.ts: apps/desktop/src/composables/useFileDrop.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in useFileDrop.useFileDrop.setupFileDrop at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useFileDrop.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":"apps/desktop/src/composables/useFileDrop.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0297810ffd7b99647681c842acb4b01c60902fe2e868d0afa661506cfa14f79a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts: apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in codeSnapshot.snapshotElementToPng at line 343. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/codeSnapshot/codeSnapshot.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":"apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"590e44e128f1b2a49774774d884037d63349bc795ba7f5198ca5bca70862332f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts: apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in useQueryEditorObjectNavigation.useQueryEditorObjectNavigation.onEditorMouseDown at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/useQueryEditorObjectNavigation.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":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed65424ac55e8cb0b4bcec851512b914851412511a3af34293705e7710c522a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/table/objectBrowserRows.ts: apps/desktop/src/lib/table/objectBrowserRows.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in objectBrowserRows.buildObjectBrowserRows.rows at line 185. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/objectBrowserRows.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":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10ecf7a630878afd060557e2cbb616215bae30dec3175604615661df39b874b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts: apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in scheduledDatabaseBackup.normalizeDatabaseBackupSchedule at line 291. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/backup/scheduledDatabaseBackup.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":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c22528454aeffc0fa27b578119583c04e2598d7acbe997b754a385eec5d48b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/table/tableSqlTemplates.ts: apps/desktop/src/lib/table/tableSqlTemplates.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in tableSqlTemplates.columnPlaceholderValue at line 202. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/tableSqlTemplates.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":"apps/desktop/src/lib/table/tableSqlTemplates.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cb456ccc2b81defcd89d9c5374b8eebe533a1a2868ba00e7d8895ea6024add"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/sqlVariables.ts: apps/desktop/src/lib/sql/sqlVariables.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in sqlVariables.readValueEnd at line 175. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlVariables.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":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"57760d3e0f1388ccb390c8356e1f648926559c1fdcc943e0648d518041144360"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/mqtt/MqttAdminConsole.vue: apps/desktop/src/components/mqtt/MqttAdminConsole.vue changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in saveSubscription at line 348. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/mqtt/MqttAdminConsole.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ba91bc169f07ab555f65faf455d7a6893870e71f8b25602ad46e255e10ea40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/xugu/main.go: agents/drivers/xugu/main.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in server.getColumns at line 2749. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/xugu/main.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"af389bac904fb434ddbadea5e6bfe6f5adfc8ba01968b57ab672c675a064370f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useCellDetailEditor.ts: apps/desktop/src/composables/useCellDetailEditor.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in useCellDetailEditor.useCellDetailEditor.create at line 239. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useCellDetailEditor.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":"apps/desktop/src/composables/useCellDetailEditor.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4244aa5691862b96f4dc54958173db57e1d7e7368d9b37d366ca8ad95e115c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/layout/primitives.ts: apps/desktop/src/lib/sql/layout/primitives.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in primitives.renderInline at line 464. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/layout/primitives.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":"apps/desktop/src/lib/sql/layout/primitives.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d772429af1b7e07dea7c4743d21d1b6e8a66e9413e7a9cf084e55c8243572a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/table/tableImport.ts: apps/desktop/src/lib/table/tableImport.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in tableImport.suggestDataTypeForGenerator at line 387. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/tableImport.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":"apps/desktop/src/lib/table/tableImport.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5153192c760c6ae7ac775dbb636c888f27486206dfb6db8670fc7a777f100b31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/grid/DataGridConditionEditor.vue: apps/desktop/src/components/grid/DataGridConditionEditor.vue changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in (anonymous) at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/grid/DataGridConditionEditor.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridConditionEditor.vue"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29ea223ec2abe6fafeba22d78089f6e33d6e0c6016ba6935623ff498127d6a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java: agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in MongoAgent.configureBuilder at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"93aea64c2a7d9e9b5eb23de2dea3302cd4b3c1a292b836687620aea133981550"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/semantic/completion.ts: apps/desktop/src/lib/sql/semantic/completion.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in completion.sqlCompletionContextFromSemantic at line 338. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/semantic/completion.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":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb59cf537f66ee37a88614b9137d1924b23447650f85d3855bd6f3688c236d45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java: agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SqlServerLegacyAgent.shouldFallbackToJtds at line 326. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e972e60156202a36d7c67e65799c06da46ac6146cbe5b03a5c873572465b9ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useSidebarTableMutationRuntime.ts: apps/desktop/src/composables/useSidebarTableMutationRuntime.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in useSidebarTableMutationRuntime.useSidebarTableMutationRuntime.runDangerOperation at line 463. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useSidebarTableMutationRuntime.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":"apps/desktop/src/composables/useSidebarTableMutationRuntime.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"107f3787007bed37878b892d4104f56e8d6eaa44d88dfed193482c2791fe2657"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/redis/redisKeyTree.ts: apps/desktop/src/lib/redis/redisKeyTree.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in redisKeyTree.buildRedisKeySnapshotCooperatively at line 333. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/redis/redisKeyTree.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":"apps/desktop/src/lib/redis/redisKeyTree.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"065a079e978055482fd1910f6ea22ca581777fe56c3b07751232668787389e4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/stores/savedSqlStore.ts: apps/desktop/src/stores/savedSqlStore.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in savedSqlStore.useSavedSqlStore.updateFileExecutionTarget at line 651. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/stores/savedSqlStore.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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c8e2881bf29cefa8cffaaea056153bb06fdb9841fbdc94487200510a84b95a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/binaryCellDownload.ts: apps/desktop/src/lib/dataGrid/binaryCellDownload.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in binaryCellDownload.binaryCellDisplayText at line 259. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/binaryCellDownload.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":"apps/desktop/src/lib/dataGrid/binaryCellDownload.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3dc8dbc7b135e379374aa9d66c552dafdbb373903e90818ac197967f4d9ac6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java: agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in JdbcExecutor.executePage at line 560. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f250125a7e557a1700bacdc28c4640206d480e838e68bed5545cbd43d1aba587"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/script_generator.rs: crates/dbx-core/src/data/script_generator.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in dbx_core::data::script_generator::wrap_if_not_exists at line 405. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/script_generator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/script_generator.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf597f27a240de59ccf2e9a7f0f167664eb3d03c34c75dd46847b842cb890a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/database/productionSafety.ts: apps/desktop/src/lib/database/productionSafety.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in productionSafety.sqlTargetSafetyText at line 276. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/database/productionSafety.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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"453cd597c51cce4c3def656d465a11c5eb24857dfa929599dfd2fb042f76036a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-driver-support/src/ssh_config.rs: crates/dbx-driver-support/src/ssh_config.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SshConfigLoader::parse_lines at line 343. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-driver-support/src/ssh_config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/ssh_config.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0176055f148f250fcfc6cc3406c6391a6b521c514bd2388dba3d7dfabf7cb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useDataGridConditionEditor.ts: apps/desktop/src/composables/useDataGridConditionEditor.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in useDataGridConditionEditor.useDataGridConditionEditor.loadSuggestions at line 558. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridConditionEditor.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":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf4211983ea27ad65ca8f256ef96dda6e8053598c9cfa6d99ecd80359ad427c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/QueryEditorContextMenu.vue: apps/desktop/src/components/editor/QueryEditorContextMenu.vue changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in (anonymous) at line 158. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/QueryEditorContextMenu.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditorContextMenu.vue"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f5d231a9c9586ae8b56a7bd7c3ebe3560a26a87927e0c1e93cf4d7d1250093"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src-tauri/src/commands/list_sql_files.rs: src-tauri/src/commands/list_sql_files.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in dbx::commands::list_sql_files::scan_sql_files_with_diagnostics at line 254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/list_sql_files.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/list_sql_files.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7320e2b22f46cc7cbd7f2dc5e5883ed4cd26e878e45cab7704c11c0c99bcb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/editor/queryEditorTableDrop.ts: apps/desktop/src/lib/editor/queryEditorTableDrop.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in queryEditorTableDrop.parseTableReferencePayload at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/queryEditorTableDrop.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":"apps/desktop/src/lib/editor/queryEditorTableDrop.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"664dd0201705ae46a6d10add695bfa1f32bed96a7af5bf303c572f056e165dbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mongo-shell/src/json.ts: packages/mongo-shell/src/json.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in json.shellConstructorToExtendedJson at line 638. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- packages/mongo-shell/src/json.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":"packages/mongo-shell/src/json.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc37df7f75d3526d2177e385a3256d0c4f6239a17982a47c4d195bbbd6f9888"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/mongodb_import_export.rs: crates/dbx-core/src/data/mongodb_import_export.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in dbx_core::data::mongodb_import_export::export_mongodb_query_inner at line 2431. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/mongodb_import_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2856432df17d0ef71e73abd93fa6f08b6206cac2c9860eb43d06e79aeb677c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/mq/MessageBrowser.vue: apps/desktop/src/components/mq/MessageBrowser.vue changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in loadMessages at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/mq/MessageBrowser.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MessageBrowser.vue"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ca0579fe485b24dd06216408e9bba77cdf17787b1ca1a00db24d514c22c678"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/editor/codemirrorCurrentStatementFrameLayer.ts: apps/desktop/src/lib/editor/codemirrorCurrentStatementFrameLayer.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in codemirrorCurrentStatementFrameLayer.currentStatementFrameRect at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/codemirrorCurrentStatementFrameLayer.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":"apps/desktop/src/lib/editor/codemirrorCurrentStatementFrameLayer.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"df742a438bd1762aaea072db41c87b333ca8ee04143b3d45d917c25974c3533b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sidebar/sidebarNodeOrdering.ts: apps/desktop/src/lib/sidebar/sidebarNodeOrdering.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in sidebarNodeOrdering.orderSidebarTreeChildrenForParent at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sidebar/sidebarNodeOrdering.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":"apps/desktop/src/lib/sidebar/sidebarNodeOrdering.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45254ebc524d3720cb570fb90d38b92eca96d8a43152be9ad56f239df5b8a0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/diagram/SchemaDiagramDialog.vue: apps/desktop/src/components/diagram/SchemaDiagramDialog.vue changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in loadDiagram at line 1473. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/diagram/SchemaDiagramDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3252a819625a973578d09d85c749a2b3772980ab3b9376d74760fa4b07ad59ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/table/objectRenameSql.ts: apps/desktop/src/lib/table/objectRenameSql.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in objectRenameSql.supportsObjectRename at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/objectRenameSql.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":"apps/desktop/src/lib/table/objectRenameSql.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa32a07ddb0fca79ff50cad0f067eb9a3ba040b6a4b0bc0be6a52e486035f47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/connection/agentDriverInstallHint.ts: apps/desktop/src/lib/connection/agentDriverInstallHint.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in agentDriverInstallHint.agentDriverInstallKey at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/connection/agentDriverInstallHint.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":"apps/desktop/src/lib/connection/agentDriverInstallHint.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"54059e3112d041f42c56f45283beb8b7d5dd7e192dad92ecceee82b901fa3772"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/transfer/transferStrategy.ts: apps/desktop/src/components/transfer/transferStrategy.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in transferStrategy.createTransferSubmission.start at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/transfer/transferStrategy.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":"apps/desktop/src/components/transfer/transferStrategy.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbad81a9249ddd8b763cd6cbc78dd8a54fd70c94de208c6086803956a179b1ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/stores/transferTaskStore.ts: apps/desktop/src/stores/transferTaskStore.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in transferTaskStore.normalizeTask at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a71a49f92bca0e3da3effefe6f0e10759b5a1463eecd27b4478aade75c7d434"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/schema/oracle_routines/plan.rs: crates/dbx-core/src/schema/oracle_routines/plan.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in dbx_core::schema::oracle_routines::plan::build_plan_with_tables at line 815. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/schema/oracle_routines/plan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"1834c34a9ec31f9fa3126ee82612f936c7f42cdb56f0ce1af6834b8d2073365d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/editor/queryEditorNativeSelection.ts: apps/desktop/src/lib/editor/queryEditorNativeSelection.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in queryEditorNativeSelection.createQueryEditorNativeSelectionGuard at line 536. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/queryEditorNativeSelection.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":"apps/desktop/src/lib/editor/queryEditorNativeSelection.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32b98791098ab618968ca2b594b02717f833f1d53c2912642f1fb1a1b082b48"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/metadata/objectMetadataCache.ts: apps/desktop/src/lib/metadata/objectMetadataCache.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in objectMetadataCache.loadObjectMetadataFacetInternal at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/metadata/objectMetadataCache.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":"apps/desktop/src/lib/metadata/objectMetadataCache.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6098d0cf4dc0bf57217262a0c874450cf8e2929e2387170dbdffe737c1d87a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-sql-core/src/sql_editability.rs: crates/dbx-sql-core/src/sql_editability.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in dbx_sql_core::sql_editability::analyze_editable_query_editability at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-core/src/sql_editability.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-core/src/sql_editability.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc439f31e2edee4108c30d8b63a9e12640666a39bb84cc2ba0c7479159ecee2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-drivers/src/db/transport_layer_tunnel.rs: crates/dbx-drivers/src/db/transport_layer_tunnel.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dbx_drivers::db::transport_layer_tunnel::start_transport_layers_internal at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-drivers/src/db/transport_layer_tunnel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/transport_layer_tunnel.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"741f8d725727858d36d59e4b49e8a57a3674f9035167ae73512cd596a40b852b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/database/databaseAuthorizationPlan.ts: apps/desktop/src/lib/database/databaseAuthorizationPlan.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in databaseAuthorizationPlan.buildGrantAuthorizationPlan at line 299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/database/databaseAuthorizationPlan.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":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9e6227704ea041065055e74d9487cb337ccf299f832cee8f2516f6432ec493"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/redis/redisCommandPreview.ts: apps/desktop/src/lib/redis/redisCommandPreview.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in redisCommandPreview.quoteRedisBytes at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/redis/redisCommandPreview.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":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e3e7f098d596eb4b2f0e1bd3b2f955a4acc79a4031a1fd1ed5ae5269395fe8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: deploy/plugin-stats-worker/worker.ts: deploy/plugin-stats-worker/worker.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in worker.handleInstallBeacon at line 446. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- deploy/plugin-stats-worker/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":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"797e5d3127e9bc667e57c50cb90fe4102ca52c871af078fbef2c728a1e6469b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/components/issues/IssueSubmissionClient.tsx: docs/components/issues/IssueSubmissionClient.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in IssueSubmissionClient.IssueSubmissionClient at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- docs/components/issues/IssueSubmissionClient.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/issues/IssueSubmissionClient.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d56aea787512b096d8f6309a11d71fc2212bd448bfa5c2af2c02d23f26d2ec2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/ui/CustomContextMenu.vue: apps/desktop/src/components/ui/CustomContextMenu.vue changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in syncSubmenu at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/ui/CustomContextMenu.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/CustomContextMenu.vue"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8345b9de1ef5be488854c295d23a52914826267f27737214c4369b7206cc74d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/schema/oracleRoutineDeploy.ts: apps/desktop/src/lib/schema/oracleRoutineDeploy.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in oracleRoutineDeploy.validateOracleRoutineDeployment at line 468. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/schema/oracleRoutineDeploy.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":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"1044d4974a3b3d5cf354c52098209534c9fee93a8f96faa981922374781252d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/QueryHistory.vue: apps/desktop/src/components/editor/QueryHistory.vue changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in detailsRows at line 393. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/QueryHistory.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a1d2f079a6e16706dd8cde4ec383dbb8d5a6ea2ff5352f76a7703d59546671"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/kv/KvKeyBrowser.vue: apps/desktop/src/components/kv/KvKeyBrowser.vue changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in loadSelectedKey at line 937. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/kv/KvKeyBrowser.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"869b841f8fde0e5c6ba2af0b896617a30cec87f68b853382195fb86f214b2f37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue: apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in compileSingle at line 631. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cf2e5f9ebf3530c86156836a6210d6437d2c26eaba277d32c2ef0c940210b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useDataGridSearch.ts: apps/desktop/src/composables/useDataGridSearch.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in useDataGridSearch.useDataGridSearch at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridSearch.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":"apps/desktop/src/composables/useDataGridSearch.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f1602768d0410c5484fb1efbe724be82a6b58dcfabc0d2621ecb3886ce7533"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/admin/nacos/http.rs: crates/dbx-core/src/admin/nacos/http.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NacosOpenApiAdmin::test_connection at line 1844. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/admin/nacos/http.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/http.rs"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"06362a984ad857b27345d46fc77b2cbdc24ddecae63f8057989214f5c5d527a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/hive-go/config.go: agents/drivers/hive-go/config.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in main.parseConnectionConfig at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/hive-go/config.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/config.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0180bdaa9a4fddedfac2b4b65313379f8d87e2656affdf41c2daaef81d09375d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/composables/useDataGridCellDetail.ts: apps/desktop/src/composables/useDataGridCellDetail.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in useDataGridCellDetail.useDataGridCellDetail at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridCellDetail.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":"apps/desktop/src/composables/useDataGridCellDetail.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"606c5f084b2c326aca160013a942e39f48f1d259009e1eb738216202855f84d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/executableStatementRangeCache.ts: apps/desktop/src/lib/sql/executableStatementRangeCache.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in executableStatementRangeCache.executableStartAfterLeadingComments at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/executableStatementRangeCache.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":"apps/desktop/src/lib/sql/executableStatementRangeCache.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed7377fc35d87915ea02650bfa6189694a1e1d8f61253b50f43e8362519f095"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/savedSql/savedSqlDatabaseTree.ts: apps/desktop/src/lib/savedSql/savedSqlDatabaseTree.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in savedSqlDatabaseTree.withDatabaseSavedSqlRoot at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/savedSql/savedSqlDatabaseTree.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":"apps/desktop/src/lib/savedSql/savedSqlDatabaseTree.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"822108faf47ac595b494e1118be8b0463047fa146a65825a6ba5370fc4c8a315"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/connection/connectionDeepLink.ts: apps/desktop/src/lib/connection/connectionDeepLink.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in connectionDeepLink.parseConnectionDeepLink at line 375. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/connection/connectionDeepLink.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":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b31eba0c3a5b9a188a18b8393764a7ea19acc0f09b742761d72c3e6665b7f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts: apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in useQueryEditorBatchSelection.useQueryEditorBatchSelection.applyBatchColumnSelection at line 532. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/useQueryEditorBatchSelection.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":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21a06b7dcdcb058904b1299c1de2f2774676c14460ac3655e441c63a5350277"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/plugins/pluginUiHtmlCache.ts: apps/desktop/src/lib/plugins/pluginUiHtmlCache.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in pluginUiHtmlCache.inlineLocalUiAssets at line 88. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/plugins/pluginUiHtmlCache.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":"apps/desktop/src/lib/plugins/pluginUiHtmlCache.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a19018e5e41b7c7e4e6f8b18de975a0d341ce6305ea7098d59606120741392"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/cellValueTransform.ts: apps/desktop/src/lib/dataGrid/cellValueTransform.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in cellValueTransform.transformCellValue at line 111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/cellValueTransform.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":"apps/desktop/src/lib/dataGrid/cellValueTransform.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b2500985ac2abbc9deb6dc09a6996cb77c3f6fcb590c6173b1c91c93fd0fa3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/zookeeper/connection.go: agents/drivers/zookeeper/connection.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in main.openClient at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/zookeeper/connection.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"613e52513c32e9396a3090d65df187dca25c6a9ee51ec193c1aa0984b503f0e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java: agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MultiSessionJsonRpcServer.handleRequest at line 198. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"409d01eb7a675a062ca0246af67b27a3a0d430c3c0713c2310117279c8207d03"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/table/objectBrowserRowAction.ts: apps/desktop/src/lib/table/objectBrowserRowAction.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in objectBrowserRowAction.doubleClickRowAction at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/objectBrowserRowAction.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":"apps/desktop/src/lib/table/objectBrowserRowAction.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f82bfee0f35795d9727f66ed11037dc55d08db9ad73516113789d663ab3fc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts: apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in elasticsearchCompletion.inspectJsonBody at line 461. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.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":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8f193cb12566fdd2142ca91c57b261f184aa55cbb6623d89e4461cecce0790"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/components/landing/InstallTabs.tsx: docs/components/landing/InstallTabs.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in InstallTabs.InstallTabs at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- docs/components/landing/InstallTabs.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/landing/InstallTabs.tsx"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aede57c44bddb1ff1188101a193eef4eef335c20a7d7d87086ef052b91f717c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/database/triggerToggleSql.ts: apps/desktop/src/lib/database/triggerToggleSql.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in triggerToggleSql.buildTriggerToggleSql at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/database/triggerToggleSql.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":"apps/desktop/src/lib/database/triggerToggleSql.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff4a88e910743906212dd10a5bc01a40650a111bdeb2d7863ac23b9d0f99007"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sidebar/sidebarTreeLabel.ts: apps/desktop/src/lib/sidebar/sidebarTreeLabel.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in sidebarTreeLabel.sidebarTreeDisplayLabel at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sidebar/sidebarTreeLabel.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":"apps/desktop/src/lib/sidebar/sidebarTreeLabel.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc288de4aad4335ab2a90b897729643620f0cbf0511175a2c591abdc88df55ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/transfer/overwrite_clear.rs: crates/dbx-core/src/data/transfer/overwrite_clear.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in dbx_core::data::transfer::overwrite_clear::clear_foreign_key_linked_overwrite_targets at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/transfer/overwrite_clear.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/overwrite_clear.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"868ff2105433c589ea869a77d4440bb7c7b1881a6dac3218309c59b6e45dc370"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/imports/dbeaverImport.ts: apps/desktop/src/lib/imports/dbeaverImport.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in dbeaverImport.buildConnection at line 242. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/imports/dbeaverImport.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":"apps/desktop/src/lib/imports/dbeaverImport.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e752f59409e804bbfc2dc0f92620724594916ce9ae37cbe5bde39b40445ab419"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-drivers/src/db/duckdb_worker_process.rs: crates/dbx-drivers/src/db/duckdb_worker_process.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DuckDbWorkerClient::execute_typed_with_options at line 287. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-drivers/src/db/duckdb_worker_process.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/duckdb_worker_process.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac4e879a1848a6e3884b0aa9128802a620fdcb8168c2c4c4296bb50be4ed36e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/editor/codemirrorSqlBlockFolding.ts: apps/desktop/src/lib/editor/codemirrorSqlBlockFolding.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codemirrorSqlBlockFolding.computeBlockFoldRanges at line 193. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/codemirrorSqlBlockFolding.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":"apps/desktop/src/lib/editor/codemirrorSqlBlockFolding.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc8fa85179b0a3749a909c25b460227b2da909a1bb65d725454a92fe0ddb1fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts: apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dataGridColumnWidthState.saveDataGridColumnWidthState at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.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":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e5d7fff62f821877cc14e42097aa70c6388cf74bbfc57feb51dce923b1c0b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/search/DatabaseSearchPanel.vue: apps/desktop/src/components/search/DatabaseSearchPanel.vue changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in startSearch at line 199. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/search/DatabaseSearchPanel.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"08442d8f0d2ca53ab79eba23a2f7eaea61735c76fc0933dbade49977bb9b96b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/app/[lang]/plugins/[id]/PluginDetailClient.tsx: docs/app/[lang]/plugins/[id]/PluginDetailClient.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in PluginDetailClient.PluginDetailClient at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- docs/app/[lang]/plugins/[id]/PluginDetailClient.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/plugins/[id]/PluginDetailClient.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa354c8043307f33fe2d5c6aebdd85d9d256eea59590f1f67aa071261db4238"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/table/objectSourceTabSave.ts: apps/desktop/src/lib/table/objectSourceTabSave.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in objectSourceTabSave.saveObjectSourceTab at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/objectSourceTabSave.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":"apps/desktop/src/lib/table/objectSourceTabSave.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd67cc3feeefdca028e67440a4d289bd20752c1e5e0b4a0c924f41b8f2f4738"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/connection/jdbc.rs: crates/dbx-core/src/connection/jdbc.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in dbx_core::connection::jdbc::install_jdbc_plugin_zip at line 682. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/connection/jdbc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"d431dc722e43e93c7166089a4baeef5aa6c2cadacfc52ffd7e6704f9c384ac25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/ui-preview/publish.mjs: .github/ui-preview/publish.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in publish at line 167. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- .github/ui-preview/publish.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/ui-preview/publish.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd0103e54d78b88b99fbfb01a14a6fa7b9de10c3e98a59c296f52dd67c9f3bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/data/dameng_dump.rs: crates/dbx-core/src/data/dameng_dump.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in dbx_core::data::dameng_dump::run_dameng_dump_task at line 285. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/dameng_dump.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/dameng_dump.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fdee9c348b0057ae530cf5bbdc972d947babf2509f800050664d39ee8ca2a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/layout/ddl.ts: apps/desktop/src/lib/sql/layout/ddl.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ddl.createTableLayout at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/layout/ddl.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":"apps/desktop/src/lib/sql/layout/ddl.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f924d42fb3b9bcbb04aeeac2e86130cabb63c987a437da195c51d1064beb66a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts: apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in useQueryEditorCompletionKeys.useQueryEditorCompletionKeys.acceptSqlServerCompletionOnSpace at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/useQueryEditorCompletionKeys.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":"apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f608d00127f3824132d5e44722878f78bd56d6723091a3861ad9ec33b88bc1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sidebar/sidebarSearch.ts: apps/desktop/src/lib/sidebar/sidebarSearch.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in sidebarSearch.matchSidebarLabelWithRegex at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sidebar/sidebarSearch.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":"apps/desktop/src/lib/sidebar/sidebarSearch.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"51474f3c37bab342b9751f880546f890499c265a0e4513b513cab5f3c6cb5cff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/cellValueGeneration.ts: apps/desktop/src/lib/dataGrid/cellValueGeneration.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in cellValueGeneration.generateCellValues at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/cellValueGeneration.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":"apps/desktop/src/lib/dataGrid/cellValueGeneration.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"039b0a8483369f14c3911bbf861e6c5522e64f48b736542656af8f44d4b7bf3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/sqlDiagnostics.ts: apps/desktop/src/lib/sql/sqlDiagnostics.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in sqlDiagnostics.sqlErrorDecorationRange at line 166. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlDiagnostics.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":"apps/desktop/src/lib/sql/sqlDiagnostics.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc41de0740b5292c6b375cadca30d5d260f97ea6f699741ad7227c8ea7fade6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/schema/native_jobs/service.rs: crates/dbx-core/src/schema/native_jobs/service.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dbx_core::schema::native_jobs::service::runtime_identity_in_session at line 398. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/schema/native_jobs/service.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/service.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7015435d086d4be621b1a35a76ef9c394ff3b9ef4351182e265bffdbeb6c7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/plugins/pluginShortcuts.ts: apps/desktop/src/lib/plugins/pluginShortcuts.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in pluginShortcuts.collectPluginShortcuts at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/plugins/pluginShortcuts.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":"apps/desktop/src/lib/plugins/pluginShortcuts.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d081b76e1d906d719d4a37faaf3aec5c23526746d6a1c44348f38c8003f5d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/export/diagramSvgExport.ts: apps/desktop/src/lib/export/diagramSvgExport.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in diagramSvgExport.buildTableDiagramSvg at line 218. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/export/diagramSvgExport.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":"apps/desktop/src/lib/export/diagramSvgExport.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cc94c5a52835ea50ad34d6bcbbf243195478d2bf0fca54c3d9da1824f0b844"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/editableQueryHiddenKeys.ts: apps/desktop/src/lib/sql/editableQueryHiddenKeys.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in editableQueryHiddenKeys.appendSelectProjections at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/editableQueryHiddenKeys.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":"apps/desktop/src/lib/sql/editableQueryHiddenKeys.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"83163249a73844c0386b3c70d0b53f31075b0c0c857811a9554a3b8344855e86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/schema/oracle_table_triggers.rs: crates/dbx-core/src/schema/oracle_table_triggers.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in dbx_core::schema::oracle_table_triggers::enrich at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/schema/oracle_table_triggers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_table_triggers.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c679879bddbb0b8c22a507c2c194cb203f834f8bf38de3115bbeca4d9daa37f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src-tauri/src/commands/mcp_cleanup.rs: src-tauri/src/commands/mcp_cleanup.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dbx::commands::mcp_cleanup::sweep at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/mcp_cleanup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-tauri/src/commands/mcp_cleanup.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa76ab8575d3fd6274509222f2eb6c83926e5f1caddc6dce60202164b131a271"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/sqlFileTreeFilter.ts: apps/desktop/src/lib/sql/sqlFileTreeFilter.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in sqlFileTreeFilter.filterAndSortSqlFileEntries at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlFileTreeFilter.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":"apps/desktop/src/lib/sql/sqlFileTreeFilter.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0f2574f794dc4e92b824b20e74232b9feecb662b33c22703231775747ed231"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/scheduled_backup/models.rs: crates/dbx-core/src/scheduled_backup/models.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BackupConfig::validate at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/scheduled_backup/models.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/scheduled_backup/models.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe9403f9267fd2a9951d0993ae7da6b3e0a28c485be8b030daadee195832ada"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/sqlSelectionCase.ts: apps/desktop/src/lib/sql/sqlSelectionCase.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in sqlSelectionCase.convertSqlSelectionCase at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlSelectionCase.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":"apps/desktop/src/lib/sql/sqlSelectionCase.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2336537cdbd2a04e489b8d41d83116bf28b770bae8fc4aaac0b8a4f4788dd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/dataGrid/dataGridClipboard.ts: apps/desktop/src/lib/dataGrid/dataGridClipboard.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in dataGridClipboard.prepareDataGridClipboard at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridClipboard.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":"apps/desktop/src/lib/dataGrid/dataGridClipboard.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"48958cdf7116a7d1816a0f0956ff4ceecbcea3eff8c4dffa165097547a22a754"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/ai/aiAgentStepPresentation.ts: apps/desktop/src/lib/ai/aiAgentStepPresentation.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in aiAgentStepPresentation.upsertAgentStep at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/ai/aiAgentStepPresentation.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":"apps/desktop/src/lib/ai/aiAgentStepPresentation.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13bbea75cbef14a4fe80c573ecb68488684fbf6d306dfd35ea5527a4d02ff3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts: apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in sqlSemanticSelectionRanges.stringContentRange at line 406. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.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":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39feed8c9a11917a26f64b6dcde31a188db65b5f9058a63b295940388bb0cbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/mq/mqConsoleDefaults.ts: apps/desktop/src/lib/mq/mqConsoleDefaults.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in mqConsoleDefaults.resolveAvailableMqTabs at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/mq/mqConsoleDefaults.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":"apps/desktop/src/lib/mq/mqConsoleDefaults.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4349b71d85062dac3c3c1863b509b684936b610674e6e5421c0a5a7bd6342e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/ai/agent_kv.rs: crates/dbx-core/src/ai/agent_kv.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in dbx_core::ai::agent_kv::call_agent_kv at line 1726. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/ai/agent_kv.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2991502eccf18abb06c5085f59e3f6a32cdbaebd785cd60eb507bebf42194ccc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/metadata/schemaTreeCache.ts: apps/desktop/src/lib/metadata/schemaTreeCache.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in schemaTreeCache.decodeTableSearchIndex at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/metadata/schemaTreeCache.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":"apps/desktop/src/lib/metadata/schemaTreeCache.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0288666a52d73e15316c594426ec6965d34c36023c4115c4e8b3f073780b88d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/editor/queryEditorHoverContent.ts: apps/desktop/src/components/editor/queryEditorHoverContent.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in queryEditorHoverContent.createQueryEditorHoverContent.createHoverDom at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/queryEditorHoverContent.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":"apps/desktop/src/components/editor/queryEditorHoverContent.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c1e94401fec43e752d2f84d284a98d5d6e1187a192d5b3e19270843f668f18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-mcp/src/runtime.rs: crates/dbx-mcp/src/runtime.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in RuntimeConfig::from_environment_and_args at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-mcp/src/runtime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/runtime.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9f3702ebfc562e4eb65355c1b40886f8e3baadc33e8aabb3ae37d54b578618"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dbx-core/src/schema/oracle_triggers.rs: crates/dbx-core/src/schema/oracle_triggers.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dbx_core::schema::oracle_triggers::list_objects at line 167. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/schema/oracle_triggers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_triggers.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b22629ffd4884636d3ed4f69a4e3ed14045f09f150b5357bf56bd340ca2aca8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/sdk/dev-host/sidecar.mjs: plugins/sdk/dev-host/sidecar.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Sidecar.start at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- plugins/sdk/dev-host/sidecar.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/sidecar.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"423f79755f773f1cfdfe2085ce5767de5fee41e6f8b6bb694c88b0ff2ef4a8ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src-tauri/src/commands/global_search.rs: src-tauri/src/commands/global_search.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in dbx::commands::global_search::search_root at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/global_search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/global_search.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5966c815469721d5c1353a6fe280646fdc58eda26d2da61197e4ceda94decc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue: apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in save at line 109. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"960cd0598dcaece20cacada55d79e4d6d173293af8cddfdda8894d9631ea66a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/imports/datagripImport.ts: apps/desktop/src/lib/imports/datagripImport.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in datagripImport.buildConnection at line 554. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/imports/datagripImport.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":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"5680e88e5288a0307a86cba9b5b6c073c156dbf0db7ac993adbe40d664eefb5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agents/drivers/etcd-go/status.go: agents/drivers/etcd-go/status.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in etcdSession.status at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/etcd-go/status.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/status.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab935ce2e7fd081438fe7d23012774c5432ea0806d1313cdd8b586c581a7edb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sidebar/sidebarUserAdminVisibility.ts: apps/desktop/src/lib/sidebar/sidebarUserAdminVisibility.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in sidebarUserAdminVisibility.sidebarUserAdminVisibility at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sidebar/sidebarUserAdminVisibility.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":"apps/desktop/src/lib/sidebar/sidebarUserAdminVisibility.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c2635fa6f421ad4f2ccc94195ae0a8db133318663ec948a905e37119b69cc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/sql/errorPosition.ts: apps/desktop/src/lib/sql/errorPosition.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in errorPosition.resolveSqlErrorOffset at line 156. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/errorPosition.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":"apps/desktop/src/lib/sql/errorPosition.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ad337d263cc1fa9ea4ddbee2094f787249782eb58bcb1f35d8e106646bb6fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/desktop/src/lib/tabs/editorToolbarLayout.ts: apps/desktop/src/lib/tabs/editorToolbarLayout.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in editorToolbarLayout.resolveNextEditorToolbarTier at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/tabs/editorToolbarLayout.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":"apps/desktop/src/lib/tabs/editorToolbarLayout.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfe68cf65649c722e69241393daa37ff8dacb87611d7cf0f9dbe180c9c6773e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/dbx-core/src/persistence/secret_codec.rs: crates/dbx-core/src/persistence/secret_codec.rs changed 20 times in last 90 days and 18 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 SecretCodec::create_credential_recovery_key at line 76), 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(dbx-core): \u4FEE\u6389 secret_codec \u7684 clippy \u62A5\u9519 (#14835)\u201D; \u201Cfix(windows): mirror secret-store key into a DPAPI-protected recovery file\u201D; \u201Cfix(windows): add recovery for missing credential encryption keys\u201D; \u201Cfix(migration): preserve portable keys across devices\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/persistence/secret_codec.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/secret_codec.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ab614af798735d3c016821f724e8d3e553caf8042111e36962e6aa1fc00cd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/table/tableEditing.ts: apps/desktop/src/lib/table/tableEditing.ts changed 14 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is tableEditing.editablePrimaryKeys at line 44), 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(postgres): block tuple locator on Greenplum, Cloudberry, Hologres\u201D; \u201Cfix(grid): allow keyless editing in Oracle query results\u201D; \u201Cfix(doris): keep UNIQUE KEY columns unique-only and scope the nullable row id\u201D; \u201Cfix(doris): recognize composite unique keys as table row identifiers\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/tableEditing.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":"apps/desktop/src/lib/table/tableEditing.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc7b25de99b5086e361b2f03f95a15fc275e7ba91d82542ce30bf00ee5b57f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/dataGrid/dataGridPagination.ts: apps/desktop/src/lib/dataGrid/dataGridPagination.ts changed 14 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is dataGridPagination.hasCompleteLocalDataGridResult at line 138), 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(grid): treat short first page as incomplete when known total\u201D; \u201Cfix(grid): drop full-grid overlay during total row count\u201D; \u201Cfix(mysql): disable next page via read only probe\u201D; \u201Cfix(grid): keep unpaginated query results on a single page\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridPagination.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":"apps/desktop/src/lib/dataGrid/dataGridPagination.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e50de36b14914b74d0d467d97653afcfa4e2a74965bfde97baabe8311f1bcf0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/grid/DataGridCellDetailPanel.vue: apps/desktop/src/components/grid/DataGridCellDetailPanel.vue changed 17 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is (anonymous) at line 91), 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(grid): support geometry and WKT preview by selection\u201D; \u201Cfix(grid): follow boolean text setting in editor and detail views\u201D; \u201Cfix(grid): make cell detail layout responsive\u201D; \u201Cfix(grid): preview text stored in Oracle BLOB cells\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/grid/DataGridCellDetailPanel.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridCellDetailPanel.vue"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7727d029e532d16ee06267e4e61fce7658f6310b572207fdf5faef7dc5006f53"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/tabs/tabResultCache.ts: apps/desktop/src/lib/tabs/tabResultCache.ts changed 16 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is tabResultCache.buildTabResultSnapshot at line 819), 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(mysql): add read-only decoding for legacy text encodings\u201D; \u201Cfix(query): paginate multi-statement query results\u201D; \u201Cfix(mysql): disable next page via read only probe\u201D; \u201Cfix(grid): speed up join header comments and show type lengths\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/tabs/tabResultCache.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":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8e1d24405324e066f9965cb7d8998e73824329efd4931f5d48d574fad3b783"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/objects/DdlViewDialog.vue: apps/desktop/src/components/objects/DdlViewDialog.vue changed 16 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is loadDdl at line 293), 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(oracle): preserve explicit DDL owner and trigger completeness\u201D; \u201Cfix(oceanbase): preserve object paging and completion metadata identity\u201D; \u201Cfix(editor): copy editor text with CRLF line endings on Windows\u201D; \u201Cfix(grid): qualify generated save and copy SQL with database name\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/objects/DdlViewDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5209f54fdf6cdf2ada75cf49873156fc0342d17dd73569ab4a112d3f402f87"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java: agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java changed 12 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is Gbase8sAgent.overrideLocaleParams at line 992), 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(gbase8s): load column defaults from sysdefaults with literal decoding\u201D; \u201Cfix(gbase8s): discover and display views without owner prefix (#12302) (#12510)\u201D; \u201Cfix(gbase8s): strip NUL characters from column defaults and table DDL\u201D; \u201Cfix(gbase8s): resolve extended column types from sysxtdtypes\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5fbcd3fd425099e96021b707d1f06696b09a541dbea15958c02b605da2a796"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/commands/app_settings.rs: src-tauri/src/commands/app_settings.rs changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is dbx::commands::app_settings::set_promoted_build at line 129), 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(about): show promoted stable version in macOS About panel\u201D; \u201Cfix(window): restore main window geometry in logical units on macOS\u201D; \u201Cfix(desktop): keep macOS icon independent from app theme\u201D; \u201Cfix(desktop): keep the macOS app icon dark in dark theme\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/app_settings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/app_settings.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d8e8a6fac3e17509ec0417040a25736c0c98c1777eae7ed86a13c944793838"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/grid/DataGridToolbar.vue: apps/desktop/src/components/grid/DataGridToolbar.vue changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is toolbarTriggerElement at line 55), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(grid): separate row and column deletion actions\u201D; \u201Cfix(grid): start auto-refresh when selecting an interval\u201D; \u201Cfix(grid): use destructive color for delete row toolbar\u201D; \u201Cfix(grid): anchor toolbar overlay menus to their trigger buttons\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/grid/DataGridToolbar.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridToolbar.vue"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"200c9338435d3257508b8b904060dbb80bc0cd7008c94ce29f0146dff3c2ebd7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/plugins/PluginWorkbenchTab.vue: apps/desktop/src/components/plugins/PluginWorkbenchTab.vue changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is refresh at line 60), 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: \u201CRevert \u0022fix(plugins): preserve inactive workbench tab layout geometry\u0022 (#13831)\u201D; \u201Cfix(plugins): preserve inactive workbench tab layout geometry\u201D; \u201Cfix(connection): block passive reconnect for user-closed connections\u201D; \u201Cfix(plugins): self-heal restored plugin pages silently\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/plugins/PluginWorkbenchTab.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginWorkbenchTab.vue"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05fe7fcbb76c2685fcf492cc1773644ddf84c8579af0188d8c4b0ad71fa2a70"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/dbx-plugin-runtime/src/plugins/runtime.rs: crates/dbx-plugin-runtime/src/plugins/runtime.rs changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is UserInputSpec::parse at line 1000), 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(plugin-sdk): encode nil capabilities as [] and tolerate null on initialize (#14973)\u201D; \u201Cfix(jdbc): explain Java 21 requirement on older plugin launches\u201D; \u201Cfix(plugin): preserve reconnected sidecar sessions\u201D; \u201Cfix(plugins): coordinate sidecar cleanup across hosts\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-plugin-runtime/src/plugins/runtime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/runtime.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d3aa326a694a71f146e2806e2836852f46c6923c554e75b357707ed97e8f55"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/database/databaseTableDataCapabilities.ts: apps/desktop/src/lib/database/databaseTableDataCapabilities.ts changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is databaseTableDataCapabilities.defaultTableDataCapability at line 306), 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(grid): allow row inserts on generic JDBC connections\u201D; \u201Cfix(databend): save grid edits without an explicit transaction\u201D; \u201Cfix(grid): edit keyless postgres tables via ctid row locator\u201D; \u201Cfix(duckdb): save grid batch edits without a transaction\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/database/databaseTableDataCapabilities.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":"apps/desktop/src/lib/database/databaseTableDataCapabilities.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63f1a8c2fd67e9c4344cceec5dfc7d744f57cf788bef47e6bb1db6f6e1bdd09"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/dataGrid/dataGridDetail.ts: apps/desktop/src/lib/dataGrid/dataGridDetail.ts changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is dataGridDetail.buildDataGridCellDetail at line 106), 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(mysql): add read-only decoding for legacy text encodings\u201D; \u201Cfix(cassandra): render collection values as CQL literals\u201D; \u201Cfix(mysql): copy varbinary text values as raw strings\u201D; \u201Cfix(grid): copy NULL cells as empty fields\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridDetail.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":"apps/desktop/src/lib/dataGrid/dataGridDetail.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8de4f6856f8fd4ca85969a0a00fb5e2b4b70ca22dd2407ebfdad3aecc0ab1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/commands/mcp.rs: src-tauri/src/commands/mcp.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is dbx::commands::mcp::mcp_native_binary_path_for at line 1290), 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(mysql): add read-only decoding for legacy text encodings\u201D; \u201Cfix(mcp): stop linux shell probes from suspending tauri dev\u201D; \u201Cfix(mcp): clean stale Windows replacement temporary files (#13010)\u201D; \u201Cfix(mcp): update pnpm-installed MCP server with @latest\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/mcp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-tauri/src/commands/mcp.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"99df6827e846115f5f8891a005c79a0b1652b7a7878aa6231c50b9a36a9c33ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/sdk/cli/src/lib.rs: plugins/sdk/cli/src/lib.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is dbx_plugin_cli::create_project at line 797), 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(plugin-cli): honor CARGO_BUILD_TARGET artifact paths when packaging\u201D; \u201Cfix(plugins): cache release builds and align scaffold workflows\u201D; \u201Cfix(plugin-cli): isolate Go backend module builds\u201D; \u201Cfix(plugin-cli): normalize Windows Go workspace paths\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- plugins/sdk/cli/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/cli/src/lib.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24f4af89b9376119aabb2e05f4fe9fec1023b82d176398ecab62a8449b735c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/migration/SecurityMigrationWizard.vue: apps/desktop/src/components/migration/SecurityMigrationWizard.vue changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is (anonymous) at line 31), 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(windows): add recovery for missing credential encryption keys\u201D; \u201Cfix(migration): preserve portable keys across devices\u201D; \u201Cfix(secrets): unlock Secret Service items on retry\u201D; \u201Cfix(migration): preserve credential errors and recover failure states\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/migration/SecurityMigrationWizard.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/migration/SecurityMigrationWizard.vue"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a68021129f2afb5758e5050fb67b3c025642858136b0a5c117467a326eec62e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java: agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is IrisAgent.resultValue at line 69), 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(grid): enable table data editing and add-row for Cache / IRIS\u201D; \u201Cfix(iris): display %Boolean columns as stored 1/0 values\u201D; \u201Cfix(intersystems): read out-of-range integers via BigDecimal\u201D; \u201Cfix(iris): raise jdbc query prefetch for large results\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e381af66d8e1b7eaf0bed0fd5caed172d80e1e287ce9020e53eb71a119af956a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/grid/TemporalCellEditor.vue: apps/desktop/src/components/grid/TemporalCellEditor.vue changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is flushInputValue at line 180), 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(grid): commit temporal value editor on blur like CodeMirror sibling\u201D; \u201Cfix(grid): save value editor and cell detail edits via Ctrl\u002BS\u201D; \u201Cfix(grid): commit and save temporal cell edits on Ctrl\u002BS\u201D; \u201Cfix(grid): keep tz-aware Now values and duckdb lockfile in sync\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/grid/TemporalCellEditor.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"574ceca58a5618c7ceb88256b5926598a1785d69b2d2e0de7d1d03fafe760813"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/dbx-core/src/data/csv_export.rs: crates/dbx-core/src/data/csv_export.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is dbx_core::data::csv_export::write_table_csv_pages at line 107), 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(mcp): refresh desktop connection list after MCP mutations\u201D; \u201Cfix(neo4j): pick node identity function by server version\u201D; \u201Cfix(export): mark NULL as \\N in CSV and TSV exports\u201D; \u201Cfix(cassandra): use cursor pagination for table data and exports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-core/src/data/csv_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/csv_export.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1cbd93bcf879d3c01d055330c5dd3f9fe856e5aba5e8abad34888c9a2eb22b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/commands/transfer.rs: src-tauri/src/commands/transfer.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is dbx::commands::transfer::start_transfer at line 23), 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(mysql): add read-only decoding for legacy text encodings\u201D; \u201Cfix(data): harden transfer and comparison workflows\u201D; \u201Cfix(transfer): clear FK-linked target children first on overwrite\u201D; \u201Cfix(doris): preserve aggregate-state bytes in query results\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/transfer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/transfer.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ceeec8862454f2c55dfb51114d89cea34cbace1de0f875019790fa792776490"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/dbx-formats/src/csv_export.rs: crates/dbx-formats/src/csv_export.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is dbx_formats::csv_export::push_csv_value_with_quote_mode at line 200), 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(csv): count decimal significant digits across separator\u201D; \u201Cfix(clipboard): keep @-prefixed non-ASCII text verbatim\u201D; \u201Cfix(grid): keep plain negative numeric text cells unguarded on copy\u201D; \u201Cfix(export): neutralize formula injection in CSV/TSV exports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-formats/src/csv_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-formats/src/csv_export.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec77909dd8f1a51addc36b7a99183bb6d3fdc34a1f27e66270bc201b0aabe9b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/export/exportFormats.ts: apps/desktop/src/lib/export/exportFormats.ts 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 6 (its worst body is exportFormats.formatTsv at line 29), 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(export): mark NULL as \\N in CSV and TSV exports\u201D; \u201Cfix(grid): copy cells containing double quotes verbatim\u201D; \u201Cfix(sqlserver): wrap identity inserts with SET IDENTITY_INSERT\u201D; \u201Cfix(xugu): preserve spatial SRIDs in exports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/export/exportFormats.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":"apps/desktop/src/lib/export/exportFormats.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5433af795f049ece096ebd2ca8870f8f57a586616291da8149d09863eaa67a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/composables/useDataGridColumnResize.ts: apps/desktop/src/composables/useDataGridColumnResize.ts changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is useDataGridColumnResize.useDataGridColumnResize.initColumnWidths at line 149), 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(grid): refit automatic widths on query runs and refreshes\u201D; \u201Cfix(grid): invalidate only auto-calculated column widths on font or density changes (#12913)\u201D; \u201Cfix(grid): size columns by sampled values and distribute spare width\u201D; \u201Cfix(grid): guard DataGrid startup initialization\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridColumnResize.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":"apps/desktop/src/composables/useDataGridColumnResize.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ace321756ee7f98973ac39f35279c1b0a93ed74fc349da82b5bec7d636fc477"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/layout/WelcomeScreen.vue: apps/desktop/src/components/layout/WelcomeScreen.vue changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is welcomeConnectionSubtitle at line 62), 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(update): show stable version for promoted beta builds\u201D; \u201Cfix(sidebar): consolidate search options and shorten Redis import labels (#13682)\u201D; \u201Cfix(home): polish intro page details and settings highlight\u201D; \u201Cfix(theme): allow background image to show in dark mode and IDE themes\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/layout/WelcomeScreen.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/WelcomeScreen.vue"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae47bd9988a668c191bc678a7bc5a4a3fbc82c82dea416b2721c513a423d7afc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/composables/useDataGridTableMetadataLoaders.ts: apps/desktop/src/composables/useDataGridTableMetadataLoaders.ts changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is useDataGridTableMetadataLoaders.useDataGridTableMetadataLoaders.fetchTableOwner at line 206), 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(ddl): refresh definitions after external schema changes, keep drafts\u201D; \u201Cfix(oceanbase): preserve object paging and completion metadata identity\u201D; \u201Cfix(metadata): resolve visible schema for query DDL and loads\u201D; \u201Cfix(grid): qualify generated save and copy SQL with database name\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridTableMetadataLoaders.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":"apps/desktop/src/composables/useDataGridTableMetadataLoaders.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af48cdb1c9bc8bcd7869752d3ef28e87ecfbcfa429b4493b9d42e7deb69127b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/metadata/objectDdlCache.ts: apps/desktop/src/lib/metadata/objectDdlCache.ts changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is objectDdlCache.loadRemoteDdl at line 147), 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(oracle): preserve explicit DDL owner and trigger completeness\u201D; \u201Cfix(gbase8s): strip NUL characters from column defaults and table DDL\u201D; \u201Cfix(oceanbase): preserve object paging and completion metadata identity\u201D; \u201Cfix(metadata): await object cache invalidation on connection refresh\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/metadata/objectDdlCache.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":"apps/desktop/src/lib/metadata/objectDdlCache.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c91983ed17b9456bbd818534c036eddcbd47598966d44d0ef7f641f5062baf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/commands/plugins.rs: src-tauri/src/commands/plugins.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is dbx::commands::plugins::install_plugin_event_bridge at line 147), 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(plugins): terminate Windows sidecar process trees\u201D; \u201Cfix(plugins): stream dropped files and folders into plugin workbenches\u201D; \u201Cfix(plugins): make plugin uninstall state consistent on failure\u201D; \u201Cfix(plugins): refresh workbench tabs after install and rollback\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/plugins.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-tauri/src/commands/plugins.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b062b60195d367b2f588428d3756fe3abe593af356333b920b8836bd8db0c8c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/window_state_guard.rs: src-tauri/src/window_state_guard.rs changed 6 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 10 (its worst body is dbx::window_state_guard::restore_main_window_state at line 129), 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(desktop): lower the main window minimum width (#14948)\u201D; \u201Cfix(window): persist macOS main window geometry in its own file\u201D; \u201Cfix(window): restore main window geometry in logical units on macOS\u201D; \u201Cfix(desktop): reset corrupt persisted main window size on restore\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/window_state_guard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/window_state_guard.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25ca44134c4bb993a430378ba79e89ed07792306ce7b3c4be1b453b6b6327b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/migration_gate.rs: src-tauri/src/migration_gate.rs changed 6 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 3 (its worst body is MigrationGate::wait at line 21), 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(windows): add recovery for missing credential encryption keys\u201D; \u201Cfix(about): show promoted stable version in macOS About panel\u201D; \u201Cfix(desktop): keep macOS icon independent from app theme\u201D; \u201Cfix(desktop): keep the macOS app icon dark in dark theme\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/migration_gate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-tauri/src/migration_gate.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6f49d2f3595b91f0f325becbd86109ce4bb45d4860fb2a7deb15b6e0938f24"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drivers/iotdb/query.go: agents/drivers/iotdb/query.go changed 6 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 13 (its worst body is server.executeQueryPage at line 120), 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(iotdb): honor unlimited query timeout across paged fetches\u201D; \u201Cfix(iotdb): preserve LIST query result sets\u201D; \u201Cfix(iotdb): render timestamps in session zone and type max_by\u201D; \u201Cfix(iotdb): align 1.3.x aggregate columns and format max_time\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/iotdb/query.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iotdb/query.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced27070f1f48bcd2d30aac7d6324e9430784a27c75f7d3db327f0cd1d90fe8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/composables/useComponentUpdates.ts: apps/desktop/src/composables/useComponentUpdates.ts changed 6 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 10 (its worst body is useComponentUpdates.useComponentUpdates.updateDrivers at line 138), 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(updates): keep MCP update button hidden after auto-update\u201D; \u201Cfix(updates): auto-continue client upgrade on update-all\u201D; \u201Cfix(updates): show why a plugin update was blocked\u201D; \u201Cfix(plugins): check and update installed plugins with provenance guards\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useComponentUpdates.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":"apps/desktop/src/composables/useComponentUpdates.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04856489576a6da4f0f245f039a63eddcb80178e459f78c30f718845c3e1179"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/stores/migrationStore.ts: apps/desktop/src/stores/migrationStore.ts changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is migrationStore.useMigrationStore.resetCredentials at line 141), 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(windows): add recovery for missing credential encryption keys\u201D; \u201Cfix(migration): preserve portable keys across devices\u201D; \u201Cfix(secrets): unlock Secret Service items on retry\u201D; \u201Cfix(desktop): clarify migration key setup and small-window layout\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/stores/migrationStore.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":"apps/desktop/src/stores/migrationStore.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2fa70f6e9e4e8cc093d7c0ffb5f7667029a6ef196d11b67de457dc93ee520c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue: apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is exportSnapshot at line 128), 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(dialog): keep dialogs opaque over custom background image\u201D; \u201Cfix(desktop): restore legacy webview dialog and highlight fixes\u201D; \u201Cfix(desktop): add legacy webview fallbacks for snapshots and dialogs\u201D; \u201Cfix(snapshot): wire code snapshot option switches\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3b7e839998582cc730480a9a0818712582c8999868acf0fd6e3b71d8ab22fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/database/visibleDatabases.ts: apps/desktop/src/lib/database/visibleDatabases.ts changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is visibleDatabases.visibleDatabasePatternRegExp at line 162), 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(sidebar): allow visible-database wildcards without checked rows\u201D; \u201Cfix(sidebar): keep system databases visible after show all\u201D; \u201Cfix(sidebar): honor schema filter for single-db picker key\u201D; \u201Cfix(oceanbase): restore Oracle-mode system schema visibility\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/database/visibleDatabases.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":"apps/desktop/src/lib/database/visibleDatabases.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ec7e62e3a88874c5e3f49a1f7684145f34d89b2f6fff0457465060e5bcb8e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/commands/database_export.rs: src-tauri/src/commands/database_export.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is dbx::commands::database_export::finalize_export at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mysql): add read-only decoding for legacy text encodings\u201D; \u201Cfix(backup): confirm legacy macOS destinations before manual runs\u201D; \u201Cfix(export): surface lenient per-object failures in export completion\u201D; \u201Cfix(backup): verify scheduled export destinations before writing\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/database_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/database_export.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7683fea1c32f000671d5a8d97a64b7a2d3499e25955792749c89ea3c94a0015"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/commands/agents.rs: src-tauri/src/commands/agents.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is dbx::commands::agents::set_agent_java_runtime_config at line 185), 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(jdbc): stop plugin processes before replacing jdbc directory\u201D; \u201Cfix(updates): auto-continue client upgrade on update-all\u201D; \u201Cfix(agent): keep offline import resilient per item with os error detail\u201D; \u201Cfix(agents): import standalone JRE offline packages\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/agents.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-tauri/src/commands/agents.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c782ab89d299401913d539e8dff64fbac03024a209c0df1038036260d8c5bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/composables/useTheme.ts: apps/desktop/src/composables/useTheme.ts changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is useTheme.applyCustomUiColors at line 204), 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(desktop): keep macOS icon independent from app theme\u201D; \u201Cfix(desktop): keep the macOS app icon dark in dark theme\u201D; \u201Cfix(settings): persist appearance preferences\u201D; \u201Cfix(plugins): stabilize plugin integration\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useTheme.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":"apps/desktop/src/composables/useTheme.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba8c767b6b579b6662385bae27f408f0aa4b824964639a72dabf917adba494c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java: agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Db2Agent.deferredLobResult at line 538), 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(db2): defer LOB loading in query results\u201D; \u201Cfix(db2): tolerate malformed character data via decoder\u201D; \u201Cfix(db2): read CLOB query values as text\u201D; \u201Cfix(db2): read view source from SYSCAT.VIEWS\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"b794b56056df07e8567a4b2733871788dfedde3cf94d3788ccfa3764b5b8b03b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/commands/update.rs: src-tauri/src/commands/update.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is UpdateDownloadSource::installer_asset_candidates at line 424), 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(updater): retry the update cache rename on transient Windows locks (#14821)\u201D; \u201Cfix(updates): load changelog versions lazily instead of the full feed\u201D; \u201Cfix(updater): clean runtimes before forced Windows exit\u201D; \u201Cfix(updater): add step and path to update failure hints\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/update.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/update.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"767adc24f73bead7f681bda34c2d73a9b90a8f2b2ecaa41a698972f8054ee12a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue: apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is collectModifySegments at line 131), 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(schema-diff): honor charset comparison settings in MySQL sync SQL\u201D; \u201Cfix(schema-diff): focus modified table DDL changes\u201D; \u201Cfix(schema-diff): guard deploy script execution\u201D; \u201Cfix(schema-diff): keep deploy script preview in sync with selection\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6804f7e011721ca8d5f9917908a9f09ddaffb3f558dc7dd1c3dc9560fc71eb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/dataGrid/dataGridLargeValues.ts: apps/desktop/src/lib/dataGrid/dataGridLargeValues.ts changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is dataGridLargeValues.tableDataLargeValuePreviewOptions at line 223), 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(mysql): add read-only decoding for legacy text encodings\u201D; \u201Cfix(jdbc): bound oversized responses and stream LOB snapshots\u201D; \u201Cfix(db2): defer LOB loading in query results\u201D; \u201Cfix(grid): budget large-value previews by segment and show executed SQL\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridLargeValues.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":"apps/desktop/src/lib/dataGrid/dataGridLargeValues.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9468e0d81546f72775fa4443da1b20685c5639ffbbd5419d28bb9ceb32619f3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/dbx-web/src/routes/agents.rs: crates/dbx-web/src/routes/agents.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is dbx_web::routes::agents::import_agents_from_zip at line 290), 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(jdbc): stop plugin processes before replacing jdbc directory\u201D; \u201Cfix(updates): auto-continue client upgrade on update-all\u201D; \u201Cfix(agent): keep offline import resilient per item with os error detail\u201D; \u201Cfix(agents): import standalone JRE offline packages\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-web/src/routes/agents.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/agents.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5681fdfea63b602c98054813063989f070cccd608f919e51d8fd5c3587358cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/editor/queryEditorExecutionViewport.ts: apps/desktop/src/lib/editor/queryEditorExecutionViewport.ts changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is queryEditorExecutionViewport.locateCursorForGutterExecution at line 82), 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(editor): keep viewport when cursor was visible before execution\u201D; \u201Cfix(editor): keep scroll after canceling dangerous sql\u201D; \u201Cfix(editor): preserve visible cursor after query execution\u201D; \u201Cfix(editor): preserve user-adjusted SQL editor position during execution\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/queryEditorExecutionViewport.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":"apps/desktop/src/lib/editor/queryEditorExecutionViewport.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad155a6ed15296f48308e83416be2f19a4846f042337440fadd3a50fed259e10"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/editor/SqlPreviewPanel.vue: apps/desktop/src/components/editor/SqlPreviewPanel.vue changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is selectedPreviewText at line 65), 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(data-grid): treat untouched new rows as placeholders\u201D; \u201Cfix(grid): make ctrl-c copy from the sql preview panel\u201D; \u201Cfix(grid): Ctrl\u002BA selects SQL preview text, not table data\u201D; \u201Cfix(editor): avoid bundling unused Shiki languages\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/editor/SqlPreviewPanel.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlPreviewPanel.vue"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b71e0de50f980f267f3a1104048a938f5691303d3b86771ad993aa2487832f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdAgent.java: agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdAgent.java changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is FirebirdAgent.listObjects at line 173), 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(firebird): encode legacy text writes with the data charset\u201D; \u201Cfix(firebird): place column defaults before NOT NULL in table DDL\u201D; \u201Cfix(firebird): fix table trigger loading and source viewing\u201D; \u201Cfix(firebird): decode legacy GBK text stored via ISO8859_1 connections\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/firebird/src/main/java/com/dbx/agent/firebird/FirebirdAgent.java"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc36aca180fe53eaa5dc2ec7415832c111447708bec7861f6b8c8155d903d2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/ui/LightTooltip.vue: apps/desktop/src/components/ui/LightTooltip.vue changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is updatePosition at line 132), 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(sidebar): constrain tooltip position to clipping scroll container (#13717) (#13723)\u201D; \u201Cfix(dialog): keep stacked dialogs dismissible\u201D; \u201Cfix(ui): wrap oversized single-line tooltips instead of clipping\u201D; \u201Cfix(theme): keep inverted text opaque over background images\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/ui/LightTooltip.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/LightTooltip.vue"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d915ae7ac15182eeb1c80376ada02b8398d48960ab236b87871d6d0aa961cd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/dataGrid/dataCompare.ts: apps/desktop/src/lib/dataGrid/dataCompare.ts changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is dataCompare.intersectCompareColumns at line 202), 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(data): harden transfer and comparison workflows\u201D; \u201Cfix(compare): cap per-table compare reads and flag truncation\u201D; \u201Cfix(compare): match data compare columns case-insensitively\u201D; \u201Cfix(data-compare): avoid unsafe key inference\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataCompare.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":"apps/desktop/src/lib/dataGrid/dataCompare.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad260ee5adfdd4bde5928cadf4740ced8dc6501ded4655e9c0e9cd82b151c6cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/composables/useFlatTree.ts: apps/desktop/src/composables/useFlatTree.ts changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is useFlatTree.createFlatTreeIndex at line 140), 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(sidebar): stop sticky headers at connection boundaries\u201D; \u201Cfix(sidebar): Dameng tree blank band, admin node duplication and schema auto-expand\u201D; \u201Cfix(sidebar): keep table search results on Enter\u201D; \u201Cfix(sidebar): isolate virtual tree row identities\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useFlatTree.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":"apps/desktop/src/composables/useFlatTree.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd57f8fdb25e3e0b0af3261d23bb67be66ff0390c858ce39475edb9b784fae8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/sql/sqlCompletionLookupTarget.ts: apps/desktop/src/lib/sql/sqlCompletionLookupTarget.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is sqlCompletionLookupTarget.resolveSqlCompletionTableLookupTarget at line 279), 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(clickhouse): follow a successful USE statement to its database\u201D; \u201Cfix(snowflake): resolve database and schema completion namespaces\u201D; \u201Cfix(mysql): switch tab database label after USE statements\u201D; \u201Cfix(sqlserver): propagate USE context through query batches\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/sqlCompletionLookupTarget.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":"apps/desktop/src/lib/sql/sqlCompletionLookupTarget.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ac8e924bc9a1514124ec9973e45e975eba42bc335441f0def1552a553e815c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/export/databaseExportSelection.ts: apps/desktop/src/lib/export/databaseExportSelection.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is databaseExportSelection.buildSelectedTablesPayload at line 3), 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(export): export only selected objects and add Oracle packages\u201D; \u201Cfix(export): allow selecting and exporting non-table objects for Kingbase\u201D; \u201Cfix(ci): format export selection helper\u201D; \u201Cfix(export): allow routine-only database exports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/export/databaseExportSelection.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":"apps/desktop/src/lib/export/databaseExportSelection.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c732e2234b492285155e8b196008f9d2015e050e79ecec4b78883d10da7cb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/app/pinnedItems.ts: apps/desktop/src/lib/app/pinnedItems.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is pinnedItems.treeNodePinIdentity at line 37), 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(sidebar): avoid whole-list rebuilds when loading more tables\u201D; \u201Cfix(sidebar): cut pinned lookup and saved-SQL decorate cost on large table lists\u201D; \u201Cfix(redis): preserve pinned databases across alias updates and reconnects (#12752) (#12765)\u201D; \u201Cfix(sidebar): preserve virtual table group ordering during refresh\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/app/pinnedItems.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":"apps/desktop/src/lib/app/pinnedItems.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55d43afa2334eebb349f50724368e854fdb27e7dedf839d379ce74005476dbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/ui/legacyWebView.ts: apps/desktop/src/lib/ui/legacyWebView.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is legacyWebView.supports at line 54), 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(desktop): add legacy engine startup compatibility notice\u201D; \u201Cfix(desktop): replace lookbehind regex that crashed legacy WebKit at startup\u201D; \u201Cfix(desktop): restore legacy webview dialog and highlight fixes\u201D; \u201Cfix(desktop): support legacy macOS WebViews\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/ui/legacyWebView.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":"apps/desktop/src/lib/ui/legacyWebView.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e40be11fd8816fb8fac8c2a4951fc79621e1ea4991405201e872b2d90e55c6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/table/tableClipboard.ts: apps/desktop/src/lib/table/tableClipboard.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is tableClipboard.isWritableTableDataCopyColumn at line 96), 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(dameng): wrap identity columns when pasting table data\u201D; \u201Cfix(table): keep mysql DEFAULT_GENERATED columns copyable\u201D; \u201Cfix(table-paste): surface first batch paste error\u201D; \u201Cfix(sqlserver): skip rowversion columns when copying table data\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/table/tableClipboard.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":"apps/desktop/src/lib/table/tableClipboard.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac9ea321bc3aa2c83ad8c9854decd759294ac620ca7b61b58d243c568b57435"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/dbx-sql-data/src/database_search_sql.rs: crates/dbx-sql-data/src/database_search_sql.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 11 (its worst body is dbx_sql_data::database_search_sql::build_database_search_sql at line 129), 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(export): Teradata \u5206\u9875\u4E0E\u641C\u7D22\u6539\u7528 TOP/ROW_NUMBER\uFF0C\u4E0D\u518D\u751F\u6210 LIMIT (#14630)\u201D; \u201Cfix(teradata): keep user queries free of the unsupported limit clause\u201D; \u201Cfix(cassandra): use cursor pagination for table data and exports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql-data/src/database_search_sql.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-data/src/database_search_sql.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ee07765bb577a7489177301a9747ef98d18244463def2753d7117efb681c48"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.ts: apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.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 14 (its worst body is dataGridFilterBuilderPersistence.sanitizeState at line 92), 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(grid): \u590D\u5236\u9875\u7B7E\u65F6\u4FDD\u7559\u72EC\u7ACB\u7B5B\u9009\u4E0E\u6392\u5E8F\u89C4\u5219 (#11628)\u201D; \u201Cfix(grid): persist visual table filters across restart\u201D; \u201Cfix(memory): release closed query and connection resources\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.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":"apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"07069126a156f8b2925857943324aaf7636e59f6aa4131216adbbd4d7fb64933"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/database/databaseDriverManifest.ts: apps/desktop/src/lib/database/databaseDriverManifest.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 5 (its worst body is databaseDriverManifest.usesAgentCursorForQuery at line 174), 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(duckdb): stabilize query pages and bound queued cancellation\u201D; \u201Cfix(data): harden transfer and comparison workflows\u201D; \u201Cfix(cassandra): use cursor pagination for table data and exports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/database/databaseDriverManifest.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":"apps/desktop/src/lib/database/databaseDriverManifest.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9500e3d82439c9133702ebb986f9fcebce3dd9889bf4e22761d584cb33b71a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/dataGrid/gridSelection.ts: apps/desktop/src/lib/dataGrid/gridSelection.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 12 (its worst body is gridSelection.summarizeSelection at line 230), 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(query): keep multi-database merged column totals exact\u201D; \u201Cfix(grid): keep selection SUM and AVG exact for BIGINT and DECIMAL\u201D; \u201Cfix(grid): count typed BSON numbers in Mongo grid summaries\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/gridSelection.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":"apps/desktop/src/lib/dataGrid/gridSelection.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a59e8db24a6d5503c9bdf50d647fab8fc0cf22cb7e3e03db3f2ada55a9a493"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/connection/connectionErrorHints.ts: apps/desktop/src/lib/connection/connectionErrorHints.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 15 (its worst body is connectionErrorHints.appendConnectionErrorHints at line 88), 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(mysql): repair preferred TLS fallback and clarify SSL failures\u201D; \u201Crevert(sqlite): remove RC4 Legacy database support\u201D; \u201Cfix(mysql): preserve JDBC TLS parameter semantics\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/connection/connectionErrorHints.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":"apps/desktop/src/lib/connection/connectionErrorHints.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ff628febf59bc3d7667573f3b3d87426e31c6a5ea4a92a1d9ee827b71fc715"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue: apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is handleWebEvent at line 113), 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(ssh): clear focus ring clipping in the host key prompt\u201D; \u201Cfix(dialog): keep stacked dialogs dismissible\u201D; \u201Cfix(sqlite): validate ssh backup and query errors\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e609f9b3e88aeaa0840f53309e2de182a3219fd60bf0288a7cb6d9dc4744d578"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/main.ts: apps/desktop/src/main.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 8 (its worst body is main.installGlobalInputAttrs at line 52), 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(settings): persist appearance preferences\u201D; \u201Cfix(desktop): add legacy engine startup compatibility notice\u201D; \u201Cfix(startup): reduce initial loading and unblock app restoration\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/main.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":"apps/desktop/src/main.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e3b999a957adaf54cb265aec329300658828b00f41dedd412acfa4e0d3d924"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/sql/semantic/dialect.ts: apps/desktop/src/lib/sql/semantic/dialect.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 dialect.roleForGenericQualifier at line 43), 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(snowflake): resolve database and schema completion namespaces\u201D; \u201Cfix(editor): support Spark datasource DDL for Kyuubi\u201D; \u201Cfix(editor): bound SQL completion to active statement\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/semantic/dialect.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":"apps/desktop/src/lib/sql/semantic/dialect.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fc1fe20cbcff014c80aa152ce86fb8ec1e1efa4ed47d4e36762fea94f2af67"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/commands/update_cache.rs: src-tauri/src/commands/update_cache.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is dbx::commands::update_cache::read at line 153), 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(updater): retry the update cache rename on transient Windows locks (#14821)\u201D; \u201Cfix(update_cache): clear existing ready dir before rename on Windows\u201D; \u201Cfix(updater): add step and path to update failure hints\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/update_cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/update_cache.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c4fa86d6a6f5ca34a30892819667e491f9fab8280d6eede30c56c6738f1ca2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/dbx-sql/src/dameng_dump.rs: crates/dbx-sql/src/dameng_dump.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is dbx_sql::dameng_dump::parse_dump_log at line 200), 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(dameng): quote the dump USERID password so @ and / survive\u201D; \u201Cfix(dameng): pass dexp/dimp file paths on the command line so Windows accepts them (#13797)\u201D; \u201Cfix(dameng): normalise dexp/dimp PARFILE paths and surface the real failure (#12872)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-sql/src/dameng_dump.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql/src/dameng_dump.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfc0210c4aa9b1df55e7cb5ce215ccfdc806391014eacfacea1a8a5a69ee994"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drivers/saphana/src/main/java/com/dbx/agent/saphana/SapHanaAgent.java: agents/drivers/saphana/src/main/java/com/dbx/agent/saphana/SapHanaAgent.java 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 SapHanaAgent.getObjectSource at line 33), 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(saphana): support view object source lookup and ddl formatting\u201D; \u201Cfix(hana): include modeled views in metadata listings (#11434)\u201D; \u201Cfix(saphana): include column comments in table DDL\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/saphana/src/main/java/com/dbx/agent/saphana/SapHanaAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/saphana/src/main/java/com/dbx/agent/saphana/SapHanaAgent.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5719382671c8f957606487b13d737cea57ce4969f33418c995b1ef58075f5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drivers/neo4j-go/driver.go: agents/drivers/neo4j-go/driver.go 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 15 (its worst body is main.neo4jTLSConfigurer at line 99), 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(neo4j): restore Windows 7 compatible agent builds\u201D; \u201Cfix(neo4j): connect to Memgraph via the direct-connection fallback\u201D; \u201Cfix(neo4j): fall back to direct connection on Bolt 3 routing errors\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/neo4j-go/driver.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/driver.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ebbcd529e0d850e4f21ab8852fdbc201751a1bd3c0b6f04deae3bd018b5c04"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/editor/sqlCompletionInsertion.ts: apps/desktop/src/lib/editor/sqlCompletionInsertion.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is sqlCompletionInsertion.appendSqlCompletionSpace at line 15), 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(editor): expand accepted snippets on every rectangular cursor (#14118)\u201D; \u201Cfix(editor): append completion space before newlines and statement boundaries (#12948)\u201D; \u201Cfix(completion): stop appending space before statement terminators\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/sqlCompletionInsertion.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":"apps/desktop/src/lib/editor/sqlCompletionInsertion.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"54421263e0da0f132f9ede9abefb9cd40a926f165a4b383cf01f574dfd7b4686"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue: apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is loadDatabases at line 101), 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(sidebar): allow visible-database wildcards without checked rows\u201D; \u201Cfix(sidebar): keep system databases visible after show all\u201D; \u201Cfix(sidebar): store full selection as unfiltered visible databases\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1471801c889fe3b9f2f919e692ee0dd550a3d17a7b99f1425c4d01869bc38f4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/editor/queryEditorLineComment.ts: apps/desktop/src/lib/editor/queryEditorLineComment.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is queryEditorLineComment.createQueryEditorLineCommentShortcutBindings 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(editor): support line comment shortcuts under IME and numpad divide\u201D; \u201Cfix(editor): include sqlserver temp-table prefix in word selection\u201D; \u201Cfix(editor): include SQL Server variable prefix in word selection\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/queryEditorLineComment.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":"apps/desktop/src/lib/editor/queryEditorLineComment.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"519f01aafbf72b89b7d8c462cbc6b2b481ee20720b17c13f41981ba581fc67ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/dbx-web/src/routes/query_result_export.rs: crates/dbx-web/src/routes/query_result_export.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is dbx_web::routes::query_result_export::start_query_result_export at line 37), 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(mysql): add read-only decoding for legacy text encodings\u201D; \u201Cfix(dev): stabilize macOS signing and isolate test keys\u201D; \u201Cfix(export): stream JSON query exports and allow web TXT\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- crates/dbx-web/src/routes/query_result_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query_result_export.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4b20c769c5be4049bf4683f2e26d42d7b6b2dd5f249a427721a6a7abc53e85"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/composables/useDataCompareSession.ts: apps/desktop/src/composables/useDataCompareSession.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is useDataCompareSession.runDataCompareSession at line 329), 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(data-compare): reduce UI blocking during comparison and sync\u201D; \u201Cfix(data): harden transfer and comparison workflows\u201D; \u201Cfix(compare): cap per-table compare reads and flag truncation\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataCompareSession.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":"apps/desktop/src/composables/useDataCompareSession.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fed9969f6687845b1f5fe7973fee09af8e104c18926104415b72d2a1e0dd3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/editor/batchColumnSelection.ts: apps/desktop/src/lib/editor/batchColumnSelection.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is batchColumnSelection.batchColumnSelectionColumnList at line 8), 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(editor): fetch column candidates at bare alias-dot positions\u201D; \u201Cfix(editor): distinguish SELECT wildcards from multiplication\u201D; \u201Cfix(editor): stabilize batch column selection\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/batchColumnSelection.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":"apps/desktop/src/lib/editor/batchColumnSelection.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba4a0a363c47015cbf4916a90d965b48bfc63a4aeffcba94f24bf393666d16c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/composables/useDataGridCellDetailEdit.ts: apps/desktop/src/composables/useDataGridCellDetailEdit.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is useDataGridCellDetailEdit.useDataGridCellDetailEdit.startDetailEdit at line 132), 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(grid): auto-format json when opening cell detail\u201D; \u201Cfix(grid): keep JSON format reachable after compacting\u201D; \u201Cfix(grid): restore long cell values in the detail editor\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/composables/useDataGridCellDetailEdit.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":"apps/desktop/src/composables/useDataGridCellDetailEdit.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"258cff7172b1e739e89533ef38d9f4618339d4408becc03c996515152124c048"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drivers/sundb/src/main/java/com/dbx/agent/sundb/SundbAgent.java: agents/drivers/sundb/src/main/java/com/dbx/agent/sundb/SundbAgent.java changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is SundbAgent.main at line 33), 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(sundb): resolve mixed-case table metadata via driver retry\u201D; \u201Cfix(sundb): use driver DatabaseMetaData for schema introspection\u201D; \u201Cfix(sundb): use the correct JDBC driver class\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/sundb/src/main/java/com/dbx/agent/sundb/SundbAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/sundb/src/main/java/com/dbx/agent/sundb/SundbAgent.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bd1e449100cabac065f5c090640f7b3dd19dff55cb184b4426015b829601be"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/sql/oracleCompletionSession.ts: apps/desktop/src/lib/sql/oracleCompletionSession.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is oracleCompletionSession.usesOracleSessionCompletionColumns at line 17), 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(oceanbase): preserve object paging and completion metadata identity\u201D; \u201Cfix(oceanbase-oracle): complete tables across schemas\u201D; \u201Cfix(completion): resolve ob-oracle schema for alias column completion\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sql/oracleCompletionSession.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":"apps/desktop/src/lib/sql/oracleCompletionSession.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c933a6d0dd5041a940c18d87c4af4dc1851c40c5967d5ca26f74fde973b7e0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/redis/redisKeyPattern.ts: apps/desktop/src/lib/redis/redisKeyPattern.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is redisKeyPattern.createRedisKeyPatternMatcher.\u003Creturned closure\u003E at line 88), 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(redis): keep user wildcards in fuzzy key search\u201D; \u201Cfix(redis): preserve full key snapshots during local search\u201D; \u201Cfix(redis): fill expanded group subtree via targeted scan\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/redis/redisKeyPattern.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":"apps/desktop/src/lib/redis/redisKeyPattern.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"12911f7332bfe9d9759d152fe444d530a0add1587f58db4a6acfdaf2452725d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/settings/ChangelogPanel.vue: apps/desktop/src/components/settings/ChangelogPanel.vue changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is loadReleaseDetails at line 135), 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(updates): recognise a promoted beta after a manual stable install (#14929)\u201D; \u201Cfix(updates): load changelog versions lazily instead of the full feed\u201D; \u201Cfix(settings): render changelog entries as markdown\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/settings/ChangelogPanel.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/ChangelogPanel.vue"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a818066c7e9299887841e65b70aa8184c325a772bc5b7adda31ccc0f268fa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/sidebar/sidebarDdlTemplate.ts: apps/desktop/src/lib/sidebar/sidebarDdlTemplate.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is sidebarDdlTemplate.sidebarDdlTargetsForExecutionContext at line 13), 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(sidebar): apply DDL display preferences to Generate SQL \u003E DDL (#14847)\u201D; \u201Cfix(grid): qualify generated save and copy SQL with database name\u201D; \u201Cfix(ddl): honor database qualification settings\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/sidebar/sidebarDdlTemplate.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":"apps/desktop/src/lib/sidebar/sidebarDdlTemplate.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0305f8b39cbbfee97539de2745005ffe34ce196021bb07be17ca47783c4085"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java: agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ConfiguredJdbcAgent.characterLength at line 201), 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(firebird): place column defaults before NOT NULL in table DDL\u201D; \u201Cfix(saphana): include column comments in table DDL\u201D; \u201Cfix(metadata): scope schemas to current catalog\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3124a0102983248b37772a70b2121272fb7105106a8f94b8d8cb480c02e9002c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drivers/oracle-go/query_guard.go: agents/drivers/oracle-go/query_guard.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is main.isOracleProtocolDecodeFailure at line 89), 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(oracle): retire the session after a date decode error (#14004)\u201D; \u201Cfix(oracle): retire the session after a response decode error\u201D; \u201Cfix(oracle): recover object column panics on pinned connections\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/oracle-go/query_guard.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/query_guard.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bbbd47d9ec7c4487019e9951f77c9e56d5cc0b7b009fcf742f22d3bc9f585f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/app/updatePreparation.ts: apps/desktop/src/lib/app/updatePreparation.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is updatePreparation.setupUpdatePreparation.prepare at line 174), 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(updates): name the dialog that blocks installation (#13907)\u201D; \u201Cfix(updater): allow relaunch and draft flush during preparation\u201D; \u201Cfix(web): avoid crypto.randomUUID outside secure contexts\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/app/updatePreparation.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":"apps/desktop/src/lib/app/updatePreparation.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a6814a96009023cb21ac2c7cc32cdee601af909f4a287b67c690e11e9bcfbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/editor/sqlHoverSearch.ts: apps/desktop/src/lib/editor/sqlHoverSearch.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is sqlHoverSearch.createHoverSearch.stopKeyboard at line 277), 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(editor): keep table hover open while typing in its search box\u201D; \u201Cfix(editor): eliminate ui lag in hover column search\u201D; \u201Cfix(editor): navigate SQL hover search matches\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/editor/sqlHoverSearch.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":"apps/desktop/src/lib/editor/sqlHoverSearch.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0457eb2f97d2df0c3cda9892dde3e53845e815c1d21ee1297dd114349eb066f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/commands/window_controls.rs: src-tauri/src/commands/window_controls.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is dbx::commands::window_controls::set_macos_traffic_light_position_inner at line 2), 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(linux): make transparent floating windows opt-in\u201D; \u201Cfix(linux): draw rounded corners, shadow and resize handles\u201D; \u201Cfix(desktop): keep macOS traffic lights aligned while resizing\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/commands/window_controls.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-tauri/src/commands/window_controls.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea55d8aa199d9ec83f50f0be8b32d4366e4968a80f323084e58b0f87914b110c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/components/plugins/PluginFilesystemTab.vue: apps/desktop/src/components/plugins/PluginFilesystemTab.vue changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is refresh at line 53), 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): block passive reconnect for user-closed connections\u201D; \u201Cfix(plugins): self-heal restored plugin pages silently\u201D; \u201Cfix(plugin): defer restored tabs until manual refresh\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/components/plugins/PluginFilesystemTab.vue\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginFilesystemTab.vue"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c168390f3b34170384e71308eec9d00327c726c1404b0df0056423d6125516"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java: agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is CacheAgent.readTables at line 112), 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(cache): page native table metadata without JDBC catalog scans\u201D; \u201Cfix(iris): display %Boolean columns as stored 1/0 values\u201D; \u201Cfix(intersystems): read out-of-range integers via BigDecimal\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"657331b12a33eaac4fe206920d68c1426e5be4f73e57eb05223b0ddfdc03900a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/desktop/src/lib/dataGrid/dataGridInfiniteScroll.ts: apps/desktop/src/lib/dataGrid/dataGridInfiniteScroll.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is dataGridInfiniteScroll.dataGridInfiniteScrollAppendCompletion at line 50), 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(grid): keep load-all chunking past the per-request row cap\u201D; \u201Cfix(grid): keep DOM results at the first row\u201D; \u201Cfix(grid): continue Oracle manual transaction cursor for infinite scroll\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 21:11:37 \u002B08:00\u0027 --until=\u00272026-11-14 21:11:37 \u002B08:00\u0027 --full-history --no-merges -- apps/desktop/src/lib/dataGrid/dataGridInfiniteScroll.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":"apps/desktop/src/lib/dataGrid/dataGridInfiniteScroll.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd67937fdd39b24dcb606a73c0e766e0d3609ce288a4c7355faaf8fdba471da"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 35 significant file(s) lose their only recent owner: agents/drivers/duckdb/src/schema.rs, agents/drivers/rocketmq/consumers.go, src-tauri/src/commands/mcp_native_installation.rs, crates/dbx-core/src/host/update.rs, crates/dbx-plugin-runtime/src/plugins/filesystem.rs, apps/desktop/src/lib/sql/cypherFormatter.ts, src-tauri/src/plugin_ui_protocol.rs, agents/drivers/rabbitmq/main.go (\u002B27 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d082d69ced72b9cd2d4da36d5f8c1ebb9b3029737c5bfa427914e369f630f55"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 16 significant file(s) lose their only recent owner: crates/dbx-sql-data/src/data_grid_iotdb_sql.rs, apps/desktop/src/lib/dataGrid/dataGridSelectionPersistence.ts, apps/desktop/src/lib/dataGrid/dataGridForeignKeyDisplay.ts, apps/desktop/src/lib/sql/sqlServerRoutineSyntaxDiagnostics.ts, apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts, apps/desktop/src/lib/database/damengJobAdmin.ts, apps/desktop/src/lib/updates/componentUpdateOrchestration.ts, apps/desktop/src/composables/useMqTopicColumnResize.ts (\u002B8 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8c1e6e501c3d2839d8127f305b725d2a27d57ea0b2e46d03194a9cbee044e1f2"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 10 significant file(s) lose their only recent owner: crates/dbx-core/src/admin/nacos/namespace_access.rs, crates/dbx-core/src/admin/nacos/search.rs, src-tauri/src/commands/mcp_http_server.rs, apps/desktop/src/composables/useDatabaseTableEmpty.ts, src-tauri/src/commands/nacos_cmd.rs, apps/desktop/src/lib/backend/nacos-tauri.ts, apps/desktop/src/types/meilisearchManagement.ts, crates/dbx-core/src/admin/nacos/port.rs (\u002B2 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e1f0451975074405b631f31625a5b4be2b3dc7ea3c12bb028288d67d1c51f5f0"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 6 significant file(s) lose their only recent owner: apps/desktop/src/lib/database/xuguServerStatus.ts, agents/drivers/xugu/protocol_error.go, apps/desktop/src/lib/sidebar/xuguTablespaces.ts, apps/desktop/src/lib/database/xuguProcessList.ts, apps/desktop/src/lib/sidebar/xuguTypeMembers.ts, apps/desktop/src/lib/sidebar/xuguPublicSynonyms.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"51ce4ce768f6ed819c49723a395d791c8c4a368ea16b950926fa7f3acf4fe12f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 6 significant file(s) lose their only recent owner: apps/desktop/src/lib/ai/aiConversationBinding.ts, apps/desktop/src/lib/ai/aiConversationPicker.ts, apps/desktop/src/lib/ai/aiConversationPickerState.ts, apps/desktop/src/lib/ai/richContent/aiRichContent.ts, apps/desktop/src/lib/ai/userSkillSelection.ts, apps/desktop/src/stores/userSkillStore.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"53522438473abc593926168fc722427bc194b2c20c2ffeb96cd40da266592c32"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #6: If anonymized user #6 becomes unavailable, 4 significant file(s) lose their only recent owner: apps/desktop/src/lib/sql/functionSignatures/oracle.ts, apps/desktop/src/lib/sql/functionSignatures/postgres.ts, apps/desktop/src/lib/sql/functionSignatures/hiveSpark.ts, apps/desktop/src/lib/sql/functionSignatures/trino.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"baf136805be8daf210f330247e116b3ace8d8a541b1421474790576a211bf6e5"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #7: If anonymized user #7 becomes unavailable, 3 significant file(s) lose their only recent owner: apps/desktop/src/lib/database/oracleConstraints.ts, crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs, apps/desktop/src/lib/dataGrid/largeValueSnapshot.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"83ffe8191dde2d97c7d6d72be5dbde212c2607fbce9626676231dd8256cac041"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #8: If anonymized user #8 becomes unavailable, 3 significant file(s) lose their only recent owner: apps/desktop/src/lib/graph/graphResult.ts, apps/desktop/src/lib/neo4j/neo4jNodeResult.ts, agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2FileConnections.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b313d8c44f53603ebb75b1250cf38835906f9b6244e65a11dd73fd9a6bf4cffe"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #9: If anonymized user #9 becomes unavailable, 3 significant file(s) lose their only recent owner: apps/desktop/src/lib/plugins/pluginFieldConditions.ts, apps/desktop/src/lib/plugins/pluginBottomDock.ts, apps/desktop/src/lib/plugins/pluginAppearance.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dfc9846c1e749b458ff4740dfe85085f231b527de110561e6f597548429bb1e0"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 29 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (121 single-owned of 1855 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 1855 of the 2665 production source files in this repository met that bar). They are anonymized user #10 (2 file(s)), anonymized user #11 (2 file(s)), anonymized user #12 (2 file(s)), anonymized user #13 (2 file(s)), anonymized user #14 (2 file(s)), anonymized user #15 (2 file(s)) (\u002B23 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/dbx-formats/src/export_split_zip.rs, crates/dbx-formats/src/sql_file_zip_package.rs, apps/desktop/src/lib/sidebar/sidebarLargeSchema.bench.ts, crates/dbx-tauri-consul/src/lib.rs, apps/desktop/src/lib/connection/connectionPickerTree.ts, apps/desktop/src/lib/dataGrid/dataGridConditionHighlight.ts, apps/desktop/src/lib/sidebar/elasticsearchIndexActions.ts, apps/desktop/src/lib/mongo/mongoQueryResultEditing.ts (\u002B27 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(Agens, tracked by #8144 and #8658): Remove \u0060is_agens_endpoint\u0060 and all"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67d8844ef5e0d3a836dffa66fa94e51c8f83bd1387913563ec77a3000168e51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix GenerateEncryptionKey at some point to cope with different \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/go-gssapi/krb5/krb5.go"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2056e5cb8c10ceb23923416910d21e9750b37279bbe5b19179a6aa4520541872"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: testing this stuff really needs a KDC or a mock \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/go-gssapi/krb5/krb5_test.go"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11c07808a0c084637250bee39c21dcee0e2804a378924eea9dfada8a1b9b4b1"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060mcp-darwin-arm64\u0060 is a command-line package (\u0060bin\u0060 in \u0060package.json\u0060) and neither \u0060packages/mcp-darwin-arm64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp-darwin-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5309d5991c70484684ff33e0181e9a8932310047e7f51cbe4450a1751b08e6"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060mcp-darwin-x64\u0060 is a command-line package (\u0060bin\u0060 in \u0060package.json\u0060) and neither \u0060packages/mcp-darwin-x64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp-darwin-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"510a5f26f26496622f60bdb99caced5d2a7219782f6046ac0b985a1d599f07bf"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060mcp-linux-arm64-gnu\u0060 is a command-line package (\u0060bin\u0060 in \u0060package.json\u0060) and neither \u0060packages/mcp-linux-arm64-gnu/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp-linux-arm64-gnu/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7c48ed1398cb6fe6eb38de2e70c362609a079f910110d54dc6a3a4068de3a1"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060mcp-linux-x64-gnu\u0060 is a command-line package (\u0060bin\u0060 in \u0060package.json\u0060) and neither \u0060packages/mcp-linux-x64-gnu/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp-linux-x64-gnu/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db0154dc7f2db6fa499c5b85c841f15a1bb1c1c411b7cc703727c6ee8dad616"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060mcp-win32-arm64\u0060 is a command-line package (\u0060bin\u0060 in \u0060package.json\u0060) and neither \u0060packages/mcp-win32-arm64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp-win32-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb76d7e6b9fe9ea88c01c0d017016e8fbbf72d5dc8c383606ebdcbe06fe34b1"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060mcp-win32-x64\u0060 is a command-line package (\u0060bin\u0060 in \u0060package.json\u0060) and neither \u0060packages/mcp-win32-x64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp-win32-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd63070e315f972b40bb4755bcc3baa04edc0b952e278f1c5e7ba03f9708ec5f"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060package.json\u0060 makes this repository a deployable product (line 8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f571cc2c2542badcf90ae46e31e24c43d9ca80090c40fca9fd1434a5c34546"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060genTSInsertRecordReq\u0060 spells \u0060TS\u0060 where 24 names in the project spell it \u0060Ts\u0060: 24 of 26 names in project github.com/apache/iotdb-client-go/v2 spell the token \u0060Ts\u0060 (24 of 26; unit: names in project github.com/apache/iotdb-client-go/v2 containing \u0060Ts\u0060). Peers: client.byteToTsDataType (agents/go-common/iotdb-client-go/client/protocol.go:57); IoTDBRpcDataSet.columnName2TsBlockColumnIndexMap (agents/go-common/iotdb-client-go/client/rpcdataset.go:22); IoTDBRpcDataSet.columnIndex2TsBlockColumnIndexList (agents/go-common/iotdb-client-go/client/rpcdataset.go:25); IoTDBRpcDataSet.dataTypeForTsBlockColumn (agents/go-common/iotdb-client-go/client/rpcdataset.go:27); IoTDBRpcDataSet.curTsBlock (agents/go-common/iotdb-client-go/client/rpcdataset.go:44). Rename to \u0060genTsInsertRecordReq\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32893ec533b46fee43670fe3d2002b8d6387b6c74b09de1aaf49b1293e50e2e"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060genTSInsertTabletReq\u0060 spells \u0060TS\u0060 where 24 names in the project spell it \u0060Ts\u0060: 24 of 26 names in project github.com/apache/iotdb-client-go/v2 spell the token \u0060Ts\u0060 (24 of 26; unit: names in project github.com/apache/iotdb-client-go/v2 containing \u0060Ts\u0060). Peers: client.byteToTsDataType (agents/go-common/iotdb-client-go/client/protocol.go:57); IoTDBRpcDataSet.columnName2TsBlockColumnIndexMap (agents/go-common/iotdb-client-go/client/rpcdataset.go:22); IoTDBRpcDataSet.columnIndex2TsBlockColumnIndexList (agents/go-common/iotdb-client-go/client/rpcdataset.go:25); IoTDBRpcDataSet.dataTypeForTsBlockColumn (agents/go-common/iotdb-client-go/client/rpcdataset.go:27); IoTDBRpcDataSet.curTsBlock (agents/go-common/iotdb-client-go/client/rpcdataset.go:44). Rename to \u0060genTsInsertTabletReq\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4bdaa404d362f1189863b6a534e32b74e7768b2de2318b087fcb8f53787729"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060reconnectDialTimeoutMS\u0060 spells \u0060MS\u0060 where 21 names in the project spell it \u0060Ms\u0060: 21 of 22 names in project github.com/apache/iotdb-client-go/v2 spell the token \u0060Ms\u0060 (21 of 22; unit: names in project github.com/apache/iotdb-client-go/v2 containing \u0060Ms\u0060). Peers: Session.Open(connectionTimeoutInMs) (agents/go-common/iotdb-client-go/client/session.go:193); Session.ExecuteQueryStatementWithContext(timeoutMs) (agents/go-common/iotdb-client-go/client/session.go:665); Session.ExecuteQueryStatement(timeoutMs) (agents/go-common/iotdb-client-go/client/session.go:756); Session.ExecuteAggregationQuery(timeoutMs) (agents/go-common/iotdb-client-go/client/session.go:787); Session.ExecuteAggregationQueryWithLegalNodes(timeoutMs) (agents/go-common/iotdb-client-go/client/session.go:820). Rename to \u0060reconnectDialTimeoutMs\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/session.go"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a41b44d7e781de6bc9df0e687b40bd008463544915c0bdb133b50dee8836f21"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060propertiesJSON\u0060 spells \u0060JSON\u0060 where 236 names in the project spell it \u0060Json\u0060: 236 of 237 names in project dbx spell the token \u0060Json\u0060 (236 of 237; unit: names in project dbx containing \u0060Json\u0060). Peers: useCellDetailEditor.looksLikeJsonString (apps/desktop/src/composables/useCellDetailEditor.ts:69); useCellDetailEditor.shouldUseJsonMode (apps/desktop/src/composables/useCellDetailEditor.ts:76); UseDataGridCellDetailEditOptions.warnFormattedJsonEdit (apps/desktop/src/composables/useDataGridCellDetailEdit.ts:31); ExtractorRequestSource.keepUnsafeJsonText (apps/desktop/src/composables/useDataGridExtractor.ts:47); apps.desktop.src.lib.app.documentJsonValues.ParseDocumentStoreJsonDocumentError (apps/desktop/src/lib/app/documentJsonValues.ts:9). Rename to \u0060propertiesJson\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/neo4jGraph.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b064d2391be5b1701bde555fd18f83726253206725a8988426c455ce9fa52b"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060ServiceID\u0060 spells \u0060ID\u0060 where 2602 names in the project spell it \u0060Id\u0060: 2602 of 2608 names in project dbx spell the token \u0060Id\u0060 (2602 of 2608; unit: names in project dbx containing \u0060Id\u0060). Peers: ConnectionTestPersistenceState.testConfigId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:4); ConnectionTestPersistenceState.activeDraftId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:5); ConnectionTestPersistenceState.testRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:6); ConnectionTestPersistenceState.activeTestRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:7); connectionEditDraftSync.connectionEditDraftSyncAction(configId) (apps/desktop/src/components/connection/connectionEditDraftSync.ts:13). Rename to \u0060ServiceId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/consul.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ae3eae3e59eb6e79b9e891031859a4a43ed8ee0cebce90dfa7ee61381a3b58"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060CheckID\u0060 spells \u0060ID\u0060 where 2602 names in the project spell it \u0060Id\u0060: 2602 of 2608 names in project dbx spell the token \u0060Id\u0060 (2602 of 2608; unit: names in project dbx containing \u0060Id\u0060). Peers: ConnectionTestPersistenceState.testConfigId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:4); ConnectionTestPersistenceState.activeDraftId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:5); ConnectionTestPersistenceState.testRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:6); ConnectionTestPersistenceState.activeTestRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:7); connectionEditDraftSync.connectionEditDraftSyncAction(configId) (apps/desktop/src/components/connection/connectionEditDraftSync.ts:13). Rename to \u0060CheckId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/consul.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"60380755bacc6b7160f8236f067a49e40abbffc6d0f96e067526f0ecaaac9936"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060ServiceID\u0060 spells \u0060ID\u0060 where 2602 names in the project spell it \u0060Id\u0060: 2602 of 2608 names in project dbx spell the token \u0060Id\u0060 (2602 of 2608; unit: names in project dbx containing \u0060Id\u0060). Peers: ConnectionTestPersistenceState.testConfigId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:4); ConnectionTestPersistenceState.activeDraftId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:5); ConnectionTestPersistenceState.testRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:6); ConnectionTestPersistenceState.activeTestRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:7); connectionEditDraftSync.connectionEditDraftSyncAction(configId) (apps/desktop/src/components/connection/connectionEditDraftSync.ts:13). Rename to \u0060ServiceId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/consul.ts"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"456ac893d39910de27055312181001f3b52ee88c76b6609e113ffb2d005035f4"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060AccessorID\u0060 spells \u0060ID\u0060 where 2602 names in the project spell it \u0060Id\u0060: 2602 of 2608 names in project dbx spell the token \u0060Id\u0060 (2602 of 2608; unit: names in project dbx containing \u0060Id\u0060). Peers: ConnectionTestPersistenceState.testConfigId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:4); ConnectionTestPersistenceState.activeDraftId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:5); ConnectionTestPersistenceState.testRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:6); ConnectionTestPersistenceState.activeTestRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:7); connectionEditDraftSync.connectionEditDraftSyncAction(configId) (apps/desktop/src/components/connection/connectionEditDraftSync.ts:13). Rename to \u0060AccessorId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/consul.ts"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec638c69b4cf799eee222bf15dd1306e8e502618044039aa007edff59218feb"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060SecretID\u0060 spells \u0060ID\u0060 where 2602 names in the project spell it \u0060Id\u0060: 2602 of 2608 names in project dbx spell the token \u0060Id\u0060 (2602 of 2608; unit: names in project dbx containing \u0060Id\u0060). Peers: ConnectionTestPersistenceState.testConfigId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:4); ConnectionTestPersistenceState.activeDraftId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:5); ConnectionTestPersistenceState.testRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:6); ConnectionTestPersistenceState.activeTestRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:7); connectionEditDraftSync.connectionEditDraftSyncAction(configId) (apps/desktop/src/components/connection/connectionEditDraftSync.ts:13). Rename to \u0060SecretId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/consul.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9e7fdbe87d0ea270a493d39a9d3fec24d0fbcf2e89d20d3554d09a782d2445"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060MaxTokenTTL\u0060 spells \u0060TTL\u0060 where 34 names in the project spell it \u0060Ttl\u0060: 34 of 35 names in project dbx spell the token \u0060Ttl\u0060 (34 of 35; unit: names in project dbx containing \u0060Ttl\u0060). Peers: http.redisGetTtl (apps/desktop/src/lib/backend/http.ts:4155); http.redisHashFieldSetTtl (apps/desktop/src/lib/backend/http.ts:4231); http.redisSetTtl (apps/desktop/src/lib/backend/http.ts:4303); http.redisSetKeysTtl (apps/desktop/src/lib/backend/http.ts:4316); http.etcdSupportsTtl (apps/desktop/src/lib/backend/http.ts:4399). Rename to \u0060MaxTokenTtl\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/consul.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9a8b094ee92c8be2df713d87c0186fc3c34fcea259d140903642080de91126"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060PeerID\u0060 spells \u0060ID\u0060 where 2602 names in the project spell it \u0060Id\u0060: 2602 of 2608 names in project dbx spell the token \u0060Id\u0060 (2602 of 2608; unit: names in project dbx containing \u0060Id\u0060). Peers: ConnectionTestPersistenceState.testConfigId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:4); ConnectionTestPersistenceState.activeDraftId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:5); ConnectionTestPersistenceState.testRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:6); ConnectionTestPersistenceState.activeTestRunId (apps/desktop/src/components/connection/connectionEditDraftSync.ts:7); connectionEditDraftSync.connectionEditDraftSyncAction(configId) (apps/desktop/src/components/connection/connectionEditDraftSync.ts:13). Rename to \u0060PeerId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/consul.ts"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75895b75ba86af2d2cc4be235bac5daec0b79f161a024449e889dcbd314ebd7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Materialized view nodes\u0022 repeats the code it sits on: 3 of its 3 words (materialized, view, nodes) are already in \u0060if (node.type === \u0022materialized_view\u0022 \u0026\u0026 node.database \u0026\u0026 node.label)\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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"140d2f0720d7f711cf9f3aad5b1e0742efcd79b02eb46281aefa535492cf95bc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Package-body nodes\u0022 repeats the code it sits on: 3 of its 3 words (package, body, nodes) are already in \u0060if (node.type === \u0022package-body\u0022 \u0026\u0026 node.database \u0026\u0026 node.label)\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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"536ef4462c6a4c478257e2c9694f5e8bd19e49550ada81c50203521c855ed171"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Table File Import\u0022 repeats the code it sits on: 3 of its 3 words (table, file, import) are already in \u0060export const previewTableImportFile = forward(\u0022previewTableImportFile\u0022);\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":"apps/desktop/src/lib/backend/api.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5552dd2eddb9de4cb3ae3149f56ca67749f099f548ec62719523ff0c048762aa"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022group.children contains ring groups\u0022 repeats the code it sits on: 4 of its 5 words (group, children, ring, groups) are already in \u0060const rings = group.children.length \u003E 0 ? group.children : [group];\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":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a845ce469f34ff277dacacbc3859bcd95ae9a71c38f75bcf4e6c61b4bde66c49"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Detect INSERT INTO table (column list) context\u0022 repeats the code it sits on: 5 of its 6 words (detect, insert, column, list, context) are already in \u0060const insertInfo = detectInsertColumnListContext(beforeCursor);\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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3110}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c20de3948bb72ef0beb714c3cccdbadabb6147596a3997111a3c9afa8b63d7"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 8 of 101 project(s) overshoot their size bounds, lowering Project Cohesion to 8.4/10. The most over is \u0060(repository root)\u0060 (484133 LoC, 5940 module-visible types across 140 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"530df92993d1853ce94978cf94841101b941d2172ad4a5e79ead6e3ab798bf96"},"properties":{"commitSha":"63498da121c8e999dedd7cddf0d4937591bf7dcf"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"795aa7af043f3bbec55b2a51b074cf837742d63dc28a58638d09057333f81db2"},"properties":{"commitSha":"7a19c9d770159cc1bfcfc0a46b4234e161787c3d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9fd83247f3afffac55cc636a3f0966ba673496e674cfc5803fd3af85c002c55"},"properties":{"commitSha":"63498da121c8e999dedd7cddf0d4937591bf7dcf"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd9c8c098ea4ed37a8864b8bb677079738d1ae6c4208c2730feda3216d365b38"},"properties":{"commitSha":"4fcb0a120a390363f1a77c1a175d22122693df7e"},"taxa":[{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06a08c764118dd487c5867d1c91d5033b9e76f9d2fde70295d90e6e1d33aadbd"},"properties":{"commitSha":"139281ce714b4d0874b7a815b456a80968626f18"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66b276a962e0b78fc625facb1ad8c6f56870f4f95e39f2f83500b4a64b3ca808"},"properties":{"commitSha":"c246a2cbea6a56980d597a825052d6ce3f92a8af"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9bc3c33874b2421cd21cb46ee21fce7958a7e27a01ce5edd9692ebfaf21c2b8"},"properties":{"commitSha":"4ad9c5f38f494a6c557cfa17a42d1bbafd149308"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68bd22911455e13a867648af2f8ec691c6070073ab697a000a458d6b0f476e4a"},"properties":{"commitSha":"06cb5c9b75ed7414183d3549b43acce7be023956"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee529cc5e41976db617d232403fd8a06c1c2a6e8ccc62f58df1e7af2d827feba"},"properties":{"commitSha":"30d8b3970adb48a5a7c577a1e8f85aa1412dd4ca"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddd2807016db53dbf546e63ee9bb8b274bfe304d274021ab8a4e5e824046121f"},"properties":{"commitSha":"21652bc79742c982d8e100b40b77dfe3650aee92"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a19dad302f6e45c723fb85c1b5f9c2b963cf831d47c3c72efdefb696f10a28a5"},"properties":{"commitSha":"21652bc79742c982d8e100b40b77dfe3650aee92"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9b4eb18084883a170296b9563636b15cb523355486d7514d6d337c5506dc051"},"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":"a841269f38b3d91d609d1d590657073618d69e270173ac72b06b59fa6b7fb37a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cebad2867f50ed5458c823f28192fd930cc14a6ceb321efab80c8793ef2e4788"},"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":"3c52ddec1e12818eb53ae21c040c1a364f78101b7a6bc518ac9876eac0b9df8d"},"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":"f9619e8a89cafe27a5e045a4db290cab4e9f3a6ae358dc632e08328041d5df85"},"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":"982fe1d9a75663a7aa83628417388c01b857f7850194d1c9a5e8613707d9a446"},"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":"f6af0fd8fde3db1ee8fdf25c2c29de0bdf106b971d86204cf4d8f54b9408f3df"},"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":"5a53fda3fa99233eaec4aef97e88dae50ee0d9d5aa77b50d730fb42d137ad912"},"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":"047c28bf08db96fc99c552d74a18cc4f8123d3fd86957c15261d1b3cee397313"},"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":"5e59494e3b689157314a4e92cac7801c9259c3805ef255fdda316c816013a97d"},"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":"7f9cd15a127f3e44a03485e28ad155d174975e58b224b15fe42d5f100a94e9e1"},"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":"5a04ae05f741b293b08e35b0358f15f7d6516052fefcc84387736c16ff3070a5"},"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":"80c8e6f96a76abc4912fb5264c706704e60f0c8f2d862e96764992f3f4bb31cb"},"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":"8efdcaf41b7227fa7393cb0f8393453ada40aaad07861b482d5c708b0abddbe5"},"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":"e449ca1ffa510e412f9e37295d287134b080a9993e58d7e135276a59127b1800"},"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":"47a7b965a4def62b800d5d5143a4c3d31e66fbd583bbfe86a0529588f4f9d2b5"},"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":"99ad6d6bd36a18440800be8b339d2c4e5be3c91565ede97a3293c3cb3111dbd3"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf77414276e5e24fa1be3fa7d3fbf4ebcf4097259c2c91141bd4cde92e0f7dac"},"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":"e03ab8754f23e761583aaf876d85886d2f08748f92e1202ae64ea91a3c6960ef"},"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":"e9923738c1c098bc25d1c309c11950c521a106b171ec2bcb67aa70473d9dafc4"},"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":"1c1d5086b606ca1c2c4dbec031a8a25985cc17fc678a3a8636c9ea502f243575"},"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":"7487fbaeeb99a9c48b426bcda81763f4b286e78146e3899235cd82c8c62f12b1"},"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":"5c02bc0dc2a61dc4032e44f691f0fa2a000b25f5d2012b2ef8895d931a38856b"},"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":"9841ef5c75c0a071a3277fcef2252df19441bcfb75df7eb24f7a2318bdac1752"},"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":"4ddc62747255e1267270bbff94fadda9a510bb3ca268c0292e8bd4378950e565"},"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":"fc272f585cdeb4c877543a3a4ade1e9be4e33a42b5c4a81860e8ec1d630dc0fe"},"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":"45b3c47e70b381fc8a33945d3776a48742151c2be76b18cadb8cd2ed0a3021a3"},"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":"48f3da800c5ad494e7a5d2e49363796f236ad551d2b7c491ee3d350b0a4e2f95"},"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":"b4425bca426f7f9c082193dc4c34dfb8df28b35c9e6cf16cce779ace82285eb9"},"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":"ad31164edd72779e60243174689bb6a1083a2c6c778e74c9216c89055de0318e"},"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":"d012a4242683dca0b8a83ee6812aded60630b6df1ee8cc3027ea164e21851c2a"},"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":"01f27dfb71e2991783ba5681c716792012e053d2178da572939f9f82c72a048b"},"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":"e6c91c9e7821fddc17b45aa7763fbe70d92da43f5d7fa6e606f3f609daf4f60c"},"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":"12c3790509b31c80d474cd31e1ed128db4a588a157bb603d1e51796d2be63dd3"},"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":"9078125a1b894ef72607b8a2f898fe4bd75417d68b4b30d490d57cbf74ea772f"},"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":"466067db85cfab02831dbb6acb32ced0a8b2eb38fe0c85cdeb7879a15f8a2c57"},"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":"c06861c94df63a35e1e45189ad86cba8edc1e2bee74563dcde19a581d7c922c2"},"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":"fcf58cba91fdc0e15553b6ec8ab1d05266f68cf2977533b2d69591197f8b59c3"},"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":"fe0128ef9bfd33ed7d6778d44fe6e1406484a89aff1a9110b18e906f9eea13fd"},"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":"a7bd8eb43a9be5781515307abe0fe4a6c073ce3e7b02a71c5ec6b07e2c4f4855"},"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":"72b7d68af6123e9005e79168d42d0571b0993250d2981e429106fbdaae7eb5b3"},"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":"99da0b244aa7cb6a51727d691dab0a91c8074c04d0dd23ed98d6a8761d825e48"},"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":"ac51f3dcac6bd4d374331ebff7119de01243f169abd99937c48bd53d54b442ec"},"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":"7e2be30def03d7c18ce57cf33f9586bbe09f6a5621f93c9fbd74f4c7f927f36f"},"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":"cec3551b56ddde17933935c54200462f5260cd1c64558d60fd759876c0ff8bb8"},"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":"d942b920c63f8cd85b32907faf8000ccd2e975bcbd0d0f18fdbe10107b73b627"},"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":"f962abe1a32c17c1da717239f8f93263783fdf9ab4fc0f210dd89531693b9d3a"},"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":"8039b65f796e366aaa943ae2d74ee03d36298e73f6f05e1315ab224de672c470"},"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":"d5e80508b7498b68051bcdb10e63a8aba99e148a1fe8f36bcb8aacc16fbb4b2d"},"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":"ec1575e8b8d6dcf5d7dcf17316a612b9bb0c25920c850dcfb28ab8083770dc14"},"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":"9390b24207db70a2de552b0226c723396418d4f329e496285c0ce6e881f8d3ce"},"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":"06e45449be71e3b530bc5e90666219ac160413d5d6cc115ab01c59b83eb75425"},"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":"d7ee436698893e2bf7538e612153313970dde4ba9e886cf4efbdfb61ac6af10d"},"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":"123732a4d76714f713ed406e96505202e403e390a8e67b1effc761328eeee365"},"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":"588a504baab07872f11f1e48919545f0924f6a3b86c2cd9acec9c5108fd8c81a"},"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":"c1dd5731165cb2de56023a9974251c7e6a8cf5cde6cbfce4892a954eb533f4a2"},"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":"8b5c13fea31d1cf6d66f5ecfb1022e8feaab2b36c1e5c81acba0959e96a92491"},"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":"32e5f469c6e2c568ea643eca7a8bfdf41e7ce197a98a06e3171aeebf226c5666"},"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":"f66434ee05ce1a244a8326dfee160c74a3bf3744382e6e43159216344c2c63f8"},"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":"cb165c542a1a08f30d0bb6b675aa1593b9d365b4a606d14007d343e140e422b4"},"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":"b83521f2c3c76324434620adb6f4b37cf682e56d47dc74c95699370b57206339"},"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":"106a167d8c3f91da47382558bcd29c7364e7f6de688e221590693fb912e2b73a"},"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":"75a158ff2bcee589b807dda7aee914a3f11029e06014904d7f57c135df883948"},"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":"dce931b702f3e84cd495efdec6b078e783b659b445397c0718871cb03580accb"},"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":"8393510967373e4ae719d52e9d8717889a095cd93aa0cfb4a484a04161db0c73"},"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":"b3c926abc0d9cbf32f78876bc192f38c70a02662e3e99c366eb22b52043bdf1b"},"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":"4ba576db25118530eae247f5d66ccef4eb4ccbde447be3334a9de511b991acd6"},"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":"c4fdf4e220ba60ec01a0c05d50b29e97e9df7c13a4242c2ae4a5e83d42ac364a"},"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":"5b0965238a8260de8a9a3ab9b9c4f661be4c9fddf9199c57b1e85ef30d662f2e"},"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":"c85d60fb4f6ece9b69cfbcccdeb8364a599ab3fc6b7fb87f15ce5d9c3ac464b9"},"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":"8addfe2c7724cc1927d71e855c518c4bc04d33a7390de379449ee31c90579b1d"},"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":"0106e5eca0a857c94470d2c003359d9b08e13185359fea8621d90ba5cd4fca12"},"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":"dad04e047c5fd2f5fc1bdb74c670ecfc0af72fe4b4ca07aa95845f5e414df17c"},"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":"daf5992cd9c94f38aaef221dbb127513ae872b0a8a6c2a427de1de44ba83a8ea"},"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":"2ed928445b30a0211e839915490ae654eeca52cdd38a576c6cc88735a23138ef"},"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":"79faea88b8ebf0e724b0470e82c5aa743567342ae44692b64b651b893b67149e"},"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":"00825d87799d1cce471b724c2ad1d88055a140f93614f6e6865a57552f191b94"},"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":"61ffa5ed321d45d62dbc75003f7d03df3662d7daca42da32435e69dde584326e"},"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":"969a33510ead3d1bdd79ff5be31c2921abc635c5e74143c74f3d2277d7f2e53f"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eeb9036c58f77d9930f8d329b10b14bd07fd67551c04cba4ccd5c1a2343bd142"},"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":"61c1974813bf0e13aeba1662cd95b7a3ced89efc6aac59d3dad88808160dc8de"},"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":"b000fa7355451f1f443423fa03bb2fd210c96d45c02918477835b92109e7e5f6"},"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":"481472ee35142cbfc7b74c18438b1cc5fb236d253161c960e655270d8bcd51c8"},"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":"ba0e92f283dc013129e421c6f24a517d57281e7d0b51a11609a7d65ff2225511"},"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":"024b7f6e3d7ee6a8450d458c1a7b075a8d1d4715e0b5de410112c958b7528a22"},"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":"3dae88bc982ffd1eb063b58a1fd31bf37901fa3fb92d47e685c9d5396d753bef"},"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":"01d274889d64afdd75f2bca55ad193efaf8f3d18a61b1ec32bb0e6026b3a5c95"},"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":"49e0f75ca9e571da8b016f8ebf7bf0078bc0d33ccb4c32a984dc8749e6b8eb6d"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"b64ba3fd4e2d2751819a6b41e6bb22b4941ca2729c5b335f3087cdb41cd63c98"},"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":"d3be9033739ac81460ee007340b2e1471e11c3fd83e26e61aea94afed9f07828"},"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":"865ea989f9d642656255d7b1999a043980895b32c6afa8499f6e1c6ba04cbd2b"},"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":"d3ed48b4317500017959effe597810d4f7af0a6b898a6003d6844a38253114ef"},"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":"382b48ca9b3d26c10adcd61011bed70878ddc7f41343fe992df3647c3016309c"},"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"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":"2fb041228e5a2d656f05b0422b275b118fadfcb5dac8888da47fc5fa00fc8779"},"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":"de24fb5b2f9808dee7349e0f8b4bf4e8fc0b77a05b8578184e5f23b813b48863"},"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":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"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":"1a0a408ee6f3339b5b038be2982108ec80e3e2f5b1bb1b2a07e844523dbc6c86"},"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":"4ffcc1b724469248fcd864b1901b4fb0cedf5b911fb5d6075b57cf61232c29e8"},"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":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"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":"5783405f4d0a90b9c0d555a912ad691c38641466c391f7837afc1bb9cb056747"},"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":"56d9371fb2efaf7518ba7ca36b309fcf19a4dd77b8fedb20a641b6ff91c06d3c"},"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":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"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":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"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":"8848ecb9b4899118cc8b8341841112d876be29e865cc3e14990aec7e928c6bbf"},"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":"ab979ab2dc46515c14a5a4f004fc991e04e40404eedb88f91aeaa5242f0df4a2"},"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":"ede70caf5f1bdcea587471454be8a9dc896b62b515692206496a71e589d55bbe"},"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":"3ee1818d8255f485c4fe9f8eec7ec14865c030222317516add1ea3f2587ac448"},"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":"8c072cdfa4919a186094e4c61b35105c5d11db195171982dbe24ea845c729dc4"},"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":"505e87e1d5b495c7c6afed88609260b72fac798da4fb6d1c9d4e6b9a2612b1ea"},"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":"c4014e7719155abad9ee780737c6a29d8c31bcf1e70b94286734d74edc799576"},"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":"9cf3fa0564336673aa64ac709fbf96b5687fd19178dae7e3bb67e37e5ec7645e"},"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":"2ba1bd8cd7cc00ffea37dae7b5e07643f624b23874e3cb0759fc3e4878f73406"},"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":"8fb8ef81494f3171ee9e771c5fb3496be994634eacfbf8e109fb303e9017065e"},"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":"fc16fdf0e4ca3c006dcf9b77d9a081a8b34a38c11900be60f6df82ee11d0b584"},"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":"fbd15266f43b9269d01ed4f6ec9cd6389efa2816fa64229ec0040dbd3e374ce9"},"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":"6e8a627e7020ac8119c8ec6c60ce9a9f6a161d947c9dd66552a2bad9e055ffb9"},"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":"c8381cdd9539330ccdf5f2819fb2f0ec8e0d20d645b1467a3e5e48700a37b69b"},"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":"f57d1d312afdbea5e586f5c4277469ac5784f32d5ade2a108c78d246b6a0be52"},"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":"ebac61d292e4757946ff83f15293e2fa751db1ae0044345ec1ca160a7804b230"},"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":"17c766048720a8335fe9cee4b5c94d175d687786ce4fe5ac15a7d88cc7deda62"},"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":"cc4313e08c448232f318be35b7241d4b93cdb38b46607e6d9e1235238dd8f561"},"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":"958d4abe0376dbd29ad22deac42da4dd1c7272133d26a369ed188ff72a75e6fb"},"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":"1fe915542e9ef9e0e2030d13e5e967c9edc93ad44e0043112709e63c307bce8b"},"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":"c63cf8799a8b5ead23677b677b846139e79b84c38f91b4822a46b8153aa112b7"},"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":"594ba20856faebb900e8f635978e37e019356a968254d953432a089b831a6265"},"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":"7e9323362030c11a89ee75d7211b2720333c55d8869ae68ed4aebea060c08384"},"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":"447668b7fcf03d704b8571741044da65bab0660f9836cac3718569a1697863da"},"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":"99d286b61c05509565eff68f5a68397110175f494beb4363aa73834f7e32c54a"},"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":"89122daa9eadbee0becf88df1842c3687c4e4ff108e4e21aa3f49bb2edfed292"},"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":"fbb3016e08588da0295feed2d3c1aabf07e14aa98db895f7d8608ac6dac5e7fc"},"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":"ef0f73559f0bf802baa495ada3d949df21e2d98cd76bb6297f8f8984c65c2c33"},"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":"be8ac374eb879fae158515405355e2da3763877c800667d6c62205a9d81b7151"},"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":"27caafaf56fda6b53f8eac51f3d304cc10e80b180ee1514289a98fae21e73a43"},"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":"f7493bb85aa2303f31804b6ff88c48fe50f76a3545417f12a1295f805c1a6f8d"},"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":"c178da23d5dfc12a928a90f7d5596cf295aa8c66dc6c666d793acf3eed7c78ff"},"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":"04cc6ef8b2713c5ae671a21c5adfc62ed3d32eec231bd27236ea49e066082d50"},"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":"3fa03dd5c6754319f00472b439d942249818b769fc19844a54ae6a1ada7702aa"},"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":"baa151beff35ac46ee2536907cc918a207da07c42b004fec4c9aab8d58a6df6d"},"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":"53041d0452eb7a0f6d7363cca46cccfc47fe77904a465fee573e39f7c59d9395"},"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":"79b1f05e5e0fc760b813df5563155e75e80e97eb4a6a74b128d6ee16a9b98bf7"},"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":"0964660517e2fb4aa579fd4644350b7882ba94beded2bc7ffb3cedf7f3e6faf6"},"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":"344d521ea3bf800770999bcc1cfcbc37d31ca53efd5011ddacb4dd10f4813f65"},"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":"b6666f77d8f07f5ad4e7321b52465aafc6cae03e7c8e17ae3ccb503ba48aac37"},"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":"a6f691a9d74630da27a24550c017d100dec100fe91830bc522b2afde139f4f94"},"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":"158220d202c678f8c32f7a174e777ad0de2f56ad0d96c887de9fcdfbdf4fd5ad"},"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":"b962eafd3faf0df14ab8267775f92fa432b2670c858a297fbb3786009e64bc8b"},"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":"8509f0a7c73f3664915974f616b7a20e32b702ca8078349351665d951340eacc"},"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":"a2b30287935870110c28e7c68c6dfade0967fa048321dde51257a5515e8cf291"},"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":"3f3eaefe0c3fa37c6ee51535bf6dc2e94e9e7b8f713ba85a7a9ffcc847ffc081"},"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":"dc8dc3a80ba7c51fa3657ccdbc67a4fca8fe31374649027fd7727fd2ec40d53a"},"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":"77e2e71a4329e551cbe8be7023c7191820e375353d80fbebb52a3572f6943665"},"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":"d1b1a56f51d12aee8302b31a191c09ff92b53b0506d933e2858150fe67e2da5e"},"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":"dd3c14c5e7374d011ec19f3b44962a81b5ffd411bebf725a7c54c919737f69ee"},"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":"a078cb5ce12d971ed1eda9a3a3ee215def1196c15359303372664af993828f90"},"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":"b603ba83dcaf06b94e6d682416647967a3b89bb8ad6e6bf6e3f1beb0f695ba67"},"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":"ce4c50ed651a00d1a03d2a80cd9ccffdaa6fdf0081ec413ad840f0f6d26f7b48"},"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":"559fb4377727106c5a5ce03d334b16720ca4b3672f476de37dfcefb4c17e7128"},"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":"228717293663adf6814e4ed3902d35ae57e0fb1ae37165ea4de4f676848a2612"},"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":"f922c7255994f5959364b9c3250dce73177cf5bdea64983fea86dca2fed1d22b"},"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":"de9f2fdbfb92b17aff787a73b114a5c1a22b24fda5702d3434bbe9d4a71e8b7e"},"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":"417c80d37e40c8c101c97e32ba9af1a95439f85918a11b7f2f630d08f638a53d"},"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":"d4a59e5ebdd54602107746841fd10b7252c68b34b02e02c73ed80377e8c2ca39"},"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":"4d6f6d2299541240adf3d78beda7cca255597ceb811977f6114518b502da8f2e"},"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":"dab49e7bff6abccf0ed1d2cdd0312c0e0943465882dfcde5c10802c162270d53"},"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":"b3c7803fbd9c725e1a5168bbe26a226135322eac20781ab0a00b755d086933ad"},"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":"0afc8d6625e383842692ff73106b37b31656921787bed7858b659f55f6cbb7ac"},"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":"22cd9b8e33d4fe50d100cf969a02a323363768c0d50ca1036bc16ba7c3c69f28"},"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":"b1ca988001961f1765f256f686a1e2fc10d78c8677244e42ccab12c401a49876"},"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":"953ea0a933e85997eb6832ee13e03572bd2f3440020eac48461890f0bda6e83f"},"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":"6447d410c09a85403799fbba66e5b4f55d797b91bb3d566235c39ee18135a297"},"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":"09295e32c4e9171906aef4a534b0517990a4a701cd51902354827628813da9a5"},"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":"b245b133d000350b18c888fb995f735be3f9ebd67ad3f44d5cfe87972a048938"},"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":"8d932480a92ba55bc9da42aa16a30422328423737206be2bba63e7933dfaf0ff"},"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":"d40a50f28a2193a83351deda15b069ac58b8675d01b4c3f486563cce8326ca6f"},"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":"6048cad3561d24b2d09392c31478b8ea188cba07eb29adc16516cb39e240c9d3"},"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":"fc4e7cc3d2c20973d43ce33b9c7eaf46f80fb9840b0d4a3aa386c3702494602d"},"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":"be028f7c90c63b9f5f92202344b89699ff150ad1587f4a06361151cdb69d7431"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"3fa8b776af28a2fd11d6f1cd5deb3b00d9aa2339fe06ce07a4fcbfd55f57baff"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"9cddffc07cd33b24e555b85907fa703d5deeca830ac15b10f2fd23c11aa4e862"},"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":"f139be9dde984309f945f8fb3a236d312b252ef89a0c0cf6835a968044e2b630"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"052a592d13620e8c4f5e8940d5f75aadad60ae88f664f2af335dc1964593b09b"},"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":"33bf181cb01649986bfc972d3b7cbf7638f7000a478934d89f5516804f2f13af"},"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":"69a3fce2944e6b0647e9dd8ebf56e697cb4a27d5231e63640a2d72dd61250c04"},"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":"826a6d79dee1036f44a4304f4c6b39229ef7d3fb2001013958a5fde3ba6f17ac"},"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":"c4962aa7c585e1aece2096701feae18df0e3edd30dc103bd4f647f806c95143b"},"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":"2a5889d0b0f58978b7ff52f96851f6a446f03601f20f6bef1a087f5b35af7cc5"},"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":"aee98b336f6153c6f53350d5493db6262f04423691cd664dfeb7178ea86c152b"},"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":"07c3f7ccf23cf22a00f48d99e13af6f3e44f58cd30ba4e346e3202f805f565f4"},"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":"01462e605169b34abe56c8d1db054c5c80a736478677f062b2c2cb8f07a6c55a"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"962ffe70805975a2382abc0dd7ea8e4202174a9789222e393e04bf7310951713"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"c08059d0008f7732ef23bb3f4690605d8093d6a70a8e37e2420c9fa0632ea0ab"},"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":"0e58f60aa5346cfbe3a46ea14a4166f86f649fd6562d6599eb7ea96222dc8f2e"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"4569a12ab650b3a8591f80e8d71a25bae970aeee7dd763d889c5a86ae578451b"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f5647ad305e7120c4e60e3b2a5a95e9c6c52bd21908ef598eeb86255ba14b224"},"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":"a8c5ca5cb834051f7c3640824ac68eddb44160793ce725f36d2d30445ddcd28d"},"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":"3839f1b865614bc1236789dd44c556a9ae56169604e398a7a350ce5f67dffef8"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"579cb1d69ba81f0946feca43f94c08abd421da5cb0afbf6f6489ee8da6caed23"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"8500bd444dd29b22a2b7ee47bd5fb7323de7a5296fca9e95d0d7da12354cfcad"},"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":"6919f3c1a9925a5e880709de650ab4db90d2a386e390100a3aabc46ad9b9a4cc"},"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":"00839ef6ea5af3634bdac80d72eee678a90d934adc6c73d59f9fba67cecb2cdd"},"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":"3e1ed0a58df46ecafdb9eaeffd68fe7138231a14f2e07d6ba9a0600137def930"},"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":"904c3cfbeab77ee4878cc5b39eaed7d2479d7dbfd7c34680b0244d804ecedc29"},"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":"15e50c5f126a28e6bb827d56f59cbf9887b80bde743183c12d3a0d83af8c055a"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44291e871f274a7ff4ca5c8c06be2d7d5d367254849997b870a4de52e8e35ae9"},"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":"7e6423c6083c1a7c64ead05b141b86629bfa1ddd082f133a17dc540dc6616fe4"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6251fec28d81d636415ec9f5f21608f10263288a0b8b54bee62cf95bea0647c8"},"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":"3e0f0d2472827c38d8c2027ee03c5ae0bde1062b9b760964be3c5b7a2ecc5600"},"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":"e2f923d6befb68d7265fe5275d2049a78c30576d51d1057d0119bc893bc5e1ce"},"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":"4dbd84299f51068a2ca3e14753ddba62133b7fd2fa4937eb8373173aeeabfc58"},"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":"fb8f06ed5f6590a4b136ab39b315a62cec0a38252e1252bfed8ded0e0d27c5a0"},"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":"9c8f6bc7cf74186123af066a5999bcd3ac420c241fa65c2c92d80ad21efbcf91"},"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":"627223f5e03968f6ee39cf8a22cb947ed4cd40a70062b4f9cd26956c4bc2da10"},"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":"0ceefd1f5a78bab1bb54ee9456270dbd9643f0299ab5400b57048ae0fdd8a22b"},"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":"18e32293eda099802841412c081a71bce13238c0a9ae2b99340b2e96ab1e4819"},"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":"c4b940eee783052e495d5298728cce9e8eb25a4c56d2c7586fd548a253c8622b"},"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":"353a661930ed3594f2cc1a0c7046e047848c0755e1334e3af8f1388383ad5dc0"},"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":"fd0a72d9c7cfebe46ad5a8dccbf01e7daf82dec1489ae30b2596f2e015a28a92"},"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":"ae3aa5360499e49f35078a095b891500f82de3040f545016996c901d963d6b2b"},"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":"ef4a1a420d2adcf66b47c97f2b7d84db1cb7e7e004f125e187e1169ea178c6ba"},"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":"0c10e34ce9b95eb3175180a97e6e31dd3c5ec52d16a0c4f117d96e2e071df70b"},"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":"e1932d438ce1f14b2f45869eae96ba76e40a94eebc143199aa6e27d86bf26fb6"},"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":"38f1e3a385bb0c2de21f5eeed4e8cf3fbef2e2f23dab7d461daf74197a96af66"},"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":"fe307e727ce1b04aabbfec496052ebaad1ccf529ebc1b1e6c58a724a752f3148"},"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":"a5ef36d9e4ca9d343f0b8832daf611b80de010d2b677ba7422d3ef312e7463ac"},"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":"5930ea749cb768198e0302ec9e18c868b12ea6ddaa5396a08328f79842fbae89"},"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":"1cddec5f9947ed1ffdf1ec8bb13764ba3978294ac58e570dfa1cae7c3ae4ec13"},"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":"233cfedd04b6f71600840c47f10f9c73bf79f52bd4f83687f09f9e5d0b911df7"},"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":"1534c9fc7807a926b8d98d76cd542da2b43dd9326e0dcd54c32f45982641b13d"},"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":"23eb8b91eca890ab93af2e0511b66d53c4ad7612d98aaa55596b5ae27f919579"},"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":"9dd8665408ee40e5204b58b34da0aca7b2e3ca93244830e800ddfa333317530d"},"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":"ee4af69065e3505c9864423af3f18c567ac37590451c8fe7bcd71b4e0eff331d"},"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":"fc6648ad6e09852b75f6da09d6716b82a309384d98dc25425e0c6bb47e42d026"},"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":"30774ffb6bf28b9b9ea3aa007e646f6fac13c60dfd82508d70fc52de98b24b5e"},"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":"7048e1825de820c5db1e104348faf1d25dfa5480f74c73b18e42ba750d8032d5"},"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":"ce59f8783fff9ba7fefa85165576cf253217729f69c493a9c0ac738c0ef10dd5"},"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":"5fd059e001ba13c6996d565bf8999f379a4ab33778620288b81a1f697e3dfed8"},"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":"56fe9a426477d9e434cb02e9429b414644a805f1f8631f816b2e7038dacbbba3"},"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":"be2da749cce432742862da70eaa9095d760142637b72bdcbdf49efb793dd7e2d"},"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":"0af2e0c92cfd228e6e86195092f803f914c88ea3710c8fb4bcc0b57c5bdaeb6c"},"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":"1d201b5853668c978c7b18e62239e4948b64f043026abec1ea6bb2d050eabae6"},"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":"cb68258b50af4cf60e2e908898b1aacc552e37dd4af91415e2db943a2b182b98"},"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":"0ac8471da60ba4fa7281579c811ab966f80b9c8ce2020d90362ca621f4a920a0"},"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":"57dfe867c0408b215a14570d0c65edddcaa667d40b4d7414d087261ab23f0143"},"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":"a2f0ad0cc434aa5ee0376b4b2db08a0dca31c8dc5a9e2b8c5ef890756b9afac1"},"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":"5702f1226bfdad93c04710de8172811f8e02ed67e80987fc9877adff5dcb0f41"},"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":"b2a2ed31d20996d43a7f06a472809c81bddfffd4d79505381cc0e0da0cbfefa1"},"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":"0c748171d59eaee65342e9ba1a1547b22abfd405c4dabc1e9cb83a032ee6ba9d"},"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":"455443e75af6bc6011ee90f6e53ed382a697668b6b98b60c3f81c5d2a68395e4"},"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":"5c058796020dae9cabf4a849b8386307f6425e39f44620800d6fdad2f0cb0793"},"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":"f30943dad8d7b40c6b63fd70977e5957ace8f833402ae0b9eac0b21b5a52762f"},"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":"57f0ebf465eace8ce4b5620602c1417bd41fb0b061928d60d866594bc1c82466"},"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":"8df57bdfe2ae8a9b6a9b421432b6b5d5a18b94cdebb1f737884045877a111567"},"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":"3768849908df3182c7b14795df968b2a22175ea20eacd4e6d8e1f1957755acbb"},"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":"b2e52a5e8bc0adb9900856e24a1ca41722ff2338279d0b36bdc6f476f7e6ccb0"},"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":"ead1c70d80b6a6ede2672ebf8abf02aad3e9959562e7eda48ff3d005fde2e35a"},"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":"498223a0ff1e6649fef9d25f670b1bb6f045cadfb43dd57aebbcfe67226d3ed7"},"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":"a00c3eae65348b1a70a6bb4fedeba9bf18737ab2c8b805e4481b5801d4657997"},"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":"bd7b5a6a6d875b532bf9dbd96de5993bfc8f0b4140d65fa24c72cd7643484c7a"},"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":"253e7c7c71c2f17bc9fea497030cad8a986b087f95d563852ed0b373a3390337"},"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":"62efab93fe5d636fb49f604280166ecb57852d3870402153566551724a86ea66"},"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":"950dbfd5b4cc5497603ae77cd53ef154909a8b04078c48c316e338d63c61ce2e"},"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":"f6898275d55bd811e12427ff1f0ecf54ba20d47e5e5e8493579b7dee13795abe"},"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":"cd3ef30a1dcdf2c767800fdbd60436cc3d720e5cbca34c117bce73c7202acbcc"},"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":"ddcbff9af73ee6870af1169e9ef6ac97020f090f0e87081f3419fb2006865d42"},"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":"073e49f887f60c40a5382fc6d3105ced4c6842e56ba30eb1e293094486e10978"},"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":"10c1c448a649fe0237ae0280fb0891e8b6b4a08732be575315f26d8883967860"},"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":"73fee4968d6bf2c12b1da4a41a4e9d05bb1365caf3b56de5c0a7197667a19248"},"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":"2e1be59fb153c1f9fc377efa2d63210e7c3dfcc50f7c961ee487322df5d769cc"},"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":"b5fddb9ac7fcd946c1112a7330f7c2e430a7690aa227010d32524091e69ed1c3"},"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":"2f6c923236545a9cf2c3fd7813b38db0f5b0d11a24fa323925329e0ba4a7e794"},"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":"aaa9db373f8d00ba95b57a6612b9d60dec2ebcc3fb110a9a770ece96441a62bd"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef90b9570d48d81ac10254fb6667c484d4b5a4b30fc68b44a1fac727ee2caa66"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c92bb920dd95d7349ab623f443480bb2846a7114621a58d2c2ade8a2ac3ac7e"},"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":"690168baa19c7b955f951182bbd0786973fce96fadba5677339fb0c1f12fa72b"},"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":"9d2dbc712d0ea5e007fb377df59a2f073f5a908c1cee58a4bb9d29784b8ca056"},"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":"6cfad192b5458e9c4f7c61a4fdc4dafce55639b438e0bc22bc820e4744eea6a7"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d580e5abc7eb325838ab97ee6048f78eb45f1c9da4c88a50284571a969799efa"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a000be34e45e7519293bd4ede25288f5af42c2ed186f2d29c0f40b4e25a33de3"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa711d8299c9004a71977b0cd66fe51acc946cdce090bd38153f7586b55cef4e"},"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":"296c26a75df0e71983b684dc1c46544ea1111b0a2e5f5aeefc3ab581a7e42cb2"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71598c1c8f52e78a96d93237d90feacc239e0c8dd3de24ace6a35d9eaec2934f"},"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":"95920bc138b4f3eea426338c15aa2c82f5baec86de658204f61c8be3d220df3f"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"790946069488f440c67dea18272746351f261c63a981303642c26d8b5d3f243c"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6eb69ba728b9da8a6a6992f23e8cddcec51cbe910b7ba7fc1be3c72c4e23efb4"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6737b7a5f91b87e890cfeac63834fb19823d846f0115fc8e96ae6685f62fc73e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f22e7196e521edd32d3ef87a76a66a00193731c799dac8874c2a6dabff80e9b"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b27347034fcc21f49d0f72a6b69b651f735e020a43de9ca06f450d2e96a65b3b"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a82231b5c4a21dbd4261280b6d20f2acec3efe07b7a8cca0db2e74cd350dfff5"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"b3583f15440f7cc0c5ba4a6389fd1798c24465f4bcfceef8be5144e4713d8aa0"},"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":"e53c1bc40894ff3b1c344c868631cd8eb0603b119826484e05e6ce0e1a39a1ec"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa0143da6485d184f629272bba19e6753854f397da049f5a7e964ab5dacbe3d0"},"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":"2edda313cecff675f19fe2791205ed464444682986bcdd13f0cdbe4d9de970f5"},"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":"a8ad7a69abf058b3c05c8845b8949ff9845bf8fe7747f3984bdaee35a67f4d4e"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"18304539309da45c3fe5943211b157a897a7d28ace328475947523144419bf70"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"b8c564f263ba1a0e8df987983cca697937633599e1499b253af89d35faeeac02"},"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":"f046e2b27ae277e289f75a2b22e85fd759bfa3b78d3f83762683de092279057d"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"be42472aa61fd90d644d57df947aa17fb86aa66edac897dbb362c93d35e69e92"},"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":"ebaaa8ce8b01cc508229a46dbeb5aa41a0590f4f42072cea3b4a247ffb984744"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67d38fd5388fedb2ee74930b464cac0c97a06d2169f897abfaf21e601caa64a4"},"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":"7cd629adbb05db9e12975bc8beb30bdc5a4ffddb9fab52168283a4e5d3f114da"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9bf08ff92006bcf394a7892bbb47ba9a558df17be259f120cdce04faa1bcdc7"},"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":"c2a6f494b289c7b55ea2bb2f29223375037d23c3c1333c74f8b8cdf0f4955d7c"},"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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a70a3ada3bae9a9b4937c8dadf6051d91e207198f3aa5e67fbe9037a6335a0ee"},"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":"95c86518b9ad95a400ef73d9039d32575b09c7dd3fc490c40463b4b7e2269082"},"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":"f42c03ad0b0bba6e9289ccb92a2ace85938bd8e86d69e3a1d85de3773e107d52"},"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":"44ab766b9ceba5acce5376a793dc45d0e9351e0c81f44332d9165adcfe2ec20a"},"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":"2e23a7f636105e0250dd8dbcb9339f32c399d20682ca1c01ba18d9611959eab1"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1064881b1494a0979eb931b13cfb0b74dbf92ef7ecd5b042ef3e895eea67bfa2"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-668","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd1e3131f8f7decc66f16b37806fb82c9d782209c67abb6bf7bf3bc91c52a547"},"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":"a2d4d34db81fb7980bb0374cbffc224c0329c23127b2f87c3c88b3da56ac785c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"fb4a23173542d7a1718b502d857067e50a3ab2bcd9e6cbc8252c0d9b2bd57371"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5d14d01959f8bc74cfb47cedb20165c1651927e69ca7f14db02f6d54f0db1ae"},"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":"e49b2f1dc8b6ada106a5ae99dbd677414f86c9417d6f8d886e453974e952e52e"},"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":"6408418bcb9f26dd5e202ee827206e5ec0b210a3dcf9ef0d7d820938c266df2a"},"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":"fb74a59e718a61b51c6a15dfe35f20d46ecd5a38b36668578b2ddda21b37671f"},"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":"205a7a02ea8082383b748eb3d15631e66d2fc794037e944b6347954f4971b22d"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd57fc77b2642efc190a6e6dd4a65118a61634b50ef02cdb280af9a65a6018f3"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-668","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33087269ec44c6ec071c7d991a836e6328ff5efd9a5ddf638a98f665a928344f"},"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":"bb0410ee4cfe4973d155b8561e3e89af5200f9ce81c264c396f787235d3821c6"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"a63c57ffb9c0e05f2b44afb65be81e05d6a2da3bf8a57577f3a622880491dc0e"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"66fe2ae937fe6f9726b7afca4d49cb6505f3d6caa2f4285dae193ca4897f1eb8"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"d2542699b904854fe2d3bb29c559aae2c03652694d5ce26390e798fe91bdf8a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cda12ade2ec2710b7dca5e054f0e71d75819267a9850f73b253c183b256cf29"},"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":"da7728c9905597d996f6271a56bd5a11cc26d1823ae33590c6eec2e9892b3248"},"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":"103c0efe65e785945f4571e572aa2bc3befa8fb273937b108bace21f996a210a"},"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":"889e9ec9c800ffef3e8ed07d849ee23cee1a7863f50316abe7cdca2f996aa39e"},"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":"d541a0eb3b2dbe5998fdd42a98fc8d42f993bd63318277a56aeb54e15c268e50"},"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":"fa971f3908b5ae3caae6932c3089046cd257419067b36b2cc99e2f6c4ec1a08c"},"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":"40beeab9d0a6d08f623e39a5926a8a2d8374e32e01fa56fc9e95acc47771885a"},"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":"343324164d051ffb47e7794b8a67d57114cc607a0cc5b1ea1800c3cd195f5e20"},"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":"f82a94b547e583107475ce443fc06e8d421287b4914413339b69fa88eebfa9dd"},"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":"79abaa6367c3b77560f55602ad4bd6d38958b7ba2ecc0a846ea9de1038c7b2ea"},"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":"7beeb1669c0a1ac5cd0bc5184ff41589710d27c83a4fc353915c92316cc8a18d"},"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":"34311ef040c735fa3fb72b804897e2d51699e8ac8205db1fe7f108290a33b829"},"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":"338407871e9c53d2625a5754ccc8f84f16e799149817c1d1e310aef9e6213485"},"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":"039e4fcce3e545d7d649cd851c92c1940b77f481f0ea93b24a1345884e90fd31"},"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":"2e92484af1fef3b4dcb7c78ad7c99b2e3ef9afcbadf8a52158104508ba920832"},"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":"0a25692745ad0ed3ca68036746171ef1bfebcc093c4887320630d8afff98acf8"},"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":"6d7d90df32a41d0b22764ca9e9e277f2d3d8367397fe4cefab8be788bc8b8cbf"},"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":"37fdc909501ea7b37b9874e79e88b620d20c68980a254dde3ba10fbe12cf8859"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975229983b4e7920f85f0fc412e05c82a765dd031ab3a6828f6e57789bb4816"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40b13e661977ec383b3447ceb5c9f2b5ad4da373f334fdb358e33166ce854f36"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a66683d15b1c69e2cc3bf33200e1ded5a7ba1a6701a45201db00ad773b866232"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7e662489c4e529c01c53eb51edc4e57b4ab5859090fb6f3ddd9e5575be3df0f"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab37af43cd215843f6a4196880225a1681d972daa655f4a9d00c86e0578b8e2c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"a13ab2aad7d6cacf5bad5ca22ffcab0383a14cfdbd78948fc0468ecb49e4b431"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf8e62a7a5a46c3e2f255a5c267da4fbb806c59f8b145c64a5cdcf4795047f16"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31e15292ee7781495cff3025f3779e23aded0d07be93120b45c65e1d6518c389"},"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":"0687424160123dc6400dcd7c951218a45f955a8035963ae0ac9fa855234869ec"},"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":"071d82ed5fa9d9b639062510f3972508d288dfb11ab04436260db8af388a3462"},"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":"6fefb5a862019e6537f48d1cc54cfb909690ae67b4719969c16dcad65a24a27d"},"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":"1fa330c7309707ca37697fc61231f1ef5256172595d307a940e68ada1b24d848"},"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":"960691d97fbe2b6a685b9a5aa993ca33169d579c014d4f896e1661cc92b48e74"},"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":"0293ae1dc8e102200e895c8f0462f2579c8f1fc9967dc241a9528bb0bef00504"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"d19857193a4ac4367cb57e876cf2eee5f3adb4bac72f279312d31bbfee4f6a4d"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"91e163fb21b52caaeb36fb609caec021d6cee484d42dabd33b43b04372a9ca1b"},"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":"5c891a1f16c0774c99e409173b2c1f600435f0e33ece7728b7470a8ae4ee07d6"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"fdd698ef6bd7011b091c6ad2b96823de74f9117d1926dfe0d977df291c6d00b0"},"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":"f40b734f5fc8f448770506e7c34e2a65f4a6bbdec240f0f7285a9b100152251d"},"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":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"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":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"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":"1de4e8df69f8ea88743a72dc79ebdff0df14ccb12667fe14ae5c33266501ddc5"},"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":"5a0307a0e95589e470722eaa1f6edefde899ff9d045423b92eaede73ef396b02"},"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":"749d4a048dbd3dcefbd7f353dc0600354e0714ae941b690d36aaef580abde338"},"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":"7e0e40f69ad7c1e292b93117a1537ed45d916690961f6e17151473d6fd51e6bf"},"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":"857c5dc010c10bb458f9466ffbb6bc4652f0bd259d41a51e6cbcd8c6d32a9a72"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"42f62c08a817d669faeb12abe184e3cc97ec457fcb1dc948b204c9b3c3b8039b"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"df6618386a258840787a0b65aaf9a8c436c506e97b1d7f0254dc1114325d6e4d"},"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":"26ba592b6cc2872a2e23d0c33717b7b90b58d4fc3c368eb868ea09a06a393176"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"9053e1f45f822416586eaf120bcb8457b02280d1dbdfc1a2876c257bd5c09b40"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3026c112dd3ac8a773ef27f9ff3c6a0db3165f259ba40b7d56c2763c0dc3e74d"},"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":"f6b5fb416b9ccbe5d4a8245ad8d9335106d4b6c3978e0190dc087fa8faefe75c"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"133ef7f63685a05a6a132598c3bd8622cb9e2481ee62c55e78e31f44a1a5abce"},"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":"2faef27945228c021f4dc9deceb24b9adde24514ab16d68f6f070ae9b0be7f1c"},"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":"1321a924a6ee66102a01f8bc5606d2ba196e84f458def499a6f2aedbc68c1d63"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"c0939648e73789093e236becad590c8a412658d954857b793397a84640cb44e3"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"3f54657c8af61535e03ccde43ecea3154e89a0283dd5e6c2b1db653b0ee709fd"},"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":"fae88886d5f72064bf803ec506862718f1a490e939c858951618b010ce2e0df0"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"22d1adcaa1c5fbe103e7c881a4f1ee4770de8598cd797b0d53fcdcacdbd9765c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"46ad2356570487f55edcae998c601be3e4fb739e435519bc6809558f20b6ce3d"},"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":"a990da58a0ac209560ac4fa4614658254879daddb25a4d51a09bd7fe5c10100d"},"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":"37602965fd68e28c4565ab2cbc3ee31c06020bf4eb65837c103ca77e3dc32610"},"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":"414c70f83374b69efc50bab0826537de85d7c02aab4882d088786e8d89405169"},"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":"46fd9d6a28fc7d82338d3a2e7eb77309304e5b7fcb7f0ac98e12f6fbe5b7ef71"},"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":"34f7a49c544f13c36b155d8404c5b8a713448e9178378cfa9790773f35a6064e"},"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":"08a72ce1308c92b2f0ecf1e8e7b5b0e6ca0cc751ac674101752c68356b8c4e25"},"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":"ae1b88a8ac3147f1723aa14dbeb9db5a95c5c955cc4407bc5169c8fa116d2d8b"},"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":"517babc33d26b7480e891de8f6413e5c81afbaf6e402a187a285d0ecbf45f04e"},"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":"1c35dcebd7181e7f99501c1435510221ad5a29f3bac96590b404af908dd80f0b"},"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":"4e6395201f21835ac629a1baf5954ea1d50e9bbef33d1f1a33f12393bf900c23"},"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":"21459e381dce6e23ea3cf819c2cfee2e9f15d8c8da3a6d67e2d55520eddef2ba"},"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":"619d78bdd4e70a5059586e0c28ab05b01aefdd5c5e98f1ceb5c8bf07ab7b9064"},"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":"287e9d7e5b860c04c000b29a68abe3c5c3f67b75e17eb12c95aa02b5624242bd"},"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":"88e92aae50031726405b413a32abf58aaa053cf54a8dc7a3219bb37d71f90021"},"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":"9e9bbae008e32bea5005fef437d48cf13420f299d512c92a2ffc06c8535e670d"},"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":"4049a32ff3fb2d0a9a201ae59db9bef03dd5647897cf3239dde5314306618fb5"},"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":"a00608de023e17f1882af8257c9b2e352cd1f0015cb8ef6a8f85be53b9c7ba38"},"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":"7e0a14d4e56894b05db5e3632408f7f612764726088c9c9d89a644219c99fa29"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"f0fb8220491c98a7b5f69dd42d1c398e21d388e7bbb700054014aafb10ff7870"},"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":"c194c0d80accccb0b7126bdcb6c99b629ceb284de0e7f946614948b0611a6752"},"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":"857526e09cbf6fe0c9d06d773e8860eedf5dc8fa847c99532df8317f9320683d"},"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":"1db0558ecca96eea79d3d4fe061e776c021b18d4c02622e622cb55dc8fd431d3"},"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":"461f70695eefdd28753690dbcd8ba65f61e33f475557522c4b586ba48d778647"},"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":"ae99af09add7f346e970c48e4f3e702ee1b0e4274fafa716126ea14dcd69a094"},"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":"5e22b659ffc6eae335b0909a523763fa04e6cf3bd40cfe8de1c283f0ae5719f5"},"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":"88b2780b815b942732a3e4954d2e4daf4b86550924ded188c094cfaaf683b544"},"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":"8d69a122880088854b3cba7b83b8de5c43c1f6f6633df6ea4c76af99840cbdf2"},"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":"34d5aac256d127ed64366bc55573e62262446b4aa1fb85d1f6577e6a97a1ece5"},"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":"36ffeed6f876994d12dbb14550e39d1a557d1dc0d5348426729e388e657b06aa"},"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":"37f3a5377ecd802f1601cc141c93e734920c739819890e8275834224df940631"},"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":"d71d30b107599d96c012adb5757a2b3eb5ec3ad2a8a3f20f7712f3c124b4b422"},"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":"2382fe5702849e70ec656a588137a93dfe1ecf85bd3bb876c21f250e34a4c781"},"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":"c819d5d6c8d73fce91ee635018efdc489ab0cd12980f8b6c66fa6a67dc55807e"},"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":"3ac104e03b5b0f30da8e0a04c358c4596068ac96c9199a9a84561b2f62fa5693"},"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":"3cac6fa545a2c16d3304aaeba471db26047b8087cc5500a8fc84259c18cba9e6"},"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":"35bea35cee8df363f9c378170c95d449feae5fc60bcce6362f238dc31bef8daa"},"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":"ae3b7eefe85ab520feaebd599facff3282687177b630d9babdb7c7847d3d0048"},"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":"5731fdbee5cb6f8e98ffb7a6a96c23b29a671beb3c5fd1a8c0a440d66391aa6d"},"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":"3e1910b91d990c4b5707111b5b8d8ae6ccfaab5eb7cfe6b1754f08d08ff5cac9"},"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":"88d4a8f20c52471273c0de2b509814b7a9b32371605c85407f990930291f99ef"},"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":"1519cc3275988df7da919e3d6a5da48fa483a76491b823dcaa72116a60814369"},"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":"c1a2e2ea83c3943284b24e7b121e4a17a17964df0ebb047d0a933259b0d7b02e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"948191bb934425e7e7cc46ff8d2bff91456cf367046c9de5a6771f061c0324e4"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"fd6f90a40a841e0d83cd41feba6dd344a765707b624ecaaaaa37465f57b16dce"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eddaea7331b065ab053d8d86ccd2aeb1993a98c7baf0044c2ad4a6b3fcd02c30"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b931fa9b651b59ab830ca2d595b589265c70807096c5006b35ae71a0d733247c"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffe3ff6c85186ed21c2c02a7c1042d7ada32ba8160c1712e41e08dbbd7747e18"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f092be4dd8f1e62b6becb232cf9edd806a84d1f8d551b6f1dca07899e1f96c9"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a18b34127cdebe46c9e4be2b5b78ba53ce5a94bdabde22e3a3c6444873b6481"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8f9c80a2250fc0fd704e6281797e172b655661ab4e61ddcaff6e8b1ee83b78e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"196f6533f7c741846225c336d19340fafeb7109c5b39a6674c74fab4820e8c74"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9f6f9d119bdf6083dac646bb90be80fc422bd653a3ddb77d875dcf9bbc20258"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1fc97d6c00e3af31b1bc1f0572bb2a0e97c9389304843d53a5bf2a4d5ec9e64"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03986801e22e244e6d99e662a5e58274c3f50935fd6e87ebf79414d75031b82e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"258942a5046f47d4ff51cebfd743f7c62249ff186753c772872762f24c56634f"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"251052a034f65dd60a13b4efae7c3555ec8c3dac02ed737eddda605e520fd4ce"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c2c64bdf9c3df4020a7ac6eebe04ead165f5d6a3a870c2f4a0aff819560d226"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a25a66d24a2d267e03a351f95c82c491bf3547e2d168cc4211c34a9a77448aa7"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2356d8678c59fd21eb738aad439c44c51ee3ccd482103bff0e9b410f197faf15"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d99a1f8cf9ed395c67a08ecedb097563670f8565ce485e3cb8a91577eeeae96"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db46cd1ce7e2d35dcfcdeeb9457412e8f56080334ac03439f147178106944a96"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bdc3d79a215146320681f0b2e823c920ed664cbaeba72d83c3b34e3509997c1e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bbc75cf2ff3417d65efb99e49d7bf35eb69b7b796919ace2289794ec696447a3"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff49580a234798497c7a2da5511c0438353393937a5920e1c09064fff6da9346"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97898871fa7eff3a009011dffe28b5c5c7ed3287fc26013b33d4fa7bbbf7a86e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3130d098e4d3250a359b8280053f83a7e6fa309e2db443386e4d99c407e89d81"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"099b51e979c29d8a8c722143361de2919a5111fb59c9664a6854d30aa324c8ad"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae45f13454a1d72f0bdcef71ba3f40d35b594b92015a4397ac248fe3020501ca"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d71caeee3b61d026ebd41eb4915ec784d7a7b8de72faef434c466029a56dcd5e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87c9398e49c09d4e9b58f946458e0476a327100c726f68933df94f43b6501095"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0090243d4a042edf104904f788d22eb33e3b7606571ed514ce9b4f070f3622fb"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0a810d355d3d4f7e81281e9e8926a8ef7b865c8a58c04df16684c974135d40a"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d12932f7344059fd07187fbb54c2d2b4d4e7a63d2e253902947502e2ba3e59b7"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63cd15b5c3f82620a51bf9f09c5d4b8e531a70d295a485b64d554dacac37dea5"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8245b1af84ee07045c95092350f5e332f16414cbacac37c0f44463ae92316824"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a14e3f173a864f91c57b83cfae6af8e8f1f17a50230efc2182079106db797cc"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4aa5197e9df6e76ab2d057fdf46b9178414486da2b0733b4afa7654b51fb25e8"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82ca614e6b498f7585833ff64306964a676609ba8e78aa9d2ff60446966e1f89"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4f9f61c681f7ecfa5b11d68dc6ac2e04e40178acdd0a57980dfc4b821ea4e8e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1a2855b822114ec4da97a8159b914c8b986acfbd111d52341146938bbb58d98"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3820e86c5878d2b85affd4464c0dcd7db216b939f0a65bb27d527d189695f2c9"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6da7fd450164be94cc40616203f3a8f364419c61659e577a6afd65fa3ab71ee6"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16edb6583391f62e92e84b981cfc11c6c5264e6266826dc3f0e70eabb9de06c5"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f5a8c575da0ea0751be99d24c557e92f0de0237cfccdd8be0f78d25971ec44e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71a1309a42b332a35fa6609ca4ead2fd1e228c97920cfe110366cdd53c4a6c9a"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d724204b36e2367f2cb81b998eb10a12a5e83871f0eda6e417f8e635a730e02"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74fc5a9147eef03cfa0dfbf5a37dceb407799dcb4f905291a4f220657e898afe"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d0b16a13f088f950a9e9829c55d9d10c1d4567c0d4597956f1595268f7d6769"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f294e1bf3d3c32ccf779884e4c0794a7fcbe96d0594f620c72739fcaf8043da"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"787dee685f9c46d44cd82dabb2fac6d2130bca0eaa5a0c17a08a4f78ab078c35"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d16f1f246f7b1f2fdda3d4387998b092e68af0d3a1c11613e1a13c06e889df21"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1ea8dd18cff834116160316fe5c6613d6d0f373e9de0b1e6aee925bc430a5fe"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddcd51f668750f8e8ccc2c82c51903fa76ecdc288794a465f845b5be77f9a0bb"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ea548f4cb0661eeba1a39f3cfa7efac1ca479604ad0c6fb2dbd5a0b644c79d8"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5964b9215707beec85f5dab9073200b3e352192191ae8f0634470c0daab12d9a"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d20cd0ff908623c276c5655f33cf6925cf52926f6cf30e360b1fb009daaa3d3"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ec4c0782dd4789e5c7030ccf7ce70a0686b8e308f02f920b081ea594ef552e2"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f04b0bb048af27dfcee27bde30d2d4e4b2638d706add56c0a36b5ea9f5960a00"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"769ef4f21da2e93c98bfbc4f9be13961914dd33cd41fb9a2e24400a44a386532"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a74bb1b7a577f0d4e93be1470c0068d50114e025028f6da101f60e4d6a437855"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"864c054d8584a21b1dcb15b946fe7cfad7d176079de9afcab9b132f70247422a"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2de42436b7056b9d91305f131c1dd870168315bfe6c06e4e6ab523e7f9dd5fb0"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d324fbe179cc3873c01fc9f58c9d2135ad36c66e8f9483dfd12032e0685662ba"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f56496e0116f93294a4f58329a537aac0984b9cc1cbd7ace76e612842d1b00d3"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d03586acde5b738cf55ea8ee5db9e9efc8179d2432fe5dd543a7dc702e22528"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f489fe80ae02e7a55da36d176ef23e5228d1af745f378d74a9351bce2ff02204"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1523a369e85eda788dd614d62099a395fde38b2cb89e64e6b9de47cb90cfb32d"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9f050e4db2b58cb3cbddbbb107ea91755b93150fe17665db64910c0b615806a"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b19fcc97a1978a4be84dc4c59e66ecb552faf8e14dda21f264ad56492474b322"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73cc86ef307ecababf804053cc58114f02bb1d82062947b24ceb841c0867d60d"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8750074d2e20406a4b90093c70a4940c4512a95b88c1d3eed37c4040efe3573d"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d9af624e58c586e6ee5bb4abd477a21cc89266c0a421c246c0f2219f2522097"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e7a464e722d72a9262592d0b6993789a8a457a52dbe01e0282425a67cddf477"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8402305064751901a7df339a8715cf287fdc5fde02718d0f7c24ca9610d01569"},"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":"01da5692bb77e80210285154184fb3cbcce3bdc1c6d597131a080937076b99ba"},"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":"1ddf33e1f10d5895de829f890b64574343585781c3fc0559f9d42369116439c2"},"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":"bdfc130fd2997bd49aa44e5718b05091c790c1bc4b37a48175d60d6c780acd2e"},"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":"b2ac0a4b2d54379dc3a6fc21fa8e8def7d8fa90f96883dac51624c192fafa842"},"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":"e3d5ad832d26c389c7db0188de027722745c77dcc3c7d40b9d17f5083455f461"},"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":"1069d03bef143fcc6982d0fbe8d99ec716d2359a6cec77ea9bb5907723eeb4ce"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82510834762e915b8a3274b47fec16b6b5c6125a81961998ae82e481b8b482ee"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8a0b680e828f110073e93e04beac29c14ecfb6572ab078f8cdbe1f8b32bb268"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7c84232220700a38affc9f6b180e0b9f0beb88c2e6b61a2a3ad979ee643bb37"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae89353b6eb2ec65221f6feeb9c7e6c1ac2da9da93e795257454d22e3d8a3b7a"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f481c54a064d638a97e0365de3de80dc287d196c571f2be33648deffc74cdbe"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee82e2c14ff4c13345d6cfeda85831d05a40508cb0a1350deb38302123d21e32"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f593abab9af7cefecb3c033cdfbd55a71b12f126c63604002893c7fdcd8f0ed9"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb176dae0a4c2c0262b33861cfb2d116bd85f64615bccde90a9db31404d651f5"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39b71e8a9248b04e7304f3893cc62a3c13fc783c1248e7650d9102d299c960c3"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2a64bc50a3a2625b0cf47ce8e0ce5d7dcf609488059adcf21a0591c8b6ed08b"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c72dbb3752924d4f8cf7e1646412043a5265dd118e4572d28b01599490ee0b2"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f625a7fe2ca3b3566ebea985a3ce415bb96ddef1718e8eb07fbe688790085d3"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"751e079382243be4c9d8fc5ded8ff8b625556f23e46b6c5fea3ed4a555f0c9f3"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c16b77712b64548695b4ab1230f245c5ac22b84c42e288e8359e0725d0cf34d5"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"434d5be529372982de6fc23ffa1846ce774f60fe4e30d15255712823ea2e2c8c"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c03b1c06c92cc7f15f7f7a472df852685e2a3fab9439c55fd9d8efc71eef369f"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cea3d7b74a4584170f48102cd3c7a02508ae1b43cf82b84b13eef8ca06326a27"},"taxa":[{"id":"CWE-400","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":"08272532f2a0b26c63f33346fb311517dfe681b7bacdfea33cf95d6c60c2fc91"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbe2ad2ae48e780e4327e0d1b64dc0aae5e61cf037d3e4f0b3a3f097fce38525"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba7ae5744ecb70561161104d191d4b6074262e0ed882036eb50cf200711c2665"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2c841964de6b681a260596ae0ea55588d01765dd37037d85c3ac9a164247ed5"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"235f6e183e948424aac7116d64d6f91084978030d20bb036a795a67444091eaf"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d625668ac9ac3b0a9230c9d8516b25b1862654b90e0347ba613fa4b747f5c0a0"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3dca444905bcf2b28c40831cc6c42e07c24698dd30c3db95aacac3e25f1523df"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"118eb339f7ae6ea59af7314a743fa19d141a8aeffd1a589703357c9ef2ea0ac6"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d63e5b7b91e3aa42f74fa22d420dcf9f2e255491b124d05370530c15c267fdc"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b7cbd0f703e79447dcbb4560a446131ff82bde0b0e028e705fafb28307701f1"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e72cbfaf95989d773e75a36b398517da1fadb4bf00ffb47fd6c0faed89d7d7b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"180b903eb6f164db462c38f5c1f82ed40ddc8d16ab19120535c3b8b023cd47eb"},"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":"2902d6c53abe8e27f02e75637ef04367dc9391efb4fab7eeb152c600d8fc4057"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bd76a0b169364ce7bced6ebe9f8bf17bcb95f744e056aa20daf3fc4c84bb96d"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0bb22efc9407e95afe734c74ba490742f25998a170d61ce02d246166efe7736"},"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":"89ca926aea8af27f27de6e5997f3bbda368d82415d3baff2d3d0f0720181aa30"},"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":"3a097058be9c87ec489921df0caa7ebed7ac5e04de25c95c77ca33a856a44d38"},"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":"a5df7c9d289c23fca24dc7a79aeea1ec0ed102a96cc025e4d2fd94840e9e52d0"},"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":"f1faa22e17e552535202d10cc0f8be765e40f7a3409db083db79b1087e92e057"},"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":"593405abb6c987bb620aa4b3d45a1ba2e8b79adca09a693c78cb27b6f59a6f92"},"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":"14d1976248bfa16e985465a64d603beb7897de03a0e1227aac8454bcf0c3967d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9d3233f722590d6dbbb2bb78e33b0f4d589c2710b22f897d3a98aef37c40177"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac1e31577da17f5162c4b222551a9d791bddfd3de1e1008a9aeefca9f7f440f8"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2153e48a24cd2c886ee3cad09e860790fce4a2d3aa94224b30950b785a35aec5"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"577e56e72b81758b220604c2b310cdde8118f2b4b37f067a581862755bc74221"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65234040b88672e1e672855c289c263d42ea92c953200e62815064784a1fdc84"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d936ee9414940e9e61d559ba670f429c82b6e31fbd9ae680064457307a1a02cf"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40cf938e35ba7391d3e4e02c975a49d342bf423f587ff69572bbe7b2661952fb"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46be3fbba2efeb9393294c7c117a8eed79f36d6e0dcd1fcfc099376aef519efc"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf8224f82303f1149934b25590195a3a356ed8309b9b3f2efd94833bd704702c"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c64219087486d96e210ef9c2068620ca647debada93a3abe7b8f4d55d705405"},"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":"ae955554a5ab30b1cc448eea681479f699caf960855be85352fdd6f759cb7ea5"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"612b78aa588d451af767c4a175f825505a3dc602d248291ba985d943260f15ef"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f2c13a5115692b05f3bd039a46dac2f171ee672d0ee91e560aef6368a56c1c3"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4df75e3ef823371940b8c6d22c8df3ff10ab3f8702a0bffe6a73ecb6e7a85763"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d48551bfd97a5cac1a6d041a5a211082277b29b1df1805d05ff7bfb9d06486f5"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d3e30de2afef72e54c056f466bcbe7826ec96d39ee4f868bf10a43785b66e9d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91ed23011f623bb0b5c5db497aa5e6f9960801b9aedb36888525979990f4b379"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4af5a51c9579efb6d2238146a54fd066fafd390bc67ca5b34a302df9ca1d7e66"},"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":"3a81d6de977c28d1c54785761a6ce32bd60a0dd4120800eaa202a3350aaab7ea"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33e2dce23d9ad6230dc1fd269a03da434cd43d0b96ade12a3c0072c7b02784fb"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c5361f4a130256aa988581c00af2354cc41f7309e28495f14bb185e47a7621e"},"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":"d11636f6954bc351a36bb7b3fcaca8b377e8a994942fa5b884c7b387da43b77c"},"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":"e1ef2bb8184a579f8c566788949b0b7dff92eba5445ac06cd625a1329594a827"},"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":"1678cbfe18c6dca5b84d82d50a0f0913f7ec4fbc7d2eb4d5d92b9e671352e8da"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1df0b8f8a0b16b6497041011a8859fb0412fd20d7c8188a9229aff2dc864304e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bdf82d348a3d90ecf5c4b3f42a61936a9e82a0ceb6d2f59fe24fb7f008ac1db7"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25a43b7828b71bcd751edf550aaed5db0139bf38c965d09a3f1f724b8f17d475"},"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":"2bf9b795cee4dda55916982f0610d309001165bb3e6d59b8caffdf8c0b9fa60a"},"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":"533fd0f5b83d4cb9519937a8ba5dc7f3044206235aff0967005c4efb65e079c8"},"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":"51f938c97ac9c3304b28d190ed96b5d606c68fa3d84286406209bbed9535455f"},"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":"3e84a0b739dc50f521d0ff572377a39ac05b10ec3c73aaf1f39330ed8e008b7c"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42fd6c43a17d0a6b2f8bbabdc830b03fadfe76558b0d6caf89ef883d447e79b1"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef50d8cc3f8f7e857e05407a196f5adbe76d8b70e906d89eee87aa77cd19f430"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"160bcd4015cc2612c962b871a32e386ce7f42c8d904f4e6e46334f620a6725f1"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f790bf5b32fc579fc14dc2941e8be060495ba87565c807fdcaada32bfb0542d"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4e92df42f2b87d5fa80d0e17c2f7311544083bb9be45ef57eda6714b5e79ab7"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ecb5c41ad6e4d4628229cb46f6dba17f049a1fa4177e7b8b42dbe971cfb2c6b"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d200e76ff54bb130e1216801dd45f213b17cc6ae8e6e25439c9c6727dfe4e37"},"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":"b55294029bf98dbbe464bc82ea2631222045315aad7d32b07d55f9e64b232ff9"},"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":"daed998e13eb1a52a82f1375f96fbd4843307e74095af6ffac71ea93e6de8175"},"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":"24cd8e996c6d5d9677bfdc4c0ed7a6c282e522f451c12e21d9a68ecf1519dedb"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20ced28598f1bb1968b7d59562a6bad0201749bde064741b25725f36d25f74ff"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b335854827489fe4e3e011d5bbbbbbebf260722df99e3c9db35e0fea59e2a75"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37716a042894ade7c06aa55513ea7e889e1d668d2010440218c86c2f5a7941ee"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3acc42d8ed09ed88d60820fa2d960854546e75d214d4295a6b3119e657c36ed3"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0993a94d13ec1b9ff13d360de21431f6742148447738c683f664b05961589542"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cb262164a646a89e8b5a6fdc9cff408786ffb48d557f88726d71e941f2d6da2"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7258e1305f5050e7c20f8ef87168523ece2c67b96792bbf8dace691732c7b7c"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9efa2bf00ebe0539b8f08128e2c8745dcbb7acd8e83a50bb84441c4df45c12c"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6acbd762c59607442d97166877d0b1d1bf119abeb6a429951bbace810c49cac"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28cab40483991d336bc7f65f11fb2d0e037ea1380a826e0565d612e57372827e"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"307a9d5a63e14ac0b5ae3ba9cc8a8d96eca32554a9133b74802333bfe8637e9b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9380e0b3ccc10b60d82ae3b13a76a3f036818c58c76d1f2326dc570077942c3c"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b69a6c99530352573455b3f2f6669a83cd297e2b9944edb60dc15f0cdb266665"},"taxa":[{"id":"CWE-400","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":"51aaa85205e21492cc0e2d1465d00342cd786eab3862a02dcfcadbb6cb958bae"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25285441896fcaaf866eb756936078583c911ab12602e27b2bd8d5eb7e0ca983"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"574929ad179bdf8e87c49725583e63de971b5a30d9ef88ad128aae8a9667c56f"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"c5b9d18a25eaa26f57cb61aa39986f0199cb1250bc33bce7459efe0202f51b64"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"e40ad4285089723350fd337d56f7d0568ee5b42a62ad6eac17a75afb46cd77a9"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"7a0d4b742920ec365105781129fa0be4b0d32e1b2caf34802888fde127db756b"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"806f1ebaefd1adcbaba24825401268e14622dc9946c0c0d4d047620f3f38eda4"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9b0789aa31ac9ac7034934628bdf3fff76088c8b7eefe9882327850d014e2306"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dff6d8879af5b89a4b375812a62348905c0f47111e6c1e1f75c40f50e3557003"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7fe6856870cc156fe29740dad4c4e525922a4ac18784eb16f6710b23f75f531d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b36ea7fabead1e9e68556950bf50a35598a972f31fed13fcac90426cde779a1"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"024bef0ea29e0a4caccff7a7eed8e7ed80c4b803e3301cdf9429aeb71fc598ea"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"bed23b9f238f608c4e8c6c384fdd91a75e90fe82c542a2235b6dc1a13a688de3"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"05d9598b3b008e3e92b5805053bd8db8e22284d2aa142c92730393be9d76fcaf"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"c3a0fc4b549d4cecd3890c7980009c776749ef97697b0364c607a46f0d464cc4"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"adf7ba00b6b133cd1e8b31ebc6eacf3a14afbb323ab163f93b8b1cd014912969"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"properties":{"dependency":{"package":"zip","version":"4.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"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":"9baf188302f63f93364e78e7cd6119aaaef73ad36d190f61ae171cc891ead109"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.39.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-4116","GO-2025-4134","GO-2025-4135","GO-2026-5005","GO-2026-5006","GO-2026-5013","GO-2026-5014","GO-2026-5015","GO-2026-5016","GO-2026-5017","GO-2026-5018","GO-2026-5019","GO-2026-5020","GO-2026-5021","GO-2026-5023","GO-2026-5033","GO-2026-5932","GO-2026-6303","GO-2026-6354","GO-2026-6355"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b4066aefd670681c602ea05acc78a1e7bf76da9ee1d00c800172091afd546f9"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.11.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2023-2402","GO-2024-3321","GO-2025-3487","GO-2025-4116","GO-2025-4134","GO-2025-4135","GO-2026-5005","GO-2026-5006","GO-2026-5013","GO-2026-5014","GO-2026-5015","GO-2026-5016","GO-2026-5017","GO-2026-5018","GO-2026-5019","GO-2026-5020","GO-2026-5021","GO-2026-5023","GO-2026-5033","GO-2026-5932","GO-2026-6303","GO-2026-6354","GO-2026-6355","PYSEC-2026-1758"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7d9c4ed7611419d2c60fb6ba0fbc23df8459256f5b9abaaf2407721e5954d4e"},"properties":{"dependency":{"package":"zip","version":"4.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"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":"10996328115d0034df58e48a15dacd2e41e419ceacbb2507f76c69f94880e8b3"},"properties":{"dependency":{"package":"zip","version":"6.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"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":"d186a9600d5b58c80c18d06909b85ff070e8844f689ab9edea9f5a25eacfdabb"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.39.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-4116","GO-2025-4134","GO-2025-4135","GO-2026-5005","GO-2026-5006","GO-2026-5013","GO-2026-5014","GO-2026-5015","GO-2026-5016","GO-2026-5017","GO-2026-5018","GO-2026-5019","GO-2026-5020","GO-2026-5021","GO-2026-5023","GO-2026-5033","GO-2026-5932","GO-2026-6303","GO-2026-6354","GO-2026-6355"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5add628119b04b11c184d154a81c81b2c1b87af5e8ea6f6f575a71430c7b322"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.0.0-20210711020723-a769d52b0f97","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2021-0356","GO-2022-0968","GO-2023-2402","GO-2024-2961","GO-2024-3321","GO-2025-3487","GO-2025-4116","GO-2025-4134","GO-2025-4135","GO-2026-5005","GO-2026-5006","GO-2026-5013","GO-2026-5014","GO-2026-5015","GO-2026-5016","GO-2026-5017","GO-2026-5018","GO-2026-5019","GO-2026-5020","GO-2026-5021","GO-2026-5023","GO-2026-5033","GO-2026-5932","GO-2026-6303","GO-2026-6354","GO-2026-6355","PYSEC-2026-1758"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"466bf238c76699c67604cec66246384293c9c71bf3bea01991b64a6cd02db091"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2023-2402","GO-2024-3321","GO-2025-3487","GO-2025-4116","GO-2025-4134","GO-2025-4135","GO-2026-5005","GO-2026-5006","GO-2026-5013","GO-2026-5014","GO-2026-5015","GO-2026-5016","GO-2026-5017","GO-2026-5018","GO-2026-5019","GO-2026-5020","GO-2026-5021","GO-2026-5023","GO-2026-5033","GO-2026-5932","GO-2026-6303","GO-2026-6354","GO-2026-6355","PYSEC-2026-1758"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76845f9d3914ac8bdf11ff9461bc37fcd71c919f386287dfd7d966eb6cee1166"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.0.0-20201112155050-0c6587e931a9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2021-0227","GO-2021-0356","GO-2022-0968","GO-2023-2402","GO-2024-2961","GO-2024-3321","GO-2025-3487","GO-2025-4116","GO-2025-4134","GO-2025-4135","GO-2026-5005","GO-2026-5006","GO-2026-5013","GO-2026-5014","GO-2026-5015","GO-2026-5016","GO-2026-5017","GO-2026-5018","GO-2026-5019","GO-2026-5020","GO-2026-5021","GO-2026-5023","GO-2026-5033","GO-2026-5932","GO-2026-6303","GO-2026-6354","GO-2026-6355","PYSEC-2026-1758"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6beaedac0563fe3e12a1735491293060eb35bb01459a2e2a0445d68c7c55d41"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2023-2402","GO-2024-3321","GO-2025-3487","GO-2025-4116","GO-2025-4134","GO-2025-4135","GO-2026-5005","GO-2026-5006","GO-2026-5013","GO-2026-5014","GO-2026-5015","GO-2026-5016","GO-2026-5017","GO-2026-5018","GO-2026-5019","GO-2026-5020","GO-2026-5021","GO-2026-5023","GO-2026-5033","GO-2026-5932","GO-2026-6303","GO-2026-6354","GO-2026-6355","PYSEC-2026-1758"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36d5795b4274ba04ec6f1308b3a5591cf2aea78ecd83511919f68a7f3b0bc549"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.39.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-4116","GO-2025-4134","GO-2025-4135","GO-2026-5005","GO-2026-5006","GO-2026-5013","GO-2026-5014","GO-2026-5015","GO-2026-5016","GO-2026-5017","GO-2026-5018","GO-2026-5019","GO-2026-5020","GO-2026-5021","GO-2026-5023","GO-2026-5033","GO-2026-5932","GO-2026-6303","GO-2026-6354","GO-2026-6355"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe1451df743ad8f928c70e7026c789a19aa75c3e37ec813ae69f48aa015e6b49"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2023-2402","GO-2024-3321","GO-2025-3487","GO-2025-4116","GO-2025-4134","GO-2025-4135","GO-2026-5005","GO-2026-5006","GO-2026-5013","GO-2026-5014","GO-2026-5015","GO-2026-5016","GO-2026-5017","GO-2026-5018","GO-2026-5019","GO-2026-5020","GO-2026-5021","GO-2026-5023","GO-2026-5033","GO-2026-5932","GO-2026-6303","GO-2026-6354","GO-2026-6355","PYSEC-2026-1758"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8caf5fe11e12f4170194376b4157b5dde94305abc5a9d09513a8cb52e620efe3"},"properties":{"dependency":{"package":"zip","version":"4.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"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":"229ceedd30c9fd184bcd0e75d9d364c1b112c037bdcc07ce3079553e3d59ab4e"},"properties":{"dependency":{"package":"zip","version":"4.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"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":"a9cf5519a382e031ac5e96c757bca8e7cc0a1299cceca22707fd93e59aa4c387"},"properties":{"dependency":{"package":"hickory-resolver","version":"0.26.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0513","RUSTSEC-2026-0514","RUSTSEC-2026-0515","RUSTSEC-2026-0516","RUSTSEC-2026-0521","RUSTSEC-2026-0522"],"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":"53f3b03c883a1afa6dcb6bd4344d213a45cbfd232838e92ae9e0dbeecc12db7a"},"properties":{"dependency":{"package":"russh","version":"0.60.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0492","RUSTSEC-2026-0493","RUSTSEC-2026-0494","RUSTSEC-2026-0495"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15d8bce1f4217cbc841113d7e7633a0bc428d8002316463790b25f4d9187d607"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.101.7","advisory":"[GHSA redacted]","aliases":["BIT-golang-2026-111943","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2026-6809","RUSTSEC-2026-0098","RUSTSEC-2026-0099","RUSTSEC-2026-0104","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"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":"ca666bb8e33095597ecefcb13784b601b567b856fe3f5877bf4e6b8d175b71e7"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.102.8","advisory":"[GHSA redacted]","aliases":["BIT-golang-2026-111943","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2026-6809","RUSTSEC-2026-0049","RUSTSEC-2026-0098","RUSTSEC-2026-0099","RUSTSEC-2026-0104","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"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":"6a08c71eb31782296e8371cace4c317a807b61fc15711a8ba3d97aa898ca18bf"},"properties":{"dependency":{"package":"github.com/apache/thrift","version":"0.22.0","advisory":"[GHSA redacted]","aliases":["BIT-thrift-2026-41602","BIT-thrift-2026-43871","[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3926"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba54505da92b8113185c0f5e7dac20388cb5f3afc7138f5491f1c041d620a4aa"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.10.0","advisory":"[GHSA redacted]","aliases":["BIT-apisix-2023-44487","BIT-aspnet-core-2023-44487","BIT-contour-2023-44487","BIT-dotnet-2023-44487","BIT-dotnet-sdk-2023-44487","BIT-envoy-2023-44487","BIT-golang-2023-39325","BIT-golang-2023-44487","BIT-golang-2023-45288","BIT-golang-2026-33814","BIT-golang-2026-46600","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78669","BIT-golang-2026-97032","BIT-jenkins-2023-44487","BIT-kong-2023-44487","BIT-nginx-2023-44487","BIT-nginx-gateway-2023-44487","BIT-node-2023-44487","BIT-node-min-2023-44487","BIT-solr-2023-44487","BIT-tomcat-2023-44487","BIT-varnish-2023-44487","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2023-1988","GO-2023-2102","GO-2024-2687","GO-2024-3333","GO-2025-3503","GO-2025-3595","GO-2026-4440","GO-2026-4441","GO-2026-4918","GO-2026-5025","GO-2026-5026","GO-2026-5027","GO-2026-5028","GO-2026-5029","GO-2026-5030","GO-2026-5942","GO-2026-6603","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6617","GO-2026-6860","GO-2026-6866"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e41bd3b83cf833b6e641519a53dea9fdc989fcf8b537dc943d6004474e12d21"},"properties":{"dependency":{"package":"hickory-resolver","version":"0.26.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0513","RUSTSEC-2026-0514","RUSTSEC-2026-0515","RUSTSEC-2026-0516","RUSTSEC-2026-0521","RUSTSEC-2026-0522"],"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":"bfcab1e1ca238d3a158d6bb8bb248778231d1c24a63b211b39857d712a17b11c"},"properties":{"dependency":{"package":"russh","version":"0.60.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0492","RUSTSEC-2026-0493","RUSTSEC-2026-0494","RUSTSEC-2026-0495"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85881599d316b8f8eb66895494613e110897cf58ad60e1f1c17b342081a34608"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.101.7","advisory":"[GHSA redacted]","aliases":["BIT-golang-2026-111943","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2026-6809","RUSTSEC-2026-0098","RUSTSEC-2026-0099","RUSTSEC-2026-0104","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"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":"ef01750b0f5e9767d5f44c92cdcfb34c679d8c0ab5f2a1e7d2ed462e8c53935a"},"properties":{"dependency":{"package":"github.com/apache/thrift","version":"0.22.0","advisory":"[GHSA redacted]","aliases":["BIT-thrift-2026-41602","BIT-thrift-2026-43871","[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3926"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef71a79a41517da58af9f4f351b6c3f0906ac27071f0caf4fc75ea3a82dfd229"},"properties":{"dependency":{"package":"github.com/klauspost/compress","version":"1.18.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","GO-2026-5841","GO-2026-6865"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"439e29ee2e9d57ea7c8cf957591000337ef4f54c7db5d5f323e0db277761c254"},"properties":{"dependency":{"package":"golang.org/x/text","version":"0.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","GO-2021-0113","GO-2022-1059","GO-2026-5970","GO-2026-6629"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e8cec19760fc3825debedab6a9ad24d1e8c9a3f91a7e8394b7dafbd3de90935"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.7.0","advisory":"[GHSA redacted]","aliases":["BIT-apisix-2023-44487","BIT-aspnet-core-2023-44487","BIT-contour-2023-44487","BIT-dotnet-2023-44487","BIT-dotnet-sdk-2023-44487","BIT-envoy-2023-44487","BIT-golang-2023-39325","BIT-golang-2023-44487","BIT-golang-2023-45288","BIT-golang-2026-33814","BIT-golang-2026-46600","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78669","BIT-golang-2026-97032","BIT-jenkins-2023-44487","BIT-kong-2023-44487","BIT-nginx-2023-44487","BIT-nginx-gateway-2023-44487","BIT-node-2023-44487","BIT-node-min-2023-44487","BIT-solr-2023-44487","BIT-tomcat-2023-44487","BIT-varnish-2023-44487","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2023-1988","GO-2023-2102","GO-2024-2687","GO-2024-3333","GO-2025-3503","GO-2025-3595","GO-2026-4440","GO-2026-4441","GO-2026-4918","GO-2026-5025","GO-2026-5026","GO-2026-5027","GO-2026-5028","GO-2026-5029","GO-2026-5030","GO-2026-5942","GO-2026-6603","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6617","GO-2026-6860","GO-2026-6866"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"52145247b939c92c7c9427718fa2eec0013706fa69f349bbbc8f5d02d1f644b0"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.0.0-20210326220855-61e056675ecf","advisory":"[GHSA redacted]","aliases":["BIT-apisix-2023-44487","BIT-aspnet-core-2023-44487","BIT-contour-2023-44487","BIT-dotnet-2023-44487","BIT-dotnet-sdk-2023-44487","BIT-envoy-2023-44487","BIT-golang-2021-31525","BIT-golang-2021-33194","BIT-golang-2021-44716","BIT-golang-2022-27664","BIT-golang-2022-41717","BIT-golang-2022-41723","BIT-golang-2023-39325","BIT-golang-2023-44487","BIT-golang-2023-45288","BIT-golang-2026-33814","BIT-golang-2026-46600","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78669","BIT-golang-2026-97032","BIT-jenkins-2023-44487","BIT-kong-2023-44487","BIT-nginx-2023-44487","BIT-nginx-gateway-2023-44487","BIT-node-2023-44487","BIT-node-min-2023-44487","BIT-solr-2023-44487","BIT-tomcat-2023-44487","BIT-varnish-2023-44487","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2021-0238","GO-2022-0236","GO-2022-0288","GO-2022-0969","GO-2022-1144","GO-2023-1571","GO-2023-1988","GO-2023-2102","GO-2024-2687","GO-2024-3333","GO-2025-3503","GO-2025-3595","GO-2026-4440","GO-2026-4441","GO-2026-4918","GO-2026-5025","GO-2026-5026","GO-2026-5027","GO-2026-5028","GO-2026-5029","GO-2026-5030","GO-2026-5942","GO-2026-6603","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6617","GO-2026-6860","GO-2026-6866"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d69082f1bc610cb8569b52a0bcd76b3aa1b216f9f02de9ceb2f8996f22bafbc"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.7.0","advisory":"[GHSA redacted]","aliases":["BIT-apisix-2023-44487","BIT-aspnet-core-2023-44487","BIT-contour-2023-44487","BIT-dotnet-2023-44487","BIT-dotnet-sdk-2023-44487","BIT-envoy-2023-44487","BIT-golang-2023-39325","BIT-golang-2023-44487","BIT-golang-2023-45288","BIT-golang-2026-33814","BIT-golang-2026-46600","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78669","BIT-golang-2026-97032","BIT-jenkins-2023-44487","BIT-kong-2023-44487","BIT-nginx-2023-44487","BIT-nginx-gateway-2023-44487","BIT-node-2023-44487","BIT-node-min-2023-44487","BIT-solr-2023-44487","BIT-tomcat-2023-44487","BIT-varnish-2023-44487","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2023-1988","GO-2023-2102","GO-2024-2687","GO-2024-3333","GO-2025-3503","GO-2025-3595","GO-2026-4440","GO-2026-4441","GO-2026-4918","GO-2026-5025","GO-2026-5026","GO-2026-5027","GO-2026-5028","GO-2026-5029","GO-2026-5030","GO-2026-5942","GO-2026-6603","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6617","GO-2026-6860","GO-2026-6866"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55352fc14fe815d1c1a2ae65f473d9a5f4f462c3ed86018ed069ed6d21bcf3d9"},"properties":{"dependency":{"package":"gopkg.in/yaml.v3","version":"3.0.0-20200313102051-9f266ea9e77c","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","GO-2022-0603"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"844ffc0f5fd1c105b324187a43fcdc2c9204b517e84bed46354379a9d6b4321c"},"properties":{"dependency":{"package":"github.com/apache/thrift","version":"0.22.0","advisory":"[GHSA redacted]","aliases":["BIT-thrift-2026-41602","BIT-thrift-2026-43871","[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3926"],"reachability":{"kind":"production","file":"agents/go-common/gohive/hive.go","line":21}}}},{"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":"79d3558e4de7271b773bff75f0bff1552f69b882a40d20a7532364c955c9fc37"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.7.0","advisory":"[GHSA redacted]","aliases":["BIT-apisix-2023-44487","BIT-aspnet-core-2023-44487","BIT-contour-2023-44487","BIT-dotnet-2023-44487","BIT-dotnet-sdk-2023-44487","BIT-envoy-2023-44487","BIT-golang-2023-39325","BIT-golang-2023-44487","BIT-golang-2023-45288","BIT-golang-2026-33814","BIT-golang-2026-46600","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78669","BIT-golang-2026-97032","BIT-jenkins-2023-44487","BIT-kong-2023-44487","BIT-nginx-2023-44487","BIT-nginx-gateway-2023-44487","BIT-node-2023-44487","BIT-node-min-2023-44487","BIT-solr-2023-44487","BIT-tomcat-2023-44487","BIT-varnish-2023-44487","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2023-1988","GO-2023-2102","GO-2024-2687","GO-2024-3333","GO-2025-3503","GO-2025-3595","GO-2026-4440","GO-2026-4441","GO-2026-4918","GO-2026-5025","GO-2026-5026","GO-2026-5027","GO-2026-5028","GO-2026-5029","GO-2026-5030","GO-2026-5942","GO-2026-6603","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6617","GO-2026-6860","GO-2026-6866"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"898d0e2c9cdb3a68dfc90a724ae385479c719262846d14d9770faf19a472181a"},"properties":{"dependency":{"package":"decode-uri-component","version":"0.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae0d27bf3852b1afd2f913fc91706716da90c473e146b25bfb83dea8339045f1"},"properties":{"dependency":{"package":"happy-dom","version":"20.10.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"package.json"}}}},{"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":"af3a18cf730f6276ad50ac81337c95bc6659e9de68697e5d39209e4ecd015b5a"},"properties":{"dependency":{"package":"zod","version":"3.25.76","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f814f99d68c2759480457d35fc42d41c7f4ce11247e748bab7b8971be44f9597"},"properties":{"dependency":{"package":"calamine","version":"0.30.1","advisory":"RUSTSEC-2026-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc4db900d7247116e90ac1f55322889d7c04a2f09430308fea72e799e9229468"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.7.0-rc.28","advisory":"RUSTSEC-2026-0387","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"109eb8c2be00952287a6643744da7dcc2c9a7a6618d7cac60ea6539c1687dfd6"},"properties":{"dependency":{"package":"ctutils","version":"0.4.2","advisory":"RUSTSEC-2026-0385","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02807c2340c313bd085553cef2aa54725b58db377d04241d3195bea3a23b7783"},"properties":{"dependency":{"package":"glib","version":"0.18.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2024-0429"],"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":"f0f740581a50b0129f0f1557d9b6518d07a2b93c4393aa7be39140693f4427a6"},"properties":{"dependency":{"package":"h2","version":"0.3.27","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"430f53c27142bacb00cdc40133b08ddd7c2a1c2696cee00a26076f688dffa287"},"properties":{"dependency":{"package":"h2","version":"0.4.15","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"147a507dab8f0266f39f161dbe7b148bbc1fbe86f605177c28e0cee8364a771a"},"properties":{"dependency":{"package":"hickory-net","version":"0.26.1","advisory":"RUSTSEC-2026-0506","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0504","RUSTSEC-2026-0505","RUSTSEC-2026-0507","RUSTSEC-2026-0508","RUSTSEC-2026-0509","RUSTSEC-2026-0511","RUSTSEC-2026-0512","RUSTSEC-2026-0517","RUSTSEC-2026-0518","RUSTSEC-2026-0519","RUSTSEC-2026-0520","RUSTSEC-2026-0530","RUSTSEC-2026-0531","RUSTSEC-2026-0532","RUSTSEC-2026-0539","RUSTSEC-2026-0540","RUSTSEC-2026-0541"],"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":"18f9715be8649315419b6bde668653ba91f7c94a0d6d4daeebfc5d0ca4efe3ce"},"properties":{"dependency":{"package":"hickory-proto","version":"0.26.1","advisory":"RUSTSEC-2026-0487","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0488","RUSTSEC-2026-0489","RUSTSEC-2026-0490","RUSTSEC-2026-0491"],"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":"f48cf8c9f415048128045caa118a1e03769d0b4fe18d7f036c2f3766e3e8d8fb"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be9977d5d7ddb867e7f2e9fb5ad301e217dd9c03427d8e948d094761434f4502"},"properties":{"dependency":{"package":"jsonwebtoken","version":"9.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.30.1","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c9ea5dd787b8fa882d73e7dfc5be0f9964c6d5cdb7e0d3bb1a6f66a24c9dc2b"},"properties":{"dependency":{"package":"lru","version":"0.16.4","advisory":"RUSTSEC-2026-0253","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":"9cd10d41b134bd18e73e7d30575f7b38b1e245b54a11bc91c7092e21092d8d51"},"properties":{"dependency":{"package":"lru","version":"0.18.1","advisory":"RUSTSEC-2026-0253","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":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95686d8e64236c3c2c566e482859faf67a5bbd9dbeebb6f4df8aab56c3496281"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.37.5","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f33134b914692cd6c5f119efdf542f3d6c34c918da971c9cc600e5d39c46efde"},"properties":{"dependency":{"package":"rkyv","version":"0.7.46","advisory":"RUSTSEC-2026-0235","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":"b0a650926c1446a30b78b4d0bd1ac0b14a584b7ecfe488180d3a51ffb3e8d361"},"properties":{"dependency":{"package":"rmcp","version":"3.5.1","advisory":"RUSTSEC-2026-0457","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0461","RUSTSEC-2026-0462"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.10.0-rc.16","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfc7200b1589a0208737687544756867940624df1ba86d4dbe4e6a541111f9bd"},"properties":{"dependency":{"package":"rustls","version":"0.21.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4369a08cad1356daefce5ae6b7b1480001f892a23a4386e8120b72405006b0e8"},"properties":{"dependency":{"package":"rustls","version":"0.22.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.43","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5524f25221308ec94b7206b58afaa59996104c20abaa242285d451f5344e44b"},"properties":{"dependency":{"package":"rustls-pemfile","version":"1.0.4","advisory":"RUSTSEC-2025-0134","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8eeeaa17e15b82ce048fef326aaee8695e87b3cb2fb8689fc87b0f78fcf3e24c"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3f6b0dc7d0843f1539cb8274e739376fd4b1be6c39d73c3f6b7e78cb5af4d8b"},"properties":{"dependency":{"package":"unic-char-property","version":"0.9.0","advisory":"RUSTSEC-2025-0081","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":"610868c659b2bc4a0ea5bd7cebeddb1d8961b8ebb7c9f31dcc75e07badfe1d8f"},"properties":{"dependency":{"package":"unic-char-range","version":"0.9.0","advisory":"RUSTSEC-2025-0075","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":"9a9761ad8cbbcee9fd4b4bb09fc1e6e6977230d7588402bc8497b52c5027e99e"},"properties":{"dependency":{"package":"unic-common","version":"0.9.0","advisory":"RUSTSEC-2025-0080","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":"355ee9fdba8596d452516a609f795a54a5bca0f7ed0289c67e6ddbc4bddd9ada"},"properties":{"dependency":{"package":"unic-ucd-ident","version":"0.9.0","advisory":"RUSTSEC-2025-0100","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":"b269e07aa3d9bfb90d59d794c0e6a0b7849b288910031fdd0fe253514c3af463"},"properties":{"dependency":{"package":"unic-ucd-version","version":"0.9.0","advisory":"RUSTSEC-2025-0098","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b5cc6a78fe02a95b2f6755616011982ae866dcba8c2aeaae7b037f36ce19be5"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.9","advisory":"RUSTSEC-2026-0383","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6321e479b0c5214ca83799e3de21fbd8d608cced83c21bf0aa51747e315e731b"},"properties":{"dependency":{"package":"zbus_names","version":"3.0.0","advisory":"RUSTSEC-2026-0371","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a134af265275693a494e959920d6245e395d99a5ab1cf9f639aa88a7fccf8ac"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","advisory":"RUSTSEC-2026-0371","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","reachability":{"kind":"unknown"}}}},{"ruleId":"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":"159079006dc56c0fb51e626cbbe62287d1d26d0621cc6b27cfb72cd5ead86b39"},"properties":{"dependency":{"package":"zvariant","version":"4.2.0","advisory":"RUSTSEC-2026-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3b918b1140b7f7696ab75d18f7107fa127cf515c0fe3f2d7c5884b10ec26c1e"},"properties":{"dependency":{"package":"zvariant","version":"5.13.1","advisory":"RUSTSEC-2026-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69c4a46d98ca89bcfa239cb26c13e2e84f6fc0b44e5072d6a1f678e2f90a20c2"},"properties":{"dependency":{"package":"zvariant_derive","version":"4.2.0","advisory":"RUSTSEC-2026-0372","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44ea6f275cfcb158929227e95b84e2f133d8a25732d0db2cb565ddc50724bae1"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.13.1","advisory":"RUSTSEC-2026-0372","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96124a1608ead6dbbb8280193dd6e577cee5f7e715b791dd00a6cf0210f2071a"},"properties":{"dependency":{"package":"stdlib","version":"1.23.0","advisory":"GO-2024-3105","aliases":["BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/argo-go/bench/kdc_fixture/main.go","line":32,"symbol":"os.MkdirAll"}}}},{"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":"38d1ad22aebf986967511e4011ec37508fc9d142a38539bd5314f2962e93a87e"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.41.0","advisory":"[GHSA redacted]","aliases":["BIT-golang-2026-33814","BIT-golang-2026-46600","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78669","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","GO-2026-4440","GO-2026-4441","GO-2026-4918","GO-2026-5025","GO-2026-5026","GO-2026-5027","GO-2026-5028","GO-2026-5029","GO-2026-5030","GO-2026-5942","GO-2026-6603","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6617","GO-2026-6860","GO-2026-6866"],"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":"7615b05fd27963d8cc83fd92c3e6ef06471bfe77724972ffb5fba881fea93560"},"properties":{"dependency":{"package":"stdlib","version":"1.22.99","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/cassandra-go/config.go","line":125,"symbol":"url.Parse"}}}},{"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":"34505f1ebd49f071b122a38862377067a0fdb71f4e726efdec4e310e762df94c"},"properties":{"dependency":{"package":"arrow-data","version":"58.4.0","advisory":"RUSTSEC-2026-0442","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e14320d4494773f66c43f856f5976fd48c672b77d7e256608a2f427d6cf5d04c"},"properties":{"dependency":{"package":"calamine","version":"0.30.1","advisory":"RUSTSEC-2026-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb7cd5d19d73c4fce1b3b8442e6df4d6dd5e11b9af5c32e0ba56451c247d5ea5"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.7.0-rc.28","advisory":"RUSTSEC-2026-0387","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee196b19ebc2b0f751a1fc2aa4412f91a54f411f9712b7a937c343a62a79d060"},"properties":{"dependency":{"package":"ctutils","version":"0.4.2","advisory":"RUSTSEC-2026-0385","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04c9c491e3f52d3aa5fca499133935cc128cd630c1b7c65e07999d68f717e830"},"properties":{"dependency":{"package":"hickory-net","version":"0.26.1","advisory":"RUSTSEC-2026-0506","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0504","RUSTSEC-2026-0505","RUSTSEC-2026-0507","RUSTSEC-2026-0508","RUSTSEC-2026-0509","RUSTSEC-2026-0511","RUSTSEC-2026-0512","RUSTSEC-2026-0517","RUSTSEC-2026-0518","RUSTSEC-2026-0519","RUSTSEC-2026-0520","RUSTSEC-2026-0530","RUSTSEC-2026-0531","RUSTSEC-2026-0532","RUSTSEC-2026-0539","RUSTSEC-2026-0540","RUSTSEC-2026-0541"],"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":"4a6d37143a31b69e578bb9efdf1c3a62b6ee4c3eabe99dc503f57ba3917ea288"},"properties":{"dependency":{"package":"hickory-proto","version":"0.26.1","advisory":"RUSTSEC-2026-0487","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0488","RUSTSEC-2026-0489","RUSTSEC-2026-0490","RUSTSEC-2026-0491"],"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":"ef69501a834fb22535baf4726468911ee29519146516e8ac383358f33a6e53aa"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63c99baed22345b61a7a24a8e55c973a3cc7e381e085dd74a50cbd153d31952f"},"properties":{"dependency":{"package":"jsonwebtoken","version":"9.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e159561496ba4151c5d4ccc4dbd42f53a159d44d0f7b9e9a224f50d7869105d9"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.30.1","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b656d4f035de893494b5419e0e626c276ce7812c6a65dd8c94e5993040436b11"},"properties":{"dependency":{"package":"lru","version":"0.16.4","advisory":"RUSTSEC-2026-0253","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":"73899c51f8132b94ef1cd641faf148fd085a9fb1f907d183653838e43e769af1"},"properties":{"dependency":{"package":"lru","version":"0.18.1","advisory":"RUSTSEC-2026-0253","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":"b7dd362767b1ea91e503c580e46544b2e304806043f569771ba857d5f3b64d12"},"properties":{"dependency":{"package":"pageant","version":"0.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95644ba102c15ef7b60655db719e6aae5b768ad02acc0c3da6fbe6d7a0b14713"},"properties":{"dependency":{"package":"quick-xml","version":"0.37.5","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d87e0f2f1471913e14d0b26fccfe50b9ceaf4bea3a6d0ee67a3cd59a23cc099f"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53a9736640468b5dd9c6bb330e655ad6504d961dff45d60cb8f59eaded0fcf9f"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f1b35c956df73f1748131870cc9557422f4ab63c561f7032ab72fb08955e72c"},"properties":{"dependency":{"package":"rkyv","version":"0.7.46","advisory":"RUSTSEC-2026-0235","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":"ed3aba86e286b2e58f8f3371ec4bb5abcfc0a90cb354541630b8257ab7b16d63"},"properties":{"dependency":{"package":"rsa","version":"0.10.0-rc.16","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"edc37cdf5762a7db8426b9c94a0a7ebb4bea943ce4075138fda2b1e462ee95f9"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87b4604467ec3aba3837f3eb4b4f71d8421d14183016ed0234d4998a4c491c7b"},"properties":{"dependency":{"package":"rustls","version":"0.21.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea7e11fff279e288e0a62235e14ebb79396034469b51457f29000f163d863202"},"properties":{"dependency":{"package":"rustls","version":"0.23.42","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1690cb725eb8ef0a82225d71b1ff031a1c40e46936c7539cbb87fc146b96af43"},"properties":{"dependency":{"package":"rustls-pemfile","version":"1.0.4","advisory":"RUSTSEC-2025-0134","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f9fa3bc567092df2845d0f4b695f3117ea9c93d7c94eb1b89a6703269192714"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbba3e76c0663d3d4e0d3e50b06d00ce5514f64fa6c7c347acd032db17f8e655"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef9fbf99db1ce5f00f029a21cae412aa4e435b107f734a7f7d1647db2d44b865"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab3539dc5475ac67c3edeaf03e247b91a0bcbd2e165096536c6384406d3208f9"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb8c8ef2be3472a40666036b1ece257a51fa7b086172187c8b7d29553b3698e7"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9c84ffc6855a7cf020705bbf2af4b5311f1c311756b7eb6ab0bd428b6936b0a"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a5170ef423ce4266b0c0067a1f8b509f811627fde0be8f19d9f9fd61cbcdeba"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"969412a14f3862977cfaae4cfd034ee4ce14640330d864ed7bc3ae69845d19bb"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cdc59065aacb17c431d99d6ab3011f1c5619fccc8a125bab5f2c6c0581716da8"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb826165123b8a5bcd16f146ec1e03831efd7f69d5a795bf0c0d7beed4b0b7cd"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba84f601318cbea80f0bd475f85c8b7bb9aa448e0835f26ac404f154e09a8e95"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d985996e56955202ce3298c6fb8e122cbd5518c9d12e6ddf05594bf4a795972"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a20caba3b9531c123687ab2ea8121fa632a0a5101bc11fd23151c0a2779f08d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"229aaf2ccb0efdaed4c70972e1e7c14b484e199e26c6d00193e77108ad754f4e"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aba68ef5ebf4bd6f953eaed3042dd2c96ff3fd8ce87e1248b108f248ef0c6d87"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e50b4459f74eb284cef803090583977b83d7b323277a34a02e00cf626cc9d615"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"088777c87d0c281cab5a40f44f884dcacc3c5e7dee35fc7dc548ac20c1b30425"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bceb0e696dfce667ac29625991add17725606d5d4e38be3ef3b38915106bec93"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","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":"46c944f7138ccf1cc8ae3afe19a1a1b7c3a5bb4ea12f6e2cc678beda59c762b3"},"properties":{"dependency":{"package":"stdlib","version":"1.26.0","advisory":"GO-2026-4599","aliases":["BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27137","BIT-golang-2026-27138","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33810","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-46600","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-4600","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4866","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5942","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/etcd-go/client.go","line":379,"symbol":"url.Parse"}}}},{"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":"88981ca58f659f945726e1351f9bd2390c019855a5b6a99abdd8b520585951b8"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.61.0","advisory":"GO-2026-6860","aliases":["[CVE redacted]","[CVE redacted]","GO-2026-6866"],"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":"bf45006bb67e6ed65880680cb59b9b3e4ce9055e1a8af64c26f5fcd48f158637"},"properties":{"dependency":{"package":"stdlib","version":"1.24.99","advisory":"GO-2026-4601","aliases":["BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/etcd2-go/client.go","line":304,"symbol":"http.NewRequestWithContext"}}}},{"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":"6b16aa753578eed9d2a0ef7e0a94363ca60920cd2942a12fcd1e0ddc4be30ff1"},"properties":{"dependency":{"package":"stdlib","version":"1.23.0","advisory":"GO-2024-3105","aliases":["BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/hive-go/bench/kdc_fixture/main.go","line":32,"symbol":"os.MkdirAll"}}}},{"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":"a708174a59a5b02166177c6dc7ea38ee9d50d14f4223d3e997b378bb19c73994"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.41.0","advisory":"[GHSA redacted]","aliases":["BIT-golang-2026-33814","BIT-golang-2026-46600","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78669","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","GO-2026-4440","GO-2026-4441","GO-2026-4918","GO-2026-5025","GO-2026-5026","GO-2026-5027","GO-2026-5028","GO-2026-5029","GO-2026-5030","GO-2026-5942","GO-2026-6603","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6617","GO-2026-6860","GO-2026-6866"],"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":"ef31f0658ea355f1a17329db8c4101590099e1aa84b43a19e1ffbc25282cefb2"},"properties":{"dependency":{"package":"stdlib","version":"1.25.99","advisory":"GO-2026-6599","aliases":["BIT-golang-2026-111943","BIT-golang-2026-56857","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/iotdb/bench/go/main.go","line":6}}}},{"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":"dce31cc8eea2f40c815d5374df55890a32013fe3becdd3a52acd0ae17e742544"},"properties":{"dependency":{"package":"stdlib","version":"1.20.99","advisory":"GO-2024-2598","aliases":["BIT-golang-2023-45288","BIT-golang-2023-45289","BIT-golang-2023-45290","BIT-golang-2024-24783","BIT-golang-2024-24784","BIT-golang-2024-24785","BIT-golang-2024-24789","BIT-golang-2024-24790","BIT-golang-2024-24791","BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-2599","GO-2024-2600","GO-2024-2609","GO-2024-2610","GO-2024-2687","GO-2024-2887","GO-2024-2888","GO-2024-2963","GO-2024-3105","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/kingbase-go/bench/agent_compare.go","line":9}}}},{"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":"3f093dc3db84d45e3d3d1e028735b268b21aa60442fe1c668f2050b02b90db5d"},"properties":{"dependency":{"package":"stdlib","version":"1.24.99","advisory":"GO-2026-4601","aliases":["BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/nebula-go/main.go","line":8}}}},{"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":"c1cda6da09a55c0c26291bb70aa662badad386dbdf590b4a309f59ad28d785bf"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.17.0","advisory":"[GHSA redacted]","aliases":["BIT-golang-2023-45288","BIT-golang-2026-33814","BIT-golang-2026-46600","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78669","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-2687","GO-2024-3333","GO-2025-3503","GO-2025-3595","GO-2026-4440","GO-2026-4441","GO-2026-4918","GO-2026-5025","GO-2026-5026","GO-2026-5027","GO-2026-5028","GO-2026-5029","GO-2026-5030","GO-2026-5942","GO-2026-6603","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6617","GO-2026-6860","GO-2026-6866"],"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":"c9f9167ec1159781f961dd6aaaf22ede63a5a359f93f5e6bc591eb6d546aafb8"},"properties":{"dependency":{"package":"golang.org/x/text","version":"0.13.0","advisory":"GO-2026-5970","aliases":["[CVE redacted]","[CVE redacted]","GO-2026-6629"],"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":"7c283a2783b68558681e7a0ffc82c1b981493ca3d7880a2e8abd9776722659eb"},"properties":{"dependency":{"package":"stdlib","version":"1.24.99","advisory":"GO-2026-4601","aliases":["BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/neo4j-go/driver.go","line":145,"symbol":"url.Parse"}}}},{"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":"80fe22553d06b55a2425d880980a39d58139039e3cfe60c3fcc4390781594765"},"properties":{"dependency":{"package":"stdlib","version":"1.20.99","advisory":"GO-2024-2598","aliases":["BIT-golang-2023-45288","BIT-golang-2023-45289","BIT-golang-2023-45290","BIT-golang-2024-24783","BIT-golang-2024-24784","BIT-golang-2024-24785","BIT-golang-2024-24789","BIT-golang-2024-24790","BIT-golang-2024-24791","BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-2599","GO-2024-2600","GO-2024-2609","GO-2024-2610","GO-2024-2687","GO-2024-2887","GO-2024-2888","GO-2024-2963","GO-2024-3105","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/oracle-go/legacy_charset.go","line":37,"symbol":"url.ParseQuery"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e5651143b56e5282e29d1ba8c0c53a1d26792f5bf44c866ba7e5cf8d19e0ef2"},"properties":{"dependency":{"package":"golang.org/x/text","version":"0.22.0","advisory":"GO-2026-5970","aliases":["[CVE redacted]","[CVE redacted]","GO-2026-6629"],"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":"87e8f93845282dc70bb0774ab68dd2866a4ff353071a92d50cfb9c4bfe66ff6b"},"properties":{"dependency":{"package":"stdlib","version":"1.20.99","advisory":"GO-2024-2598","aliases":["BIT-golang-2023-45288","BIT-golang-2023-45289","BIT-golang-2023-45290","BIT-golang-2024-24783","BIT-golang-2024-24784","BIT-golang-2024-24785","BIT-golang-2024-24789","BIT-golang-2024-24790","BIT-golang-2024-24791","BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-2599","GO-2024-2600","GO-2024-2609","GO-2024-2610","GO-2024-2687","GO-2024-2887","GO-2024-2888","GO-2024-2963","GO-2024-3105","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/rabbitmq/bench/agent_compare.go","line":382,"symbol":"net.Listen"}}}},{"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":"0f0d1a194ff4f712124181878897dee4d77f573303912f90a84dcfafe4e8dc95"},"properties":{"dependency":{"package":"github.com/rabbitmq/amqp091-go","version":"1.13.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","GO-2026-6700"],"reachability":{"kind":"production","file":"agents/drivers/rabbitmq/helpers.go","line":13}}}},{"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":"c45da41f0b1ca0d16e7a25341e1fdba5c56d1ea7a5a5120b2b4bd0a0da08e39a"},"properties":{"dependency":{"package":"stdlib","version":"1.26.0","advisory":"GO-2026-4599","aliases":["BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27137","BIT-golang-2026-27138","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33810","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-46600","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-4600","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4866","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5942","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/rocketmq/routing.go","line":76,"symbol":"net.Listen"}}}},{"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":"cf5c203a3871304f58e114080f212d2538fb010d3220316e38fa660038a35f2f"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.60.0","advisory":"GO-2026-6860","aliases":["[CVE redacted]","[CVE redacted]","GO-2026-6866"],"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":"b721009825ee7b6e31e344933252128934d910d0ec48e56d8554ee0dc85dd5f7"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.57.0","advisory":"GO-2026-5932","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":"b3c1ccc4a847b6cbd85d6d4d244c33eeec1520757e08c6345d72301b0989ac47"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02d556c3b9505485935354151dcc4b9b7e5ef5df2b2440c9408d0f0ad1939449"},"properties":{"dependency":{"package":"rustls","version":"0.23.43","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70d112d4b1310cd87516067a116fffa287a04e2d0bc3f6a46b678973503deece"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0bc1d9120db4b9df6bfaf16b6b04049e3a8749c1fb5cf766d990548a06e61e55"},"properties":{"dependency":{"package":"scc","version":"2.4.0","advisory":"RUSTSEC-2026-0205","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":"97c8721e0b31ef73e29bf6590ca31b3077f488d88406289b028d48ebe6cce171"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"102bfa9b90a6f4c75600e63d8eeac95e4c7f371939b93aa4a8005c52714768e8"},"properties":{"dependency":{"package":"stdlib","version":"1.22.99","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/vastbase-go/bench/agent_compare.go","line":117,"symbol":"os.Stat"}}}},{"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":"5321c3ba614eb727d94f21e79623806129fbeee4525cd0a184dcf3a7542180cd"},"properties":{"dependency":{"package":"stdlib","version":"1.20.99","advisory":"GO-2024-2598","aliases":["BIT-golang-2023-45288","BIT-golang-2023-45289","BIT-golang-2023-45290","BIT-golang-2024-24783","BIT-golang-2024-24784","BIT-golang-2024-24785","BIT-golang-2024-24789","BIT-golang-2024-24790","BIT-golang-2024-24791","BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-2599","GO-2024-2600","GO-2024-2609","GO-2024-2610","GO-2024-2687","GO-2024-2887","GO-2024-2888","GO-2024-2963","GO-2024-3105","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/xugu/main.go","line":7}}}},{"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":"f6f76cd297bc4a5bcdb6d8e0bd2aff2254b6a77a27ad58c50fd546ffa965327c"},"properties":{"dependency":{"package":"stdlib","version":"1.23.0","advisory":"GO-2024-3105","aliases":["BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/drivers/zookeeper/connection.go","line":504,"symbol":"url.ParseQuery"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8fdf36494ec5db7fb6639dabf89ce9fa552ed76926679390596c1cb4e5b2be73"},"properties":{"dependency":{"package":"stdlib","version":"1.15.99","advisory":"GO-2024-2598","aliases":["BIT-golang-2023-45288","BIT-golang-2023-45289","BIT-golang-2023-45290","BIT-golang-2024-24783","BIT-golang-2024-24784","BIT-golang-2024-24785","BIT-golang-2024-24789","BIT-golang-2024-24790","BIT-golang-2024-24791","BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-2599","GO-2024-2600","GO-2024-2609","GO-2024-2610","GO-2024-2687","GO-2024-2887","GO-2024-2888","GO-2024-2963","GO-2024-3105","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/go-common/go-gssapi/common/channel_binding.go","line":3}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"302f194626f9403ce4cc55f0a1a2a1eee875ce8490567b5cee2aac0d8e920e72"},"properties":{"dependency":{"package":"stdlib","version":"1.24.99","advisory":"GO-2026-4601","aliases":["BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"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":"0c897b532387eec19051d1d8ec26e0147f88fea031b2f1cf8c4feb5a2fc4a2b9"},"properties":{"dependency":{"package":"stdlib","version":"1.23.0","advisory":"GO-2024-3105","aliases":["BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/go-common/gohive/browser_auth.go","line":54,"symbol":"net.Listen"}}}},{"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":"e175d8c31ae75a02b30d003c6232e9129ae85fe3fcdaa045a328551522daeba0"},"properties":{"dependency":{"package":"golang.org/x/net","version":"0.41.0","advisory":"[GHSA redacted]","aliases":["BIT-golang-2026-33814","BIT-golang-2026-46600","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78669","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","GO-2026-4440","GO-2026-4441","GO-2026-4918","GO-2026-5025","GO-2026-5026","GO-2026-5027","GO-2026-5028","GO-2026-5029","GO-2026-5030","GO-2026-5942","GO-2026-6603","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6617","GO-2026-6860","GO-2026-6866"],"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":"40cc71d949498803d5b6c412d424241d8a435b29a89dc7b0827ff1ac2cce6279"},"properties":{"dependency":{"package":"stdlib","version":"1.23.0","advisory":"GO-2024-3105","aliases":["BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/go-common/gosasl/gssapi.go","line":6}}}},{"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":"c213e95ba02f36b5da6e3b50abc594d640841b03e8631c7a293c3ce0b6d9d70e"},"properties":{"dependency":{"package":"stdlib","version":"1.25.99","advisory":"GO-2026-6599","aliases":["BIT-golang-2026-111943","BIT-golang-2026-56857","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"agents/go-common/iotdb-client-go/client/tls.go","line":24}}}},{"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":"a8bcced98d09067602a29af72166e1d586b616b0a7d62eca94aa304e43d15201"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4df4512cf7f3fc9b8f10d8d076d93e35cd65bb24a13409a93fe949d77d58836"},"properties":{"dependency":{"package":"stdlib","version":"1.22.99","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"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":"2b9538ad8db176b3abea3e684354eb5417110559f145afad85a6772be1d1ce25"},"properties":{"dependency":{"package":"stdlib","version":"1.22.99","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"plugins/sdk/go/dbx-plugin-sdk/sdk.go","line":439,"symbol":"os.MkdirAll"}}}},{"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":"bd012ff43db016a3b121bd624c18542f3f87ab966953b0895c0b6ba0b257d697"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22e86788051b6eb0684cc592f7c222cc5ab2ea2c71d4969156b9cf4f8309339d"},"properties":{"dependency":{"package":"rustix","version":"1.1.5","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f21292574dbbaa7a7dc92e765dc0ec99c7b32b30ce6030d6f816e8a020755cc2"},"properties":{"dependency":{"package":"rustls","version":"0.23.45","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0347","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3fb4f8dcd81f60f911ae8b68089b7e76ca5bb0701d143ebd0f779034c4586ec"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"733ff3ce1a4c9ef22d516781a394a83cd2700ed86023b4406550c11c8d6699af"},"properties":{"dependency":{"package":"tokio","version":"1.53.2","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d1bd05b5ffce094e79d143e4fed1774c2ba93aedc4fd89b29c5f54629552f05"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea7e5354ab7cfc90dd177dde60810f39ea3e10b3fe5c807ca0b2b906b7004ac5"},"properties":{"dependency":{"package":"glob","version":"11.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3bac0b956cc7625db5ffaa04443fc36030c2af44043a6f2dfd365abaf694f40"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a861b1ab2fd6ac5a0cbbd2d1eaeca38914dcada77f7a5d62bbdd015efb9e974e"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63504ced86aa0f2e93b06b230de721cceee54190d2361421468e37053efc3b31"},"properties":{"dependency":{"package":"vue","version":"2.7.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"apps/desktop/src/App.vue","line":5}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ea8c9582fbc43c69cc2b28e4b657cb45223e68c93f9320a4b2a08e555388c4e"},"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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fb20753bbb8908cccc7c487e3b2f1bc29c83567e32dd5701f8da477967d5db8"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c3fadeb24ed704ae7ea637c29ff22a816984a204817c47a4b93fdbe9b975a8b"},"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":"0fd76d5b86608953f4671abcd7323eb579aa907aeffc358c3ccefceeb35e8867"},"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":"175bd2c7d2ce9fbfe3b785a5fee07eb578ae68d3759488812c5021ce4b729964"},"taxa":[{"id":"CWE-1357","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"262ce447d933e0644c0faaa6be1f295e1a5f4a3b6349a4e3e254cac52e0743f6"},"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":"f52816c5c1b6c1e4211483d40eb1c2ab1e3274a319d89686f6b2021f33f3261e"},"taxa":[{"id":"CWE-1357","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6b310e14aa6c2826619904c24c69ce36942c61a6d85743d5134c9f726f3241e3"},"taxa":[{"id":"CWE-1357","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"5e99f97f0bc818f33fb76486529dd5f59c0fb00eb9fbd79ac6580efd4022b945"},"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":"95ec7aa2fc4188686a4f0e07b2a7d0356015caf57fe3e049027c79d59ad58fac"},"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":"d69edc2b352f5b478f67a4d073f190976faacbc07dc400f7347325ce6cc8650c"},"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":"182a32e8fcaf75aa7cb580e665150cfe884b032271cb6760f292290169b7beb7"},"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":"479fa3d2a6f713153028a87e65eb44d70c0a38dda1db4dba34aac6176b6b217b"},"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":"b8b516873bfdd87f28e11ae79e48bff66dc771588be4c851d6167295349f1639"},"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":"288e204cafabdc1ba651ef96dfade75ab50f4808e7efdea13251f1b2ac1442b6"},"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":"1f77cd4277c6bd6430613251aa1f787522d7140a71761c3a9a6bf225ea3e5f86"},"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":"ad0fd1ba5962c52c44f8a90f57a3aeac908737a83641f36a47154535efb9a0ec"},"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":"af0860b59f2b1fa06572098c2dbb8dc432d9ee223f4c94fef19048504dea35fd"},"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":"9c96154c4074c61be2cac46944feca6c4def8d107d6a367e67cbf0e9dd167e8e"},"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":"0f08073fad3f67a535ee37d62568e2e3525b3aa2c9344f02c96f12ba0002af0c"},"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":"08ba5cdf59e172d64b60328fd892ff7556c2dd374a244ca2906c948f8c40d8fc"},"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":"79d54e170e993e3277ef5523c3a669d9fa61fec220097ab4b1d7b4a064ea02c8"},"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":"cb10388a003c19471ef2563cd9dba764d4ab26d278064a1c00b131a164ee43da"},"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":"9534b7f89ef48f0184acd0137309834f1294c195e87d8844c79ca2ead1541baa"},"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":"86f8d9f9e3c984b733213b25d4c7beca343caba1300a217e304b8e90bca84e9f"},"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":"1090cd872a60a8e30995b824fe6dba135f8ef2b130897d584baa5ddcbabd8071"},"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":"3f4b26a3f3bcf8f7997165f419dbd062125499101609638b6ebfa7515acc07a3"},"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":"c079c9aa22241c3144f021685d438b73696771214ce67fa56175920896cb2303"},"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":"e20a7cfeaca0c1e9a15804b0a5a774f0c1d56c9b706070cbc948fcc445f89720"},"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":"d910204a18c1aeddc171111154819b7dd59d6011e0427a105cf1c75ea22243e2"},"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":"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":"4a0421d4182b8ab1995e490af2c776bb2f4c6818f7b78f20ef6951a843f1b208"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 25 of 1855 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 1855 of the 2665 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: apps/desktop/src/lib/diagram/edge-obstacle-router.ts, apps/desktop/src/lib/mq/rocketmqTraceUtils.ts, apps/desktop/src/lib/database/jdbcxBuiltinDriver.ts, crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs, apps/desktop/src/lib/document/gridFsBrowser.ts, crates/dbx-drivers/src/db/cloudflare_d1/sql_guard.rs, apps/desktop/src/lib/editor/semanticSelectionRanges.ts, apps/desktop/src/lib/editor/plainTextSelectionRanges.ts (and 17 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/edge-obstacle-router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1174fee379aeffa183d0c5580bf6927dcadcb55896b8887e4bae4e5aab1ae5c3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sqlite_backup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"090ff6d996d3c01c0099e24613c2e72022ee4874d87ec3ee3239dc456ff73512"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/rocketmqTraceUtils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af7845ee100203bd17bd084f66a3ded21ca01a2836ffa56c1b3701c6f076d18"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/jdbcxBuiltinDriver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5141485145de4467a84748c276ff76f75d94cca00ea1b221401a3e8d5f2d72"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64b401ea2dc4c243239f025fbd89d34d191be17b0d3be99f9bed4e067ff5ca8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/document/gridFsBrowser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc32a9fd392d4a3e6c3d102c76af7839a4ecc899b97bb2bd0eddee18dad67631"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/sql_guard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae514d09dab6ad584171718cb73cf86a832e2c49a2d290ab94c6c01cbbeb6d87"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/semanticSelectionRanges.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd63a2d54ae5b26a527265940354bf1754a8d2613c82115c8a24f32673d76807"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/plainTextSelectionRanges.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d445535023db017e8cb8e533eae5a38408db1517ab6257f8a6a7fea50a74a29"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/layer-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba6ef564c02959803124a5d4b44e06408980ac9880138075f0b0c6dd021b308"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mqtt/mqttPayloadCodec.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36baf483d0faaa4b108682bd98bf1dee055c766cceec8910c3f0ee8e095e8316"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/rocketmqMessageUtils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"472d2ac422c613b253bee575c27b16b2b66d924722b8ca7b3e6a8cdadcfc6b4f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/query/queryResultArchive.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de7c646d322da46e5f8f388567baf131e98aad6db186c5c6bb01d9aeeffcabb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/match-engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa13f9fdb10a82d1f1f55ba176e3948f9169f0b6ceb07d9c1a77694171f21214"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/size-layer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb58700cb782f7db320417a7d6cc61fd1e07c97750a491c4514135188a1c114"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/graph-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"498c92d110b21fe5f10a2d59d0e1ff3908b8352c40cd7153ddc1336eb39d5876"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/sql_limits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8415052af07dfcfbac759dbb65ee08739de4e0a64e699bf95855c09fed8c79ac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlHistory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb6a004ddfcc82551641135b00b538d31587be2b72806ac470b2ecb9a8c7f07"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcDatabaseInfo.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4245b95a73368e1c4711ace3adaef15f437c184fdd6963764096d146dfdcba"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/diagram-dialect-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df9cf4c9c317a29290a6e68b7339fcf2d5d597ed9a45dd8d7185c7a15ee4ae4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorExtendSelection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcd895317383578e8dc8012e40f1dc8555a1962fbc613badc5ce9319b715f9e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/productionSafetyStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"143b612dacb3a60a8d862452ec24151fcef89f9d2057c4f0d1280e5a76576151"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/diagram.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bef033658f1ca481b38afae3eb70822e26e32f9f6f1f298324b2c4435ea1297"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/trigger.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52bcf1492fd11d362cbcf1ec098686c084d6aca89ab08d5d26e3cf330040fac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/rocketmqTopicTypes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51d7084b1bc08dcb99f9b2f8ac6054aef639bc940bcb9ef598234fef9b0c79b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: AgentProtocol.java \u2194 agent_driver.rs: \u0060agents/common/src/main/java/com/dbx/agent/AgentProtocol.java\u0060 (context agents) and \u0060crates/dbx-driver-agent/src/agent_driver.rs\u0060 (context crates) sit in DIFFERENT parts of the tree yet change together 100% of the time (21 of the 21 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 21 shared commits counted here, the most recent 3 are \u0060f581bed2\u0060 fix(zookeeper): route all ensemble endpoints through transports; \u00602db28fc2\u0060 feat(mongodb): support db.collection.renameCollection() (at that commit the file was still \u0060crates/dbx-drivers/src/db/agent_driver.rs\u0060); \u0060f78dc1ba\u0060 feat(mongodb): support bulkWrite (at that commit the file was still \u0060crates/dbx-core/src/db/agent_driver.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AgentProtocol.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c827b592d37a3bb1cb236fa12cf05ffa71640acb2531cc772c671ae8baebd056"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: redis.rs \u2194 redis_cmd.rs: \u0060crates/dbx-web/src/routes/redis.rs\u0060 (context crates) and \u0060src-tauri/src/commands/redis_cmd.rs\u0060 (context src-tauri) sit in DIFFERENT parts of the tree yet change together 91% of the time (20 of the 22 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 20 shared commits counted here, the most recent 3 are \u0060dbb83334\u0060 fix(redis): faithful raw byte command parsing and cluster crossslot p\u2026; \u006043b6e218\u0060 feat(redis): download large Redis values; \u00600f9d32e1\u0060 feat(redis): edit hash fields \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6cb043c09600bfd7a94faf84efe480159721368e80bf8ceb18e770c5615e77"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mongo.rs \u2194 mongo_cmd.rs: \u0060crates/dbx-web/src/routes/mongo.rs\u0060 (context crates) and \u0060src-tauri/src/commands/mongo_cmd.rs\u0060 (context src-tauri) sit in DIFFERENT parts of the tree yet change together 82% of the time (28 of the 34 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 28 shared commits counted here, the most recent 3 are \u006092ad8331\u0060 fix(mongo): error when querying a non-existent collection; \u0060f78dc1ba\u0060 feat(mongodb): support bulkWrite; \u00609eafac70\u0060 feat(mongodb): support replaceOne \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b57fc81d8e2b79a0ad6fef580b420f9fd5b6b0734e3253c5b7f7564ff6c8187"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: AgentProtocol.java \u2194 mongo_ops.rs: \u0060agents/common/src/main/java/com/dbx/agent/AgentProtocol.java\u0060 (context agents) and \u0060crates/dbx-core/src/query/mongo_ops.rs\u0060 (context crates) sit in DIFFERENT parts of the tree yet change together 76% of the time (16 of the 21 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are \u00602db28fc2\u0060 feat(mongodb): support db.collection.renameCollection(); \u0060f78dc1ba\u0060 feat(mongodb): support bulkWrite (at that commit the file was still \u0060crates/dbx-core/src/mongo_ops.rs\u0060); \u00609eafac70\u0060 feat(mongodb): support replaceOne (at that commit the file was still \u0060crates/dbx-core/src/mongo_ops.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AgentProtocol.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19e1aaaf310d99a9a91da5199b0c2690ed97d8ef14ea42f8fae0c4886e10985"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: redis.rs \u2194 lib.rs: \u0060crates/dbx-web/src/routes/redis.rs\u0060 (context crates) and \u0060src-tauri/src/lib.rs\u0060 (context src-tauri) sit in DIFFERENT parts of the tree yet change together 68% of the time (15 of the 22 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u006043b6e218\u0060 feat(redis): download large Redis values; \u00600f9d32e1\u0060 feat(redis): edit hash fields; \u0060168f2a47\u0060 feat(redis): support renaming keys \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/redis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68d16c6dbb5d2abe7872bf2e0157ad4fc27dd60df6167bd72eacca8619f0324"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mongo.rs \u2194 lib.rs: \u0060crates/dbx-web/src/routes/mongo.rs\u0060 (context crates) and \u0060src-tauri/src/lib.rs\u0060 (context src-tauri) sit in DIFFERENT parts of the tree yet change together 62% of the time (21 of the 34 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 21 shared commits counted here, the most recent 3 are \u0060f78dc1ba\u0060 feat(mongodb): support bulkWrite; \u00609eafac70\u0060 feat(mongodb): support replaceOne; \u006052c89267\u0060 feat(vector): support renaming Milvus collections \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dc397edd6db5ae0eeb1f63a75558debaea6eb9626ed6a29bb7624e8b191f9b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mongo_driver.rs \u2194 document_cmd.rs: \u0060crates/dbx-driver-mongodb/src/mongo_driver.rs\u0060 (context crates) and \u0060src-tauri/src/commands/document_cmd.rs\u0060 (context src-tauri) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00603e9974b2\u0060 perf(mongodb): skip total count for explicit limit queries; \u0060a5ce8510\u0060 feat(mongo): preserve BSON types when cloning and saving documents (at that commit the file was still \u0060crates/dbx-core/src/db/mongo_driver.rs\u0060); \u0060c9764be9\u0060 fix(mongodb): support collation for find queries (at that commit the file was still \u0060crates/dbx-core/src/db/mongo_driver.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cc610ab12255c84581fd0f962a4b00cff04d310ea5f3d7b396499d0a1725bf"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: main.rs \u2194 mongo_cmd.rs: \u0060crates/dbx-web/src/main.rs\u0060 (context crates) and \u0060src-tauri/src/commands/mongo_cmd.rs\u0060 (context src-tauri) sit in DIFFERENT parts of the tree yet change together 59% of the time (20 of the 34 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 20 shared commits counted here, the most recent 3 are \u0060f78dc1ba\u0060 feat(mongodb): support bulkWrite; \u00609eafac70\u0060 feat(mongodb): support replaceOne; \u006052c89267\u0060 feat(vector): support renaming Milvus collections \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"772c10d70f8510091acaecf53615789312fb6981a573c47af35885b6081acad5"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: MongoAgent.java \u2194 mongo_ops.rs: \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java\u0060 (context agents) and \u0060crates/dbx-core/src/query/mongo_ops.rs\u0060 (context crates) sit in DIFFERENT parts of the tree yet change together 58% of the time (18 of the 31 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are \u00602db28fc2\u0060 feat(mongodb): support db.collection.renameCollection(); \u0060f78dc1ba\u0060 feat(mongodb): support bulkWrite (at that commit the file was still \u0060crates/dbx-core/src/mongo_ops.rs\u0060); \u00609eafac70\u0060 feat(mongodb): support replaceOne (at that commit the file was still \u0060crates/dbx-core/src/mongo_ops.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4b9cf7e14527314d4435c9b3a0604a2f564709331a8e007de6894199963f42"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: main.rs \u2194 redis_cmd.rs: \u0060crates/dbx-web/src/main.rs\u0060 (context crates) and \u0060src-tauri/src/commands/redis_cmd.rs\u0060 (context src-tauri) sit in DIFFERENT parts of the tree yet change together 58% of the time (15 of the 26 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u006043b6e218\u0060 feat(redis): download large Redis values; \u00600f9d32e1\u0060 feat(redis): edit hash fields; \u0060168f2a47\u0060 feat(redis): support renaming keys \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7438bb8c2bd5d74982608235b127ecf219d6d7916f16f7693dabd871a124fa79"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: JsonRpcServer.java \u2194 agent_driver.rs: \u0060agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java\u0060 (context agents) and \u0060crates/dbx-driver-agent/src/agent_driver.rs\u0060 (context crates) sit in DIFFERENT parts of the tree yet change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00609cade987\u0060 fix(sql): harden SQL recognition, duplicate commits, and batch execut\u2026; \u00600e414e63\u0060 fix(agent): recover JDBC connections after query timeouts (at that commit the file was still \u0060crates/dbx-core/src/db/agent_driver.rs\u0060); \u006073120883\u0060 fix(dameng): separate materialized view metadata (at that commit the file was still \u0060crates/dbx-core/src/db/agent_driver.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4083b47e867116b1ea56b488727e2412e5ff932078c49bacf9d24f27f5cc1bda"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: MongoAgent.java \u2194 agent_driver.rs: \u0060agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java\u0060 (context agents) and \u0060crates/dbx-driver-agent/src/agent_driver.rs\u0060 (context crates) sit in DIFFERENT parts of the tree yet change together 52% of the time (16 of the 31 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are \u00602db28fc2\u0060 feat(mongodb): support db.collection.renameCollection() (at that commit the file was still \u0060crates/dbx-drivers/src/db/agent_driver.rs\u0060); \u0060f78dc1ba\u0060 feat(mongodb): support bulkWrite (at that commit the file was still \u0060crates/dbx-core/src/db/agent_driver.rs\u0060); \u00609eafac70\u0060 feat(mongodb): support replaceOne (at that commit the file was still \u0060crates/dbx-core/src/db/agent_driver.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12850bf7ce079b456161093664280679344d452a12b92bd44ccc5447bed31e1d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: treeNodeIcon.ts \u2192 SidebarTreeRuntimeHost.vue, TreeItem.vue, connectionStore.ts: \u0060apps/desktop/src/lib/sidebar/treeNodeIcon.ts\u0060 changes together with 3 other files \u2014 \u0060apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue\u0060, \u0060apps/desktop/src/components/sidebar/TreeItem.vue\u0060, \u0060apps/desktop/src/stores/connectionStore.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeIcon.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"573644608156f2ba21e19b91ea8bd6777d654d4bf158db760278888de1260ae2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: http.ts \u2192 useSidebarDatabaseSpecificMutationRuntime.ts, redis_ops.rs, ai.rs, document_cmd.rs, mongo_cmd.rs, redis_cmd.rs: \u0060apps/desktop/src/lib/backend/http.ts\u0060 changes together with 6 other files \u2014 \u0060apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts\u0060, \u0060crates/dbx-core/src/query/redis_ops.rs\u0060, \u0060crates/dbx-web/src/routes/ai.rs\u0060, \u0060src-tauri/src/commands/document_cmd.rs\u0060, \u0060src-tauri/src/commands/mongo_cmd.rs\u0060, \u0060src-tauri/src/commands/redis_cmd.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 6 separate couplings, not 6 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 6."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b7cbda94b383fcc6f698f625d7383e21f8d4097e258923052304265b3615c5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: en.ts \u2192 DangerConfirmDialog.vue, SqlFormatterSettingsPanel.vue, SqlParameterDialog.vue, ExportProgressPopover.vue, VisibleDatabasesDialog.vue, sidebarTreeDialogState.ts, useDialogSources.ts, useExportTracker.ts, useSidebarConnectionMutationRuntime.ts, backend-errors.ts, api.ts, tauri.ts, columnFormatter.ts, dataGridContextMenu.ts, gridSelection.ts, keyboardShortcuts.ts, shortcutRegistry.ts, editorSettingsDraft.ts, settingsSearch.ts, settingsTransfer.ts, sidebarTreeItemLayout.ts, treeNodeIcon.ts, objectSourceEditor.ts, tableImport.ts, ai_cli_agent.rs, connection_secrets.rs, redis.rs, redis_cmd.rs, transfer.rs, update.rs: \u0060apps/desktop/src/i18n/locales/en.ts\u0060 changes together with 30 other files \u2014 \u0060apps/desktop/src/components/editor/DangerConfirmDialog.vue\u0060, \u0060apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue\u0060, \u0060apps/desktop/src/components/editor/SqlParameterDialog.vue\u0060, \u0060apps/desktop/src/components/export/ExportProgressPopover.vue\u0060, \u0060apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue\u0060, \u0060apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts\u0060, \u0060apps/desktop/src/composables/useDialogSources.ts\u0060, \u0060apps/desktop/src/composables/useExportTracker.ts\u0060, \u0060apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts\u0060, \u0060apps/desktop/src/i18n/backend-errors.ts\u0060, \u0060apps/desktop/src/lib/backend/api.ts\u0060, \u0060apps/desktop/src/lib/backend/tauri.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/columnFormatter.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/gridSelection.ts\u0060, \u0060apps/desktop/src/lib/editor/keyboardShortcuts.ts\u0060, \u0060apps/desktop/src/lib/editor/shortcutRegistry.ts\u0060, \u0060apps/desktop/src/lib/settings/editorSettingsDraft.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsSearch.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsTransfer.ts\u0060, \u0060apps/desktop/src/lib/sidebar/sidebarTreeItemLayout.ts\u0060, \u0060apps/desktop/src/lib/sidebar/treeNodeIcon.ts\u0060, \u0060apps/desktop/src/lib/table/objectSourceEditor.ts\u0060, \u0060apps/desktop/src/lib/table/tableImport.ts\u0060, \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs\u0060, \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060, \u0060crates/dbx-web/src/routes/redis.rs\u0060, \u0060src-tauri/src/commands/redis_cmd.rs\u0060, \u0060src-tauri/src/commands/transfer.rs\u0060, \u0060src-tauri/src/commands/update.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 30 separate couplings, not 30 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 30."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/locales/en.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe8dcff59562a39b19c1eb337cc5790155790628d12d108ea96f34acd6cc2a1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: zh-CN.ts \u2192 EditorSettingsDialog.vue, sidebarTreeDialogState.ts, useExportTracker.ts, backend-errors.ts, tauri.ts, columnFormatter.ts, dataGridContextMenu.ts, gridSelection.ts, keyboardShortcuts.ts, shortcutRegistry.ts, redisKeyTree.ts, editorSettingsDraft.ts, settingsSearch.ts, settingsTransfer.ts, sidebarTreeItemLayout.ts, treeNodeIcon.ts, objectSourceEditor.ts, tableImport.ts, settingsStore.ts, ai_cli_agent.rs, connection_secrets.rs, cloud_sync.rs, redis_ops.rs, redis.rs, redis_cmd.rs, transfer.rs, update.rs: \u0060apps/desktop/src/i18n/locales/zh-CN.ts\u0060 changes together with 27 other files \u2014 \u0060apps/desktop/src/components/editor/EditorSettingsDialog.vue\u0060, \u0060apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts\u0060, \u0060apps/desktop/src/composables/useExportTracker.ts\u0060, \u0060apps/desktop/src/i18n/backend-errors.ts\u0060, \u0060apps/desktop/src/lib/backend/tauri.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/columnFormatter.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/gridSelection.ts\u0060, \u0060apps/desktop/src/lib/editor/keyboardShortcuts.ts\u0060, \u0060apps/desktop/src/lib/editor/shortcutRegistry.ts\u0060, \u0060apps/desktop/src/lib/redis/redisKeyTree.ts\u0060, \u0060apps/desktop/src/lib/settings/editorSettingsDraft.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsSearch.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsTransfer.ts\u0060, \u0060apps/desktop/src/lib/sidebar/sidebarTreeItemLayout.ts\u0060, \u0060apps/desktop/src/lib/sidebar/treeNodeIcon.ts\u0060, \u0060apps/desktop/src/lib/table/objectSourceEditor.ts\u0060, \u0060apps/desktop/src/lib/table/tableImport.ts\u0060, \u0060apps/desktop/src/stores/settingsStore.ts\u0060, \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs\u0060, \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060, \u0060crates/dbx-core/src/persistence/cloud_sync.rs\u0060, \u0060crates/dbx-core/src/query/redis_ops.rs\u0060, \u0060crates/dbx-web/src/routes/redis.rs\u0060, \u0060src-tauri/src/commands/redis_cmd.rs\u0060, \u0060src-tauri/src/commands/transfer.rs\u0060, \u0060src-tauri/src/commands/update.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 27 separate couplings, not 27 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 27."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/locales/zh-CN.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c780d7fe4814aceb7756fe32bd312e0824ab5febb3b0ad37f143f70c51515cf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: zh-TW.ts \u2192 sidebarTreeDialogState.ts, backend-errors.ts, dataGridContextMenu.ts, shortcutRegistry.ts, editorSettingsDraft.ts, settingsSearch.ts, settingsTransfer.ts, treeNodeIcon.ts, settingsStore.ts, ai_cli_agent.rs, redis.rs: \u0060apps/desktop/src/i18n/locales/zh-TW.ts\u0060 changes together with 11 other files \u2014 \u0060apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts\u0060, \u0060apps/desktop/src/i18n/backend-errors.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts\u0060, \u0060apps/desktop/src/lib/editor/shortcutRegistry.ts\u0060, \u0060apps/desktop/src/lib/settings/editorSettingsDraft.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsSearch.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsTransfer.ts\u0060, \u0060apps/desktop/src/lib/sidebar/treeNodeIcon.ts\u0060, \u0060apps/desktop/src/stores/settingsStore.ts\u0060, \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs\u0060, \u0060crates/dbx-web/src/routes/redis.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 11 separate couplings, not 11 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 11."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/locales/zh-TW.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffb0cb78dd5a739454fd2bec7f69b3f91bef030a2aec58d0cc818eebeb9986d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: es.ts \u2192 EditorSettingsDialog.vue, sidebarTreeDialogState.ts, backend-errors.ts, dataGridContextMenu.ts, keyboardShortcuts.ts, shortcutRegistry.ts, editorSettingsDraft.ts, settingsSearch.ts, settingsTransfer.ts, treeNodeIcon.ts, objectSourceEditor.ts, settingsStore.ts, ai_cli_agent.rs, redis.rs, redis_cmd.rs: \u0060apps/desktop/src/i18n/locales/es.ts\u0060 changes together with 15 other files \u2014 \u0060apps/desktop/src/components/editor/EditorSettingsDialog.vue\u0060, \u0060apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts\u0060, \u0060apps/desktop/src/i18n/backend-errors.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts\u0060, \u0060apps/desktop/src/lib/editor/keyboardShortcuts.ts\u0060, \u0060apps/desktop/src/lib/editor/shortcutRegistry.ts\u0060, \u0060apps/desktop/src/lib/settings/editorSettingsDraft.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsSearch.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsTransfer.ts\u0060, \u0060apps/desktop/src/lib/sidebar/treeNodeIcon.ts\u0060, \u0060apps/desktop/src/lib/table/objectSourceEditor.ts\u0060, \u0060apps/desktop/src/stores/settingsStore.ts\u0060, \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs\u0060, \u0060crates/dbx-web/src/routes/redis.rs\u0060, \u0060src-tauri/src/commands/redis_cmd.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 15 separate couplings, not 15 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 15."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/locales/es.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d9d120412ebf0366097d8e69917e4c84bfc68fc20140e9858503b06621a133"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: it.ts \u2192 sidebarTreeDialogState.ts, backend-errors.ts, dataGridContextMenu.ts, shortcutRegistry.ts, editorSettingsDraft.ts, settingsSearch.ts, settingsTransfer.ts, treeNodeIcon.ts, settingsStore.ts, ai_cli_agent.rs, redis.rs: \u0060apps/desktop/src/i18n/locales/it.ts\u0060 changes together with 11 other files \u2014 \u0060apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts\u0060, \u0060apps/desktop/src/i18n/backend-errors.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts\u0060, \u0060apps/desktop/src/lib/editor/shortcutRegistry.ts\u0060, \u0060apps/desktop/src/lib/settings/editorSettingsDraft.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsSearch.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsTransfer.ts\u0060, \u0060apps/desktop/src/lib/sidebar/treeNodeIcon.ts\u0060, \u0060apps/desktop/src/stores/settingsStore.ts\u0060, \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs\u0060, \u0060crates/dbx-web/src/routes/redis.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 11 separate couplings, not 11 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 11."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/locales/it.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7fda136a1e225d893b5de466f011bdee4b235c9ab327b7c9337e627fa49316"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: ja.ts \u2192 sidebarTreeDialogState.ts, backend-errors.ts, dataGridContextMenu.ts, shortcutRegistry.ts, editorSettingsDraft.ts, settingsSearch.ts, settingsTransfer.ts, treeNodeIcon.ts, ai_cli_agent.rs: \u0060apps/desktop/src/i18n/locales/ja.ts\u0060 changes together with 9 other files \u2014 \u0060apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts\u0060, \u0060apps/desktop/src/i18n/backend-errors.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts\u0060, \u0060apps/desktop/src/lib/editor/shortcutRegistry.ts\u0060, \u0060apps/desktop/src/lib/settings/editorSettingsDraft.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsSearch.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsTransfer.ts\u0060, \u0060apps/desktop/src/lib/sidebar/treeNodeIcon.ts\u0060, \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 9 separate couplings, not 9 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 9."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/locales/ja.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efdddc216f5986c3320bf81724d7233da195be74fdf8be4193ecf449c17a56e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: pt-BR.ts \u2192 sidebarTreeDialogState.ts, backend-errors.ts, dataGridContextMenu.ts, shortcutRegistry.ts, editorSettingsDraft.ts, settingsSearch.ts, settingsTransfer.ts, treeNodeIcon.ts, settingsStore.ts, ai_cli_agent.rs, redis.rs: \u0060apps/desktop/src/i18n/locales/pt-BR.ts\u0060 changes together with 11 other files \u2014 \u0060apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts\u0060, \u0060apps/desktop/src/i18n/backend-errors.ts\u0060, \u0060apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts\u0060, \u0060apps/desktop/src/lib/editor/shortcutRegistry.ts\u0060, \u0060apps/desktop/src/lib/settings/editorSettingsDraft.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsSearch.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsTransfer.ts\u0060, \u0060apps/desktop/src/lib/sidebar/treeNodeIcon.ts\u0060, \u0060apps/desktop/src/stores/settingsStore.ts\u0060, \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs\u0060, \u0060crates/dbx-web/src/routes/redis.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 11 separate couplings, not 11 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 11."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/locales/pt-BR.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7702eb5f8e6fd4db9c1d119c4232ea456b8762b682af3894a59767a1c9335273"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: ko.ts \u2192 editorSettingsDraft.ts, settingsSearch.ts, settingsTransfer.ts, treeNodeIcon.ts: \u0060apps/desktop/src/i18n/locales/ko.ts\u0060 changes together with 4 other files \u2014 \u0060apps/desktop/src/lib/settings/editorSettingsDraft.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsSearch.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsTransfer.ts\u0060, \u0060apps/desktop/src/lib/sidebar/treeNodeIcon.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/locales/ko.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4e2134afcfe6bc39f3f20bea40d4b55b1f652cdb0153b40b745a463b6604ef"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: tests.rs \u2194 triggers.rs: \u0060crates/dbx-sql-schema/src/table_structure_sql/tests.rs\u0060 and \u0060crates/dbx-sql-schema/src/table_structure_sql/triggers.rs\u0060 change together 90% of the time (9 of the 10 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 9 shared commits counted here, the most recent 3 are \u00609d38961a\u0060 fix(dameng): load and edit triggers in table structure; \u0060e18c6001\u0060 fix(oracle): add trigger operations in structure edit; \u00605a74925d\u0060 fix(oracle): extract trigger body from driver source when cloning (at that commit the files were still \u0060crates/dbx-sql/src/table_structure_sql/tests.rs\u0060 and \u0060crates/dbx-sql/src/table_structure_sql/triggers.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65c27870527f464c2516d593787d9747d4f203d353142c7b49a9fe1204931c1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: columns.rs \u2194 tests.rs: \u0060crates/dbx-sql-schema/src/table_structure_sql/columns.rs\u0060 and \u0060crates/dbx-sql-schema/src/table_structure_sql/tests.rs\u0060 change together 85% of the time (22 of the 26 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 22 shared commits counted here, the most recent 3 are \u006095d3e800\u0060 fix(hana): expose table rename and column comments; \u0060fd3be84b\u0060 feat(hana): enable table rename and structure editing; \u006005a57cbf\u0060 fix(sqlserver): drop default constraint before dropping a column \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/columns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b912d850f4bf07ebedb227d8d63496d9ed0f71a6ee66aeeb35192a68799151b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: api.ts \u2192 main.rs, mongo.rs, redis.rs, external_sql.rs, mongo_cmd.rs, redis_cmd.rs, lib.rs: \u0060apps/desktop/src/lib/backend/api.ts\u0060 changes together with 7 other files \u2014 \u0060crates/dbx-web/src/main.rs\u0060, \u0060crates/dbx-web/src/routes/mongo.rs\u0060, \u0060crates/dbx-web/src/routes/redis.rs\u0060, \u0060src-tauri/src/commands/external_sql.rs\u0060, \u0060src-tauri/src/commands/mongo_cmd.rs\u0060, \u0060src-tauri/src/commands/redis_cmd.rs\u0060, \u0060src-tauri/src/lib.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 7 separate couplings, not 7 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 7."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84051ecfc40fe0ddcbca3a0d9477a69d461d848bef790be025bda83958841574"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: AiAssistant.vue \u2192 ai_cli_agent.rs, ai_codex_cli.rs, agent_loop.rs, ai.rs, ai.rs: \u0060apps/desktop/src/components/editor/AiAssistant.vue\u0060 changes together with 5 other files \u2014 \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs\u0060, \u0060crates/dbx-ai-provider/src/ai_codex_cli.rs\u0060, \u0060crates/dbx-core/src/ai/agent_loop.rs\u0060, \u0060crates/dbx-web/src/routes/ai.rs\u0060, \u0060src-tauri/src/commands/ai.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77401bf8c9e44192a9e6f0c31c5176b3af70bdad06b49aaef4b2c806c5112e5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: App.vue \u2192 querySurfaces.ts, openTabsPersistence.ts, external_sql.rs: \u0060apps/desktop/src/App.vue\u0060 changes together with 3 other files \u2014 \u0060apps/desktop/src/components/layout/querySurfaces.ts\u0060, \u0060apps/desktop/src/lib/app/openTabsPersistence.ts\u0060, \u0060src-tauri/src/commands/external_sql.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6717ed37d23e6ba01482638eeefdd7ea05746124caa762e28ff636c9baea2da"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: ConnectionDialog.vue \u2192 TunnelProfileManager.vue, DatabaseIcon.vue, DatabaseSearchDialog.vue, VisibleDatabasesDialog.vue, connection_secrets.rs, agent_catalog.rs, database_capabilities.rs: \u0060apps/desktop/src/components/connection/ConnectionDialog.vue\u0060 changes together with 7 other files \u2014 \u0060apps/desktop/src/components/connection/TunnelProfileManager.vue\u0060, \u0060apps/desktop/src/components/icons/DatabaseIcon.vue\u0060, \u0060apps/desktop/src/components/search/DatabaseSearchDialog.vue\u0060, \u0060apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue\u0060, \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060, \u0060crates/dbx-driver-agent/src/agent_catalog.rs\u0060, \u0060crates/dbx-driver-agent/src/database_capabilities.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 7 separate couplings, not 7 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 7."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0453895f5b2b46305ebf4a6ac42aa2d651ce96a998ba312927684e9413dfe61"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: explainPlan.ts \u2194 query_execution_sql.rs: \u0060apps/desktop/src/lib/diagram/explainPlan.ts\u0060 and \u0060crates/dbx-sql-core/src/query_execution_sql.rs\u0060 change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00603c4075a8\u0060 feat(opengauss): support the explain button with plain-text EXPLAIN; \u006032789b1d\u0060 feat(xugu): support visual estimated execution plans; \u006006fc0df2\u0060 feat(oceanbase-oracle): support graphical execution plans (at that commit the file was still \u0060crates/dbx-sql/src/query_execution_sql.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fca08057b1a6e55b8b23bf2fedfadb5b299905d6151dea309a9a5ff5f2a2b0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: tauri.ts \u2192 useSidebarDatabaseSpecificMutationRuntime.ts, exportFormats.ts, main.rs: \u0060apps/desktop/src/lib/backend/tauri.ts\u0060 changes together with 3 other files \u2014 \u0060apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts\u0060, \u0060apps/desktop/src/lib/export/exportFormats.ts\u0060, \u0060crates/dbx-web/src/main.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5927e932ce69d4d62bea445fd78ea2b200050d768e68e88eff7cba371a65cc98"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: layout.tsx \u2194 LandingFooter.tsx: \u0060docs/app/[lang]/layout.tsx\u0060 and \u0060docs/components/landing/LandingFooter.tsx\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060a3038e25\u0060 docs: raise advertised database count from 90\u002B to 100\u002B; \u0060d766228b\u0060 feat(site): polish dark theme, typography, and docs nav; \u006028c0977a\u0060 docs: bump app size claim to 25 MB \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2f4fd7392fae868c728c47e49081a6c88c78a927427ba08ac7b43caf13b4b0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: settingsSearch.ts \u2192 editorSettingsDraft.ts, settingsTransfer.ts, settingsStore.ts: \u0060apps/desktop/src/lib/settings/settingsSearch.ts\u0060 changes together with 3 other files \u2014 \u0060apps/desktop/src/lib/settings/editorSettingsDraft.ts\u0060, \u0060apps/desktop/src/lib/settings/settingsTransfer.ts\u0060, \u0060apps/desktop/src/stores/settingsStore.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/settingsSearch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52bdf5f55f1511c498400506c02bed507481fd27495749a2daea9ce424c731e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: exportFormats.ts \u2194 table_export.rs: \u0060apps/desktop/src/lib/export/exportFormats.ts\u0060 and \u0060crates/dbx-core/src/data/table_export.rs\u0060 change together 62% of the time (8 of the 13 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00601d07cb05\u0060 feat(export): add portable standard SQL inserts; \u0060d715b16b\u0060 fix(sqlserver): wrap identity inserts with SET IDENTITY_INSERT; \u0060d17ce466\u0060 feat(export): honor exclude-primary-keys in SQL script exports (at that commit the file was still \u0060crates/dbx-core/src/table_export.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/exportFormats.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9da394fda9962a9163373e699cf7eb79dd0e2d10100fb482ac78a88990f9b20"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: LandingFooter.tsx \u2194 metadata.ts: \u0060docs/components/landing/LandingFooter.tsx\u0060 and \u0060docs/lib/metadata.ts\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060a3038e25\u0060 docs: raise advertised database count from 90\u002B to 100\u002B; \u006028c0977a\u0060 docs: bump app size claim to 25 MB; \u0060d53c855b\u0060 feat(docs): update database coverage to 90\u002B \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/landing/LandingFooter.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"612bcf83c5a3664281045c0ff87185173c448f410cffa68fe3c4e0372631770b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: DocumentBrowser.vue \u2194 document_cmd.rs: \u0060apps/desktop/src/components/document/DocumentBrowser.vue\u0060 and \u0060src-tauri/src/commands/document_cmd.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060a5ce8510\u0060 feat(mongo): preserve BSON types when cloning and saving documents; \u0060c9764be9\u0060 fix(mongodb): support collation for find queries; \u006078a61334\u0060 fix(elasticsearch): preserve legacy type on delete \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a35b2088641d6c41d42b95bedaffe51d8a17021cd13e031c754b4ee69ff1b98"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: DriverStoreDialog.vue \u2194 agents.rs: \u0060apps/desktop/src/components/config/DriverStoreDialog.vue\u0060 and \u0060crates/dbx-web/src/routes/agents.rs\u0060 change together 59% of the time (13 of the 22 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060da95bd43\u0060 fix(updates): auto-continue client upgrade on update-all; \u0060c712be3e\u0060 feat(agent): support cancelling installs and upgrades; \u00608737114d\u0060 fix(jdbc): include managed drivers in offline bundles \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"130078d78b654974999c9e2f521eb9697810b5a0287dd942445de53019cb3f58"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: queryStore.ts \u2194 mongo_cmd.rs: \u0060apps/desktop/src/stores/queryStore.ts\u0060 and \u0060src-tauri/src/commands/mongo_cmd.rs\u0060 change together 59% of the time (20 of the 34 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 20 shared commits counted here, the most recent 3 are \u00603e9974b2\u0060 perf(mongodb): skip total count for explicit limit queries; \u0060a78fc48a\u0060 feat(mongodb): support find explain in the SQL editor; \u0060f78dc1ba\u0060 feat(mongodb): support bulkWrite \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6910974cc85bee07cca5f2ff8330a108a6377036175d9b63a3a01e27bf7fe7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: RedisKeyBrowser.vue \u2194 redis_cmd.rs: \u0060apps/desktop/src/components/redis/RedisKeyBrowser.vue\u0060 and \u0060src-tauri/src/commands/redis_cmd.rs\u0060 change together 58% of the time (15 of the 26 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u0060168f2a47\u0060 feat(redis): support renaming keys; \u006031f0b7d6\u0060 feat(redis): add stream consumer group monitoring; \u0060ba81fa44\u0060 feat(redis): support multiple value formats in viewer (#2766) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a18292a6247e1dfccbeca7fd46e9680e71b7a812eecf2b6fd21d7bec36ae97a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ContentArea.vue \u2194 tabResultCache.ts: \u0060apps/desktop/src/components/layout/ContentArea.vue\u0060 and \u0060apps/desktop/src/lib/tabs/tabResultCache.ts\u0060 change together 57% of the time (12 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060741b10b4\u0060 fix(grid): speed up join header comments and show type lengths; \u006066007187\u0060 feat(neo4j): expand node query properties into result columns; \u0060237064f9\u0060 fix(grid): budget large-value previews by segment and show executed SQL \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1b79585ce68bfc14999483ce5e80b49bb5a3ac25a5fe8f9cd296c1de947189"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: DataGrid.vue \u2194 tabResultCache.ts: \u0060apps/desktop/src/components/grid/DataGrid.vue\u0060 and \u0060apps/desktop/src/lib/tabs/tabResultCache.ts\u0060 change together 57% of the time (12 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060a10bd55a\u0060 fix(mysql): disable next page via read only probe; \u0060741b10b4\u0060 fix(grid): speed up join header comments and show type lengths; \u006066007187\u0060 feat(neo4j): expand node query properties into result columns \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67b0af903bece36ce48b7f1f61a0bce9db007fc9e321de4d4af123737930a1d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: useDataGridExport.ts \u2194 useSidebarTreeExportRuntime.ts: \u0060apps/desktop/src/composables/useDataGridExport.ts\u0060 and \u0060apps/desktop/src/composables/useSidebarTreeExportRuntime.ts\u0060 change together 57% of the time (8 of the 14 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 8 shared commits counted here, the most recent 3 are \u00600fce8f44\u0060 feat(export): reveal exported file from completion toast; \u006087546f8e\u0060 fix(export): honor database name setting in table SQL export; \u0060ce5217bd\u0060 fix(csv): stop wrapping exported dates in equals-prefixed formulas \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4866a6c2959c1f3b0525fef1404fcb01f53fe0661de053106991202715ad81f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: sidebarTreeItemLayout.ts \u2194 connectionStore.ts: \u0060apps/desktop/src/lib/sidebar/sidebarTreeItemLayout.ts\u0060 and \u0060apps/desktop/src/stores/connectionStore.ts\u0060 change together 56% of the time (19 of the 34 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 19 shared commits counted here, the most recent 3 are \u0060b8f39f9c\u0060 feat(oracle): add dblink completion, tree view and management; \u0060ec4f8582\u0060 feat(dameng): add user and role administration; \u00606ea009a5\u0060 fix(connection): refresh and display connection notes \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTreeItemLayout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e966658163131799e2d57e377c8a5320b95c739abe87bdf95f2e1c70523efc07"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: connection_secrets.rs \u2194 mod.rs: \u0060crates/dbx-core/src/connection/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/query/mod.rs\u0060 change together 55% of the time (17 of the 31 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are \u00602929b1c0\u0060 feat(hive): add Kerberos connection options (at that commit the files were still \u0060crates/dbx-core/src/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/query.rs\u0060); \u0060d815a16b\u0060 feat(redis): move scan page size to connections (at that commit the files were still \u0060crates/dbx-core/src/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/query.rs\u0060); \u006040c93b9d\u0060 feat(connection): add visible schema filtering (at that commit the files were still \u0060crates/dbx-core/src/connection_secrets.rs\u0060 and \u0060crates/dbx-core/src/query.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/connection_secrets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0824ceb8195c1a6e358d68e44e33f5c167c3f0c9d032f708ba8b39452e891df"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: QueryEditor.vue \u2192 codemirrorSqlDialect.ts, diagnostics.ts, tokens.ts: \u0060apps/desktop/src/components/editor/QueryEditor.vue\u0060 changes together with 3 other files \u2014 \u0060apps/desktop/src/lib/editor/codemirrorSqlDialect.ts\u0060, \u0060apps/desktop/src/lib/sql/semantic/diagnostics.ts\u0060, \u0060apps/desktop/src/lib/sql/semantic/tokens.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3179ec3a1a3424ac06250404e7e6496694bb5eb2955c34f1a7d211a9a3ae0e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: lib.rs \u2192 useSidebarDatabaseSpecificMutationRuntime.ts, useTauriEvents.ts, useWindowControls.ts, localeOptions.ts: \u0060src-tauri/src/lib.rs\u0060 changes together with 4 other files \u2014 \u0060apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts\u0060, \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060, \u0060apps/desktop/src/composables/useWindowControls.ts\u0060, \u0060apps/desktop/src/lib/app/localeOptions.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e481a8dc4fb1ca40b9554f3390ca60b543fe66b4dcba44a2878a991bb7f9c15f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: DataGrid.vue \u2194 exportFormats.ts: \u0060apps/desktop/src/components/grid/DataGrid.vue\u0060 and \u0060apps/desktop/src/lib/export/exportFormats.ts\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060d715b16b\u0060 fix(sqlserver): wrap identity inserts with SET IDENTITY_INSERT; \u0060ab35a5b1\u0060 feat(export): add SQL INSERT batch or single-row mode; \u0060e9fea304\u0060 fix(xugu): preserve spatial SRIDs in exports \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a8af65f1b6c04d7ccc3b5679645dd3d79e336feee1ffbfd5ee425799d9b6a6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: connectionPresentation.ts \u2194 mod.rs: \u0060apps/desktop/src/lib/connection/connectionPresentation.ts\u0060 and \u0060crates/dbx-core/src/connection/mod.rs\u0060 change together 52% of the time (11 of the 21 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060264f5c48\u0060 feat(influxdb3): add influxdb 3 engine over http (at that commit the file was still \u0060crates/dbx-core/src/connection.rs\u0060); \u006050e6476c\u0060 fix(meilisearch): preserve proxy paths and secure REST requests (at that commit the file was still \u0060crates/dbx-core/src/connection.rs\u0060); \u0060336fbe09\u0060 feat(gaussdb): support multi-host connections (at that commit the file was still \u0060crates/dbx-core/src/connection.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionPresentation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6d2bdefa00aa17951e23421ad78d6092d752a8455dd37e5284ac2af74c8212"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: RedisValueViewer.vue \u2194 redis_cmd.rs: \u0060apps/desktop/src/components/redis/RedisValueViewer.vue\u0060 and \u0060src-tauri/src/commands/redis_cmd.rs\u0060 change together 50% of the time (13 of the 26 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u006043b6e218\u0060 feat(redis): download large Redis values; \u00600f9d32e1\u0060 feat(redis): edit hash fields; \u0060168f2a47\u0060 feat(redis): support renaming keys \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f821dfdb1ff40a863985f2f9017abd88d74ecb14a34a1687822217f5b500faf1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: RedisKeyBrowser.vue \u2194 redis.rs: \u0060apps/desktop/src/components/redis/RedisKeyBrowser.vue\u0060 and \u0060crates/dbx-web/src/routes/redis.rs\u0060 change together 50% of the time (11 of the 22 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060168f2a47\u0060 feat(redis): support renaming keys; \u006031f0b7d6\u0060 feat(redis): add stream consumer group monitoring; \u0060fc9f97b6\u0060 fix(redis): speed up large key scans \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8fd38759b367d0769cab29b673c6c018dca8ffa4469363e52bb90f6d96045b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: RedisValueViewer.vue \u2194 redis.rs: \u0060apps/desktop/src/components/redis/RedisValueViewer.vue\u0060 and \u0060crates/dbx-web/src/routes/redis.rs\u0060 change together 50% of the time (11 of the 22 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u006043b6e218\u0060 feat(redis): download large Redis values; \u00600f9d32e1\u0060 feat(redis): edit hash fields; \u0060168f2a47\u0060 feat(redis): support renaming keys \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6b6de1448e297e4f3514eed291920d90a64c0caa40fa879d4f7a92d04578d9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: TreeItem.vue \u2194 objectSourceEditor.ts: \u0060apps/desktop/src/components/sidebar/TreeItem.vue\u0060 and \u0060apps/desktop/src/lib/table/objectSourceEditor.ts\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060668919a7\u0060 fix(gbase8s): make view source saves safer; \u0060f16454a4\u0060 fix(app): preserve object source formatting (at that commit the file was still \u0060apps/desktop/src/lib/objectSourceEditor.ts\u0060); \u0060da00405e\u0060 fix(db): support routine rename editing (at that commit the file was still \u0060apps/desktop/src/lib/objectSourceEditor.ts\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bce67fe180959d6a90da0b4e05bc05a1ab92f53a30c98aa5c4ee1b19ef429e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: EditorSettingsDialog.vue \u2194 ai_cli_agent.rs: \u0060apps/desktop/src/components/editor/EditorSettingsDialog.vue\u0060 and \u0060crates/dbx-ai-provider/src/ai_cli_agent.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060d3947d24\u0060 feat(ai): add Claude Code CLI provider (at that commit the file was still \u0060crates/dbx-core/src/ai_cli_agent.rs\u0060); \u00605a666b1f\u0060 fix(ai): improve assistant execution and MCP settings (at that commit the file was still \u0060crates/dbx-core/src/ai_cli_agent.rs\u0060); \u0060034cce47\u0060 fix(ai): Codex CLI provider reliability fixes for DBX Desktop (at that commit the file was still \u0060crates/dbx-core/src/ai_cli_agent.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"951c41c74e283ca9a665b3029e06439c309ee6792e8662da1501c4fcba1f7254"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: TableStructureEditor.vue \u2194 triggers.rs: \u0060apps/desktop/src/components/structure/TableStructureEditor.vue\u0060 and \u0060crates/dbx-sql-schema/src/table_structure_sql/triggers.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060e18c6001\u0060 fix(oracle): add trigger operations in structure edit; \u0060d96da5de\u0060 fix(sqlserver): edit triggers with events and disabled state (at that commit the file was still \u0060crates/dbx-core/src/table_structure_sql/triggers.rs\u0060); \u0060fdaef625\u0060 feat(oracle): support safe trigger structure editing (at that commit the file was still \u0060crates/dbx-core/src/table_structure_sql/triggers.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"296c56b9e35722aa25977d7751b33a2b9ab9a7611a464b32f1cb02b9dc38d736"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: useDataGridExport.ts \u2194 sql.rs: \u0060apps/desktop/src/composables/useDataGridExport.ts\u0060 and \u0060crates/dbx-sql-data/src/data_grid_extractors/sql.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00601dd7535d\u0060 feat(export): format SQL Server spatial columns with STGeomFromText; \u0060e3d5d141\u0060 fix(grid): keep manual primary keys in exclude-PK insert copies (at that commit the file was still \u0060crates/dbx-core/src/data_grid_extractors/sql.rs\u0060); \u00609fc77215\u0060 fix(kingbase): honor connection identifier quotes in exports (at that commit the file was still \u0060crates/dbx-core/src/data_grid_extractors/sql.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"484c579a7f8ae9cda7d7fed7a5531df3e64725037ba366dbf7d62823639b1123"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: useSidebarDatabaseSpecificMutationRuntime.ts \u2194 main.rs: \u0060apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts\u0060 and \u0060crates/dbx-web/src/main.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00605b937388\u0060 feat(meilisearch): add index creation; \u006052c89267\u0060 feat(vector): support renaming Milvus collections; \u0060439f2c26\u0060 feat(milvus): add database and collection deletion \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08962ce296f8282ad502d1f8f825eea3d89ab48643254d12b46944d7b0a8f6c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ConnectionTree.vue \u2194 LightDropdown.vue: \u0060apps/desktop/src/components/sidebar/ConnectionTree.vue\u0060 and \u0060apps/desktop/src/components/ui/LightDropdown.vue\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006099c3bd0f\u0060 feat(ui): animate sidebar and toolbar interaction feedback; \u0060589fbd9d\u0060 feat(ui): streamline sidebar and settings layout; \u00609d603b61\u0060 Refine overflow navigation review feedback \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4f66b2c6e711d8b503de9f3da94cb94d010282c8c12376b5509d18d2f94d3f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: EditorSettingsDialog.vue \u2194 LightDropdown.vue: \u0060apps/desktop/src/components/editor/EditorSettingsDialog.vue\u0060 and \u0060apps/desktop/src/components/ui/LightDropdown.vue\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006099c3bd0f\u0060 feat(ui): animate sidebar and toolbar interaction feedback; \u0060589fbd9d\u0060 feat(ui): streamline sidebar and settings layout; \u006028e7cdfa\u0060 improve: \u7EDF\u4E00\u8868\u5355\u63A7\u4EF6\u5C0F\u5706\u89D2\u6837\u5F0F \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97412fcb6df3a65d6a7a28b7a2e0b8016148bce91de0421a48e4ea265b2ff8a"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2dda846f1ba460233103b004e88096545a8b171442686f8a7c3ce3dc74dcf010"}},{"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":"3728f568ad58432cf3378cc04701b711fdf7b3ed3e07f89f5f362022d66e6f38"},"taxa":[{"id":"CICD-SEC-6","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":"81d0799af757bba1afbed34637d383ea39ed22bd8ff8ec5b09c5aa413595d701"},"taxa":[{"id":"CICD-SEC-6","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":"50a78005a46346becdac86ed94c6be7faaeb0b16abb3f2ad51c8100c5e97148c"},"taxa":[{"id":"CICD-SEC-6","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":"d81e06368f12707a8638190601744ada73d3a8b26f68c9f8349279b0b20db9e1"},"taxa":[{"id":"CICD-SEC-6","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":"a0812939330ba529a9465cfd44fdb8db3074946bddba5900e225bd16cbcd9a63"},"taxa":[{"id":"CICD-SEC-6","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":"f61abefcaf625a5b4372fecfa9caeefab97fdd38a65c46a5a9fa93d4c45be9de"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d0742dd8efc35ffe2cbf7341c393c2bb504eb5a833c5b7f658cdaab3b7adee2"},"taxa":[{"id":"CICD-SEC-5","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":"c6eb5a94052c328a9f9d4f3228923a5f2d4d56700f96d3ddbb1b358415402983"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAttachmentCard.vue"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad30eb1f132be8b0bda8edc863361270ba4b3d2c36f2eff442b9c79918cb7b0"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridCellDetailDialog.vue"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"81da12c1edc77d9715b47a3c6732f93b15bcd07f875943b6aed62c4599fc28fa"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridCellDetailPanel.vue"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c2f8601dd52b22dacc0fcc51cd6b8a738343aead42bfc23b26b35754618100"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Csvg role=\u0022img\u0022\u003E without an accessible name: An svg presented as an image needs a name \u2014 add a \u003Ctitle\u003E child or an aria-label/aria-labelledby."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/DocsSidebarFooter.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a10635821101e01bd0b91548c95ed88c7960e886fac617839627654e8806b71"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/landing/Starfield.tsx"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"850e74e2c6565d31a4845443614c806fdb4a0a0b70e8aec161419020dab05ce1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":6206}}}],"partialFingerprints":{"codehealthFindingId/v1":"db31b4c8a31aa77240e6e95cb8c6a83ccc72e58e480ab2cf773f25177741bfb9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":6207}}}],"partialFingerprints":{"codehealthFindingId/v1":"34416e3c6b07e715c44dee80fdd320fb2fd264791b8849fc5b02c9ae6fcc9589"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":6211}}}],"partialFingerprints":{"codehealthFindingId/v1":"43afe7b04b56c5e5206186104f2f0c53debe65aee71739df00d33d167973dc0a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b601d5cc397e730df8191dcb562fd9d112d7baa309294045d8ae1de3276a46f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/AuthorizationScopeEditor.vue"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5075c08980215e0f54d3e0814aa5a63cc5f9fbefcfb1d29af8c99a0f7c3b2d57"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/AuthorizationScopeEditor.vue"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e13a4afc9b769dff2d179ea591be7349321283477d3487d68af0922832c2bf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/AuthorizationScopeEditor.vue"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a413eaa68a5429ecafc22f22b11a39dd482f00e66ad7384d5087dd0e963831e4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/AuthorizationScopeEditor.vue"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f56325c46f912fbfa1d934e062fcb4306dcfa64dc57508424a9714bd965378"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengRoleAdmin.vue"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3945a61bb6222fcaf74391042d9db63beb827c36813a28a0414c79c5098a456b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c10e5b0bc8004e9ff73f26c38a3a386b9f485d7c6b175f7ce279b88e9bd865d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"b868361850764aee2ddaa8adaab7b6dfd4f6f6cedaa8a14d5ec4cd97a33f5846"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea5026944458de8c5ec06e45e2ff9c384051bea82f43f8eef67948e27a2c909"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbe33a329c84923350c6eeba74e92d81f3fa4d074934ccf6a91e00f9ccf6b0a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"40512041dfc0e7f1870fc6e943c6af70416dc5dcd6ce4baac63829ef4a02f235"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73078d4e3778c08460a182a20ec964abf3e022612722bdc779d379d2d3ac9fa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cc00c1ece1c17cc44d6dcf0b0ac4862889e7d4786b1e7accb231ebca17d3b8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f192cd7c28928777b8fd24aa2788b5b9b04f925d29105be773d88e30c450b16c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78d2614c9ec24f8b49af1e1cc6433fe0d12ba2c962b10521574f14986e6dcda"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"503e6a1576656deecfa28877e3523d7ef90aea269a2065a6cd6693b5e31629d4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/MySqlDashboard.vue"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e6b6b02c2916445883d6f5af0098961b01cfbcdc7c485366a4241aa5057a57"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/MySqlDashboard.vue"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5546b9e23cb871899bcdd6ceb327b9ca16f9f80ae04803ae3256639e6ac3ca"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/PostgresDashboard.vue"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce7182d3c8aa0b296a76ff1d59ba8c14e2e447bf4b6bab5bca126351528cb62"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"d953852080efb3b648b1dfd78e90afb08141b0c76281fedbb6931acb0a158243"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdde427c6d97ac0b75126369971a10b1032a5a16bdf044fb6c031d32de0f59a1"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control named only by title on \u003Ctd\u003E: This \u003Ctd\u003E carries a click handler, which makes it a control, and its only name is a title attribute. A plain element maps to role=\u0022generic\u0022, which does not support a name from the author, so the title is announced as nothing at all \u2014 it is a mouse-only tooltip, unreachable on touch. Give it role=\u0022button\u0022 (which it needs anyway to be operable) so the title becomes a real name, or add an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb79cb7dece3408ea8f2d84e978f741131bc8590426e29813e9b98119f0b6cb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/SqlServerActivityTracePanel.vue"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c323cd56aa898459bb93746a6bacf00bc86c5b68d6874014511b7ae741488c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/SqlServerActivityTracePanel.vue"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c017b548fc89b6400964ced85fd3f62a002088faf680eee934346a652ec3f7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/SqlServerActivityTracePanel.vue"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d04871f77bcd62d3b08bfcfb7f0ce7e7d193dbc28d4e07df690ca11eff2b8c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/SqlServerActivityTracePanel.vue"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2438a200a48537d056e0315893036f008bce93d2fdd02ee99d2de177d73323"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguServerDashboard.vue"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df1c0e5386d5ef6a09e412c28c47164efd3d2611fc4ebc4df569facbbd3db44"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2a262827e2e9998a58996f07a39152725d0943138cabca940797d196ca92d0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"8732085b805df87adeb6448f7883cfc420696451cfd6db74ca88f0fa508f4da5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/auth/LoginPage.vue"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4a32247e6c9f05085fcf5b72cc6b42bc4c0c9a2eeea2770a8d080aee80784e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ef59a2bcbede54dd97cbea857edfeabe2b2637aa4db9263d9617d6d5269a6b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdc2ed7e40b2818ee54434bd1996d4ea1a03b8262da36b07f49e5b229ca3b7f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc7b5840ed9f2a4b3066800c70d4cd85da4798e86ffe951fc23b6c01570aacf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b0d0d386f036734264a22886178df7ec1e2798c94c6ee0333c50fde39e7fea"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f5c689682f28bc840a8c09b7809a58da20c740d2103b4a3ff79fbddf038615"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f699b7daf02701ef2b728247907b4e6443890712d8f32f9cb325dea8e9a592"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7ad835d988a054e7699dbe3a8b96b7b00b5b85168b9bc71580e399d29f41e6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"abedb6705749d54fb46d3356d105b0b101c06cab3c23a5f6f6dac1ad87650737"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b676f0159d3effb322c0efc99dc32a5eb8f5e4323e7db87fdbb0fc1e5d164e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58680b191ce79228dd9e8c9cbc9de63abea1ebb9f0ea1a55692717b5ad85784"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f70a940aded0bc7022f33972e0537c387742171c2a2aa59ed6520bc0542af97"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"04384cd150979ef4d6348f5cc6a8c0e720b1fa5225dc6bfbf8b42ec3ef3faf70"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"685cf83ab8151abd66ba930e330603dd0a43ef0939f1ad1a5100002232f2a034"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f725a9ba893f7e5e5bee2c361e89960c20ab8340a44435670bba11eaeb5be800"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"550cfcbfa5d39d7aa4432fe68bedf52aa2cdd3d4c108af587f5f9e2100d008a8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b770a9618a5a8fb7811b04e90bce54317022a4f70fee7fa05ac13659c0d7d8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df49c7725b2060121b2e5992fdc7d55176e8f897f0ebda30053f9a1ad45ce8b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc0a9552cd35100ae62c20a480afdb4766b9a6a5336b07542b24e40a3844b0a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"90973545bc2f1fee70f85300b517ea23e6ddebdb47f84558e7492da6bde9f39b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c56dcf780a5b13b13d51dd64e331d11ce75981b11a4f90fda5e7ca0d3e383c9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d1b904089c8d78321c6d4f3092ace8696618b17364ce01c7a0a627160eedbb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d57ed98440efd1d1f898a1a93f0da4dd55708426d0b2197e9a2a8c28289e8d6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7ca380cc9c32c4f51cf42ad2107cf4b4414e00781be60a1455b138665439d2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ded00213c96324e3437a59f6a1dca1a056936c3f1ded7759df848c75abdb9c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"03083bc87cb72398530aba698eb3c392085210a7c138739a3c1f4be35d90bd5b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d142c41bbd962e6a48a0b1edd9bceb003b12eaf121fb4a7cf990a44181a5f2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a43a0754457b27b98d386dc8ac8351a5e87780b4e2face556b0987b8d5b221"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe90b93a5c98424f2c6e8034d963daadda446a96f31dfeb0baca5ad5288bc1c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a6c1d9fb815c1ce10eca3f693a8ccd02c77326a25323081b7097147fa68105"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fedc3ef80e3fa62a04b0a4ec66b3597894e11f5c2fb52b81fdb90706bcf8f5b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87b2b614af106c23de4a73b9bbc4eac8fc0da1d0b147bfe1defe318599f9ba7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"54123fab7ad617d9dc52664a36edfafb51bf62fe93edc860d3c908308cfd74db"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1644a5dcfc8a72b770000a75485f8ee7d83deeadcff25932055e164cec843e07"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd28267017ccc4c20621d78e30a628427e456a3ce203e56876186625d77126ca"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9201a73e70ca8db8f399e20f26470bc5de36229225a559431219dce866a3a0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2841b182d9301ea9bc55f4519d0d99d8aff409f56416ba476f2e349b8cbb85bc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"10de829082513cb52e80088a2e27533439136a1777f04fbf52cb09184aed49f1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"34dda670238ac5f48a0295d2194811c2da4e7908a18e52c0a262d0af313bb482"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f209fc571b98f455169821987eab133f7700f324e279679ffa7e2c76ad2815c6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d04ca221293eb4eefcb821c9f880d71586b7618289ac29159ebf150aeddc7c0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"7684ee4f1bda032f5cd3baaa5c6432cc937bab5b3800ee88bdb149d4cf024171"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/ConfigPassphraseDialog.vue"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3502704ffda845aba49af2977f6a6676ecc95413d92b6b7f3dfc448f9f5f76"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/ConfigPassphraseDialog.vue"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcca2f3663b3cf2ca4fc182445d1be15a017634325d258eb6ee105d3d1ac00fa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a64a0c685c6b5e78d5395df2d0be4044951487b7329b63f78ed0e286877999"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"708df7804be879dfc9e8b552fc191b5ba849c311645892e0eacfcd9717698290"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"694c0eeda38195b606b44f1e8a20a708e56452da18918d3689115435b6b62048"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab52794c973e2220e230ea4be9b6c035aa4e621f103f2ef84e6af67b5244900f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"da00bff4ad87ed1f8030830a8efaa22dcfc2a4464422c16231a9bd94ae0c53e9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63a853947bfadf7b0bdfb3ff87fd073bf84f692c234dde7b1c81a7300c502fc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"00554fe60f437374d97bfd6bdeaf07cc66e4ef4d5c393eae44a95b87754369bf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d3b310734954d8adee555a24f0f9552c2f0e1947273d9f5dcaa9922ab88005"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"966762babd2e7655b31beeb4c6f19fe39d246eed8fd369d34387c1c1acc40ccb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c339194c7477270c38d09ebb56c16a31775431acd9cf48e68188a3979c2cb39"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dbcc90edbff91074128440e36fc766f90c3015232e05a8835784a0b5529cee"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"b070dd9c00e773af6af9acd2cda0cb9dee01a72f82b67324c1fad3871e257fde"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/CloudflareD1ConnectionFields.vue"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad43f5e3a63261e12ecfe38a5296f31c098374062310e9190f7893b41481801"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/CloudflareD1ConnectionFields.vue"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc742983aafff84223326031a212071ab5fe3f1797b788c1a2a0f4fb83ee8fd5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/CloudflareD1ConnectionFields.vue"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe43a890e87d925ddee916c7eefad3a429033efa9bd93c3786514b78a90cdff7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/CloudflareD1ConnectionFields.vue"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7101a366cc11e68a2e7bcc560bfffceac9ab266cad5e99d3618e75131c14a84"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/CloudflareD1ConnectionFields.vue"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"85903bba42640be55166452ddf625871266d31138574543003f455f807e13599"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionErrorIndicator.vue"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb8506f4637575f58202cab9cc22ad7d52c801d8793ef490d54dfd07ac58aa8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionTreeSelect.vue"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c0c2e2e9db7234b66893d834027b0b4af51330f63dfb11c81cee0dd9fa4f1f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/SpannerConnectionFields.vue"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b84fa3cac985bae94d91c9b47c93f3697c38eb5d3a499195e2c19173844332"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/SpannerConnectionFields.vue"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fabbaf3424a14aa752b41b1d123d361397c965f7f36779717ff031236fb1aa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/SpannerConnectionFields.vue"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eea67944af5c3fef46a37e4e448f70d7fbfba8bc75ef321a94cd9e1f5850bf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e016d5665faf7832cab6ea60892c7b21af893271c8669e236f8ecf4c923c19de"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"872688f374e0c984467014760a4667f302d2d154bd309cec6b93679c7086817a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"715f5fe1cf9e1101752117f3e0f8c00121dca882594e5f9fff6ca60dca403c12"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff37e728ccb3f179297f92e2c2578a93b92f176b332bc67d1e8d4eafb2590d5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"515e3654625686618b105965d10359c8d55b278edfef41e3edc4cb2c2de27eab"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a33427e4a4ad948a337154c4f854b4f9f1a1883b20a82b1864665ef54c377a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"8843f7e80818cee165d2c86e3518e959b60b69309f919562ad63a04ea2dde16a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7383836e4e54f7b6ca90e13bdbc4c93c0b0a5a630ce3d13d8ed9814021cb813"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"4644da538ab9abc90285df597c87da069c18120f09757beb33537ec9064ae090"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"909390865eeac7fcd7d1fbfe52011cdb1ae76edc8cb8e0244934dd649e594109"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8d0e2d74c78a3d19f338a7a3ea2cac5344e1e7d1e84460ff00051f3839c836"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"e675b833ef90dfe07f04ef2f1f797225471b48b70dd2d1a72eec53fd978f1f33"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"d025cd77bfb2ec103b3de5bae50ddfc7b4f1782d76f7c9109d1a0c9d15a8d14d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c541c2d5931bf5f7ec2b58b679ab042b31431ddcee3a689d5ad2e587dcc68ef"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f4ea7c684524dc41696a929954958c1160aa5893a1d981f28356b2c1c9a947"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3403c87b74a679f28d5ecdebd1418409c70b6d05f8c213900391fe08a1e40a3c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f23d1874c250db9bf9940f67089172e842e134a19f8d1537481f94970a1435c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"8805d349fbe8b866dd5398247d2792f45be9b4b3947ad70644a75043f8d362bb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"509e78931e03f2b71665522a79e29b0caef922cb569b5b2e2834f1e85cec881a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ed3ce2284f784c71fcdce5a9fc7233046ac8cc65157a902497de4b22c632a3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7a25dc59fb46fc8cedd3094944876861ee0f1145ab166dfd25cf72001eff8e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d1da76cf00e4057dfb9c343d267cd875edb8785b45ba89889929cacb77f407"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b1f17716392523f7277561e6d4b86de3010c02c300ea35cde6b548451bec71"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f96b19b56ddd7fe86f3e4661530550896ed733920cd60a69d96dd80371be98a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47a23328942dba3ea82ecd344b058718b2ba7c64e7f96fa4eb4a09df3401ec3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"62abc27e91664ef62cbcbd7442c1cb2edd074a0230b6e09b1087e6ef1c808b50"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5a6d586395d14723865ca4493321d502b4dc7b431f410b6116bb511e1044ac"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3c81b604bab6fc9a541605e62f584a84f885480bd34e33c0d1f0cd9b742a93"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"776e699df42322b10cb9c35449f8c24adb0ab6554bd5035e0b9039e9e4a0ab68"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"901c60a293669d44b224dab5f5c36916c886495a735429c38d69ee9c94f8e8d3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0794652e9c6d42da7878494425e69af508ac192efe11e16c2ea896a77dbd6b11"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ac113bdf73f951823e7b9ba1711fbc2097135fd46009c7c5fc59f247d88b15"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacebb4bc8578490eadc4f8d89356ef8e32d0790a47c08a1d56ec591a4b5a6df"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2c735f4ec754c2cee3ec94bcf809e026e5cbf0410c56f895f90c3e304f6945"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcfcc181737e857c58d656616d70655fd01b32d6175e6d6f8bb0e6f1f9fdcf7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulOperator.vue"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9cf973499469de7c968b74bbc685e4d2eb59ea2109b338ec232ddb3125ebbf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulOperator.vue"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f51ce450e3663782f8efb06879eb3446fcff921b583b3b621231b917cd7ed33"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulOperator.vue"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09d7af2bb89fb4ed62ead16ce882c0bd8592fcc5641cbb0aaf55b8f40491df8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulOperator.vue"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"26591190a5fd677bf9a35cd9af1fffa45d0dad80a8236cd18385d1958da5b34a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulOperator.vue"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a8faf1bcf6cbe41abfa52eb96322589a89cc40a9fc8096d34223e3a485707a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulOperator.vue"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5a810e4b880f0fcee703c8789e004975f48d4a9206cf4a2ca5287d0567647c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulOperator.vue"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5beff306399fd03b0d6ba49c830e2b0271dfba4891df3006f677e207626009a4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulOperator.vue"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e264195dbfc2b81529e7dbd15da505396f87a586b6f9a053bb0492a3bfd4f7c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulScope.vue"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aed17feed5cb88c0d709e9afb5c136749e4887ee0fa2261de3a84fd221b14cf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb7cdf4f5288cfe3cc6f38c57194a03b9f455dccd5f1a1f0db3b1fb09a13e3f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"0508a9232c4a927afa9d30dfff6ff1040542b06549d3c8d138e9dec4c674c8f8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b981515bdfb096928f1eb8cce0091a533cbbd89795ac87e565c2282a56e3b7c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dbf92b11368d2ddf2d772921abed4fa90831d170c296c48bb8be12b3651f2a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"890c788c16b9694c240cf7eb10640db2504e97a8a2c1b59fd6367572cc3caa9a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"410a26e0483ffe506fb20eff86d7b63bd21a8272c96087279b2e93861ef6f6aa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"129f2ab60031953b9c9256d3f908cd5fcae0d4b230929f4cf6702ffa5a624fc4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"076fd00e5d295ac1884583a537d973bae1db495012ed7967a95db8f386e506bf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e1da6d1a8fb42482cb8c95779ffb24ff4a84ecd81d2a4dd6e79e085a57d6e9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdbdb088365ef7081de64e5dea71ce518cea0731cacb0c0acdfc6dfa5f3ca3d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1059c810584d77afd7f84bd4949c116c02e4643ebed7001a72aae43d8159ab"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"b098a8f6b44229b30eb0d126401ad7ecadd3b9bf1a44f8a508525d4a486da719"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccfc1aa911d08e814b4ddf8377eeba6118c79e652a7f33d941ef7fbb856f455"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7436e32b92a5d0dc19503154edc52dfe69242a8945a8be22918839bbec79c0a7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f87a51aec8f8169df6ca6d26e5e8a73842db818e994e1e9d138cac1c0ee24c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dd5c879357a0fa07ece742eed19c6f41378ca2ca3b356b6ef32d91a294e970"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b75c09365926f759c4b090bcbcde12911733162c3661b3dbd5ad5be54349b7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cb23ae99462d056ed43345ac2f21521f3547e015bc1885d3f42fcc052dd3e8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"364f5874246df1b530a4ae04cbbd324813959054bbe4d63f8bca7d2b898f666f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc6ac549d73df35f733f0a92dd3a58ccbe9ed83d3bdeb2a17d33aedd7fb4a9f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efd2cc6ab7b2ace170d0fac7eaece76633bc9d6f3d9779c77db7b4fe2ef5bf4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6a475ab83a9e3e43cb8984bcec7cf0e7aff22453f9bcdd5b77903f9d7b8c0a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef9170885ea69c82115736b521e7233128711351f9776c8cb23e99312cf8c53"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdceed0617491c8ba7b017183c5e7b28a9ec9577148f3e8ff2424f2a014d619d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff822b080bd5e94cbb875e720b873594b3cd020653cd04729bd6876fa312e9ca"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd48ca5d9f13afb446a0be2976012baf76d98672668c11a9998e72641958622"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4cebf3938fbcad3fa07fef7c1d3d4f12577c91410411fd57c5d2dbd9886c7b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"801898438e6de084b915a243c0c14caed47f1903bacbe2fb65bf38d1e64a7b48"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02514586cbab65eb2d96e41241460898a33e78f0f1c79cba8f316779f23ea7c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c488484cb2e20e0b49ce33f5683ad2cbca9c536c2805353ae75f5369dfd31d1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b23cb208f704464d9aeb52fa3117cbf6ce0a519dad3164a461171535ebb9ff3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ed0f1d10c9e42b72ddacef586e6573b7024588f2aae7a5679e9c1d28e070e9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulTools.vue"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cffce96953e541a6fe7d6973f4e0bf2d0fa9e7d0415e3b601a9de41cc39c9f3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulTools.vue"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"79edbba0c95a3cb6a7cab45a763a8e5646bfffefe9c1bd577683bc1178eac4f4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulTools.vue"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaaeaa9528f373805539ef604a81a6e9f2ba8043249a168ec19b05d612f2808d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulTools.vue"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7170c166e362d2fed6d2e6a85089de13088bc2205480170c651c6af96640ac8e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulTools.vue"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"0819878740e4792ead18b6cedcd1d2cf406e6450bc7099079864f1785765e19e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulTools.vue"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce19066edbcba4d1a7f1a9d87a269215079b2c087ae9e951b2b8e8917902cd6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulTools.vue"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"146392a62d0ff551fd78727972b558772eef998cd7f5bfae9658aac38b6c4f2d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulWorkspace.vue"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d06f79466fc1dd2a60cf1f04c688376ed9318fa4b15d07cc4ab6a3f0fa5d85e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulWorkspace.vue"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac26159af4c2294fa73709ae25652c62d9d33e0b4847d7a7c3bda36fa44dd09"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulWorkspace.vue"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"467ba30b2bfc19cfe1da183ceff8cafd45863db3e7fa4e278ff975140106190b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/DebuggeeSqlPanel.vue"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1076385b270e18b4307e9e75e744276a0eabc908745c6429041c9f09a7ad418f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/VariablesPanel.vue"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1675012cefe9bf4d6802318753c6b4460c463c4c4b8626008034edc4330ec52a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/VariablesPanel.vue"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4077bc6c8afc44a007fbe11ba07598d6bcfba504a8cf0e9f1f0689dc98bafc4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/CreateDraftTableDialog.vue"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"212a7239d559819559fce9ef49cb6afbf85bb4513bd3c2baa7c5ccbcfe7dc2ae"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/CreateDraftTableDialog.vue"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb55f28a8742a9dc171f82d1516b97f367e4223dcd7e7af3b64ab91d4be433a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/CreateDraftTableDialog.vue"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad2bd07fe4c6b29b87376b423e5451004acccb7de1b25ef0d1a8d475b307346"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/CreateDraftTableDialog.vue"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ad2175b884145d70cfc42988ecbe1fb0af89a7d87c310eef6fd89e2637433e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/DiagramSchemaSelect.vue"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5d9b1e1ab55a2062b959d5aa46caa10e2d4a220015f3aa286efb5e7608255e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/DiagramToolbar.vue"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c7ba706e0832fdb41c97a04ce7bc554ad02795c51600bc4c7e653979b803c3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/DiagramToolbar.vue"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9881cf6cb07c2a2b42a803dd87e9862aec3ea7b3b615d86d255979f7271b7688"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/DiagramToolbar.vue"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f61f71b11a46de5a2f0b49b63d767053d6a14a0ca51115c60802c5d0251ab9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/LayerPanel.vue"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e030c22a3e976336c4d614bef69c52b1c84ebd3d8ef47573f3f65da753d3556"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/LayerPanel.vue"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6843e808dffeccdfba9bed0f8134dff755c7e20e76baaf64c97a98a8b020d113"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/MatchPanel.vue"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4bb8c035e133abb35fe71d7ed7f0121fab943766b2f3271f032462000175f3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/CompareConnectionSelect.vue"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53f330b983b3ead4319291bebcc353ac9bea51223bd5d77fdf651c3f6afe997"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/CompareKeyColumnsSelect.vue"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78803d02f9db7dbb1b5d6a9445caf4503144cca30542a055fdd52b6c30bc1b5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareConfigSelector.vue"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d137ef150f26f64f4a9dec41e1160667fa8f17bae1c3b5cd0db0d77ca4f2b30e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareConfigSelector.vue"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de88f32b1df32c143790323f19379f9124c5eb962d3aef9290eef6eebdd6ec4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareConfigSelector.vue"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a7c36a730723337994c559997c4af1f6488de0fed8d6ddc4ff6541184913d1"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6881a2df7b87b431c445329b63e75b1f63283657fc2206c8bb30a73ede98a283"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9426d86d71121b0111fbe99b6af5e10de13c4d8c226f9306b7beae14f1990c64"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"074cd358e1ad6856bf1b1a484289a5c5b1cffa50dcaafc0c7c5d80cd7717d505"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2686c39ccdd08de70ff3e57bdc3374f1bf2cf7e4afb2064d6bf07d1e3d7dfd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5dff8beec00d757da3229203c6e7b03d6dbb982ece28f85b647de461774abe"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"b531b689613e6ebdb753e87e44c36641fcc1c1c212062f434a8f659125abd054"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/FieldMappingPanel.vue"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dc8439a6c65f759950a9784929a3b751144443859110c617dcee5159fa49b0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/FieldMappingPanel.vue"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb40d2a0a5ba97dff8a0ed6e21984068f5e14c9b8d530e1f10e56ded2caaf9c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/FieldMappingPanel.vue"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b968d459e43345eeef44ed0e9dcba0b70b60cbf4e7cf085c6a3aa77f927029b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/FieldMappingPanel.vue"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e2f32b44eaea580aefe81471b369de35241cd8764312c4e4d6eb15a8fe28eb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafa95c514443c78b966ecc1c8a4c57d50c7dacbcb70046dc89d345ffd9b5546"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2098ae8491de53fa52ea479df6ebd102e1fe2a3256dc2066239b5857f5e9a96"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0297230542d60a224783c5bceefe01c6deb7fe83f0d03cb617ff1057ec36b050"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcefc34c400b29c6880cacc49d65b66be0bd939609236f3620fbb3af265751d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2c53e8c1df274c9451d89012f084d4032ec4c2f41bb8db6f6753eb589956a5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b0b3d3802977c4e9cb61ea131278dc2c71a2586b28f84da67fcf50284d3c12"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f043ae7c3d0bd57491596460f1348531b75c8b9e3d99d0b3cc41f6d36f6fb89e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffcb6314fb09cabd7f30d9692278f37ef3d7574d123b034b097e0d09bd24c1c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"10614a8a7378d7307a54f861625234e48b72476573829fe15fdbc300c94ecf52"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"5242868b3922919a434d73414c15ee00e0fe795bff5ece1faa5287240337fb15"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d563391510f651df4087bffdf602058f44121894bcd28331880032cc9660035"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ded7294c06f18de02671cb7ead2ec68b2180c61f2d58f502c5211a1afbf679"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad385b85060bb9b91bc6b8515bb212d45b77da86e726f76dbc65aadda5b6068"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"a312e19fa95fc523d1c4e07940e614856c4fcf775225838f73fc2d98d187c3a7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"add806f157265461125edfca500dd77ef229a748d64838740b2223837d4a0484"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"550d18679f0bc4c799998d386d22a2b43321b7d1be557d9fbfd9351e7df264b8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f0fe41abb93b121db8e2d9d551c95212487ca96ab4d842bf94b6f2f3776295"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f6ef6b3b13f50fccff9a046f122c42366029477e7f043bff3520e8cf602ed0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffObjectTree.vue"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf4d86827bbd2bc959247bf4d78213c28f7cffea598f3f29d9549ff5b9a24aa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffObjectTree.vue"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe538ae2ebcb44efdbe9365e2936ae0060a4cdda69a86761fe83a5315bfbb75"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffObjectTree.vue"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5d33d109a49469be4a2304e1ab4197733f61166a1680a58045b83fca7f24f6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffObjectTree.vue"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4624cc61899af8ae3b6f990b0e82e21f15dfb8b2244da9494ad0723d19a6b4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffObjectTree.vue"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e6a0340cb50238e5e1924b587d52e52d283e0bd6892809e606b6c5c913b877"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffOptionsPanel.vue"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e1bf626ef59fff19674844dbdf95d581ed0668aa227371c7315fed5886aa3c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffOptionsPanel.vue"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e687c26964dc30a0f6c7941bfb38cb1e4b9156858a98e8fd3b65ba9a839d50d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/TableMultiSelect.vue"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1378ffb7e7ccb19e6a97d0dbd1506e167fc1a07174289c92c228f554a70b67d0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/TableMultiSelect.vue"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"466583b543456e59e126c48e0875711ba3c531299c044a846d73db9f7c1d6e80"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3780596b03d30baec16fb0aed515429631a7110aa7267724b02b2f8a2fa8b73"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"9547178b2d1ee8a65893d420dddd4fc5aefab3d497489b70db48fa660d54e565"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad3a329f336ab13ba642e7663f344beca97ae504a1c6e93c0923b399e1c1169"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd6691d38f523f0648a0b48284fa933ff62a81e98bc8178b76a2e867b0abdfa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e612129ebf817bf363773f45f4553002a788ec8b60b524a34778101dbdf81d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"99083f378f5f4e856ca18ef71710acbe5244df3c66cde0205f9f76c225e0c5fb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5996c419efd1bb89e19bc94be6c479f658998a526046861f39330020a1d380"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9daec2807328974c7b6ce0a399a975988b04dfb11adb63945602a950a8e2413"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"9874cf68342550c5e72343a6008198328430ef5b9f1c6e5d3920ef60118e8c0a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece4f61bc8bcb4d9872365026b810d1b64d3ad032f42481b9a1de049e7db759c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"903e713f0b514c144d353e3a328bb90addfa977cae6db8541c5b82fd8cbe6908"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0d0931d9367d7571113126888d82fb2f548102078b805a5ee24ac042bcddd1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/docs/DataDictionaryDialog.vue"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6be1cbc6edef53385af1aa739097bcf87debf6149b1976e177c8c99e96942fe"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"683518e7525a73da33ceb7b5d0bc0513916cf47cac1ebf818a82cc5589cebc90"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/JsonEditNode.vue"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa6bece2e486b47f51d97ae730a9aef58fa65e730c118ef760bcd892a7c629b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoBucketBrowser.vue"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8790a351a2a96046e649f6889e49fb22f0a56fee92aeb263ed54b897959ba6d5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoGridFsBrowser.vue"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dc0da52b6a8c81e2a24bd77fc087c6e9f1fcbbe31be43cc30598bec972fde9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoGridFsBrowser.vue"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c764717774922eac2e635efe8e0091c6c483f0e8f914c5bdb2a0685f76d706a5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoGridFsBrowser.vue"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"837d58a2924d03e2f916e05c6975875d8ac3830c5ba24f7f404d3384aeac4a38"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoGridFsBrowser.vue"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed1dc92b0b5788da20297b4356b9f65540a7f9290a16eaaeec05de802372d7c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoGridFsBrowser.vue"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a114a0126c0f47259618a44dd75caa0f74425fef37550d982b80d8f1683d36"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ab073409ab67daf92ab962199531cd7b9bbe656f336ddf803c9d849a455d62"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f4984491eb0cfb4a8a1ae8238d772f1c424868f29876151a6fc8fe52ea8caa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de049b45d26c92d4fb801c2ab936d59d19722914806a5643c507b4165f86ca8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"678ce43fbbe4b3ecd0bacb2fe5161c9cd95a0fdd7980ca23df5b653afbe9e004"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8182ec257f87330bf7a1ead167ae9c88ee3363f43328e653747e0303d82fad8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8feab43bafe1bd4bfd70f5df6264011104764d8ec93abb5e1a648aa4cae6589d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abb1378dcb24005f7e68d15ce3d2c188e27e07f8d563af350a5ad098d934b79"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a374f0ff28e5f87bbcfdb2a5df71e5fa70e461f0a0527e965ae1c850f264b4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltDiffPagination.vue"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7339feaa81ecf524fed9ba1e333ba7a26be4b0426fb8b350cf0d7ae072606fae"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93969b24fce89f6c84c291dd1814a8af37b881d00b31875918b713cdf6a1bcb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3c9092dcd61372ce0740d045695d2bf1d7f706d470dd0069e1d765eec08094"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daa258df837395dc6686f6e40ab82accb3f2efd72f49c5b044ebede07ae8316"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39a372ad605527a9a36c7be263a11a368375fdfb73ec4e7399a4e8648806592"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cf1b2f826777ca280aab5d62f8b8c7628007f53ff7bc4f7c4b1b5439bac036"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6802}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80c9c1bd6dff2e89ce967e1357c3e804ba47ed9bd921783e8cc3ccfc7bf3348"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"592052f9c7c5ea2674065a41ac62c6603e8a5f8b7f02967c3914b0048a59aa2a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e864b529c4cc0aa74f25bc074bffca1aff8f37ae7154a9670b3f1545b308da9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f26e87377ec3994db79cfa203a2df4e2d6249e1889bc6a10a77eeb8f757e064"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be09ec85fd81e5f8874b17094bde423f859b9d3b36873a504aa398927e7d4c3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a3057c5b9f634ce47c443dc16462af83201b27a06bc79ff43bebed72d567b1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"2346bdf4b6ff36dc116795a7b8fdc63399d25deaee59b13e6b633ea07108b17c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f79ca4ee7e6dbdf461973106976ab38b2c0a4794dd9c9f405fbf328b995789"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d3aa787499f563c2a6ba31bd705325382ffe07dfc5de0291467c02c6df73d5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b960b2f6088845e767e4213bebf31eb35602c685afc4f49c4d458c1928a20c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a42b5bae1c19dab6193053445e20a4dc9a5b89965116bc15d77f4b88a0d4fb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e11c0e6778f56e37511fb7157722e5f14197a94ec67ecbe6f06115dbc22361"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"325a3ab1c62cefa438aebf3d919c8a2a87286d9d4ca6f14c999001812f12725e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6e25a6f1e345bf70f00ff36711136142eae6eff575e29c6cfcc17e5b55ac53"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"232563e45fd46beb5bb1ed792ae7e35fca6f9399734c68fb5b5a9cd02e4693a0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"df23e51dd575f425a77f429a310b69d7fee1ace24f546f02feec29f4215d8c5a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac9e68135a5956839c3cec99123da3fbae2b3bc107711228cb1266954d1c6ba"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3f2ddcf9bbc227b45fd33d8c6aeda8c81c32077b84a963455b693de115742f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"859c81f9b7098fbb80f87cf5762a427e90966fe681be85f3e8b269995fbaae82"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaac98907d93b5342a8c04ec9669de6c43f6a28797939e4bc8bc23fe2e3d83c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSearchPanel.vue"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03f462f2a477ee34b8b6aba57be91f566e8d38f5f9f7e3207ebe8e5a4e92a3a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSearchPanel.vue"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ea4d1552d8f6899bc3a0d6012be14c9c7f01c5df334f4ae6e6bdf06f06f0a9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8299}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf2a4897a0a0d2e1b0103689292983fb5df192716e42a63957225b8957001e6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b67c801c20169a3bc8ac529c7e997955e2273c36ee47f0a27a61729fda4afb6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8388}}}],"partialFingerprints":{"codehealthFindingId/v1":"81980432af4bea7640e705485d3d0ccdb0e226a4805db6d57aba7e442cf96e0e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f838fb696c08aff31651b767c5828125c743b1723171cffe38a96eca98c1deec"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8413}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e56591fee5825d862c7070b74ece62a62877ee9bf674b383b9bb80479b5c0c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2dbda3ed98c03a23071a454d0641860f989e3917c343edccd350ba60caba39"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8481}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0a781f03c112691f772e48537132d4bcd1961e74df9729d05996ea94906316"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8486}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eed16c46920efee2164ba054674f15861f998cc062f1c7f9f6a9693fe7f171f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8499}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d2183e7ba7f96e5e8d70ab86a0952e49b264c5c82063fdc36339513dadfc36"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8504}}}],"partialFingerprints":{"codehealthFindingId/v1":"65618522c8c854bbbdb668783ed2e0203a42438a861646b1926f41ba4a1707e1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8523}}}],"partialFingerprints":{"codehealthFindingId/v1":"65213728407cd608023e76cac0de6aa37d9490df803e69728a35ed6d92f2fd7d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8622}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aacf57a34d0b01a11a202c3ede334ad907381f9e2ae01a335f398b2f275c94d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8627}}}],"partialFingerprints":{"codehealthFindingId/v1":"8507ed7d0c13b5b4f2fda7c4ae737ada478a808c90a819132c450adb00c9ec17"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8641}}}],"partialFingerprints":{"codehealthFindingId/v1":"82666b9fc38932b3264b45949a1796915ec51ab36dc808a9a368a0eb4793eb70"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8646}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bae49e1822775e0eaf0bbda775f8be20bf736317de28c7373dddfcd6f4586e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12734}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2a28d75d8069757025ae25421eca02682f296be26b4028fd9638b261bf30ff"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12735}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aed9151f984e685decc44714d1e315a242186bb9ac93f44ee8e4c9166d666f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12756}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b08f8176efa6cad4d9e008cc2d27f24670813df647cf3f58fdf35467b47d2f9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12757}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b96788d58ee98765e2d539345a71434c8c6b4ffff98b33dc255f92bcd23d431"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12793}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f46f0324e74bffe097a70b8925c974d7ac639015ded00d8acbef8312b2233cb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12794}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc94a3f8a0503c8c5855cd90faae2d85c58a84f581b0e1afabca560543b21d9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12799}}}],"partialFingerprints":{"codehealthFindingId/v1":"23642c4222dc3a97080df3b1768239430c350c87497043d854cbf14869093636"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12801}}}],"partialFingerprints":{"codehealthFindingId/v1":"0088073ccee669638c2612dd5d7652e7e2bc6f74b9496e8222483a80541ca902"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12942}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce1739b54093e076862a1e342f0f3342ff4fe0fd1dce410bd0e1cf5d5276cc8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12943}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaac0c9f3bc7081bc26c6e4ef73ad9ab043ddee5fc8550e2bc5ea1064af43d6b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12956}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd7d976201ac8edfc3f81bb127ace32df10b2ed4f4457eba5b59caf1d05821d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12968}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19bddb98942a5573b436cf5a86333e237a11ec50080d58fee44c17eb53fe56d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12970}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfa07a0fb50fbc937c8daf24332844d359181b6c05c9807ec05d63447acb2be"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12979}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c8098642356a92f8c70ad34d2e183ebf0cc58de20f7fc813e89eb36087cb9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12983}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c07157f5eec4c3f6d9fcfdac505a2db541d22e880c316745159fabb6d25a0cc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13001}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc26ca4c83e8681ef162bb6c304e85452c9f38c11353e2ac85ad5faa1996973"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13003}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c5656b252c37f04acc7b16c60e48de4fc177936a7079229e45b9cbbb99e6da"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13020}}}],"partialFingerprints":{"codehealthFindingId/v1":"4045eb87faf2ca24119fa3c07abcee5ddd7d747636413777150ce659e82ad3eb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13022}}}],"partialFingerprints":{"codehealthFindingId/v1":"4163f3464ed60af16116641c7fed6b41d193fc1db473f68f45ab7b2b1b368d5c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13040}}}],"partialFingerprints":{"codehealthFindingId/v1":"120a77d1dbb7d8a218d879606a6cd770db2124a2943c5bd7a8a67ad492bb939b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13044}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e74a517047b60985af90020c57c42185efc2d0117c10fc71515d5dbe3250ab7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13045}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5bb0d40a7b3baeff462ca0281fb9c2857141ec37926df4ce3194b89a116c74"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13066}}}],"partialFingerprints":{"codehealthFindingId/v1":"db13a65ca9f1f5c8f7461ca28e4adbafedfc1f8aadf704d38b87a434a4755b74"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3eb409fb6e4e37f17b725ca740926815f4184a699b215fa19bc5125a1570f4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13105}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d20b4eec49feaaa4b6fb62935de056e6dd0afe3ced285c3d0e83c545d091c2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13110}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d9206a2fe87119bde949b7763976e2f7d5f01da88aba0420fa1cfa3b35ea27"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13112}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b2b5f90ad2b05198f79b4b79151551c372ea567df5844ff8b8e31f5610dc9d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4eb86262eaddb9c42272b0e44ebb7b72d3e09193b4c8c07d5d3883060b5b74c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d988edf7aa5798027e718cada2a1dd1374b55fc84976ee78de8fbada2cbb0044"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13131}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab04e85f7850f04a38d267a5ad2a099952bebdbafefc102727f2142c4257579"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d572f068a57cf10fbafbe2d2caa927a8da93db1738560a96440fed51d17208e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0e5072993089662eb34c2cd96b8097d1d30c4ee3cfaeeaa730c6c15231f582"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13146}}}],"partialFingerprints":{"codehealthFindingId/v1":"217920d95e90726387f4d074f955def1ab2111fd3903257074f412fef2cd26f7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d05105bce35562d0823ed85096e81ade4856ddd5ecf3a435439b7d96b059b3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13216}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d8df1c4269b3b8ad2bd67b37d921bb77dfe70d431522d6c54dbc1c07e13cf9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"b802e52745c5e2ef3242f29cf701d3520b0082e4e9bf28200057e1cd91a9dbc0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b62295a2ac031c0d938f1339310e44fa6285f03843af86dfd5bd16d276891e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"edabd89b2c789524a5191ff89a6c7276362947842f734bad0184489b1d8b9896"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1328f5db5fddf36814058dc6f64fe88cea0651a56f487c05ded75e99568a9a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7c9a1e69db45a558ca3a331a6da0551a813c5638af26ec26ebc62be58b0f71"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ce65a21c2f4514984e48ef1d63679033a6dc422242e353c512e36d3443be78"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SidebarActivationSettings.vue"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1156bc68c1b1e995009d54a773ce248f4f6b00a970b661cf6fe8a6fc87857d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SidebarActivationSettings.vue"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"206c8da80113c097f0f246764ef7db804f7f61d40314ab1801913dbbe9c11239"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9caf2a438b017cc1af6300eb6ff78904e082fb4957c7ac8ed7dc4bdbed3794"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"018fb6d49d7b8370dd9ab158d57b17f57528bfa7d338c01df04949c921522088"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab4e5f8109f5a4e681c4ad9d180d4a858074a275e9013419d188e24face71bd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"acea46c5afa09e92e34fe2a5fd3bf61381e60112202e1215369ade78ec030c90"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2a58f43a9deeaf7be743a9e4b3e84f088d3826e2d107ba2945c0ee24a7adb8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"c349d751eed570186ad0a19da83efa8a262b7ddba9ba0f0e2cdf4f0cb1bc6a68"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83f3cb1c78519ed70e5e4b1ff935d52e4c1ed40f43337fbe24b329dab7c96e0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81ae34342d9c165e8aad34d1bac13bc0d32d3c0d66a7c76644c9e7dc56de0e8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"803f252069572607be75268e2121638887baab270fb30ca92e61a29ca581f9ba"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7a54ca26ef34123cca4c1da9e3f9da3f42510d714c2b8a7259d30abfd2e38a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6d63aa5a21ed86a31bd766434bb82bad75e821f5817bd8ce8ace9325afa594"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10a061ec4fd9f3a9c74f24717df368de4b6bb9fb9a2aa0296487c6963826f26"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce30f7552e9d2efd8544c2ff4cac86f53e45876b1eb2bf5e1ee112d909931e36"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"82558a4084635d2d7568aa369e6a7b0cbe5d0c0a1d143016f7b7509c7253d6e6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f70953b448ebc265cd515241aea18e18c23555af8029a08d321b4afcfc299c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa377b7dcc969e0d0f0ba2498d4ca6ab430bcc44508b997748c04ffd1c6cae18"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f0fb011052e0b1d3b5480989881d9544aae9219ccc96d7d66d067441716456"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"b782bb2b9a7dde23681601e1bda63f50dab8a275b1c27184125d9d0e2649fdbf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"3624bac53a47ab00c59b004432768e9f968ddacd88dcb118ef3285b7998faeec"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a14870b7839fee41e4a2d497b663b95a6304b2ff5911b6c1e55e6a5e7caa5b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"825894ceda991afaf9701f2f7d93e433e1fab9acbdb31a5b8137a5192bcbe26f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b63b974aeb4664b8ef089681839d85e18ade145a952eb81bb7662fa599682fd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44ea36a9b79186301b8c4c3d78c80f4febb02c24f29ed24e1d410a24a87b389"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"527e5bd5ad9281b5520d192451c468dfdacc9ddb034d74c694a04750f9d86544"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e85dd29e422840caea20258e4d75d6c23b0d6c858c0a5f0f8458aa8f7c50587"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"f919400fdb2e3e07db914f0ea1b302cbba16eeaf0a1e977aa5f710be89f89f92"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56ce3c455a95a6a8154eda806121b3cf1019a78c350bda6f06768b7f0318742"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc159f08a70a185624b9da0cc75dab3e9df9f7ad34209ecd46face5706e8ca6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"5112e5605b18c797fda7d01fecc9da2c9b78c6373b006ad7e08975660de3e892"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"571a0fada8867a07c699a840556fd103aaacafb6af81f51156d0015e162328a5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"befc4d2e230409b2feb33d2fdbc99304b08ef4ee17ea48a15bafd6d13bd1cd63"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae851b73895c7b5973e78f7fc5664f530d17a402d75a1a73d8851c41ad9d1a6b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlParameterDialog.vue"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee38f0b0d444c4897d50b807d135f409e3bde77b44424a4155e6080284f46559"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlParameterDialog.vue"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcb6b2f1eb22d02594a3519a29ac0e9e8a1717a63ecfef20a7d53eabf7f4708"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/TableStructurePeekDialog.vue"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e8bba4dc2273415b61acf64529eb9254d8a7870ba5bd348a06e14f83294781"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"241f9182c2b50ea03b9597660005ebfcf93f44c0ae8d0ac2f7806397cad2d976"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a752bf8074b56652969595da61d8f6d36ac7c22445e7d2cea8511b01ee6ba0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ec136c0cbe91a82f328c9bf54f95fe5a367e6b754d92a26274a27015ff67b9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07df73eff707fd1724c2c6e368c7f8d4a7cc741d7ba9a402733edd3bc797210"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5feacf000b60b70ecdfdc8c95759cbed05c272f78794273f9a71ff6072947e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bbf7002ebd32209ab84ae8caffe796fb8e743e164938c708be7d814ac38efb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"33239311a80330a0e5bfd44d8bb42c15c5928182368aac7aa645024273dba9fc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"7728ee0701693466f793e44ef7d8de6e9d675941cfe7e117ab77e5646412bd3e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e26319200307405f015e72a0ce5a23c2fa8c344dc3e26f85703b77af73f6ba"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ceaae103558ac2be9404362cd254e6b85f4324ad06319647dc8c4fb8b316b3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8e6459f38c1908ef3bc6718e73ca5c30a99dc4669af2d209a3605efbfce179"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cad0ecbc878cc16fc84c3066ad70a8f4d34328351646a49f0ddd2cdb65995f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec807676fda310440817f9e6fd2d4ead8fe4ff9afd326525de5957fcc162fc7a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10cfaf2b1d065d412c569d64ca5ed935e802ad1085e4edaecf12f8f07edbd2a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"55850cfb0254d3e2bb51212c5a504e2508b54d3a86bc29a7a3faf43640fcb64e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAdminConsole.vue"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fedca667606d300ec320889f4fb9cc8f9f0f13789a8a386db96688d3ae180d0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ebe7ff2eaeecc4f4a0b2adf5979493ee76bfb09b4c12b15c5cd920627041fe"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6243275ad022c67db2fd7066d1754a3a645d30895908482859babede540e462d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ec48ccfe4551b2bacc0d2325a66bf890d8d0ebdd11ddfd68d48207934f572f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7843d20f1969307f6009f408dc93e4f2917c6504583601c8368ce9899cf0afa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e5cf51152cef12e27a1be024b2adea7a4af38d42a49c15e03acc711c3bd3cc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dcce430e82cd10af53f9cf4667262016a910f78024326aa26a615f402b70c0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b037fe0966b54f9cb5c38de61a0bbe0982835c0d89300186760703a802a9020"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8afc5206e6fdffb50a9d302bd948ad5af19e5f014fad78023210415da845c7b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"00defaa406c309ca1e969f8e5bb1eb0a9f7c42d638d16cdbf57ac1f732355bfe"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b183848a574eb3f2834cdd50b1b4559d76da9e4f182dd8e27bd32534f07c684"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"787cae6a1c90eedf3f703d2853d8b8d4e816a09b42ac9387870e7a021c9a2699"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16ac5faa514d57bd640ea158c82ce3633e7ea33cf1f6220e3e8cc5328999d08"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad9ddc6effade6bbaa769bc9404defc09fa6341f65339c37087c3cde55fd4b7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"abeecdc65352ec6be36dadc9648269c04ff44b63aaf1c97deeabd22d7a8c769e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaae7344c962832c3ace2443c3a48cff59e12e6f11bda6afdb5f763f529ecd6d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc288c1963295edbbea0334958c6066140bc61f9c34cd25f08500dcd3337a98c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/SqlInsertModeDialog.vue"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eb3fab9f2e52de2f0a2cc469dc59dce42afc34c11b4c585ffade9043b46b1f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a357dedd4cf77ff4756530547a8e573a0cba879c094a02f6cfbfa184c29e6b49"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7189d1ca2b43a236af93436d648558396d555b9e33d1ef42b9d60a1368778f43"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e341491a3ee3873fc084afac7cc5d50d6b8385c6a05bf6c1215faebd303bad"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da64efd1458a15750d5f1f985e1ec1e45cd90f15718434d94c1fcffb2565708"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/CommonOptions.vue"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2c7d501cc4cb81be03ab77de1e5ed646addc8c52ce7959f695aa5377d7214b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/CommonOptions.vue"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a0e3e31860b653dfb7946687d01f013e9a73f0843443b26641601f4b9ca759"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/CreditCardDateParams.vue"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c50173ab7fce17fbe24be101026c8fa9c857736a57c78ae0b227f3e9478534"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/CreditCardDateParams.vue"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49a6698452e8b8fc1d0e82b7c6fa8fa4af93434ae295220f613c4b94a84967e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/CreditCardDateParams.vue"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3cd0bd720fa230db9c78ed289bb16bad3e4b52104752225abab4917a1adc76"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/CreditCardDateParams.vue"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c598c0014a82710add4f9946ed9a1fa1d5376564d7c4a7d46a9324ede2941b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateParams.vue"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f0dfd2ded607bb3f47ce1b29b7179be05dadb617d3bcc5f3da4985c5b3a6c3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateParams.vue"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48fb9f89c28211bfb36bafa72bf17f1b610c553b24e3b2e1309be67b989455d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateParams.vue"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d04220464101c230e11172c792d2d2294f9dcb264005ce9e679aa511b23a9fd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateParams.vue"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f11810038a042f8283960f29d18a5f797e3026bec50516cd3e2a872862eb585"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateTimeParams.vue"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c8b8ffb3b66142d98f1733eb0cb83e5ebd3f14161fd884b4ba60316b28ba61"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateTimeParams.vue"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"14833cde3204082253510f914e5a6a3760f0e98abc8d003bcb973b2be5bdbf96"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateTimeParams.vue"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"664fdc8cdcd9d262dbbc080ec32295fda80a59c9683c26e8b9da7e92998b7e84"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateTimeParams.vue"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7021ead40ce9549f4da2b135bbcf26cfaf68268d96855a80b61a17bf7757f2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateTimeParams.vue"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86e90655c5fd8f83b64098d2f60a821a231cf10ca4c8fcf4cff8435b48132d2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateTimeParams.vue"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcce3a4c14917bb8f448702113a8dc4efc3b4d0ccd6865b5d24060b10aa5596a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateTimeParams.vue"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c47b250ed0b62acedc619338a34737c73c8d0a180a04663db17059d6ac91fbd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateTimeParams.vue"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f3ca01b0a1be71d4ce66ca720a26efeeb283aa3a3e03261ce50de063004937"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/EmailParams.vue"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4251bc2f9b8c5a4c1791bc60cb375739e11e64eccf5437a8197f650b57171e98"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/EmailParams.vue"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de688b9510ed951a93ddfc8eb2ba9c6d446bfd51ff027d9fb3318ae41418a48"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/EnumParams.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b82884b0bfdbffe25df7e8a483bc92aa30a19858cc4cb834fadd821f628698"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/EnumParams.vue"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3f2caa96d7bb49107c3c6d8c32a5c65d964e297225d48642f4dab160f05145"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/FileExtensionParams.vue"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9062d32e09492a4f80875bf52f96032d398ec96df979024663010fe1079f1a7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/FileNameParams.vue"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f1d507f4a7a0c680ee676488de2a478b25540746af12d4b2f5510ae9992ff3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/FilePathParams.vue"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8354ef0252bcb395fc609d96d397a8bbe9284d5d485cf73ffc02ee80da770a79"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/ForeignKeyParams.vue"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44ed0fb2265b1baed4357806a14c540393d4f83035587811ece544ffd8f13a5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/ForeignKeyParams.vue"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1e35b72963b5e12a6c43069ddd370797b8ae6fe98da33511a61b202d7abd62"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/ForeignKeyParams.vue"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9dbf305e0983331300ce2f3faecf0d7d37a385a6c15544999d69681954c124"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/ForeignKeyParams.vue"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fdf5b1e7cca296d3e440561c3255ea83ae265286dbab7e5b76def439e8d4a7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/ForeignKeyParams.vue"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"526eaede5edb4f39f2cb2fb34e9f512bd7b1dc79de7d9e97308a7ec672a1cbfa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/ForeignKeyParams.vue"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"491cdbda755a341ecbfe08b7ce47c18bfe34c9613dc840ad1430d46bdb5c24da"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/HostnameParams.vue"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e208fdaf370c187259fabe67636c00e7d4ac708475e24a6abcd3a3186dd720"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/HostnameParams.vue"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62d8dc54d9a5723bf38870800824e267cef18abd749ce976de0214b0f2a0fd6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/IdNumberParams.vue"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30e929f6322e0984553df17ab0f8dc97b48324f55b63f9b59f35418b83e86fc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/MacAddressParams.vue"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"49859862c9d9b480c3dd6b759fb709c3bcc71d32590c62e3102f88932b753e00"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/NumberParams.vue"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b645ac965f2a75de4e2079ca806d4b575c93892299305e9cf6706711f9b479"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/NumberParams.vue"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3367ada48107d59ef6bbc5f04e39a6deecc725badad773a28ef9346a237b6c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/NumberParams.vue"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1b39d37a4ce22a6a6ae407721a7afc4d4d296c2a5ba2670f11a0a30182a275"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/NumberParams.vue"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da384b473e059cdd07f493aac8a487e566d36e8304c95a4fdf54a2a00483334"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/NumberParams.vue"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf1f6081e67663916c91bef2de86d25b6358f947a36c8911a22ae1a9955abf0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/NumberParams.vue"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c981fdd4dd25d5ca2e24c50d765d5d07a9be83ac4f8139a096072e2547114e65"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/NumberParams.vue"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8d8fa2512f43553267bc9dcae90a5175523fe06c613aca5f9508585abc1975"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/PaymentMethodParams.vue"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a300bd3d40d7ac63c3c01c2156bab60ca9919893354ef31d26886356ecc6bd6e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/PaymentMethodParams.vue"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00452640e931b6d49f21deb674c2ca420cd4c766befb20c84570f96a7e7f953"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/ProductNameParams.vue"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad235cdee9955383a7727ceec10a5557e644f82380d2fd57175c9082cdd3a03f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/ProductNameParams.vue"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36950de79e062fe12825ed13fe069792adb3eeebdd41b39bbe1156724c8fd79"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/RegexParams.vue"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"487a651079db36683fcb9fa51f196f1de93e76c339c84033bb0f5ee021b9f99a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/RegexParams.vue"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02d45eea80d9686b06a68c2406de3f9c2675df76cace240a4c9752c200c3bc3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SequenceParams.vue"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd225998826e78126e0e34c927630d59882c12fe4f9c0453285f9649509f5c7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SequenceParams.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a824fd86dc9ab56b22483b35123ad1d40fef6473b0bae96a41bc863059d5c5b0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SequenceParams.vue"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91cedb8a0f91a9672897117e3ba19eecd597cf68928c58503e4c4dd859c77cc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SequenceParams.vue"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"253ad7cde8a30a6e57dc8fd42093e8a7eebeafe1e6506952782c79ba55db134c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SequenceParams.vue"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb102bddf5558337d822fbc7114d7506f00121a6967348dc864cfafa0a027bde"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SequenceParams.vue"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c13ac6b5098d6394c9fbacb3ae60e23f357ae6ec9d545c47ed972d6ee8e1b5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SequenceParams.vue"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee5dce6108117b68a37859fb443e5440eec6b05d3d9e9529d64a324d3bbd2bc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SequenceParams.vue"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20a66951a4957671ad82a100f4785553ee903aa5c8c217c911a3f3e0faaf3c6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SkuParams.vue"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb44d5f776b3160f1126b9f8dc3959eef0d5a0115215bc8906fa9888c15aa75"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SkuParams.vue"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff73fd2cf249ca1630705c15f53726aa502f8b4947de1eefe34cc81f4d24b9a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/TextParams.vue"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"789a562fa61813bea4d341916b73a516b542b8bce4ec400201d7dde8314ffb5c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/TextParams.vue"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"17170f7f31d8234ffefde045e50c092a0889ad2047d8f634eb38d7d20e93011b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/TextParams.vue"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5982453905602290faac7b8a9ad48a3fc4a2f3e6fc08c17bcd2927d0daf14fe1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/TimeParams.vue"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f66a1b0e3da5d3c777788910ae1a6d43bb29a19b2ee4254cb6d0a5299fa9f5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/TimeParams.vue"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d64d9bce1389a4cb7d44c33feaacaa0539e794805565b2f82b8dea12eab6d53"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/TimeParams.vue"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc35f8d3ffee67f6acc907a16ebfd025e5e6cd8f4152932a9b601e9bfe2b662"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/TimeParams.vue"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b7785c8c7fa1ea3aa9669bd78cb8c9fba1eb0ed3d9cb0c4130e70ada6288ff"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/UrlParams.vue"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f6e455be55a09ef5e453ebc845f3e24627ce39d8a6df5c02705bbb3169b797"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/UrlParams.vue"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"840b467b3200232db5d4d08c9632588115af98e6c63ae3fb4cb46f1b8b2a3e6b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/WeightUnitParams.vue"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4518bb5e3a5ad8fa92e6a6b80bf155781d8d349e1629e0c2db2ce8eb07e8694e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/WeightUnitParams.vue"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8989fdf3463351c619efedb9a4a8a314bd063752e4dbc9f69d213df317ad1db6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":15612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89e3463a8d7b7d9ad4e6e46d4e878d0520256c9d5dd576b18227db745459444"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridColumnLayoutPopover.vue"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"159da7d3ba9f6fb32fb0b7d552cbb72c517ea6d1055f15abe57196490688b569"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridCopyColumnNamesDialog.vue"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"58decb98460acd2acdf8b704ca5b0769d38bc3b166778cce66f2ec170caa493f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridCopyColumnNamesDialog.vue"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efe4274dfe464c9f2bb27bbbac74b7616756b8c3e7935e40d02417b44042ee4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridCopyColumnNamesDialog.vue"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de2f796be31a0ed25ae3fd8bcedb5740e171162c0f59815e54c55ca8748986f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridDetailDialogs.vue"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69d7fbdee5d5bcd718648669b16922bf59cf87fcd06a9b2644eaa8be68026d3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridDetailDialogs.vue"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64597afbd12340ba9248617a1aca3b6ac82ed8fe36ce013453488132a1670ff"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridDistinctValuePopover.vue"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"011edf6849f4724aebf79a77c96481e1c2e6a45280fd7e1886567808ca7c2b71"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridExtractorDialog.vue"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"001592f1f39db9dc8899e992c4788723a6acc3ce429710e87e854e788e2724f5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridExtractorDialog.vue"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0281801b239f821fdf058a3859f7947f4de66489c13fbedeab38d9315985661"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridExtractorDialog.vue"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c447cdd5bc027f5cf33b4a9b1dfecd95a419db1b1fd2ad22a803464739a4e4ec"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridExtractorDialog.vue"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b6f108cdb385e915948844b2d61a5a5f4140326aca75aaec7db8c8bb394b47"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridExtractorDialog.vue"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"260cd4550eab064b221aaf24eea462249574e76fa3d647caacb6747c4cc5baa9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridPagination.vue"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe8ee811e8d1200034fde61c357eed0c031e216976fa562dadabc6a7c53706c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridReadonlyTextSelection.vue"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"084388c9d58f9e787f823eb3bfa79ddb24fbd121130e519589ef02d03c49550d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridSearchBar.vue"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c29506cb26ab2bc2df8f08c2c5536c65ad8cfb4c7ac54afc05a14c6eba1307"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridSortBuilder.vue"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"34da465b3adf24e9f8811ccbebf6094baf993805b5f23a19fb151bd76850a43e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridSortBuilder.vue"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d68731835146308bb05bee38f8f487682e574f7f079dbfd611611a5ad85c9c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTypeColorSchemeDialog.vue"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af1e77f72c53a5e69adab63c174fc7ed0b96b5b780f1a4ab219d01197b5d692"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTypeColorSchemeDialog.vue"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac2d72090f5ef9b7ee8762518c362190241f5ef5d1c53a3c5447a4ebfca7acf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTypeColorSchemeDialog.vue"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"354d44119fbeeb07455f9b36a4640aaa6240e18c09bd7dc8c1b03d1a6f97117a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTypeColorSchemeDialog.vue"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"11eb22557f1922830e065899ff86504ee65dc516ef745a924103ac0e3072e4d7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/EnumCellEditor.vue"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"1968077be9cc9e62ae6c1a04375a78600c7fdc54ddcadcdef5160f8222436a9b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00491959da02c11747cd117f5d521490fa77b627e29b3f471ae67aac8d3e8d1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7632e9d9dce856ebc3cd0fd5cfc44ba4a7abaadd405f71f03c373d652b56f1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0599a1387ab2a8ef60c932a217af43adf68a8d0893442c2d12b548f6972eb93"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a3136d1c734f27bd16b62f04771de94f199703f7a897e67c829a298c4ab421"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"417fdd477f01b86aa1173631443abec73e93dff09b8bda2a6d2e7b576bb5fbf4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7286df6000333d7f675dee5798fe7bab57886754ce2b7dea8b74b1f612dd5526"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"80be6d768cf1fd243f437a4ffc0a09b97a72e4f1c14c9c1e952d7bd1dfaef348"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7358f2bdf2cd48f4f77dbadef0f8e42f8432226e6ece99550ee585d0513d58"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c3def6c7c06d7e5b050362152cf40c58670ce7a3a39aa6e594f87c7dee923b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2c6bfe577e193c5cda984a5e0fe76615a3969677fb19bc5c00737c8ac91c28"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1ddae3d7dc87e75fc196e50a8d763ea37a544110fec8a40de89ddaa982b6a2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae0ba557f9a1cd56492f1b19c217da4f2e0f8ba3106142e3c5785704e43a3b6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c845dd4ef226ed6d317064377be80a1b89f21fbcb27eb51c8aece9aeb3dd03"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55b31c70a3027aff1a131e92f02391cd1604e8feda5cce8ee2c4d793f0af563"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e78325f8164138b72133b3f8a760a18ce74483798f8dd9d79baaa136bc3b2fc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa40d9e7c16afd86941cee245c82f7fbabca94272a49e792b334f351015a7925"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c4e770a02a15583028d5c48d66e7d5afa55c839d9170ffd73bc9b1e6a3f3b1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"6747d9265ca773a1a4b74ebfa66fe6aef8c30a32116914f0176a7e78eccebbfb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fafe7c79793ea5ce880da3c57d3c780de9f1e6bd07fc821b198d473b67ad9b9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb8862fa8020c956a97132bab2e59268deef1f6f3cdb9f792534e876e32c89d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f7ad6f15ab3cef4d04fb1b6ccdc977b46c5630adbe9322c649bdd3dd662807"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9dbb36f240738023d2e3d0a0434906bc1490935d2fe2ba442fb42798d0e9a8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0c1dff5afee7cc53051514c64d13a92e0149de479371ccd914bbdf0cc8d70d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"9720ce22d816bbd6d5caa80d41d56afdaee9725ca2bd3beb34d21412b819b61c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"af74216bfa2422b637f93b7f88515d70d863dcc12d1d044fc3de20a67ad61d34"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/hbase/HBaseBrowser.vue"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc788cdab07afb3230cfd6e8d50ed1184b57bd3ced96e17a1447f8c72bdf733"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/hbase/HBaseBrowser.vue"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"27836ad3302b1f8f6b581ba68c63814a1e20b5bb8ccf6ae69960097baec01a1c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/hbase/HBaseBrowser.vue"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace210b93a0653bc1328964884122c943e5a903f3a08e5997c55ca3a1d0be354"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53b5262bbc64d93c399708f9015ef816efb3d92ee667f2991963f53130ae0e1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d0a6bc12ae8ab8407145fb02936291b23ba3d33d28dad17753cec6781bd963"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d590b585d257beba13f27bb689a0a77e055f96212991b7340d532385b68fe61"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c09b8a425ee75b583772edca1d10ff34674059e2d285470ff929d3e6820502"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5399796c6ff731f3c513ecdc5d531f8db387d107dcbba83608a2af2ddaa4c8d6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75e0a6e16f49714224b92e56e91969346067331b356fa82a2e54fe531febf8d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"111ae5cf03868f9a540e8354582db442a7fab26c02b3aef100601a9aec3c540b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffb1cb94ce2d7f90017670e96feb70650affb0e0e8fa95e4226863a42f20b94"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"496781bdc49932ce64fb61dd14d7dcf8b8aa73c5db77f08307a81fbd4a7bbbcf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2221}}}],"partialFingerprints":{"codehealthFindingId/v1":"240e646df3a89fbc5b79013b284dc2924db49eef8ab3a6ec22418958d033064b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6d2c8c4cab7ba858660eb9d7238e6c127a2d13a963c3f4634d379a11538913"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaadff69665de05e2bacbc7029079a50d5861abb3d0c576351f59539c4a5eb4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"85af1cb29a3c4a473e1fe80804489fd0e9b9e393512e06a66d41fc4c7960c5ab"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49306f428344c7621816ca6061598d3aa42c091cf1268dcd5804d7b3cc6a1fc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2253}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b1cd4e5791a4d9f7765b2b5d653e53cb5a8fad31756f4fcd61187578eb68ed"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"382674640d98a10a15c91c13379ba005c4f0269c7e3406564f48f5b188ece1fb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"818fcc9f3620ea78c2156c1f96fb943d3a2ba4d858c1a0d6cdca12a7b06ebbec"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"94000d4e0d4d2b3bebac58f8859de004a06e2af8993f0285dbfed3c2f4392d89"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a5056152a43e73f5cc99035f75f9fe61b59227075c3452cde62622dc095b9a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a35d3007611f12f888635cfc63dec31181ffce831b8af27e19c8fce29e2942"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"34358397c20b23cdb33df8d84e5e5e6356e8af7f84d1db7d3abb08f94817ccc6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"be043490f422a8fe10d452f17e0c63add35fb59d4278bbf445eb6f5c0fe22005"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e277695bb986dea2e8b89e3348af999a002c4d1a50c49ce0538775017afe61d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb559350fc42d0ebbf3dcf14cb65321263e2bca73dbe732d587db488f8c0849"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3084a7acb55e73eacd4529243e94ae675a1cdc8d3c737652df93a2a39aa3d5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf9bde00cac3858413c9d5f1602c2b4ec7a3809a812b27b024ab63923651399"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8418ca076c13d10f8b1d45509fba18f4e0288c585e5a45f958e712da4ed169"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae7236fd4b7355ceee11387f14405c112187ee0e7ef1d7bdd5f1eac86b3bd7c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"363dc2233023c8fcdc6a2ed119bef07c9c686a220049817b54742841ae0c24b4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a675c93ca9773582af33e21b95ea91158eb801129d6d32f7e9fa871aa8a171"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f4f22d8fbb788f1f13369dad1ac993cbdae74288f5d4a2cd9fdf083fcc57e4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4aa375fd05f0af03e24fba091ad58cd69718e8f753cd41f45fa7abb8f58d01a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f8dd043e763a03d721ff76e56e2c117382e094d14ef9f83b89988032296ded"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"d559e0b3ecabdcd2e1c0962a3a3f35725b32d291b25ecc1a623786c251ac26f3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2462}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0f8dfd1e0c73dca607a890c4c1a229e9c85698bcf22f28b32b1de7e35ddec1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7d7e43e5326d50af1c9b39e65bf71794ba83acca445bc6df460f5209702a72"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac0300d001744b870092b166ff08c838d5c247b40bff32b984e2352d8d610d2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1438e86c4ffe1e639c310393d156b514375487c180e038bd37f4f3216e46abe"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e43e713a779470878e7f8e83a0dfd951c5b907bd189f14c4f0cd77e0842c575"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2629}}}],"partialFingerprints":{"codehealthFindingId/v1":"594b231407281a44fc946fa816cf4afc056cd5bbd6fd63245984965c00ba4ab7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"958ca04e352337d6dc1b85f4bf488a4a9b7b78e3d4a650954fd64269d671167e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"d477cd0d453f8e4708099abace53b42aadcf1bd76bd0f1c181431f714b48c5d5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f6224cbc9648efb58588130a4bd26320020a8793560aa5c1b7bdfe3368c87d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"602aa21e95fb083ec530b81e6c6e961f9ffc86267d22b81571eac2b8287466b2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa93a5c27b11b6b7f05afdc99fad83baac82d400b685dbbe3726665f8b796c2f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"770453969cbe1ea7258454207c0cea25fb16258cb1013ae49d3c779f987e91d7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79b9eec0b9bd8575f3b28d61ba9c7822d19b6e1897ef774c4e8a886178ea064"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8f343f8e56b5800ac39a29e8eb04dc6e4a63050c8cc7790495710048375293"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34ebdb5554a12d8e2d52d95ebf50a8c35df7ecd8b65652d09ae6a7672c7deff"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f86e15f38aeb382b242efc147c711ffce867233385ce8cef67b46ab03b16f5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c462eeb1380a206f52b1beee3a5f3d3faccfd2f2b288cdcbd0e802a4ce123cc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b57f9193a921d84dfbd84800200a6cbbf7e505da29343ee2f006ff330d2b56"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/AppSidebar.vue"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e31e11290dc982bddda4930832008f872b9f338c2f5cb2eb9aeee7063622043"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/AppToolbar.vue"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab2ea5ccc98e022561c90d0bc8243d60208b7de4cc21902aab99d43e78dc199"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5827e923dbe8c3c1b3b29ae551ead23715ae294f27e73dbb2a7b3b4dd5e12ab4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb6a4f244b42a54978708c545eb3ddc5b0cac58ede1ecb2d12a0cc4d1f42611"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"308606ba6d0a9f6655d6938e345323daef58cf37fac0027c7ba1a1615d8d0c39"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d4005646c8e4bed189ded3bf95027a938f1007cccc542edc62080ec762cdfb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1fe6c216590d6e3c20d2130371e097c8135884c4ecbd6d6692a2723be4076f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db2282221cd8bd97a5e3bd11b2f1ad3d10f0a3509dd55085223d6ea51a1e738"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cd38ad71ba229494419dea6744409cfb0c3fc3a79e23fd4017a42636cbd9a6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"e020f9f5a91ae0bc8630b2190934e50df5be86375139a92c00b28ed08333def7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"10abb494d2a650e9290d3e6baa061e093a5c6f82e7123e6dcdccaa4b86df83d0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlPanelSearch.vue"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef50709e924f7530e3e67315bdf8f7e62c33e69dbb3cf61ed427392a625b8e26"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlPanelSearch.vue"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"670eaed495e83ffc4aeaf09df6908f8feeead007b01c79b11d608d26c94598d0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/UpdateDialog.vue"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"055ff4d1617a4b9645955af2481870c22ad2a708581a9006aef0ad05980c5e59"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/WindowControls.vue"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacf1d1c2f3ff4264804b6752f408c7c77eee18b273680583b0f656f857bf7fa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/WindowControls.vue"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80f44439b604836fa83529d80d93ab2f1d643d5ea546150e50cdb86c62baac9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/WindowControls.vue"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad793ea913145594df7be441c8b6452643c4a7e1f45179dc7217f0bcf048d1b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/lineage/FieldLineageDialog.vue"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"45db5487c3d1d76d2bd5287953889010b91f5264df1234dfea217bd73f407380"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccab0855ee0db511f35c9e0028337b42eb7f0fd7046a1b6fb1b06df97f8435b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69bdb47296354ec61cf1d8f820952514661642cc5195d453c684c86a0740cf9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6304707ab395ef07b7a299816d66a5f28eeb2f8704d7f07e443586806f6dc3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dee269939685c713167ee123b5707f8e01618e3e60274f6aab782b3d638ec2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"260e01ef47d4263294315c7e7baa8c11f738d744f6208124d8c9ca5ee8f0f1b9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f586fba0766040ebf3bf6b733134c1a333743d74c1af6f8ea7881507038fd4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21d67399bbf9ff1cf512dbfe8c2b5f0381c2449f6c983436dee167384b03907"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0fd0c291adfea0cceb3f921899204ee659783cb648717f3e25192a00dfd577"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c74943e37c5cb0a546793491397492e3a9cd5edd8786fd3a9d85b0c53db0c4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c97a36967f7e3c082fd98fd46f22bd2ba0d82d3173378baad2e3a6c232098f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f498c62e5cb6e09044615e7ba45322b8b11bd31b980ff5cfca27ba68f7d0012"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"9586086db8304a75e6c891e89646441e09bc90e278e3aac9be713f720d265a69"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d532e6e38416cf89d6c302e706939845bac9fc346102f964e0b90ef8946157b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6223fb56faec4f66015e9bf19eddc30bd607412672735e0b992cccc4e57e08"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchTasksPage.vue"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d156da0d0b96663b97ce9fb817ff8874df129fc1401a820cb39360c2953562"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchTasksPage.vue"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd6edc98d65eacdb61d8ca0b0843d393c2bc0ac67ce99fc4087088b2fc422ef"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d579d50471ff35ebf384663091f6884a343ad1728cb7faf0c1b26a6bd3bc9aea"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ed4ff88b5e9d8401f468cb2b0bc393bf8746fd96619429d61fd5ea2b44e2af"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7272729b35bf7396f5b90ce0738dd912849b85ac43d0d73dbb0a588a455e9d9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b4481a3c7a95a2e6459587e9a470090bebc1bd6e2a76470b4a761e1361a377"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be467a511588288564e27386ddab489926264357d00bbff13dfa27eacec7261"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ac552f63d58c524a88b18fccf8e0f6a5ff0f2545cdb55380d5e94b5b9426c7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab53dd0c2a88a19ba14e96a370a535224be7e4c93395561d6321eac29d8038a4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27693035e059294a52674e6abec1406d054689d17f5dd05e50b756c74a8c592"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"326fd69ff32fffac51a028ac538d898f192b8ca5eada90b274884b067946e986"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacd543fbcf340ea921ddae66281580e9f2521d1aaea7de07b6729c5f4a1b1b3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2a6452cf1587b1a9dde1d7d657f008ca1d5ba92cdc4bf85b45983c26538e05"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ce2c8ec6abc4370bf77fe53624b6b3edf5e38d042593b7782256e619a69d59"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb3f251a4610d37f7f3f57f76fa92e21f5c83bb0cde66b5b4ded02e565ac1b7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1463d0dfd3e2588b0b6a34030d4894a9970bd4be265b25e3c796a536b8d98ad"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5da3f4c6a44109c859dd22009a0349d3a218a610da74f64935b376bd8412ca"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/KafkaMessagesPanel.vue"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"816410967fa29b94f273746be0d560cd154a2f4a4f75049c9a2c56efd5462520"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MessageQueryPanel.vue"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce6a82fe2b890bc35f8218624df21a7c80e71a365cb893ae28895030001a246"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MqAdminConsole.vue"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bffa733f71e3dd79757ba48e16bcbc38819f87a745719823ab686d861edef38"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MqAdminConsole.vue"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a13d3a00bb627ce834491a35f7eb2eeae85c670dbe73439f087a74bc3aefd04"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MqAdminConsole.vue"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"8111e6d9efbf6606acd74ebd8b63cf50c12af9b54dccb0292575e2bca088cb03"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/NamespacesPanel.vue"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac45b0cecf6b8b10d9df70bd84fab3a344e525a45dca15d5fe5a95a2a249b7f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/NamespacesPanel.vue"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a67a76e67d866911a160290ad674c06637c93c3d6ac8cae575ce731520050e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/NamespacesPanel.vue"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8445fc974e323b703fd09b48b2822043553072ce3c670aaf0877e8c223c6ef36"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/NamespacesPanel.vue"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"66136fcd2a28d53d555bfb6b7c170270ccf2c410997f9b3a7cf40eb59851e338"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/PermissionsPanel.vue"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bdcf0916b0581e9acc641d3a0914b4f90f3df89e53febcf7931668add595a7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ProducerConsumerPanel.vue"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"636efde0be9e699e838603b675b55962d6f08594d15a81c1a0180223d0e7972e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6523aef357f9f8a1e7ddb42ab24554f420cbca5ab14a10124d739e939ce14977"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e8b86af2210910306f526f96fa7e4df7643b6c41b8ee4d71c97cf1e99492c6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5c53e3bdbaef96aa9b4592ffba5f7267b633f25a56a015d275b558f681db03"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa120f3684f1d7a5450aa4206810819dd11fdf3240db332b3d7f93f4bc436a3b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e715deeca7a552c0ca7e11ee6b492f9c650ead1cfccbc3a498add7696e62a72"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed91568b60736442853f4d9d1d327d396cc730e1c2d203235c3504d19e33b7fc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2db7353243ae4f356b8508800148878991955e559f6c04e1db986e7546efaf3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bd8389cbdfedba9167e384c038f7069c3b3dac1c3ef8ade42ffa346eae5201"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c98bcd7afa80d399561ed1eb6f2203a29580d5f668b858a43b2d99d6868b875"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6255d3b61d2e96d81a0466cd5241d7d707f0dab9ba8c786ff17faf91eec1a3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a326a64326fcc2830b5b614523bda27392252c7231968f77ad7132d73db2005"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2e715f7a5868d677848312998d43ee8fa42c5ad0bc73beca79be7b132ed7db"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f8449accc73dbed7be03c1fb94e08a070c94cdbea8f52ada260a6bc16fa24e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d04c85b7a4d9c54e51d4ea9232db278881813dcf74267d0ff37130036b0a00b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cb93eeda8ca454aebbb638d5439c881b76cb0d2279a3eb05e18b9c477ce08b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d074b8b3c6d5513352ab49fbb1588c38819c3e33c6889a6f78a78185354ffa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcd133d19cfea939ef0ac7aa545033ca0d59669c882ae37fe6cec0acd508a4e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"7277641bdded188b55ae42ac8b144cca397c0217291f83bb3270ca2f2fbe1130"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"960c583b394c2a9e9a83a24e2e7995ef012c885f973ab72bf579bb1f65750aad"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b34e4d069aec68041b1c6132e6c3653ca440977a1fb70465e0644475f77540"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fb37fe07af604d2529802fa624ade5127995967817960c2676b714b53f7f07"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebbc8ca2f131ea321be037611b144243825267b80ad4eca0eae48bef6f68e5b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"71748f6bea17d56236577c0c060034b79c252e5654ad3ebe0600f7755f2c15a4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7d3c5d1d3b115eb2fbc6d5c7bec0646400594209191c68b8f68dc62bf884ec"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5ddde95caa4dd30464bb1947291cec557dc2bb400959905521caa04da15b2c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"c636e07b9b3571c1823712999b14543a69553e0d33ef67dcffbe0e8029228ec5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c952c98224c77593c65d0176688bf6d7553d6f8443206e297bbd4638664a33a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0a8effc55817477d6e5efea58f3e8bd40b870b61e1cdbf90086cce6d8a0683"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed589c7c090c2739d5204e6347217e6cd5a096afcde5875e2e03f1e13e12dfa8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f745730bcfce0f89234a437c408e003ff0a87860dcf527351dc5a064e94c0b08"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f12b403bf3d6edbb9317a88e7ba3d54b755e39ee20ce077df0aef8ce4b34547"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb69318a10228c7529c35d8ddc445b8bbbf59502a7d4ab104969f76f6a82b03"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"500bebdd7f6e24b655712f8d76b56639c11db0b00128b44f9d16c5c50670eb4a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e9f04c6d38b8ad8173b78b8572cffe9eb69bedaf172cff12e280a4d661e5aa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d3aae0d9db1023d33cad9a16deb3ed480f9c8f17958fce25f7d8866c533a75"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a542fe37ecb6e59907857702da50f4135135a2ad770d8f69c1d3d0d8661ab12"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"57305487745143aecbb09f48a1db10dca499c48ae6058d5aeebddca45c13d2b5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqClientsPanel.vue"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1045a25011a58757f1f6c6da7392f93e46b4a71539bf85b6521d0195f54084ae"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"571a5c41066c504382fb03d69c4f16a64934e1fb4d99455fca48180f78c19e77"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a941df40b684ee1a7209bed884e9a7fdffab877c31063cd4148663fdab3524c1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"898fc36c7d86675f65e8d53100ebaa5af6843480e6d9a6257b381bcc9215c390"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc5113c6aebc06339cb190210ff73d9f4ab6c44c61f918fc3b97c23ae70ef8d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87bb6d97194a4cbf7219845e838630a21254316efd2b472107d4c4bfb1aa556"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfee6a43fb0ec913cfe4f050b019425ce7f6be13596eac47555ec126e9d7f396"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"be050d4d1b6e9930bcb73ed076e4a2001565fe5a67775d58258af1047e1bab7d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad9f485a4ca002504216a655f2d98d56c4d960a4c547f278a6f4313c95db50c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a29b52629e709cc795d775131ae694e78eebf365d7c7127b7c34c25083a520"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa45cadb5c6bc1985645f8e72fcb0cbbfce9a175d2d6dee3571197929ba0b4d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"435b97a178898f0cc7b15bd2e00f3ce1de640cebbd9f007cbf4d30643dfc0558"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf430a7a59ae94d56b0a6798008faebd6da48caefe9b3200df91e9bb572c9aaa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fda882e80dec2752b5e089aaf23534e50a44471837dba2425e2f467177b7f1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"407ba242f639dbea3a914975ca4c4f1c5e0d8fefd16fa9e3bd61769a94794b71"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e849a8cc6b4ba246941da8a641ba37eb44478471c0dccd9e947ceae619a8a5ba"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"241f5fd31d3059786b4fb1beb1362646e9e031e8793a859d71c1af6eaa7d4306"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"176c0c72c55421c7da4436330eade0ba8048e0f86f105b0e404541cdcc3eeae3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa89fd06f8e88650dc348d1055be3211938a26c8e2a61f1d9d2be5496620420"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5038bdd88ce254df000010f224a5a322584168a32f8aedfd83a15f86e07028"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29a40a41e1f823eb89f7a530aa44641f2b099e69c9e8f192459127f33e96529"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da172edfdf2633956054738c167174727d7375c8721a38fef033fb5a6bb3069"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2b13bd026d328c142b7d2107ad1a52289e723cc8d0ae518f6bfb9ae0732417"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"d857425823b541604c346cbd36d44c13563a1c148449be742e615b890274f0b5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd8fe9f59926b8b7627b21028b8e0c961f2d8f860fae4caf502dbe455940dd7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce9ad2f2e182041ee99d5cb8bff8e264c5d3092a501500430f5762f7c2d665d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf7601c4dd257ae57996fe268fbbbf36ddd583e2edc12dfc0ee9121625b0eb9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39e6b7f6c84c8149baf88b987c1c1a6fb72ae941fd13f5db41756a773d655a0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7936f899052d69e20fd4cd5e3fade5ad66dfc2d4797ecc160d6bfd29eb16ef"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2899a1015639786bc69d03a0aa7f74ffe2086594416c2a76273487dd1b58d4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f65b46d7012c822ea4ff4c6bf8e4104610435180b63af8dc3189d44ce51df63"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02fa7800994ce49ea65ccbfb73bc8712bdfcf51c455c72d34d6ec293f30233b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aca8dff57b1f34f0ad0b056e49beebcfc68ece9f0fc912a2174809410ffb315"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc662e97f1e256321c8ee3d5dc08af42ffdbc4d696a20459ae8ea4156e6fca5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fe6508cc577dff56b8106597e754359f7b497571d3606672f9c88633a82694"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"417f4a5580f892039c0963aa66251736841b3c8b7ca08cc938fb4929a81bd2a1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b16c204248db91722df78f103f13ee5428b786ec4aa18468b268ffdc69ca5c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b006145e5c79f1df6dcb835deeb3baa0d4ee9745cb26d2adc417f6737f53da"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5bfc23f1f0ba2a9ec7cbcd56314ac3c51c36016752a0ae214dda632d001e9e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbf66c1576bc476dd21511de2c855c8674f53fa0f14c4bd7efa879704cb5736"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c0e57100a2da900d7bc645f1d0c325102ffd19a5151128e4401816655edd9b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdd81756b035bdb62a70adef61f97d492d276e15fb35601decfe9da8ffd5338"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bf25ababd89644f877c6d86e433170f0235947070491dbc960b2ac31f21915"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdba1a5f257bee597caf1ca6095573f8f5f9ec62a7ab6251ed7c07886bb48ded"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"616cc350dbfedf4068727f62a53425bb43858680a22971d84059d684a8062ac9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d9afcada2ab17d08d6f74a45f6b51facf0440d2235a025f563a57959e9fef4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae057f93805d0166bb256b3323c0df0a6e76ff99b5f9c5fb41ac3f9f494f4b2a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad898ab62aa065f1041a4126d0d0c27a63253e8317d10129220b5e83022af207"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f7beea3d2d8691563836a143286869d19fe7099491d0e081f70c78b22b5b67"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee822c5892d593613c42f9691e977c4c36875d79baaeb0f2f529afc44bbeff5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec8c1824a40b4b2898883e14e6a6cee3c3a4995d4f6d5e5c78cfc364e25f5f7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5117e5925a4579dd9b40e320936749dc9a5e0acce95964f4194946be31f23b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"1023bb7a369946b1197cb3538960760bd4d500621b0f69282bc1019afc750b21"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2902}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef0694bdf237e10085bff4cf06b8c0bdc3f465fbee1ce4efdba0325ece0138b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcdcc75a029495f33c1ceb2e59d00fd354f57c1e9d2b1cf541c1dadecfebf1f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2928}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5b7c484a934cd89e76b754d85ce3e3d1ea121116d13a79193dc2e7d81cee4c"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control with no accessible name on \u003Cdiv\u003E: This \u003Cdiv\u003E carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to \u003Cbutton type=\u0022button\u0022\u003E \u2014 the right fix for its keyboard operability \u2014 does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5bde07c49e1812b63853ad07664e2e812ef5ed831c4829bf24527966c15414"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f549ec596cd1bd06fe2016e5d110bfa82cb2483f850dc50280050d52407980"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d96ab0a655bdb57f69a88a4cb98d1f06304e090525a6c2f9ad274ab3b050a3b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3215}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a46dd1647400f25080057d799cc1a0c7de0cd6c8c6f38b8ba9417622521e44"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3293}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ddc22761d2ad0d15d20450a6c4f0bea0879d7026d0fa35565a69142b308503"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3612}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e92d4af22cf0a8518ecf6c8d8820d44a9054125ae82762c93dfc756e91503f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3613}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5f1d03a36b7dd4ff023807a43c88f145055fc0a725c18f06f77f181bebff58"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3616}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d2c4fe68d3a0ffba985f9cae9f68cdd113a6feaf11013223b78eeb52091dab"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3617}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e8e4b2bdcef85ba715bf054e47a6289b045e288249519e5e115f4869e53c6b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3620}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2708c25e8fb9f99d23eaf1577b2618c4ca8b0ffde9607ce3e1e44383d3cd7e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"15081bf2e7930aa5623067d59d8ca14a6c2333f12cf1a764e1eca842ef611743"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d441530c5d16b3b2621fd0410b9149077b3475f2dc245b71c23f3f28f086e946"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"1443a7d7ef57b9cfb443ed8ad1af6b08dec84f66edddee6d80b62b877815db4e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosConfigBatchDialog.vue"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e00ce53e8446d65bc5553008312218d102424335aa53cb83c29def081f09a7d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosConfigBatchDialog.vue"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e60d24680bf9b1765bb3963ef4d4c2f2b9d51420d831243916622ff29f3d2e4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosConfigBatchDialog.vue"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"527b121e40a48b4b8cefbbf631218a7a23cce1692fc1c9e90f1dc7db3ed5994f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosContentSearchDialog.vue"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d27bf58fb7a6d579b16e4e44659351f1f3d8434cf5962632cf0ee359ac19f50"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosContentSearchDialog.vue"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2677d2aa2d8cb596220812738843c9bb9f977f1b0af4549aaa7f462b50b895f1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosDashboard.vue"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d18e98f67d830936fbe9fc5b658ac80eec8a2885bc7d29b6dbf2194f962a7d9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosNamespaceMultiSelect.vue"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f06ecd53edec905c745f3357304d32a39ea7a605c1c095251104d1c89f69e3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73b8e18196b617f14ff9cdbd2e1877f3d318da2a49d38548fdf0f89c7bd27f6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4047443a63fb8f18252cd1845a3975089ded30aba53ac06807d41eb9babca6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"060233131ef0913c049adfc3782ee0e58280caa1272b99faef89d32f9c52993a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"066be5be64b37f371fa0b159ec5a95f0a179f9b0f43f4ea6c3ad8a140a356372"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c691a134f61e5254a126d38d2fc971a6438da9610fd6035dddc0550d6573e51"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/FirebirdObjectManager.vue"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f46d024948a24ca7c13dfe1c48bd6ea1088771eeeb01709800e37e11be3dade"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ForeignKeyChecksSelect.vue"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"69de572112828fbe035e78384dcea33a0640e8aa98534b8b5cce321fe3b891d1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/InstallExtensionDialog.vue"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfbdf9609414b9c864ff5c9b42cb32cfc8c0fe6f33aa222366346a13705ce00"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6605}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23f53442d96ecd3e69607d755e0de1b9207ce97f62de290e5bda1f4596f383f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":7683}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d907226ecc207f030f82c2db275b0ce88eadb2484e1ba1eadea4727eb1735c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":7714}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd3ddd230f9356877f3662bdfa98ce6c2d6c72f1d698b1d89655fe0e5e891d3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":7846}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f414a50757f0591455c5547d368269ec24c3bc211ffab893bfdf98ad2bb29f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":7880}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d66ebf8c20962acbb66de52d86512b3ab2c1d441f786129017e436e85a6262"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OraclePackageSaveAsDialog.vue"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f3aa550f9ea749e8a234520285ad69a1e6c93f0eed28513c8ba57cb854b755"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ProcedureExecutionDialog.vue"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b920a557e4689883a1509aa947a3642c0902f45a02e0ea38584dcfafea726b6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ProcedureExecutionDialog.vue"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3a9069c39ac654495a48a935592cad2409799392abe7ed068524c1fceb31ea"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ProcedureExecutionDialog.vue"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98b194153369480538189dc5a5ef9c1472ab13bca8e04bbfa57bed4f278bbae"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ProcedureExecutionDialog.vue"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8079dbd3760180a7296acc04fca6ec25da2f5ca0be4ec51baef7a70c96b52fe3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginBottomDock.vue"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b559a655fcbde7c6a1146f6975b3b5356f588eb4bab1a9cfd498e014f7f41c81"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginBottomDock.vue"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ba95132186f3b2573212c16e4ffe8efd960318d3f8fdb38cd307368940178d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd748d9df12c82e848d5843e26a4d691eaab17d3710e510b57e9335490beded"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fd4f43576b77ca0df6603a11f721f1298936e8aad3994b7316d152dfed9b6b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"532759ae740daf6388eb41c1e1b0b8f8b75bccc006a4a645b38cfe41736df14a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc169cec782fe2075534c18f14eb79e6fe201046e1462ceab96b31c4929b308"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97296482708a0ba772649e74bbb58faaa19509ee867154cdeb7d7989318b72c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdf52b70e0c6ed717c15b9bb90955d67b0a16d6e740f7a11c11b6a6a61a7632"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginShortcutSettings.vue"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96ef375050c5c231a02538cea69909ba11f1cc7b83edbecfc7f7a61af1310d5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginShortcutSettings.vue"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf39e8d7127435437d9dc76814d656378d93c258b8e862d0907b2f7dac54a18"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/quick-open/QuickOpenDialog.vue"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f44c53848d16950bb37074d3fe369e92b6f2a824ba937b9e0b7bc982f9e651e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/quick-open/QuickOpenDialog.vue"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ac96db2bc6d3be1cbfaa5468e296da816c0acf09b6a8e33490bf45281b8586"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/quick-open/QuickOpenDialog.vue"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa16aeef2933eadb119e180d79ac5361f785b9fb13eb938ec1f9c905da2e56eb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisDashboard.vue"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac07b1f214c1d7546a5bffd5bbf0ccb9b03cdda3961dc55722077e5d4642166f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisDashboard.vue"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f4554fa97a6c6d60d3688e452db1b62db17f4402da7f75a55106b41b99f4ff"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisDashboard.vue"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb0702c2ed55ad033808aa1b20c93a5f1b7bda4947e2285ee55341bb8938ae0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4064}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb3161d0dd84dec33b767277c34f937d30c9c26c1b891c5f132c077210355a4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4168}}}],"partialFingerprints":{"codehealthFindingId/v1":"783d04e0b637af9b36a680d1ba488ba9ca531723ca2a4077aa8943ec41437572"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4486}}}],"partialFingerprints":{"codehealthFindingId/v1":"99494039cd69e176cf97f5d29ba7da3330e101da6cf2f1ac75c35de2d3335fb5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4543}}}],"partialFingerprints":{"codehealthFindingId/v1":"10216780ac03e6e98d0c94547ec8c570c1104094a24575bdbaba27b37b5c4f1e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4557}}}],"partialFingerprints":{"codehealthFindingId/v1":"a293f9b7351166de22f277c090144f38140cca983a1841bf1338218b7c5f4d42"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4619}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1747ea0223ff1e4e18f85736fe38fe183829428619bf36b87c1891c72a0b908"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4633}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84faf7f90f8b7513f425006e7f7676c9940dd10fe5849a102477a46e8416b53"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4641}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a440646a627c459e49cc54a45d19793258b1ab758240687ead115f80fff54e"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyGroupingDialog.vue"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"444cd277513f25d4951569a6c1f1fa7d8973c1e5b8ff32d24ef86bb465d7d1bf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisPluginCodecView.vue"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0514a000297403f9bb283c9154b94f2c0769a6c77f2b8e312d682a3d97c256"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisPubSubPanel.vue"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce571b2fbd2ea4f12d5485529fe3b6180d4fb15e2ee9d583bab7701ca57ca8b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisPubSubPanel.vue"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec37ca8d7aab50fe10a18e71ad241c4b43e20cfde1a0d550ff9791043d2fbbd0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisPubSubPanel.vue"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c212a6375460bafd16b68dd5799184042648d0abc3db21ac41756315c89916"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisPubSubPanel.vue"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"381c331c97cba70250327641aa310de725cd8b996c0b32e53d7ddbf66456ac8b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"550f0206775323c3f4775b65bb6bee04bbb5c46879e25116937a352f70eb3bc9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa7fed4a2d388c62bade3b0c4dac878c4a63ca913ad4f203106d396439e1009"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":3999}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c2692b4710344ed48b7b25776a1cdff5c3ca6391da4acf5e4797a8584b2776"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":4009}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccafb5c43fd8f39245858cc3e7460c4957252b7361b3d7115007a9687c83e8b0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"caceb6a8365558be905b1635eb294f1191a296457091821eb07618159f2c4d7c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1ee0ccf5e859a781676a49c18d296f99af41285b8d428de4a95f69c845290a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"690e0fe3e837d56b29dfe96163a7d47d1d9b166978b8dd3621c45875046e8968"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b8ac963fea6781bf9a3217ff5da31a600781e74bf5b6a2c17b74ad2116bfb6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9284f533a06e3ed2471ad04c83834ebd5b2c13f8a167545c9936f787deaa2c0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d906b46d77cd436fda5cf880e4b7246fc0fa3b19d9df821440d8c3f87b075e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/ChangelogPanel.vue"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd06b31fac76f43071aa799caa52bbcaf8b58d97e61746518835fbb4f897bc22"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpAccessTree.vue"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b7eeb2f89646090375ed2836306c19d25c6a050b2f492369872237f49ade7d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilitiesPanel.vue"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"258ba35b9c72a584f8e6aa522c580670bab02f84a24d1c57497fb1f4de704913"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilityBrowser.vue"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4f480b1e4da36f105eac5ff316cd53447455c0cd2c93a17c16969d5683720f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpDatabaseAccessDialog.vue"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a73505eb48a1acf51b66296e400a35355ed04561a66ff5dbd8a1aef49bdee4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginScopeEditor.vue"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"519a9f2c2bfa5718ceb059069179540c075465a7267ce3e20e304b74dd641951"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginScopeEditor.vue"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0ea12db9a5f67cc1c22d774d9c34b507426b3fcb17e21efcfd144db648154b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginScopeEditor.vue"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"36156f26d740feec5e75e11639354f278b0905977003b9b920343e4279f25f81"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginToolsModeSetting.vue"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fd73ed2219d2634b54fe4f100b78165ae93bb2eee3f3189047ef95b0cd8d2f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/SettingsTransferPanel.vue"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"434df1f1d7c4fafdc0d7fe7e106eeb6c6508fc2c649ad3a480355cba339caf29"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/WebLoginCaptchaSetting.vue"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54c4dc3090657a46d5ee6f4ca7daca67366adf1d343546b35727f7f75138946"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b16929d1596f50bcb34db04005daf981cf0a1e2ac03d4acaaa0c7e378722f0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3373}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a868c50c27494b116373e3e1dd60c5c730af609585a6277e9eb1454385eba1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a322b575934221b526b442940cd79fb42c578496d4aaaefa050d6bac8c26957"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3381}}}],"partialFingerprints":{"codehealthFindingId/v1":"863ddeb0adad04ddc81c82094c68abef71987679e04dcf50f1e52e79a1c66d58"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad94fa5ce7f30b394304b822a232fcc4603ca74b6b41020f472bd7c56033ef3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/MongoIndexManagerDialog.vue"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acaa49d36eb9039e62fd33175730bf3efa2fc0278d2ea4716407247c4b76991"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/MongoIndexManagerDialog.vue"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b51d7b3f4e7bc44728493cbc9046ba858edb4a7ab883c01df858de49e35665"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/MongoIndexManagerDialog.vue"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd26ab29eeaa80805d1c2f39c49d1c56769dc802bb26da9dc7f48f14341b1aa2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/MongoIndexManagerDialog.vue"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5545d50c36ee1cff59155443525ed097bb4e9196cdb2032bfeaa70d8b2995d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/MongoIndexManagerDialog.vue"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a759683b0a1978675d1869cc509df85689b660be2a3ab12b70ba0ecfaecda6b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarMenuPreferencesDialog.vue"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01e1050256d4fc2eac82bff9f0647511ae8187bb55f11d820d491b647c8066c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTableVGroupDialog.vue"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbbd1e11fe2758f063a3ad37adda708c0cf765f9a421e961559f3e5790ca3a7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43272632f090facabac0af6ab7e6f40b5258a00beb864d11eb02ad21cdad4ed"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68738f5ecd9c16577a83022bc8b4508fac57190ecff34914f4cda4da83a3dc1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ead945ff367cb02833554ece5140fe20b2e1d336a48835e804523b36778c40d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf46bfc6ecf1e17dfcdd0448fd7098feaa41cb72398d606397c5df846138072"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea010c9751082aedcb623aef26e6b5a7b58c643fd62a6483cdc23709ca6a44e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"af25fbc653dd83dd192569b4aec8de44d947d343031b74270ef4620fb1bf2659"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"445d50e1f24bd4e65e6c424b9d5af9d015548f37820a915cb1f2428223c13ba1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a3b5b7d29899814716034659b2bca5d51d46333fc8c5a6bdc71fb6809d8cb8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25dae0c136a34a71030f5b134ddb0d3bae39278cbedcee36b53ea06f0289087"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"da364670b6c6cd88280701a6008bfe29961f653f873c9d643e6f861613cfa26c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"38867c54e6f6fb969112412872703b6ec3a2b2a834ee61e45a537fcd1595c32e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0973b3e2a366d63660eceaabf90da07d4adee453b3d9f679f7c9c241ddd5cd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"179fa5fa89e81c7a497f0474697ab578357fc3a0430cbd9cb041869de8e818bc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"d569aa0108cb27bdb0ed6fba0e5f6f19a0b16546e7fef6a75c068511a30eca62"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"f665bcd6cd368c0486f83c6006d38ed2e44c4d7a8192ee9c22abd1c957da69c6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59d2ca90d80b38fa62439b0570a93b12c5fdcb314aa227e5705adb644377c74"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbb02de66d50eab68c351ebc9026f010ffe4d7917c93e3ef01c6060c1faf1b1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d9edc7a2ceeb7624acdbac9a290f6b2b01a9c0236a6f536933a377d9e80d5c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"865115a670f91ce2d37ffc26bac9954719d4f8516a94f973bd0c117f7e1cdbb8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b554f0e3f73385db05fe4fb449a228e6ed31ce22cefd6485fc8e01fee320017"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"13db2e861ee8d6c08e80264cdd5adad8d22d19c0cd229e9b4e54271bc6fc3245"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb680145fbaa4126bfcec2b123291e703df695f7ab040ae870147d850cb3be99"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ba45bde002439c763a23deed46356f062e077eda94823e47742312f025a05"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fd344485109834cdf25c23c13a88266c33236b205c3cb666c88fe0e099cb9e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f068ccc294115a1579c46eb2f791e596951d6a41f91909902e7c4ec2eb0de5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"58367992ead325e7ef05201c8233f6e889d029b77b14dfda181a121917525363"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"840748815574ccbee34ff2b5df5d49d534d2a52bf14e53a3698592107d7e2843"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"0808f2237b57f47d17ab525e2e52a0f3741f420ea7706f0e75801a48e430c2b4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bdc0010f5fc5cc75bd2ea5c9f9f024fba84837740c265e78d1e95096a00c02"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23fd3dd862c15703a00a142f8c0debc3ab73751b39266bf3a65280640d5c289"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df1887d4accd893ed6d498189e4556aa8ec31b2a420149df580891e061ccbbc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"601aa15764b52805cfa7669d701cea9b6a95f3e4582cec70bf6f7714980ab5a8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cf6e0efef8bf5698228cda68814f6274569bd0b6be859afcd94d648b0d2edc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleNacosNamespacesDialog.vue"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"febcc0f1b2fde295888cb13d8b42b1c32262b49f94d0fa2c84ea7645e0cbb2d1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleSchemasDialog.vue"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"579c445473ef53f50fb77ef30fdfaf0e3dc529324fac23e27dbb7a3cf7f251e9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a577f3a61189ca0845fb444292b0eca7108631011cedf74b9ba7b72a1f139a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"defacad6cc4de25394d5b6f3364f713551037c535a077504f467218250a24d2b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"252685d95a2652d9bea98c133fd1293f6f56efe731161fa5114e3c4a609f6e42"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a7f430c3ceb3d648ef0349b7c144d22edccdd9142d10cb4892c5ef1b49f447"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb2d52873024c583b9f51d9201e32c1213ff13f700bbfc7e0b82669fe60c621"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda76b69a1ad921a8a0b861897d2d28c6b2f10c5ca84f6d7cc55eb64e3ced5e1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b52e3b5d374f84aa830cb3b71f94e7fad7ebe03f7de41ff357d8bb4b794b63"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bb934aa4e13a829fd183f8a459cd027523e8e44a0cb44628121e7533074aa2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbd0750735b9f242a72965eb457b4932d641cf3bedc35edd155723e6f4ff889"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc517ee94761b47c03359cacb9011c2b2ca4f7b3166e728345d0a6a724b6992b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"60256328703c3fff3b9fe062b4576e46b3746b304842095eb918fe8e475110bf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fccfaf17594e6c663d2d4b820106c8f17cee44b14c79577896cd38b16068f8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f0cd5ddfb1b4c8aab5d1b3ce02aff436a13b6bf9133255a4a217889516acbf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc85dc539f9e7cdcdadc74cb3e61b7cf8ce1b46d442b4c18ac455af3de76ac6e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da8722b327d831b28bfcf571de1b52ed892bb876facf2b3680d219d051faec5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"714c802f0aa0a2d546b8d56eb33e317f274cb6bf7aa7cb8447eea57cdf6a879c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f061f56692ac32f0ff603de8c5d5bf2a1dc60c583648f3f10158c4840f0f193"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d43843d707debdc0cd9d6c1c339255d3525cb9a2276459be24b19f213d3d6f6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65fb50e69e056d75b7dc210b2d50fab89e6f636919bd5976685ef9e9301e223"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd63764e7be16b147e00fe1d67c3f7552f84804581fd30af2cc8df286a1e98f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaa7c44f5c7cca483b491346214e8063942476e9f60736952af990bfe0313ae"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2f3afa38d959d66da8f8304f7762c1b4851dea6d132a80c29e416f911ebb84"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"82db398271e8019ebd2445f5d70bea676945ac119775523c0e26ce9647d49ca3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f89373a374fe43e44e697cf8a783bd964cf7856472704956d5ad48b53b1c2d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4b560cd6dcea43c58ec346b43251f15a276822495c23c3f9456c907cbba28c"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/PostgresForeignTableOptionsEditor.vue"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba91c04b15df9c64b3db5ca612c6879101cf6cb0d4c7184248d8dedd094181c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/PostgresForeignTableOptionsEditor.vue"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74fb779e1fbf08fb6465d9e129ebfebf71c7720bbab16ee6c1f5e9fc22c198b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksAlterLayoutEditor.vue"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d67b37c5c3e4d9c4d1f9f78e42a3d3780fc6b0be9609421ad5bac43aae1fdb0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksAlterLayoutEditor.vue"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"af857cdd5320737c8518f7e309a8ee0acf02ed8f2b4e4f366426563e4ee20d56"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksAlterLayoutEditor.vue"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d86765bf3d43374792f629075bbb8a33f982a335771fed0ced0eba665429f0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksAlterLayoutEditor.vue"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1384093cb6fa5d7c9546f9e406196e31d6aabd031408511e13850ed79a37f956"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksAlterLayoutEditor.vue"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8abe159e0d8e6372af429b660a99601276b9a0bfaea3665b5608f3ff3fb431"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksAlterLayoutEditor.vue"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"67393b0f286e1ec5a676b10d06f93a73c1c1a8a8c88c40b442ea56bd234fb5e3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksPartitionOptionsEditor.vue"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4190d05330cb15a2a2113c37d8fdd672d5232a7d6c6e340a2580a70735c702d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksPhysicalOptionsEditor.vue"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e012c6e9a2783abbc42114b615a4967c57064bf764e7b9eb064e321bf92f85ed"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8387}}}],"partialFingerprints":{"codehealthFindingId/v1":"3292f35315c7821db8dbf6636e4148ec414145e692b33fc29d284a1375020ab2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8388}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dc11b1db65e8a32f2014a18e5400f52a1a0d3fbf8ca414ebf77aefa9aa7483"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8394}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5935d3a848526396d680ba7f2cf2e950e084d453a44799fc8514e0cd226ecc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8395}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da30af44fff768d2a453f7efd18a77a872fd8e8c61bd618ba4a887ba5844e85"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8405}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a426f6e124f23d8c5df06740f35933696d1ecf59e07064b6a8b2f649a11e82e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8406}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ce045e4ba15984be2fee38e1bfa6336265880333df83696f13266ab6a084de"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8410}}}],"partialFingerprints":{"codehealthFindingId/v1":"84278eb56e73d7896b3f322b6107bff0b08b32875981b327af288922854a118e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8433}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ee6c9981fe3aebcf87d1e6a54f4660403192712cd3dd18d11eb5603a051b27"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8452}}}],"partialFingerprints":{"codehealthFindingId/v1":"720193985bd1918c94b2d7399cf2d7d06f94dfe7828adaa34f1b3b1cb504001f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8472}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfcc893ad8f512fb435b390deebe45e04711b42d1c06441aaaef4774c409d34"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8570}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b11a27c4dcebcc6992f549f40d1668569139786be844ca7f4511b069902b3f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8676}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a69d7e5d791186a357949df576f1d15213465d8b4f29356ba45c38a13de60e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f5007e91a0693820ffe313268269a6ed0fe63d635c7ed42bce07ce279311c8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c72cc0693d0a5ddb7185fd9c6a59afa69ccf842cf2d8a33c7262ecfa774d331"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"55010bb8b482e48f93f9b3ba00f94c077e264d7a30657cff2ea308e454d57a9d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"577e6f237e7beec863e533bbed6510bc88d5566c682dd06160127c3917e5ef26"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ae0bfe4e91b9f47a68458648d4f7c649dfd7be496ca8aaf3c10401db0fd31c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"a968452a658a3d7ae1b2fe56ea39835e9f3f5b7fd117c2593c66bf48be3f590b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6204602a539454496aa3d8b8ee1c146b4ee573b35169db1f82e7260e9da912"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"330ee36f0b7b8dab9efe1a3e1c0a74eb9bb90b84246d23aae4523e825d40563d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f973398ce944cc67aa598d83910c6991419231061e3038cea6e0dc33ae7e27"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aa990beeb77d826395dee8ae1e49a17ed19fdcf76a6dedfe57e3ec14254e7e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0cd1d9c48dcbe8998f456d7691e1a720685fdf9009a4c7d5452df8b0a915d0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc05e260ff24c20a7794fce57ebd3a5e86f5822c5d50d808637ee68a2eeef80"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd87b579e656207be29c5749f3b3029d05975e8ecce31a3022368cf3ae432fe4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cef63174925ccfe4569e1b05eba29e1d044124d9703e7dadfc7b29dde26d3f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9aaf2a607fe7eab9322fbf4fc6c38078a590eb61fa4b041991ea80f826733ce"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41fb332b28bfb269a40f29fbc8194409ae3d2a1c3bec2c2d9c6d7d85cfdda6c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"02169f42dda314642dfe94e76fb3e463846152df66ff584bf45c70d1c1fabf20"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"0333893b27c75bed5327da9b528a43f1191ca9de7666c9d6d369d79ad1ab232c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"91971673c27ab8fad7addbdb9db94328370a6609c969edde6d161c65c4293e9e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c52c01ddef7ce5f0fe36773843a1b37f46d546ab8466cb2065b509497eb948"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf042fef81b086432084f99b9eda4f049461a16a53ec647f093c4276491fe31"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/ObjectSelectionTree.vue"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90756a1746b287ac4939bb1ad12405022f4233f1df115fb0ff76f77a4043f3b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/ObjectSelectionTree.vue"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"027b3dcbdfb1815e422a6fa14a1dbc8aaa1e0c05d2b9826293fa7fe14848b096"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff812a0aa61ef1a84f6b5ccfc733f23393435b30e9e1a154e5b187aaabc9d9f6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edf3c1b1336aaf7195d0210ba3a1e93a1161aea9ad7af1a93c59ab2fcb4b094"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48129b1eeef1c8f093c2ec528fd8e7f8e9f601b282c0a432a218858538fd352"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb3369e20458238fbcc7067b3a7636d936dadc784258d7d813b45b543b50b82"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00e53d41bc528113be33688e58e1d0c9eb86ea35d581614a0f54ac44ccb6cd7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"269d752dc952eb6411a9f287efd4a70799d8ebd2db99e4dcb35eb2182d928563"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/TransferTaskTree.vue"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc95bca8ec5d427d3ef61b1199747511b381dfed7d5773a557ead0669ef1d88"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/ColorSpectrumPicker.vue"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bdf2b468b8363a0f7594db3b0a4aa23ad1ba73e1e6f27df299ec4d03962bc4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/PasswordInput.vue"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bdbe12cd5cbb517ec61d6b564764118a2100da28811340896e5f3c5d7383b1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/PasswordTextarea.vue"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2d6272edaedd561792aadd79ac99e57be375b242b57475a82c44de94b89e2b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/input/Input.vue"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cab0e663d08279d75086617799ca1e4804a8770818dec00ea5d1a0254a4662"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/searchable-select/SearchableSelect.vue"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"310a0a4615362734e29fe1db169ec2a3abf893006a09333ecf122e206e561c2a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/vector/VectorBrowser.vue"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"38897b60b3c2ba16f63ec0b784be707562c32577c95714a23eb4ea94afef72e1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/vector/VectorBrowser.vue"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32a6115e0a628322f02e28d72f1646f1b762b061a5715b81b5d13f103874879"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/DocsSearch.vue"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7734f7a077e1d09daaa571fd164cf00c3f68658bacba3aa691d8090676581109"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/GroupPicker.vue"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bcc2564768e16151f4b2689d55a252f55a8038ad2d7c4d4a7c7664a68d7a43"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/NoteEditor.vue"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc016b34c9aa5aae1d0892fec90d7e78cf807c048d3b8367675e56eb470e44b"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control named only by title on \u003Cdiv\u003E: This \u003Cdiv\u003E carries a click handler, which makes it a control, and its only name is a title attribute. A plain element maps to role=\u0022generic\u0022, which does not support a name from the author, so the title is announced as nothing at all \u2014 it is a mouse-only tooltip, unreachable on touch. Give it role=\u0022button\u0022 (which it needs anyway to be operable) so the title becomes a real name, or add an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/NoteEditor.vue"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e955715692169d71d1bc2301acf7d97817c92a5588a689e58e31cad3e6e6ff5"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control with no accessible name on \u003Crect\u003E: This \u003Crect\u003E carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to \u003Cbutton type=\u0022button\u0022\u003E \u2014 the right fix for its keyboard operability \u2014 does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/SchemaDiagram.vue"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"506ed67a093b8efd2edd893a035792e440aa964705507a48c18189eaba7ce36e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbfac3ce5466d34ac51d63d1fcd84c4288b7aa44a8edd4cc565b2d0845b69a7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d7589f5e5d7008c926dbefdef4217516bff3477b8bcbe45c74725a57d2f439"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CLanguageSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/DocsSidebarFooter.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5365967a2fac8c82ba2fb9276250585e9d118ff625e9c672f54ab31c4f890e1"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSearchDialogInput\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/StaticSearchDialog.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fd0a267903b4e28b08755d6b79667a1d91316b22b1d86c897d58b69bce090e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e09ed992899a68c61a8149961a7adae80c621d8d541c4100e68908063ee240"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/MySqlDashboard.vue"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d1769ca5f190e6d527535390704ae1b773cc24bd4a0eeef33ceb06994e514f"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/DebuggeeSqlPanel.vue"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b09d028fc2467abb1d46702a44d5d76949efbcb5a801e9f2a000cc9f6a4b4c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Empty \u003Ch3\u003E heading: An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it\u0027s decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/DiagramInspector.vue"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad00c2059ec65db43f2f298b5d3efd2efc67ac29548d31ce00ec551024d1db53"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisDashboard.vue"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a50fcbdaece798f79a20f86505a92b938f2cdcd7a359c64f3d858165f8a72a"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c7f3b879a2a07fb71632f841ccbbfcba83f1af7bfc223e1615562758546881"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dbx-er-diagram-architecture.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c52784bef210ac42056386d8ad4bb7d8bd249222a52e8f89a0d217bcc59218"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h2 to h4: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dbx-er-diagram-architecture.html"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5ca2968bb98c00c232b7da90a9aa874ea775e7d0bc1a0fee0fbee8ca81f3e5"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/(root)/layout.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"05748728230830c9fa0ea8f3a984500af3f03e20080aff5fdbd8e2e1be446335"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/cli/templates/svelte/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88dd1e88bd85506c7384502cfd31ce7b52555d7679b5864b43f8184e1971228"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cth\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"72235418d0552ee626b2fbacbe7d2248646886c533fc1d4905b0d355573d169b"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctd\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"99582d9faaad15e2d916975d373b6d5451b65012f50d36b01353192fc8e26e01"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/SqlServerActivityTracePanel.vue"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"362e3dd7f785c0dc43d573ab8486fb2b52ca1a5112f7dcbca5432049c908a1a1"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022alertdialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ai/rich/AiHtmlPreview.vue"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ed4d7ac1326120e0303e116efe9d53311c992796f535dc018bd84cce3266dd"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/DiagramSchemaSelect.vue"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0124244430d5e390e2680c4dbc083ec8130f4e3e92ef267f47dfe61d5dd3a27"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/LayerPanel.vue"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2cc123808c7216cf32a9e1c325edf28794bdfaaf8ffc79570a63808351981e"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cursor-pointer with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/LayerPanel.vue"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ceee466715e82fc79c488afd989dec916708280522af790683352040bde1a17"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cursor-pointer with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/LayerPanel.vue"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1245e83dc57f5299d3832c5e2654e398a76489987c15aab0406063fa675387"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cursor-pointer with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"9855fa4b9d34f8ce7d71dc02f4e76ba75a8754ffcdcf0e54d9b5c8c69c5ac0bd"}},{"ruleId":"AC4","level":"error","message":{"text":"Focusable \u003Cdiv\u003E isn\u0027t keyboard-operable: This \u003Cdiv\u003E carries tabindex=\u00220\u0022, so it is in the tab order and a keyboard user will land on it \u2014 but its behaviour is bound to the pointer only, with no key handler. A tabindex makes an element focusable, not operable: Enter and Space fire a click on a native \u003Cbutton\u003E or \u003Ca href\u003E and nowhere else, so this can be focused and never activated. Use a \u003Cbutton\u003E, or handle Enter/Space in a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDeployStep.vue"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d4e05470238d228ddb7deb286e193d14e81437a84d6b3ef593583a806ab9af"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffObjectTree.vue"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9a03d9e87c732ac5e063570742cda63601f17796625fa4c8fa192a28a8f4ce"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffObjectTree.vue"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fba33dec57664b02ef212c739a7d40e7f15557d0cdb7708e86d112d3fc4cdb"}},{"ruleId":"AC4","level":"error","message":{"text":"Focusable \u003Cdiv\u003E isn\u0027t keyboard-operable: This \u003Cdiv\u003E carries tabindex=\u00220\u0022, so it is in the tab order and a keyboard user will land on it \u2014 but its behaviour is bound to the pointer only, with no key handler. A tabindex makes an element focusable, not operable: Enter and Space fire a click on a native \u003Cbutton\u003E or \u003Ca href\u003E and nowhere else, so this can be focused and never activated. Use a \u003Cbutton\u003E, or handle Enter/Space in a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffRoutineList.vue"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c24b74b2b2749168341b88073a383d42092041a78ecacf58a28da6340e4772b"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoGridFsBrowser.vue"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e5bfc995df6224d8f2ec98982d1e52b8e6afd09a5a61543b24a58f7a188386"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltDiffTable.vue"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eca97cd94616d0ff9b8ad2add9c333e2bf41fba6bb16071355ca95c0eb3e0ec"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6801}}}],"partialFingerprints":{"codehealthFindingId/v1":"48df9abc1c584233c7716ee0032f06cf8a2c1c5e074d2215d227033436476b3a"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cp\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12843}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3127e071d0662ee9687fdbb7941cd4a6af8d77cfcfb6738497e19244618063"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditorIntentionPopup.vue"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4bff52a51ff74e040612f6c51a0ed8e0dbec42ebc21ab913ba735a4309dce7"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cursor-pointer with \u0060cursor: pointer\u0060, so this \u003Ctd\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/TableStructurePeekDialog.vue"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad501fa3aeea49961025658296c30c691bacdb106d060664dbdc8ab6813e061"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cursor-pointer with \u0060cursor: pointer\u0060, so this \u003Ctd\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/TableStructurePeekDialog.vue"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"becc6152269e06cd0ff8ea00c1d8b7d34db0b1bd487beadde32aa0bbd7e60a38"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cursor-pointer with \u0060cursor: pointer\u0060, so this \u003Ctd\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/TableStructurePeekDialog.vue"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9119dbee8ba257a94ea93d85e03a9161f1d4231d44c249e8416b98ec4f55a05f"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85da1ffc136daa5d3f7788d034056b3fea5706bfabed639c75ee1f0ff38fee6"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"431668b512ef4e3d8bfd1a553bc6d61bf2dc9326b5317210d8dc18e3a8a34a10"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc36eec1d8b1bb219324c5cb276555f0168dc623bd988e187ea04a7c70140fa"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc28be009d94a9cd715de5654ddc12a5cc9fb86255c3800c89d48b4016af2bf8"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"2627ebd12325d382ed6679e689bfd12d0b13f7f494a9cfdda7a780660e8695b2"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff4fa7623782bfcc68b5728708726768d1d972d4d253b8aca9eb3c93b4f9ffa"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2000f66226beadc8767b8e67af9c77a6dbfaa94f89fdc78e0b5713d9da4ef2b7"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade4ac3674bb12fc7c9bd1ce44f08638092da3f2c6052e9c71185d0451eaf6ac"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b1ad38beb8b6bee00818597aff374d712cc1bfd220d2b5bd8499a59f5bb3c0"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/GeneratorSelect.vue"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f1d3769b185d50b08bdeb0ffd51bcececb498c3b5a5ba6c520e1c1121101a5"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/GeneratorSelect.vue"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d2d773516bc265afbef4ff3a439ccbcec5258e9d2c1d2e7238f7ccb13c800a"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":16050}}}],"partialFingerprints":{"codehealthFindingId/v1":"047e52cf36783e0c188f2ee442a64269ebe5e3aecc6a3125a5ab91151213f584"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridColumnHeader.vue"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02c31217adee4b3523ce7207b638a124d416c9569c6716b4feefcc0b0fa4ac7"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cursor-pointer with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridSearchBar.vue"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfd55272b72d3b5c5734dd65f91756a188060d0639a3c61b70bd11ba2a9cf56"}},{"ruleId":"AC4","level":"error","message":{"text":"Focusable \u003Ctr\u003E isn\u0027t keyboard-operable: This \u003Ctr\u003E carries tabindex=\u00220\u0022, so it is in the tab order and a keyboard user will land on it \u2014 but its behaviour is bound to the pointer only, with no key handler. A tabindex makes an element focusable, not operable: Enter and Space fire a click on a native \u003Cbutton\u003E or \u003Ca href\u003E and nowhere else, so this can be focused and never activated. Use a \u003Cbutton\u003E, or handle Enter/Space in a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTableInfoPanels.vue"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd36b471ea512ecdbbcfcc6d67e7e13e37d779f3ce7f442a702c6fe7f64588ab"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cimg\u003E: This \u003Cimg\u003E binds pointerdown, pointerup, pointermove and double-click \u2014 pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex=\u00220\u0022, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/ImagePreviewDialog.vue"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2789ea222b0607a47392d2070d63be0471011fa6815c1fb277d1c3e8645e3b"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cdiv\u003E: This \u003Cdiv\u003E binds double-click and nothing else. No click, no key handler, and no tabindex=\u00220\u0022, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/AppToolbar.vue"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf7bb66c611d9a5f8365790de89c389a4fe00f5074253568057e571bef75d15"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .app-tab-scrollbar with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b90cd48337040dc50b31e35085be48b597dad4b1b5a3130110b03cce5cae7f1"}},{"ruleId":"AC4","level":"error","message":{"text":"Focusable \u003Cdiv\u003E isn\u0027t keyboard-operable: This \u003Cdiv\u003E carries tabindex=\u00220\u0022, so it is in the tab order and a keyboard user will land on it \u2014 but its behaviour is bound to the pointer only, with no key handler. A tabindex makes an element focusable, not operable: Enter and Space fire a click on a native \u003Cbutton\u003E or \u003Ca href\u003E and nowhere else, so this can be focused and never activated. Use a \u003Cbutton\u003E, or handle Enter/Space in a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"0436bd5c30fd804c9f51f6476e30e7d71a0435e3b6dced8ebbc39ac2aba10668"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cursor-pointer with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlSearchMatchSnippet.vue"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80d789295409bca827d98050a623e05a54bba4ab67170b44750cfd3b65f1d91"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctd\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a97b1791db080beeeaa5f515543c17a57cbeb0638170e50e1daca9e16a41e4"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"0300a3d8697dba7f38a61f185e8aa9b436c4558c055e30def68257f9453fd5fa"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cmain role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/migration/SecurityMigrationWizard.vue"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf266c1b024730c944be0a888c0234d8e1be6d9384f85d925487361d6a1dd82"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7e1d1b41105313445c44051ea0b7f7ff70f4e562cc59ada3484cebf96e0718"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abb1d555020641f926c8028ab2f5e3741896a9c7477f965c9b86960deb26433"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/KafkaConsumerGroupsPanel.vue"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66896bbfa38ac87a0af9a21290ab0246e3436035c4af7a546120bd13fac3b11"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b638ed7d817e5cce6678bdfcc3a97b40303670429870ca335a944279de1841"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MqAdminConsole.vue"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"268a598721889e1a129e8f7fcb47296bad8c7ecb055770de589ff303554ae573"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/NamespacesPanel.vue"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1e5d783846f75ad1cbad2ce0eb5a4879fa51edaa493e7261467be4d252d264"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/NamespacesPanel.vue"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"425deb7ff8354ebb09c27cc385c4a1a545d4925e4f167e5999c2835b885679c7"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e35d0ab3d5c3669cf68f492011e54f4c2d3ddb0697b51aee43a0b1b8865c1a4"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"163470454506e6697434932650c0f717e66980cb349318cb942fbef30220556d"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67835bea28b9a6cf387b6cf7b82431f87385c4bf5b45ef919042eeb39feb884"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c83bb6b5d569c59b97d69f83521775c170903c365d8b4cbcb1fc90cf5055c4"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7803541485ac22c2aaba68df0cb2a5ca2fbd90a6d7a0c965677ff3c7ad5c6a"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"15116ac11428aa32df99751d807e3acf1e0141af2feaf9508d424041229c7d52"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f3584f281e227b9d62aedd237570662001b96c0beb602185981f8e27a26867"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqClientsPanel.vue"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e778af8c5a61d32a66a65984ee938c8ba009d49f4aaf1662e3ec3eae7d1d8951"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dacc0a7f8b43b80a0d7180f6a777e035b7a42310b9f499f75dbd2dd36602713"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e53556488430358512e1ad341cedf6d3b78bbebc638c01806d1d7a8fef055e"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b6aa442df0b9796cd3680bdfaa9e1aabf59bab5c940b499cae77d42d96148d"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed98a262093a972176b51829be7d62edb1542c064cee8dbe442fa5c76258b966"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"362d8aa93116423591e8f95bb38dab5011cb6f127a0a3642547f101dc0eaa72c"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ccddbec60287bb9abd9a1064e248d57fd50eb8d9b382efff79c9c0a53bf8ef"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cdiv\u003E: This \u003Cdiv\u003E binds mousedown and double-click \u2014 pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex=\u00220\u0022, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8e35d6b19a244a2b63844f301bf5162e0e42dc5d2d9dcf038bfc4e068044a6"}},{"ruleId":"AC4","level":"error","message":{"text":"Focusable \u003Cdiv\u003E isn\u0027t keyboard-operable: This \u003Cdiv\u003E carries tabindex=\u00220\u0022, so it is in the tab order and a keyboard user will land on it \u2014 but its only behaviour is bound to double-click, pointer gestures a keyboard cannot produce, and there is no key handler. The tab stop leads nowhere. Bind the same behaviour to a key handler, or provide an equivalent control elsewhere. Give it a role as well, so assistive tech can announce what it is."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0e28f04560e61be083f21fcbf3d28f3f7d2f886d509fe30c66ac6fe242ad4c"}},{"ruleId":"AC4","level":"error","message":{"text":"Focusable \u003Cdiv\u003E isn\u0027t keyboard-operable: This \u003Cdiv\u003E carries tabindex=\u00220\u0022, so it is in the tab order and a keyboard user will land on it \u2014 but its only behaviour is bound to double-click, pointer gestures a keyboard cannot produce, and there is no key handler. The tab stop leads nowhere. Bind the same behaviour to a key handler, or provide an equivalent control elsewhere. Give it a role as well, so assistive tech can announce what it is."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee0b0b6e411c4ad13163de41f2b32d6e71f2d23a19f4435666f8647750ab918"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f7addb3843d1390b0db17f728f4ade3c3e84afab3e5768e09b6138a67de796"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/quick-open/QuickOpenDialog.vue"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"b536434e3688b27b7cae8a16d3e9866aed6feafc3654e3a5907c6f266b08ae69"}},{"ruleId":"AC4","level":"error","message":{"text":"Focusable \u003Cdiv\u003E isn\u0027t keyboard-operable: This \u003Cdiv\u003E carries tabindex=\u00220\u0022, so it is in the tab order and a keyboard user will land on it \u2014 but its behaviour is bound to the pointer only, with no key handler. A tabindex makes an element focusable, not operable: Enter and Space fire a click on a native \u003Cbutton\u003E or \u003Ca href\u003E and nowhere else, so this can be focused and never activated. Use a \u003Cbutton\u003E, or handle Enter/Space in a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisGroupHeader.vue"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a10d83f44b86f433b2f8d9593a249254c28280ff264e8e1898e85b295088bae"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8c138e1faef524949bdf41993b35e538d64d57ccab128574647f1a4cfddda8"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d98ce0dd6a36beae957e4efc438426d985a0a025276641402fe5ad4ea26ed47"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilityBrowser.vue"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8af87bffaf1eb987b037a60b6ee9bc3041d2452d9ba1d8f940bde781963934"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilityBrowser.vue"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f932e98066fc9aa30d6a9086aa08a12228900b5ac07ef3eed484bd4375f6d0"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2f43532d0fb75c8e1dc2e4d052abc13d0e2b5b5227923eab7fc45adbc033ee"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable role=\u0022option\u0022 that no keyboard user can reach: This \u003Cdiv\u003E announces itself as a role=\u0022option\u0022 and binds a click, but nothing can put focus on it: no tabindex=\u00220\u0022 in any spelling, no key handler, and nothing in this file moves focus or sets aria-activedescendant. The role tells assistive tech what the control IS; it does not make the control reachable, so a keyboard user cannot operate it at all (WCAG 2.1.1). Give it tabindex=\u00220\u0022=\u00220\u0022 and an Enter/Space key handler, or make it a native \u003Cbutton\u003E. If a parent widget owns the keyboard model, that parent must move focus onto the active role=\u0022option\u0022 or point aria-activedescendant at it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/tabs/TabSwitcherDialog.vue"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef3792bfe575720d467b5497ae55fd3eeda8f781643e586670e99fb72cf294c"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabindex=\u00220\u0022, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabindex=\u00220\u0022=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/CustomContextMenu.vue"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad354ad68e20a15d15e412c7a9e02894ba2c05d74b28e220e63a97ed469856f"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cspan\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/LightDropdownMenu.vue"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae33a5c9d8df206d425c5fe79ec3c64e9e6c60d8903e617ac3f5b8a6dfb55ca"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabindex=\u00220\u0022, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabindex=\u00220\u0022=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/LightTooltip.vue"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cacf2a5e76fa57ebd8d72cc84e6a820453bb87beec7d0afc12ee19d028ac142"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cursor-pointer with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/searchable-select/SearchableSelect.vue"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d116c3fd6ac756dd491cb8a580bcbdcb45903669615528371748aacb2dcdf9"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/NoteEditor.vue"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7474b47a51f1b2770953aa94ad79c8bf052b8ee73c5f1e1db93e4d73a3e9681"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Crect\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/SchemaDiagram.vue"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a0a4f57f396d12e34b959259186932904302538eb91e95ef4243ad4a2c3ca0"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cspan\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/plugins/[id]/PluginDetailClient.tsx"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"50039e01b243e1d81bb41d49d6a4e87819c739d43fa17f9abf2c2bca5732ddb1"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Csection role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/contributors/ContributorsExperience.tsx"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51f663b4846bd737f6d5b9062ac26bfcd84ed0be6326eaf430d8ccd1428d79d"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Csection role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/landing/InstallTabs.tsx"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4a8c6d69dcdbb75c4cc1a3454b1d86d84c56a931ac41c1c3c67fb37823b55e"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-hidden hides a focusable element: aria-hidden=\u0022true\u0022 here hides the subtree from assistive tech, but a focusable descendant stays in the tab order \u2014 a keyboard user can land on a control screen readers can\u0027t see. Add inert, take the descendants out of the tab order (tabindex=\u0022-1\u0022), or drop aria-hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/explain/ExplainPlanNodeTree.vue"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce32b7d6e1f1084ebfa7b5e4dec7dc9641d243b80a1045c2ddcfcaaa7717b8b4"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-hidden hides a focusable element: aria-hidden=\u0022true\u0022 here hides the subtree from assistive tech, but a focusable descendant stays in the tab order \u2014 a keyboard user can land on a control screen readers can\u0027t see. Add inert, take the descendants out of the tab order (tabindex=\u0022-1\u0022), or drop aria-hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":15931}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cef6f4c159f916c1ecf435245c8e5788da3422eecc10d32dc249b6b28a45fb1"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-hidden hides a focusable element: aria-hidden=\u0022true\u0022 here hides the subtree from assistive tech, but a focusable descendant stays in the tab order \u2014 a keyboard user can land on a control screen readers can\u0027t see. Add inert, take the descendants out of the tab order (tabindex=\u0022-1\u0022), or drop aria-hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/StartupLoading.vue"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde61e2cea5f8c90ced47c70206c7545bc52bf1479cd3c5f72a1e12e173b6350"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-hidden hides a focusable element: aria-hidden=\u0022true\u0022 here hides the subtree from assistive tech, but a focusable descendant stays in the tab order \u2014 a keyboard user can land on a control screen readers can\u0027t see. Add inert, take the descendants out of the tab order (tabindex=\u0022-1\u0022), or drop aria-hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginShortcutBar.vue"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d57a5e0787479bb9310af2d44bef75b1673929cbfb685eee03cfce52fed358"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-hidden hides a focusable element: aria-hidden=\u0022true\u0022 here hides the subtree from assistive tech, but a focusable descendant stays in the tab order \u2014 a keyboard user can land on a control screen readers can\u0027t see. Add inert, take the descendants out of the tab order (tabindex=\u0022-1\u0022), or drop aria-hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilityBrowser.vue"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cfc96f1c6823487ea74e2630a75474909ca45c2356da140da10d01967f184a"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-hidden hides a focusable element: aria-hidden=\u0022true\u0022 here hides the subtree from assistive tech, but a focusable descendant stays in the tab order \u2014 a keyboard user can land on a control screen readers can\u0027t see. Add inert, take the descendants out of the tab order (tabindex=\u0022-1\u0022), or drop aria-hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilityBrowser.vue"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"743f5f6e725a40c971c970d8ac0e0449f0c84a875800b1d58564bfa9fc1ca6da"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/AuthorizationScopeEditor.vue"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"095f955ce053aeea81ebc995dceaf7b53f250b18f061615f4194ee1318c2e0ef"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/AuthorizationScopeEditor.vue"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"988be428d2a66f79ea2b3420794f72d5ffeab6da6a61d9a5a3ddd4e13eee87f5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/AuthorizationScopeEditor.vue"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"088ff0deed0573b8a9d84eaac981f5ae2a6ee4f8f1dcc05de96cd789e8dd177c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/AuthorizationScopeEditor.vue"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c884d67bb2c41881767d437a3b473f6abf1e45fe3420aff87966f598bd104b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/AuthorizationScopeEditor.vue"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d16249941084a2c1bb73cf968a82593f1bce8be3d60dcccfde53ca161c0d89"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengRoleAdmin.vue"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e005008dcaf0cf663475df8f4f49708ea26a13935f310ad74b35ff777adac95e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengRoleAdmin.vue"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5469fd6daace408a45bafd562b3b4c9d65e3af3b200e09d90a1a1135ccda8a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengRoleAdmin.vue"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0df95e8ec91de9ab08a8676a33492d51cd79eec454c818c81351db59218d42"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"7413d714958e82b47ec9afc146544f6fd4c35922e97ac74b74b5fb6f0cd462b0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a02526e8a5032d4f66970471d4f4528fe0e6a28c6ac5a37c2904389c9e66818"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a11047dd24ec9bebf85a7311ae74438be04b607c477cb23c95661d1e5b5467"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"6187fbafb6d45f5858d910839a7f5150a4bb3adf3b257fbbea024fbab48f5e87"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce78b2dab7e1a6951e4ea9aa344722db9e6d03e2c71acbb20fa08fd4574d509f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe88fe6d9e094298cf5db206f85ea36b78f6dd55d15a4c5e129cfe9a1058426"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b80b1b8e951b3e19680dac437078807b674025a3ade4908f2a334b3318c744f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5b727dba34a7607bb057013ee796e9736b33f9d8fc7c5b11e8da85364c1baa"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c97f745ac518a9a2e90244187cdb935a97669813764c345f2c479ea1b3996b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1180800e8ed1f8817440aa599f734b4dddf57e504fe4e042c730f9eb54ba3df"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d450980ccc1200c2678d2fde4c4fe63ed3b76a49a6d421a56f34b4c1fbc62bd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d25ebeb6222bdf8df24d1f01f5eefb0c0a10ca16fd0f67e88e22c3193b0830"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13c0a14a68867ac96eb23fae4324103b48c049b038d9ab5adef7efa45866127"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2be3411824aeb1b63ab4c88c180888df75630c8ca9579e6e331c0680176ec18"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/MySqlDashboard.vue"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a143d652b67bc6e6104a38ac1b22700f69b436872b11d91852116e3d70a1a9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/MySqlDashboard.vue"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"536c85f1fac3f58960b01d6e0d0482a1d1f39398ef6c0ed52e2ce10cdf93ee73"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/PostgresDashboard.vue"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b25461d0f76688efecfd83ce5adc9f66355d5e69899e21a5a40d34c11e160a1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a256b895e4064da57ed12bc1147791a1d11ee84d9bae21bea245470b2e321e1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"947230d08a9f674f588625f45b38898ba9fa9d97915139830ef181152d45df5d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb9e0c748152848937e357c35dbfaaa224cda3862feff9e8541c0d698d98afc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cfec6596f754e9af4692d98f074e5c4f618f90c769a7914e55c744cf993bf0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42294f651fdeaa93e57cca17e23dbffa19e76e6233ea8d768d7544ec0a56207"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8a23fe2307b3574617859c8b0360fec78b9ff0be0f25d9712cc37c582d2abc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"3800ac7fbea258661f233b7e6c1981c239646bddd0fa40504bc847edcd53f835"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be3c816adcd43b552b2e778926a440c3ebeb2c7958dd5f2eb17d73f097cad30"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/SessionDiagnostics.vue"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ebd049b5d57506263bd25244fd7311f9040052c4d77af09693c2b1aad24c3c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/SqlServerActivityTracePanel.vue"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdcfe903bfa9c95b6399df1b2cbe2e06845b3b3d908a35912185733d62151b3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/SqlServerActivityTracePanel.vue"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"32368889066b0173c55e41ecd746db4a85021ae72797d7839ef080012bf128fa"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/SqlServerActivityTracePanel.vue"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61ef46356d52fdd897a2762753551136156cf59c1b8161fef7ee0b56bee7025"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguServerDashboard.vue"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbf2bb632f795e5df850b7d4a0c0512d0e6a1b51f08605985a2c48188d9042d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04aa88b80e417a4e95e3fd1ae83d65b9e574a97993b92e723cf2813310bbd81"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0038456b434f39442eb516eff88bc80aa4d17ce3d8c52b4819c19dfd9ca327"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf72caef4da0471568b223e1e96ce666f9d7019bd72136aa018ec4e67802f11"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (3.2:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ai/rich/AiHtmlPreview.vue"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f0270673534bf2b56fd573425d9a9791038e640cd1f9ea22b08e7310514541"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/auth/LoginPage.vue"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f05ca68f3ffb77a7a47a88845fb09bd8e7de8f6c59e5d77739729934dcac30"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/auth/LoginPage.vue"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"89163f2aa835ffaec4b1d8f867d7a246696765f57ac21d2ca296646ec1e5cc62"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"19190cb618c3b8f6a1940cc4ae7bbab892657d1e5671433e2dc13c9d749c4f9b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"512c8c4979819e491fb7f5bc3fb368df6199de677d7ba51472799bc4ccff17b5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"184bdaf81f15982115fee09b2f239fcaf00aa6afa6effffd3acf9ec75fe1b695"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a78af7d3117caf30856f0936205b8794ba843c17a789535ff0874e93383b02"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"c937d212740ff1bc122ffb769bc2e7a69a91844ab38ec29092a4ae8b7f9d1bb3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d655f97fbf259fb2d89c24448bdbacf74da2586ee8eb715c00143232a16ea5d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9199ee6b1ddc73bb102cba8a24cd7fd4c6d065bcacdfc0d57b6ac27a8574c4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e88d0b1b0d7dee4ea73f3b5a29b1325d6c35d4d27ea0a89a68bcdd1bbc4052"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/QueryLoadingState.vue"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbc05ed9d25fe6692ab295eb47277a9276a2e320c72461b38353dfc46e8b833"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/QueryLoadingState.vue"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4843130a63b506ab0991459f3df71adef4d15c02c687e42ad212e67e7e67ee5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/TextContentSearchBar.vue"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb985bf89ffb848c0aa9103aed33c546d6e190a8f10cff29f605b378720a1870"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/TextContentSearchBar.vue"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"963ef781a3c0e6029143f398c0139423a908972e6375b3e5bbd7d9f803f1b96a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/AgentOfflineExportDialog.vue"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1112a815f6c9ea35fb651a0248c8c17e72fb4d7d2a3434dba532042b21a4abe8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/AgentOfflineExportDialog.vue"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ef7f4c6022d71241ae1f410a4ef69d83d14aff0619cd6a2cf113c9da4d064f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/ConfigConnectionSelectDialog.vue"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e4c31c4d509f1a38fa5c9d947dcaeb4f876d8b58815421ff163ff9a41949bd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreAgentRow.vue"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"898572c1224506b98195c766d2643153d934acbe33aa18416ea029b3dc2f9592"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"397cad5529c0e0c07bbfb93b7602c224e87831822a19963d5fb6d7418c2f6548"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a8f709e6eb9e653a4c36007b76c1ca6911a4b7abecc5b8f954d5ea13d04da7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e4db7f5a01b686cac202ed82ad0ec20323ebf5940cea2c70e69813db6e7833"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18b749d07a35bc623314dc9ae590a75aa808ed4f57a4bf51ddd9f8f38c88586"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24bd1ce829701a6ae89dce687744e4c6404676e528b1bc467f4bc38c8c4abc9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"7193c57e86434648e52b965b894f6cb5e85ec2ba93b1ac587504e1e265ab250b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34d6f7222d3cd087f76f54cb013511026d4480b9d00b87bc237e56b36922345"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionErrorIndicator.vue"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b55234ae15dd7f7a327353a9510c7d113139c28529f6df76ca59da7b223848"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/TunnelProfileManager.vue"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"0379fcf1a86d39c5c5b5bdf9760161df343fa6245fad384c88a249996b55b509"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/TunnelProfileManager.vue"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f370558f26ab7ca541c24f53201e83313f20e083df2bf4f8460894b348bf93"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30ba9d80a03e3887e04a0527a5501eddc423bd0b91e3afaea80c1f1c0dc62c8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5db9c763b3d3cf076ce8ee975168bd405770c414ee397eaa266bd3d690ac71"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"679655b0559f99976e225f70cdba96aaf20aadd612bef088fcf36ee10b3393f7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fca90b4b039b9b414610387c57c3468652f179a8c5803b14c117c4282b49cda"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"5810b7573bcc953a413d0921b98379ede820b9c3de5f5773d70cfc608e753e9d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d2aa4d72310289a0f74b692a0cce7e8f85839967f379e98f1f8b5e5a664610"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6eda5fdbbddab667a44975971aee1d92621245a705042fc0b2785234047afc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff1026d7118066f3664b85e1891e9ea81d044c986db8d5fefb2b93f0efcf7fc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82afc59d4ed79439e58f0b70190fd27d4440a378f814e3bf95fe377de677ab2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1436a4ac4526f93b8857e165b8c969e494dae9890c619b29ab2227733f2ff68"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"20405a2d122197902b2bb9feefe9f44fcc30738808d42ac6efa56146b2e1569f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e6bd15895b1700db29c72f140f76c326b50e03f9d0600801e8852f5dd29d02"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"45710a8ce182a9c93461984a6b43ec56f302d4b401e2573caf163493d3e38f88"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulOverview.vue"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"838ab94297539309129d0ca36442cc30c118c2007b300ea85c2f7bc796d8d185"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulScope.vue"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c79abd9975160bd0e94f01664960a655db1952c10976dd43d280a500f767ba"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulScope.vue"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d135981e8b85f92faeaaf78132d8c9178892800d46171c41ad5d044a42742f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"353e9dd17b2ea9f36d2b716baa586f33d64966a6a5c12ee29641dbb29cb40c8a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca874dac12fed1328249687fd5b82ec1c26d46ee2170502f5a35e11a7538203d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e12ab5e7cdb325e197912af3a0a1cd9e220a7b4dbd13fa5cc48d5087526972"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a96519921850d0bdd913d377aa99e5fe009740989334026a0c13de7bdf92a4a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fb52daa5ec31ad3e52371c7d8d1c540b221eb041607fdc23a56b0454de95fb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"14658957a4b2e7ee2ebb3fe52661010bd4f569f035eef399df544f7e1015294d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"43563aa9c1d858691cb412bf891c58b2277243d5dd3d3d59b7ac71adbff12fdd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c7db13acf9067529e34ba891a2d385271d4736680e1ac8885587f0ec3cee8c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/DebugToolbar.vue"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"acacf61b1a81056be134b42f7acee3eebf211d4a7991d2b1105336603ca0a50d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/DebugToolbar.vue"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2762d22b738a7f5408d7eeb6178352f619b82b9e3454bed632e70a5a036ee17"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugSourceEditor.vue"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaeeda9e5189096b8ac03ff7142eed94cff0c9607b4d28bbbb7bf26ab2bc184"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/DiagramSchemaSelect.vue"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ea91bd17698f2a88890a0499d541a32eab028c245ad5024082b7d4a75bc9e2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/DiagramToolbar.vue"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f85b858b05a778ea9520c7662924abec7aa9f2032099928472c728cfdaafc6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/LayerPanel.vue"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"75623fdf2d54ed7fd387bf1c03b9fa75b4d1d53bcf68f972299ef76870d4226e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/LayerPanel.vue"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4d95b7cb04f58e332f61c6e1cd8e99445efb4e6fcfd47881e0e9646a2f7028"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c83fcf8023914391a7e1bfe32bb786b2119be64f17cfee1126716f0322ff43"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f21db80ebfc7676e2b3214e279e90c60015094fd7d54d864768f689bb224f90"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (2.1:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"47350ad2be03d8887766eba53249b6d945b2dd1233954a52e064e3f70133f7f0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.1:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e906b84a17ecebd6c832fa1b4edec69382caa82ff81de8a0036cad7d0946619"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDeployStep.vue"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"845ca747b5097a412b0651c762907d34dfb25f10550a34be708b39258c978119"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"572449987aca07d5dfc5c707ce04c77d5d5b0c32505df3b45f1621cef3072fa5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":2018}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffacbe4b0287846a69313926c276f1907d5fee1abd2ce85f9d4fdcd080903cca"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"597da201b8a10453f3d38523152e4a9a2ecab7133102b4dbcd80be3b3b97e7c8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloadercircle\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoBucketBrowser.vue"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7da153932910e40eedb1973b4b6d22c1fdd1cd5639a41ecb03f277acab2105"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoDatabaseDumpDialog.vue"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3951fdf81b0996c97861eeecbd60382a8fcb4b601fc0d8c532094915de3a845c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoGridFsBrowser.vue"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"58990e333a52289cad0a9900c869dea5a76579586e3a15eb68ba324d4fc4e375"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoGridFsBrowser.vue"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e61953c1d5fa80c6d3004a89b393dd01a049a101dc2774fb9a8a7d5a235557"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Crefreshccw\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoGridFsBrowser.vue"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"511ad7ce15dbb8879085d61674d4d96843365c9778b202d3897bd24b0e244ced"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac60c9031b5522a2ebcbbb202978def2d4a1770a1147fac0713b676346d346f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f0508982a2b51633f9daa15782d62da742657c8b8f2947291f4aa267cbe2d8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49a604466f4bc51f9ff6030475c745aee7f4b20ff03375887a944276781b153"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltDiffPagination.vue"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f026de6b2d55b4bc0430cf55025022447d81473d6b7c5b56f0a71b5cdce686e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b88761219a2de3d0e8d041e515aa6d2e7c840b07132df957909c204d4d5039"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c616b1cedeb13142d010471683698520fda6fb186b17c1271b71c95bb4b96ff"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de51df74c690b26bebbf03167f9cdd42bfc9045769fa592835c34adb5bf4cf2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"46049972d3f6209aff31258d56e0c50178f3a5ff2e7380eaec3519edbfbf06d9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"685355f60df9459800edaa2ed99df24f77da7dbaec523b357b6afd41d6b3f0b7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"b535152e8f248f2aa3500908cb33b8252ffdc60c7825510af2a68647ade4ccd1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8acd0ca47d317017fc3860d5de92276045ca03949557b9c63e2741c844510b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5050b86e69c9f512e29bd3c6c0710f64d9c222917572f4d93baadf845fb392c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac072516e4234c44635bca0c4e0915c5f990227fb788a3ee9e2597a2b65de7d7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6780}}}],"partialFingerprints":{"codehealthFindingId/v1":"3580869f0e62c5b461f86eff2de877e169908ecd1cb7f1c68507c75c42bcb9c4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6827}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d234dcd5c46ad1ba4719d2aec38c56cfeb43d6df606e8c834f7d9b296a0c1b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiToolApprovalCard.vue"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a6c8970cfa8c36bf3363a93104d098a82a07db55154a9449292f35b4858b7e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DangerConfirmDialog.vue"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7ef148cf9fa8951e7f883d8a9d6a2f032af6146b60b4d6ea27be7c095758b1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DangerConfirmDialog.vue"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd31b9726318a5bd3a0a85ab0d3e0372af583bfb88772220c9dae97f23c1e7c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorGotoLinePanel.vue"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"389ec1820a9703d02ad086c47c479aa93d247dc636fb5f84dfc4dbd23e86abdb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSearchPanel.vue"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee97dae1516db4a2703ae63a9477538844dc62b5a1caa31fee3fd4a0e76dbc2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSearchPanel.vue"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed42461d112de8c58044c6ebe4ad755a2cf275f15af2ebadc1ca9fa4c8f53103"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05728cdb673ec15a6153bd03078bd838eb1a47f2079aa898028355a790c0620"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12866}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ce626e9da05ccfe21cc70937939877918dc5ca4db5e7be2943b0da8c29a23b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12880}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a87b91b12bd774dd6dedf21a2db933809047d6949e9f3aa54034529492303c8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12888}}}],"partialFingerprints":{"codehealthFindingId/v1":"3257c85142ee5bf9d80bf5612ccf747676f48a63393ddfcc7962cd5512509b01"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12907}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee52e7c053174b3a6b693d95172830e19a6a6368b46f62e827bdf5330127485"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12928}}}],"partialFingerprints":{"codehealthFindingId/v1":"1982768c4a49881c7e059abce7fac889d10927c9926c86ce469f3a4d9b043941"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12933}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ba2e112a72e54826614c41554f52d3465bbbcbccde104314fb813bd0bfefa9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":13176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b29b30828d4459354dcb1183bba202ef96a683b40792ba5df9149d522b98020"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d9643b956e14df5d12cededbad5b242c2eb5ddb2f942c2914901950d69e114"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"85933f1659940a408663cf6705348fc17e2ae25fc7fff21a11a3039ab5292094"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c60c46fea956b9332caad20a495a8eb6865f24da0ea2c80980a5219db2f894a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b30b8926487074e054c7e9ffeae90a753f1c3b9b7743f4dade3855a58c3b10c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5275c4cbb1add1efcbded23cc038b23c712d1bc093c97ae82369c4740528ea"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a8ac173b12fe4c45a8d27e147cd29fd8efc20410d798fde583b8e98f3d876d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloadercircle\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"65029600e2c01bbd3c4c872587551840e0398859a7e7fe027996afe6c0ff49ac"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloadercircle\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f0f87bd739f9bdb0d4cb9e4cc3215e7348afccd8d7704c2a3cbbc33d38e6d5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cpre\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlPreviewPanel.vue"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20da139c2b98bc3f8d00f687619ef5b4bed4692f4b6db8bab737f61cd95157d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cpre\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlPreviewPanel.vue"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c2570eb7d24d50ec7afd9f53d450f74523b31261ad0ac8f1a7d88d03923da8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/TableStructurePeekDialog.vue"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdb8a363b3d614201304ec420e2e1d899eb6a42b5acf2d8bdd4646c34a9a59e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"54731d3d3ec5ac6b345eaed011885edeb23781ad4af587690d91e979bfd0e973"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08cd4e5a086ee067174ecf012886ae5df55e7709bfca5fe79b4c1f9e2733984"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAdminConsole.vue"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"17386e8dae03ee126df25b17f98907ba798aeaa38c5a48c53862430f79225b14"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdDashboard.vue"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fcf3b0cd53b4b20ed150e4086c00679512f7a5e79daf65b81e91e7e8f5152e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdDashboard.vue"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0cadc49408e7bb757d245ce48ad92c3036878bdf2f6ca5f0df7c6850ff2d70"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e046f379e016ef117c19f56f5f83e6414f03d0323717298d101711bea1b07d31"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d54c455c81d41c209155d1744eb6277730c15556882337168f6e14d21462207"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2663c74a1b9135e9a205ec6d24eed44673f6c47c21f8d20952d140113eaf0903"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e10f95634645f312f6f82963e30f5f1cd9c036a327da153c5ff6da2ba53ae21"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ca905832b51d5797a1e10577a73b09971066683229b4b62d002a70692bb328"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3db29149750971fb42073b83ea35fefc154e24f6b3f640c6ec7fcc205c8e00"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"388c3a1be73fc5c9c1b1ec96a7e63a60d59a30bf1d6c5326ee6866d7539163c7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f117671bca1392f43beee3f9661f06b4edfc1d8ab8e0fb713b9a10d9f036e0cf"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fdf5330b9012ef474db79dd09910dd2e1e8ab3afe2cc839387e27436fc6c2d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":15577}}}],"partialFingerprints":{"codehealthFindingId/v1":"205702df65641000d2fdee5141c322ae4dc2c1e1f729bf4e471101e062f9f590"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridBusyOverlay.vue"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18963cefecc796394dba030684697aaf88b002e4592962f30dafb8e613db407"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridBusyOverlay.vue"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a269897ab046ab4c64dc6c38ba3bb34dd6ff07b1dee37d7bcf3fd514a2e212"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridBusyOverlay.vue"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2054cb90f778209876623ad0c66d9d6db6d65e1206863d381e81164ae69c4a65"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridBusyOverlay.vue"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fa41b58a27c31dfae2554e4ccd155ac696e265921e8ec25671f934553086c4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridColumnFilterPopover.vue"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17dfac299ef34b3b505a780c81f459ff19b07e19c0484cd2811231772f2492d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridColumnFilterPopover.vue"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3672aed4c01a52f2817f175b14492067cd9ab1066573606735497b1dd86d7c3c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridColumnLayoutPopover.vue"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46098c4b40936baf8fcf11f27f09e487c62cc16ca3b4a9e3b44bb27cb936eaf"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridDistinctValuePopover.vue"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"376428aa838f28aebf65b190c91c398ae92643e6cf032b5bd26441110e8cde84"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridDistinctValuePopover.vue"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0f95f7c88b6c8fd15224da550d0cd3dd3c1250193fed0a33f38f4d1178fcce"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridReadonlyTextSelection.vue"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0b8683c1b517b8bbfce5010ddf69dc514a31c1dc7ae1021d83b034cb4480ec"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridSearchBar.vue"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcd8569747f5b9d9116f87c9f5662092bd9d1f61c43dc70105cdc430187d486"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridSearchBar.vue"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eea916230ef1486b4f11b59f5c795270904e313d0be2cca112218fe0bef3576"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTableInfoPanels.vue"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98f11745de5af81493a5673edf082d1e360d60ec969d6ae96bf18953651fa69"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTableInfoPanels.vue"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b2690e7944e49d7f3ccc8ad402ad3cb77f93a2c021554f7e99830638f95395"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTableInfoPanels.vue"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2401e504ccc9ed6b1dd23ef116841fea51dd610335d606989d3798885ea7f2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTableInfoPanels.vue"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"965b648dd6112eb12c0cdaa7051cf1692b70e0d71c28e29d124ca08cd2a400f1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTableInfoPanels.vue"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fc8002519e394ae7924578a43467a9b6eb3adaf1346a2df267b08c2899b3a6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTableInfoPanels.vue"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c880e2c9d3147b3f77f83235593035f4be54c075fb0d6cbbed27f1e49cb3befd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTextFilterWorkbench.vue"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ceb1516f7bcce2406710b14e9583476f9f3a9691eac2bd3c05532277e73e62"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridTextSortWorkbench.vue"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8923dbef2ebcc70570ca40bcbe4f5cdb702877c791479d743a0f1f1abc97399d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridToolbar.vue"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"686bece222117175f0df51c01b024836ddf3c3ecb2faecaa09787cba055922fc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridToolbar.vue"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a58cb6be78b5b1d59e8550e83dc394c372fbfea7962e5ba5cfeaa10dd6b38e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridToolbar.vue"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d543356497ba623ee66435aba9f74ec6bedd20a3ea9acefaeb166a288100719d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f88b3798856cbbb76369d7a68a575f1de916e16692f5ad0e7e800762fa01e5f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"194e7cdef26f944086b0b8c18b78b9071691d5fb37dcbf2d963e157e7fb886b1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ac4707246e09253897cf76141d965a360a4328dedbb5c3ec4eafc733626a65"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7491d6ff2879720c8df6e65fb01c910e7131afc7eff9e68ba6d279c983ecd8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91bf76f4648032da69c7b2ef850dbfc57e5aca9736c34d11e0ca6d4a7a8ceca"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69ebed53af6b219984598d09143bac5771b91102ec19c048812658211f9c41b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"440f3b10b2fdcd05524374f837fd92d933fb8df139f0c2b4968dd7b6f1f41f2d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f700bc9cd182679916693130bdcdec786c8a74dd75dd29830bee3e402ccb3b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"730bea700cb006d5cc48eda7d0b33f4bf51639498d4971fe667609388c6eb792"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"8457ed041895c39f3ecf8bdfd197d75ab72812faee1f4e9e4cb36104946c710b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66319c74f4871dc0df41e7037410f5db74c6ed5718f80ae47a6015f65e034a6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c532b29a2d6ec38d19a1c7f092879d319e3eb6ea63ab0931a0ce7c29a12a684c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96a2b0339954e01afc0a19ebffa5de43ba44a75c770887ce583be7da440c81a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c970848d6d41d15ce5e456cfdaae0ad15eab866505aa369df44eb9fb46cce8ac"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2370f770a646d6f444a181eae0d920be7bc70a3bdba1ff00ef0f5d16c7118953"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ad5c9a93bb33313ac16b104e5879c3c9794fbff7e64d66da1745dcb6e69f5d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/hbase/HBaseBrowser.vue"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e8fa73fc18d455e3ba2ce2f3ee2f7dbd07f87600d2992c12c01ee565ec2084"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/hbase/HBaseBrowser.vue"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85c2e186c44c15fd1d8a0c66e909d9c4b173ee47eaf4586b05e8e81d5512a9d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/hbase/HBaseBrowser.vue"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9a7575a699592ab6593c64198b0420b213d3418d5072b56059990d4a2d0570"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d544ea2bf1ee510a17f55d9c1f7d0aa3fe8f037cf1bb756b61c4c47a3c2717"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"5597e0e363c27fcdbf42f514f684bd11e94db3bf740b38f99514d5c1ba4d75ee"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"828e3672518e4bc008a063c63155c1654938e82725632706e71f6028880dbd55"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c854c02f33a3fa8b595bab382f2bb635cea436aa54cadf56871e3c299bad9f97"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4ee62428c9f0153b6ef43b7238ab45780f8ae7c6bb8fb4758a26fc58da0cea"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3793c2596b92a195dde7d100693f595e1a71e502a89cc58bf9589867d685503"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":2834}}}],"partialFingerprints":{"codehealthFindingId/v1":"0811136272468594ad4a2551c050f5736c89a4ac7395e87e3e8bf58d0edffb9c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2ab57bbfeb17baebaf5219580460465ba2028e75ac28cea216c3c43c8325ea"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"533dbe31d758f259322f98f9aa771d3f31c9b46a05a4ad0d36deb10c9e7c8b56"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa55e9d8ed15e32b7c5b9703ed0eaf807998da8aee626caf2567fc5b75442d1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cab43a1479be7f95322f4a2ed3e2d542bf3258b4352653ed67dd5230282048"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e98f5aadcc26ca8ad2185876b28ce08d5ca22be5e27a3fe051ba160d243beb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0df0d211c6f023af2bcefe92ff01dd774ad1b0efd5f479cd394c96639a6d9b2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1da2037c5bafb420c30f48700918968f3e30132d222f7f10a165e7699eb386"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"e789b260e13cdecd1d72b6832c3ac0d05b7b99e83ca14b63b69c7722ffb7cd7d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (2.1:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/AppToolbar.vue"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d420c453ee2974f054417c5506da674819b93df8e625b327d67875f1da7f0de8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorToolbar.vue"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"968be6cef36a3839819f3a871dbe720e484fdce6456555180655163a6c6d9452"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorToolbar.vue"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecbb46bf36210e0d6fc9cbea38b4fe516fde7e328b0ae6d5cff3b80aac7f5a3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/QueryMessagesView.vue"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"040f2d66a4686072b1bfdf44626041da5291a90f6040b65669c1a35bab1fd9e6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/QueryResultToolbarActions.vue"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b621021d718e850875fbddfc243a7880ff0959385afca9d64d22ed020827133"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b9efe441dff4b468eac41302df761bbbeaab72fc00ed170610f1f071046f48"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/UpdateDialog.vue"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd152237c21c558c9bfea68cb17e8e37b190490da5da8eac3faa2d5b7016a5f1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/lineage/FieldLineageDialog.vue"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"316350c26689d776b4785ee4353b2e73b04b04de1fe30b35f0477d209b386a44"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloadercircle\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c10dda4ec3897b15c8faca399dd816d21bda8145a9de58d9c676d5cacf943e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloadercircle\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ea521d4358bd135b362aee330e887342a2ee9a5a30ebdbb5b81a7cbaa47d29"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloadercircle\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"4838a5757d07af9b8e015963bb099a6c2ab6961f714c656b4b2847848de49d68"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb50f43ce94acd279b9d679a1c51093e883c9db2fd2a5ed76c97742c9d364a1d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"9981af5375cf9578c341060e04972df21933dbca18e432c7bb18e4a3a7125f44"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchMultiSelect.vue"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f82291dea596e731d3b803bace32f421868b6db97dcae1b7ad65076f84097e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchMultiSelect.vue"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec42398bfce6ef01fd91034757dc12996ee2aabb86ade0b9dae91702f764e68d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchOverviewPage.vue"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c3701a1fa7bcf69520ee54c1b8d9b813a4e4edf60bca078225f20765f52041"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchTasksPage.vue"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85c08be116089839a8cca1416fa763ec8ef296f6031ce7d78e0fc3db84a3662"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchTasksPage.vue"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d2ae85bac7dcc2ecfa07907bd437b735d86d3c5a4128ca5057ea081cbc048c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f9dc4f78d68ed556e48929dbe7756a3fd27d9d8eb1abd9b90a28ae7fc8723a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc35de70b90bb267d1117bd8ec31e4cfcfe3eba2fd93f3b67e02b2d95a99b18"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf972a19f9a9578bab9123bc4fa10f96c38fe4d6871906942ebb1114f696e72d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1c85cd8e1e8b98296e65402337ed4eab2907bd3db5786c3737f90a90f6f9ea"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c63bff0bfe0338d4e302e039e9e827692bfe19341ef554903e3d8ceafa7872e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd29bdb7a35bafaf713ad1952f57f969b0bac3716a5e69992bd35f45915001e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3d2836e84172263f099d447ee40ffc606b854694084af8a5d900e491e6e1d9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAccessControlConsole.vue"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f66df79754df7ae6b6764cd368da44aad33021d9f444e47ff7bc7635b2edce"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"b090b20869e27598dd0df7939ac16f1f981a515f896c4680b159aba927be6193"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2941}}}],"partialFingerprints":{"codehealthFindingId/v1":"998284c21b0455fe6ba999086a1cbbf7565c33b3cff0a5f376bba155354a4dfb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3232}}}],"partialFingerprints":{"codehealthFindingId/v1":"244e67904f120933019b619aea95fa709dc29c47e4f6866b6e25716788c3d576"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3286}}}],"partialFingerprints":{"codehealthFindingId/v1":"710728e236c80a3ea2705587265db8c8ff89dc5d276b6dfd871d9a965f376571"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3448}}}],"partialFingerprints":{"codehealthFindingId/v1":"98df45a57f417605afa75745a9c4c5bc2351370d0e7b657870a182e344e5f429"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":3582}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1a89531e1eaa3a6d55b366670fee0c31ed815e6bfe063f0c31f580147309dd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosConfigDiffDialog.vue"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b4c6896f189cbf94f1d187bb70d6fd28e9a43d89f953e65fd149bec2e71630"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosConfigHistoryDialog.vue"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18c4102c997cb8eb12655d736b20fe9d8b599adce5a72d958a60a7f78da38fb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosConfigHistoryDialog.vue"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7304addec35848b2f3d56b37900263354b22daeec04d993d15807edd7e17f0b9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0f195326dfeaa5833c0410bd4a93bdb982854c217bbc8ea475b9623e60ade5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a734ed567ba1ba287e1749e1d2d848203740affeab4176840530ef6187f2599"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"b726207d61ee7964cd8ea4d2c95babb1672ff574edb08ff871b2ec65935c5f14"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosContentSearchDialog.vue"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a81dc3e42fd42f34a84128e3ce8f27e981dccf0bbafa27a267e79b03cf68f9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosContentSearchDialog.vue"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40f4bcba2b08c558e625d32188617854b8e5b9f0f9143b176601b50242c5179"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosDashboard.vue"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"174accf98aa4e3833eca12ac8636eaf0daab42a57fd9b565f8c0eb38c8942418"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosNamespaceMultiSelect.vue"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab345d1a9f2a7490b32abbc2e4d3bb40fdebdf832c587e2f1d8286d845e8259"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosNamespaceMultiSelect.vue"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"323b30ebfb6ec7e86125edf3dbd55907712827f60961c5ce7fb159e3aa44850f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"458bef020f212b9ba03f68f39f55e274c06e593442a7f6477ef88dde7353e02e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"31186417c72e42c4f026b9fddcd07b4ff0c46c0d099efdada96ecea1640d29c7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfa67729aaf458aceda505f0a6bf5e7316fdb7b48488aacd869b56c7164308f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"feee8d590b5c8d137fdfdb4623ecba7dc2cae40ba185db14b607a526c83c7d15"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dac328ac27cdee3c9be31d390292db6f27c661ad7ff23129ed70c62e1103041"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"a659d070199420e3e347d38a14d0a7b0914d90fb8169142c56b07f40d369dc3e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2a5bbeef90e916cea76deb2b02eea78bc54200541d3c6226be98af6671cc2f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ce5f9802e263e59918207f04205b7ca97c6faff9e05405c8ae91e417e42ea5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"817392abab56ae8a1bbb9a632b7bdbd764c7af833487548fdfa609df8c2aa30d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ElasticsearchIndexMetadataDialog.vue"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d74d064da91c5df5d0a1aa21b0639e79b19b6f4a4c771aceb4b7f69de8d3ca"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/InstallExtensionDialog.vue"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f920522f93b334b1c73f07faece55e8fdbeb8fd99ba7390672cc54f426a198f7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/InstallExtensionDialog.vue"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebe07a9e6a0458ec4c4717c12fe5532c753ee885ec9b9a51ef32f05333424f1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/InstallExtensionDialog.vue"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9074d78aa53c3502c57ead9e798c05574777e36782d5554242fbb1392133d53"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/MySqlEventEditor.vue"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2ac358073900f3b38c539197ed05b384484e29bf6f5a9a18ea1c6c86b7d7ac"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6587}}}],"partialFingerprints":{"codehealthFindingId/v1":"299adde483e70caea2c406abbd707ad8fc216d7763ea397b529a59b3cd32a02a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6642}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaceb4ba767ca169762ead300233a9ddb3a9013219b25962f100580b84764b1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6815}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dc4436fdbe6d855cdf6e93d716c5f23abab8703cbdfa7f1303037a14b68c20"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":7196}}}],"partialFingerprints":{"codehealthFindingId/v1":"329bc5c358c086d55592019be1fd16d412f982e237077cb19f15d81a12586581"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Crefreshcw\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectDependenciesPanel.vue"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4e23efb16f1dd3eef79b329b11e80b62066bf4946278e4a904d694fb2697f7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectSourceDialog.vue"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"6749a1aec1be49f76d479d3d29f275928c1e9b0d1224df2d6d191cdddcb2a9bb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectSourceDialog.vue"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"a460405af383f6eaaae0cabc1e4cfdb66d2f247b46bd345868d6a75ccf780ab7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectSourceSqlPreview.vue"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"968d104b01102c4caa8524e41ffbca379ee64cde1626ea1e9aed9a3fd4e0e5bf"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc3c23ac2f075b980fd2d58205a4ef6bd41b6202a29729fdb7651cebb1904f6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleTypeManagementDialog.vue"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3097e2fd8158d84875a89629545982b819d0ab3a8e25caa9df06129416e069"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ProcedureExecutionDialog.vue"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffbf5d5db07cad05e1b8fd4997a8f899c90aa85da38179a28096423cfceda41"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginAiAccessSection.vue"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0fdd621be6271587523183697a2522f44509fa4ed616e6cd2fff07fc6025db"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginAiAccessSection.vue"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9983393b3a699f87ae6807a529d8871662ef4686769bfae4e5d866feba4c218"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginBottomDock.vue"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67075da40568a15ed1384ba3c862ee69f21a5c194bc3e3ef5e86461af6dd274"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9915dcb6f7a79a35d38829aa5522a3bde61319f29b938dd648320c02005aca"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15d2827e6bdc10fba5e2a766d476f17a81431521bb61d2fda154652a26bde2d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa795fe58672c63223c6fc876e0a98530d5ba02747e246250e17bb86066bfbea"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2479ffc57d33fb0f57774cc23257be477199d7e1266141e1202cd5c6d04642a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f71360f68fd797e258e9ba9b149858c58fdac8f70ae345997f7af529a8043b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"232572b9c29f7ae028b004738225e948f9f3370649efe076445dbba6076e6221"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ded0bbb059950554dc726cc568dd735ca3f83d8cf0e6a2696b77361581df44"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a015de321a4d5abcd5d1e106698c114274f1adfbb39d89d927a3699f5311b2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginFileManager.vue"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"845cc5c3a9926bc4eca45e85274d8e43e77eaf8c522de16eb34456250b3c73ef"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginFileManager.vue"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c20509bd84239cb6751f91232c97678838e04cd59ca883dd3ab0ac22132a44"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginFileManager.vue"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99d7764b9dcb5a476e571450a037877c37dab43957f886fc13e09a1740de17d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginFilesystemTab.vue"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f311bc2583587146cbd85977fe276cca2fae5345d2ce3e4eadfe6aed88a7d1af"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginFloatingWindow.vue"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d6ffdeb238e9ee6886a27b6852c8825130ddc80060efe4532d90dfb525dc99"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"598a4d6c0d21ccadcfff3d036b9a6d3c14e0f710d1427cec0fa140b93e26a0f2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginWorkbenchTab.vue"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7930498cba58e7e1d86d6cfdecb4b26d7021880bb324d0dfb639eac448da6b5c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisDashboard.vue"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8749c6d8d379c337e55322999cc236464b6728f818feb61dedd3a656882b686d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisDashboard.vue"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddcfc29eb6680fc49fc0a37954880f53d381e73af38ad0a8a73b5c5b1fdd885"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4019}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6c62e2c347c904c98837c88d80c6bfed911998c6d5402e7d65ef269f1f0939"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4053}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5e61dc7a7f547b730bba149fda0841e0ba8333ae77354a31c945a1beb28f5b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da83b6c252a0610092a404415c9d9c83d12099b4027a5e483411cd3488e1b1a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e149b244e9945d71aee0789333247a4652fc7d4af816209f6c9b20116f108b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4358}}}],"partialFingerprints":{"codehealthFindingId/v1":"23efdc0ecbd7bb764bd173d7df162a86512d4a12d6b452f817b9f8caf068dd68"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc4185c9ef54916ebea76f9ad5d65aba1e523c7cb371802ae237d9af48c8750"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b779cf65435b769cdbd66b4646016e89c3c05bb5712f11e31a42783a1437c9af"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4505}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec46ad62ef9ae3fae488c5a840f986618048b7089fb58d4e56ae539ff61f422"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":4569}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08819ef9b7c285fe2745e853e284f4d863f610aa62c1a5b93f1579dd8d69e03"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisQueryConsoleOutput.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"45793c589a5b91997f44724fef4e0bbc2b5539d4553b433748ec4f59e279f922"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38056072361f8022e8942b80abc83efc2b591b2bb5033b0ad3aaed6382b679e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ab00b84bd793196a04e3cc934fb287c6674436ea5d1cc1fded1b8c6a803ae8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":3985}}}],"partialFingerprints":{"codehealthFindingId/v1":"e094ef7982ae8a2d0142e96bf480b0ee2c9324a458ec1828cf89b337204ce0af"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":4015}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f5d32e441eded7679444e274ad1288296580f4d37302b6a2f4b3293e8af9f0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ab19e9a1da4175e967cbe76aeeb3ebd5e913d7fb8e57f89eed66c5d65dbe37"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/ChangelogPanel.vue"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4385efaab9a4984c512b66eb2c1645d05933427d0a72fe6b0049f931228dccc4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/ChangelogPanel.vue"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d177a78e4a298189c835141fa52af7ef0c5f458914d8df3b916395865ba1fa0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/ChangelogPanel.vue"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ccd53f0fb20d9b7a982d70d24cf43611cd8cfc92647d0b1227c53db7673311"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/ChangelogPanel.vue"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b308d45691b60524ff3931138f545a0dac643b071c6e5c3d67402a0f4aba7b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilitiesPanel.vue"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b403fcb86d62649d64b8a48b9fe400f8b95ba93d6bd29c5573ee94306167e10"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilitiesPanel.vue"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bd4fc9d4a5818d486477c0a7bbce16bd5a9a69b20a35a22294bfceeadbb1e8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilityBrowser.vue"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54a71b5d69d393d02ccd12a5dab5aa253531a0186982a08d3e39b46b5777c36"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginCapabilities.vue"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c83c9e15445be299c62da155c00815103043d93a855b452fbb94305be75822"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginCapabilities.vue"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff828ee370aac793babac0fd3af1aa422aa6ba6c484a7f1c39fc550aa581810"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginCapabilities.vue"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"713e80864c3a71e980a277a3ba33f563bfa9bf2bea6b661ddf158032aa957bef"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginCapabilities.vue"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70d18e4778b91dbd423fa39be9036e9a0026f7cd95e800c3849278b7298f009"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginCapabilities.vue"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7464a1f58bc7805a796af28f533298cf287d5cf0d5a6ed383ab3e401181150"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginScopeEditor.vue"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a2e34faafceb439a4808686d92c832e3bf8ce321c6a80006bf98c041d6d2b0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginScopeEditor.vue"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a012ee637b682b4008d3cef5f8596d47113074543f95cca6cbfdd65d49468c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/SettingsTransferPanel.vue"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6318dae1df79dad5693818cf4ef385d6f829efa6083bbcd57c9f3ae1beb8e971"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/SettingsTransferPanel.vue"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8d9b0372233dd0fce39c5689c99489c0d011e3ef02da48085ede18b4b5bc3f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/WebLoginCaptchaSetting.vue"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbe90c86e09238d767597058196200d6483231644d36057ff8e8466c3a7b422"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3099}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda5a8102a5d80c9bc31d30a2032944a5b117f88eb5ab3c7dff576f2673c0367"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8294981696af8876fb42260bfcbfce060fc64bbc9f6ebec27f097c3626a797bf"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/MongoIndexManagerDialog.vue"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"83263ea061c4c237239525c6804db2d331e3e6a2a148dda11ded9af8a7492b9e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/MongoIndexManagerDialog.vue"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3248c0164e7cefb7862289c9331ca3202f4ac89fac79297b6540272e7fb35dcc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarAsyncDialogLoading.vue"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd44a1cd8de9a49a9930cf6136a3cd84bcb8c6ea18556e4a292f28f123f9d20"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa217570259d5337b698465657b4fe881f1a9a9ad9e045be347352a183f5b6b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eaf7c5b63f4db662a209ab15c2221c59aa8a6a5110f61a995e8a21d8c50e7b5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9d8112889d66735e05a5c0166eea24e41a05d7a48fd224549a58efe385d57c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc521a87e592d10f3a40c6078db4b50f76e1c360845d4d2e496e064bef9eb1e7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"11aa086d3eafacd94beb475f54d1d1103498eb05eadbb72a7357bcd20d59e40e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"015a9c5a7577f3797715f33084c847657aede44b945c89096c85da2f58f9d083"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"076f4028bd3d38e786b207ecb177a7bb1761d7a1a93d1b714f54fef8284ca61f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4cf489dc36f3dad171474876f098dd30ab486c5a601fe61af95e536baf1939"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f20649735ea1f9b8bac39a84bd5bbb1f0771f690536b729aec55d7777631538"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"914cc0e7087346e9c0ef16ad319952e8a89cf01abbd5662769713ec75a0b4374"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0e890f78ef9420e849caa6cfdf3699fb46cd66793cad47bd03fec643a887f1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8b6301e57872630f28c0859d0086b1fd8f1c40fb0c42b8a4863c8b3504f13f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleNacosNamespacesDialog.vue"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d38157ad649978eda54da64e8478a37f394dcdfcc69ac7d782c24980438b2e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleSchemasDialog.vue"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d0e925cb58c36bd6179da01f7daa117d113096b42f9fdb71aea89d2d5eb3d5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b598d924874a18f39a71c2dd1c2028d6e30536ccfd97172a8dae3f2c75a8199"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afec5d1d5e7ef37d021397a7be97f5d729b33095ae9f56119de5873a15bd0e2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1b576e0bda2bed067876c10ed314450f203b7c386f9c300833918462279987"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2abbd0b26bd947879437256086b3ab03554d558762df95577d47533c723789b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ffda00e99fd33d8cc521cd9082bcd92575abeeb865f6559ad08eb6d011ad2f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7732052d9a8760cbfd6bda9680d449678923381d4f9a58951fbe6cef0897b82"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StructureIndexColumnPicker.vue"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a068baa3b38280c8de59cbb0ce4c53dc00c1979255161ed677cc7169ace0eb04"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TablePartitionsPanel.vue"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac71fe85b446b77d2f0a762c98c8880af56a7c83aa0d8c67401444091d16b9b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8423}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d750ca6ceef6021a4356ed94672df59acffd186b29aeaad80a53df330983b3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f81b69b0780aaebb6965a0b6348d588a354a1f0a51adab7600926b782d3ac6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8506}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03e61c0db2704149140b226c6db8053036807efad2021c40c44c9f2ca97cd6d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8553}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8f0f3cf823723c54506df91be0c3d941efff2b35744b0898c6bcd638d73685"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f52d42c2344955893f16e020e541f168c1cd022642475f9190c61ea4aceec3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferProgressDialog.vue"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f130c7a8fe120cd66fa15786457ae555c20f6de2c5ef3ffb94a12cc01b03a5ff"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cloader2\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffd8a23657ddff5e55d6dc35b04be36aa046e4eb6472c2e51dafe5b14d216bc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/vector/VectorBrowser.vue"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"220daa140074516c9e1af545abbd85f7d2aa22565b2a04d963cf564ce7d4c283"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/DocsSearch.vue"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"beda83397dd4eb60b92ea879f561ba9ec152581243e33c4fe4afd2326262ee4d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/GroupEditor.vue"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d4dade1ea955aba992c0732de3f987339ad42533dadf7750f91079ea8dcc7e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/GroupPicker.vue"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c63eb9ebee7eb5214ec127cfcf6ced62a03bab7831aefbc45c92b6dd12efce"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/docs/components/NoteEditor.vue"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ca45d2ba00ba94731dc83bffca7763c67ccad083750806ba26f029c605396c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebf5832c9ca77c8b9ba2d56845b57e40846eef399a81a923361f13b963fb607"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/drivers/DriversClient.tsx"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f30b0d67bfa54918988d4d6cf5a86973272f03adda102ebd886e5f59284125"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.7:1): \u0060.verifiedPanel \u003E button:not(.logoutButton), .verifiedPanel a\u0060 sets color: #348bcf on background-color: #fff \u2014 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/contributors/ContributorsExperience.module.css"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb937d65774d41e11ec1126dbd3edf6df75ea59b182a51b3cf487db19d69452"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.1:1): \u0060.previewSeal\u0060 sets color: #fff on background-color: #d9ad3d \u2014 2.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/contributors/ContributorsExperience.module.css"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efb7e80c746e9f3e0debe82005c9064a030308a8483d280ad656567f2692989"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.1:1): \u0060.fullSeal\u0060 sets color: #fff on background-color: #d9ad3d \u2014 2.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/contributors/ContributorsExperience.module.css"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d70f9d6a7bd06c63cc1431028a5faa4fcc24a706f135f6d2e5cbb3121a7d457"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.7:1): \u0060.modalActions button:first-child\u0060 sets color: #348bcf on background-color: #fff \u2014 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/contributors/ContributorsExperience.module.css"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd0e90ff27903d1cb152cbe8d9abe2ba78513d010d61750c79dafe45b113feb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.directoryHeader input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/contributors/ContributorsExperience.module.css"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6c377f205870c3bdfe0727ec72341f4220c4ca0fc4e17127cf9c0a8245dd72"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.landing-mobile-menu-link[aria-current=\u0022page\u0022]\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ab7477b3cfd4d7375b569bbaff4f6c54ae090225f00204318e29f0d71d8e85"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.outline-none\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/assets/docs-export.css"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e487e05f2acdfa10dad4ad6e27ecde512c6b5ef8c712121ba3250fd5ffc545"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.topic-combobox-input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/shared/RocketMqTopicSelect.vue"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"320b579979ce5787bb6e3726ca5f5efb491260562a4970a66c192a3bb2168d68"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.tab-group-color-option\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/appTabBar.css"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"00507f45712ab1074e85c000b39ce3d3895172bbaa80ff53396064d523f5368c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.canvas-grid-surface\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":18587}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf11757a930215071dd3cb73b6dcc638cc90c40b8bb6251d6dafca11c2a10c8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060:deep(.cm-run-statement-marker)\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":3491}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ad6ddc215ca9040d5eb4c03d3169764022bfa02fea1aa2d215f8b34b9e04b5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.dolt-revision-selector-input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltRevisionSelector.vue"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4583baecbcc26a24777b5c21704c26be9f2c34f45a816b86ccaa23af0da40968"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.route-progress-bar\u0060 moves (\u0060transition: transform 0.12s ease,\n    opacity 0.22s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8b5ca8215ab10835845c4677bb67f6615ede6e5c114efc79b52f16f203323d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sponsor-card-in\u0060 moves (\u0060animation: sponsor-card-in 0.3s ease-out both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"82deb510c3cd7d5aff651ad4c47b14fae172e3995ad75d2ae7a8d59e1507227a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-reveal\u0060 moves (\u0060transition: opacity 0.72s ease,\n    transform 0.72s cubic-bezier(0.16, 1, 0.3, 1)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce925b05ec4bbf85c54f3c88236a5681a41d79a006c8aa73bfc63f336df36c1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-reveal [data-stagger]\u0060 moves (\u0060transition: opacity 0.58s ease,\n    transform 0.58s cubic-bezier(0.16, 1, 0.3, 1)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b69def1c0a456850f20e7e369e5b2bbaecdf57eee3e0ed2f6b8fd1b2a080087"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-mobile-menu-panel\u0060 moves (\u0060transition: opacity 0.2s ease,\n    transform 0.2s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"2917d71be927fa561f920c2130b81325de92bfc85ef30f43f21fda255a0bf470"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-hero::after\u0060 moves (\u0060animation: landing-grid-drift 15s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d727b858e8e1c88a7f283d68b76f5fdf4c3bdaa62434ddaf8b23322da55983f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-hero-copy\u0060 moves (\u0060animation: landing-rise 0.72s ease-out both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f86cc58387a4ea2704f8fafd8743be52b3ddd8b7923009f0cf54ac0397a10d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-btn-primary\u0060 moves (\u0060transition: opacity 0.16s ease,\n    transform 0.16s ease,\n    box-shadow 0.16s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f7d55205ee380460ea506864864e6587547ef1f2cc9dd00c52f95853ac1e5b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-btn-secondary\u0060 moves (\u0060transition: border-color 0.16s ease,\n    background 0.16s ease,\n    transform 0.16s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c086f9a8cb37a5e2213310cd0679c6f084b210546b4cb0b399b4d00726e272"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-install-toggle svg\u0060 moves (\u0060transition: transform 0.16s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd539a03a3c8e2072fbb0fcfbf5d16f6ecaf5cf8173e627008a2a79f47a3d51e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-install-menu\u0060 moves (\u0060transition: opacity 0.16s ease,\n    transform 0.16s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"752d4a488228a3207e838a4750b05ce594ca37ecfafa592eeecc4864b062fc66"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-product\u0060 moves (\u0060transition: box-shadow 0.24s ease,\n    transform 0.24s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e132ea2759ccf204a47a44ed546aec5c284947b2246fa57aad38373d19dc9d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-product-dot::before\u0060 moves (\u0060transition: width 0.2s ease,\n    background 0.2s ease,\n    opacity 0.2s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"15010c3e63d197279636d28c8c3451eaf0a15ed30c41a07e1e0a9550de1a5e5f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-workflow-card\u0060 moves (\u0060transition: border-color 0.16s ease,\n    background 0.16s ease,\n    transform 0.16s ease,\n    box-shadow 0.16s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dae908932a192981f72226a7da9e44a7a89b343dbb0678a655e2dfacb2962da"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-db-card\u0060 moves (\u0060transition: border-color 0.16s ease,\n    background 0.16s ease,\n    transform 0.16s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c44d522de75603f85f92f9274e87ad22bb99e1f1e53136b6690c813b4314e8f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-testimonial-track\u0060 moves (\u0060animation: landing-testimonial-scroll var(--testimonial-duration, 48s) linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"c129a8e1b3be84b8d1bb620b3905580950fb0adbf883e1114d19e2b1efd3df0e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-db-track\u0060 moves (\u0060animation: landing-db-scroll var(--db-marquee-duration, 72s) linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b51655d10ae1d81f5a85b14d92198abae0b77e40bcd822f1243f7892a46c387"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-contributor-avatar\u0060 moves (\u0060transition: border-color 0.2s ease,\n    transform 0.2s cubic-bezier(0.16, 1, 0.3, 1),\n    box-shadow 0.2s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a2420c01766f9048525081fc08feef33df6fe002cef6bb1b20a2ba6babefd3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-contributor-tooltip\u0060 moves (\u0060transition: opacity 0.18s ease,\n    transform 0.18s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3ff2fbb938a08ef27d5ceec9d0be093bb7413c3a1ef8f09cf47cf1c7ed6856"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-capability\u0060 moves (\u0060transition: border-color 0.16s ease,\n    background 0.16s ease,\n    transform 0.16s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bd1119bf2cadb40dd774750d63b79da183e23b0c94bfd824e4ac15a6d677bd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.landing-final-link\u0060 moves (\u0060transition: border-color 0.16s ease,\n    background 0.16s ease,\n    transform 0.16s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ae3bd827271e962b8ecd32f230d543bca5fc8c560ace28dac1095d13cbb9a0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.issue-preview-panel\u0060 moves (\u0060animation: landing-rise 0.25s ease-out both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a7c84c770e136d998a4060f58369e23c7bf705e311bbeae8eba46f9ed2414e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.issue-spinner\u0060 moves (\u0060animation: issue-spin 0.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/global.css"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed92aa5ab1a3e1b2385a24bf31b272393180bcdd52faa56d989872871b042a6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.export-progress-indeterminate\u0060 moves (\u0060animation: export-progress-slide 1.15s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferProgressDialog.vue"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdbab613c3bca5c7225cbe94b3f58ca981e728a0959ba75931bb262f0a6fc2b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.structure-vertical-scrollbar__thumb\u0060 moves (\u0060transition: left 120ms ease,\n    width 120ms ease,\n    background-color 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":10602}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a74e49446db8fcf4b28ac83de201aca81774a70e9c1b6fc537dfee9e609549"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.structure-horizontal-scrollbar__thumb\u0060 moves (\u0060transition: top 120ms ease,\n    height 120ms ease,\n    background-color 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":10633}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ad32db43f2080d288fcbcc19ee145a41e65f19d12f6f222c11bad8a8b65424"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sql-file-progress-indeterminate\u0060 moves (\u0060animation: sql-file-progress-slide 1.15s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileProgressIndicator.vue"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e338a24892b7a2ea18caf62103aed70f44ab6af6c3db8f2f411dfaca75c5c95"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sidebar-tree-scrollbar__thumb\u0060 moves (\u0060transition: background-color 120ms ease,\n    width 120ms ease,\n    right 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e4ff62b7b5f638250c13d5cda6e353b19f135ebd89a591470c0fcba7eaf47b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sidebar-tree-horizontal-scrollbar__thumb\u0060 moves (\u0060transition: background-color 120ms ease,\n    height 120ms ease,\n    bottom 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3576}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb774820cff8f6fb453ec18004506da4411f673b3fe8d8ec735bfa4d87dcbfe"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sidebar-list-options-icon--open\u0060 moves (\u0060animation: sidebar-list-options-press 180ms cubic-bezier(0.22, 1, 0.36, 1)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarListOptionsIcon.vue"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a690fb21c1937a0b454df58dd7eab587c00ef9b6ada34cea5184af00e82831bd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sidebar-regex-glyph--animated.sidebar-regex-glyph--pressed\u0060 moves (\u0060animation: sidebar-regex-enable 300ms cubic-bezier(0.22, 1, 0.36, 1) both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarRegexToggleButton.vue"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d26723b054dff01ef2dfcc006a24c26f43cfa12c11ed25f9c1325217fb8b13b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sidebar-regex-glyph--animated:not(.sidebar-regex-glyph--pressed)\u0060 moves (\u0060animation: sidebar-regex-disable 300ms cubic-bezier(0.22, 1, 0.36, 1) both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarRegexToggleButton.vue"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd46cb28c47b0441ee92255363e60e73ea91e4ff7153c6117849928be8a1e5e5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.mcp-nav-filter-control\u0060 moves (\u0060transition: width 150ms ease,\n    border-color 140ms ease,\n    box-shadow 140ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilityBrowser.vue"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"f617465110670c7b027bf9b20376226de0bfbacf8a10d2d6288cfedd9b306a2b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.table-info-action-button\u0060 moves (\u0060transition: max-width 180ms ease,\n    padding-inline 180ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":8061}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71380c97e954de05775a2aa2d1417ad0145868650f06f1ce63ede37b6363774"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.table-info-action-label\u0060 moves (\u0060transition: max-width 180ms ease,\n    opacity 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":8072}}}],"partialFingerprints":{"codehealthFindingId/v1":"9587376fbc98beee7180ea2c7abd0ef4126c7450d24838a3fc4e82ded7e241d6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.collapse-arrow\u0060 moves (\u0060transition: transform 0.15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MessageBrowser.vue"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e7e8fafd976c3e1671ba13f171072e3c73951e4ea5158756a89b2818b091a7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.spin\u0060 moves (\u0060animation: spin-anim 0.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MessageQueryPanel.vue"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a136e21efd633f12676c7a206bfa2d0a2b33b509fe6ff93ba6280ec165e95f91"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.btn-sm\u0060 moves (\u0060transition: transform 0.16s ease,\n    background 0.2s ease,\n    border-color 0.2s ease,\n    box-shadow 0.2s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa5b5984ac579d53c7132e49640746b035e9793158043f7784db7afe0c3167d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.spinning\u0060 moves (\u0060animation: monitor-spin 0.9s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c8a50f2009958011b8bda1373b4c015ff6681e4ce7f63a1dce4a8f933fb79e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.loading-skeleton-card\u0060 moves (\u0060animation: monitor-skeleton 1.3s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4781cea2d8d6dd23cc8be325955ad1be3e62c71f77cb68681213eef0f5b511"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.stat-card\u0060 moves (\u0060transition: transform 0.22s cubic-bezier(0.16, 1, 0.3, 1),\n    border-color 0.22s ease,\n    box-shadow 0.22s ease,\n    background 0.22s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4f3175f6e1b0a666917959ce4bdd2d5e8a3b8d3ad962e990901e942813bb4e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.spin\u0060 moves (\u0060animation: spin-anim 0.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb07ab7329033dbfd712664331ba5faf5a0e27981f4aad2591f4362c7c1711e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.collapse-arrow\u0060 moves (\u0060transition: transform 0.15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ea668dbb627d7dab7d566509f5c63e5a520f4d956764ab285b23cbf0ac6911"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.mq-spin\u0060 moves (\u0060animation: mq-spin-anim 0.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/shared/mqPanel.css"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d248e0eeda6c5186fb862194d1acfe6f14173a70d4dd4cd26414751da9f854"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.result-tab-scrollbar__thumb\u0060 moves (\u0060transition: height 120ms ease,\n    background-color 120ms ease,\n    top 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":4237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8de498976faf1f0f90727e943d459003ba1131d1661926095ee4506aadb48b2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.database-required-prompt\u0060 moves (\u0060animation: database-required-shake 420ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorToolbar.vue"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d98f0470d7259e574c0b4ce8fcf5dc1cdd76d02cfa6163706d4ce3ec1867c1a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.connection-required-prompt\u0060 moves (\u0060animation: database-required-shake 420ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorToolbar.vue"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e243757d98c1e186c2d8d78e827e2b29602d4a6a63c73b0f25e50408ea00a5d0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.app-tab-scrollbar__thumb\u0060 moves (\u0060transition: height 120ms ease,\n    background-color 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/appTabBar.css"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aefd697514799e6fc2646de6ec235d0e8a9ce1da57c87c95d8308703781901e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.tab-group-header-content\u0060 moves (\u0060transition: color 150ms ease,\n    background-color 150ms ease,\n    box-shadow 150ms ease,\n    opacity 120ms ease,\n    transform 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/appTabBar.css"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e97a274f3628d62933dff23112286babd69c748215563da71fb3cd43e37214"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.tab-group-chevron\u0060 moves (\u0060transition: transform 180ms cubic-bezier(0.2, 0.8, 0.2, 1),\n    color 150ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/appTabBar.css"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4bbf9c682571888c2697c14c0526fd9ec78631ba25bf927f08f72214205dc8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.app-tab-bar:not(.vertical-tab-layout):not(:has(.wrap-mode)) .tab-group-entry\u0060 moves (\u0060transition: max-width 140ms ease,\n    max-height 140ms ease,\n    margin 140ms ease,\n    opacity 100ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/appTabBar.css"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8e4e8a14e18596d35d86f12ad850b2f01de8a14ced8c66fd8cf4b3b514765f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.app-tab-bar:not(.vertical-tab-layout):not(:has(.wrap-mode)) .tab-group-entry--collapsing\u0060 moves (\u0060animation: tab-group-collapse 140ms ease forwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/appTabBar.css"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef09477e30a706ca6457975120cf6c3ebceda8e14cdd73ee73e23966394cc029"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.tab-group-color-option\u0060 moves (\u0060transition: box-shadow 150ms ease,\n    transform 150ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/appTabBar.css"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"598b799d3510f2fc416162d4fc081451a231f30816a354b89a3d7a313949092a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.vertical-tab-layout .tab-group-entry\u0060 moves (\u0060transition: max-height 140ms ease,\n    opacity 100ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/appTabBar.css"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dbc7a94f5448db5a250bc2ac2541194d2a1bd6e3b246c7f80b1088ef69db13"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.data-grid-horizontal-scrollbar__thumb\u0060 moves (\u0060transition: height 120ms ease,\n    background-color 120ms ease,\n    top 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":18510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f2aa6ec0e072e1f87d09ca5fb5b961da131c9b3531bf053c7a2c222c08086a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.data-grid-vertical-scrollbar__thumb\u0060 moves (\u0060transition: background-color 120ms ease,\n    left 120ms ease,\n    width 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":18568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a11fa6e8221f7500fa5913808795f78ae993328bec225ef0e10fb95d23f4da"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.table-info-action-button\u0060 moves (\u0060transition: max-width 180ms ease,\n    padding-inline 180ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":18684}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2dbb9062cbdd988089a708ccafa1a69131abdf84d852e5f8044341451e313e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.table-info-action-label\u0060 moves (\u0060transition: max-width 180ms ease,\n    opacity 120ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":18695}}}],"partialFingerprints":{"codehealthFindingId/v1":"1112efc46a5a57d382d050ff492b4df4715cecb3678efc814e0c6e41e85b1e13"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.data-grid-topbar-condition-label\u0060 moves (\u0060transition: max-width var(--data-grid-topbar-transition-duration, 340ms) var(--data-grid-topbar-transition-easing, cubic-bezier(0.22, 1, 0.36, 1)),\n    opacity 240ms ease 60ms,\n    transform var(--data-grid-topbar-transition-duration, 340ms) var(--data-grid-topbar-transition-easing, cubic-bezier(0.22, 1, 0.36, 1)),\n    color 240ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridConditionEditor.vue"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c79477a60f12b0ccf1a7bdab54d7213041f0e073ed5e027012848fa46e52050"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.data-grid-topbar-action-button\u0060 moves (\u0060transition: max-width var(--data-grid-topbar-transition-duration, 340ms) var(--data-grid-topbar-transition-easing, cubic-bezier(0.22, 1, 0.36, 1)),\n    min-width var(--data-grid-topbar-transition-duration, 340ms) var(--data-grid-topbar-transition-easing, cubic-bezier(0.22, 1, 0.36, 1)),\n    padding-inline var(--data-grid-topbar-transition-duration, 340ms) var(--data-grid-topbar-transition-easing, cubic-bezier(0.22, 1, 0.36, 1)),\n    color 220ms ease,\n    background-color 220ms ease,\n    border-color 220ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridToolbar.vue"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e5e19ada659f3f96eeb8c7f3d614813a8f7f4eadb1bca9e0e48a37e917ac47"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.data-grid-topbar-action-icon\u0060 moves (\u0060transition: margin-inline-end var(--data-grid-topbar-transition-duration, 340ms) var(--data-grid-topbar-transition-easing, cubic-bezier(0.22, 1, 0.36, 1)),\n    transform var(--data-grid-topbar-transition-duration, 340ms) var(--data-grid-topbar-transition-easing, cubic-bezier(0.22, 1, 0.36, 1))\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridToolbar.vue"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c61339da38a4214b56aeee82c655bc317c14072d53bf8b354cc8451064a78b4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.data-grid-topbar-action-label\u0060 moves (\u0060transition: max-width var(--data-grid-topbar-transition-duration, 340ms) var(--data-grid-topbar-transition-easing, cubic-bezier(0.22, 1, 0.36, 1)),\n    opacity 240ms ease 60ms,\n    transform var(--data-grid-topbar-transition-duration, 340ms) var(--data-grid-topbar-transition-easing, cubic-bezier(0.22, 1, 0.36, 1))\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridToolbar.vue"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"533705af478bd8e4c0007bb3f9ec135a1cfaaaaf00a54142d068d58ddb9f0804"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.database-export-progress-indeterminate\u0060 moves (\u0060animation: database-export-progress-slide 1.15s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b9b53df9a0e0f2861befa48fe8665b2d8a32c124f6aff564598ea99c448d2c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.export-progress-indeterminate\u0060 moves (\u0060animation: export-progress-slide 1.15s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/ExportProgressDialog.vue"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5723c9e3650716bd6261f4900691b5ab355a10345c604d9f002c1f3dea6bfb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.export-progress-indeterminate\u0060 moves (\u0060animation: export-progress-slide 1.15s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"424e00d4e3544ffa45d7416d08f7791cc0c373b771d68202749532f993e8c805"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060:deep(.cm-statement-execution-spinner)\u0060 moves (\u0060animation: dbx-statement-execution-spin 0.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":3557}}}],"partialFingerprints":{"codehealthFindingId/v1":"437fa835ea0638f934492236e63729f147f6487467bab274fc053dc3bd5a79ca"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.schema-diff-progress-indeterminate\u0060 moves (\u0060animation: schema-diff-progress-slide 1.15s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a74fca7c5376d44647b518eec7c24af861f0434e42b779ef42ef860e43a8b9"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: EditorToolbarActions (32 required operations): \u0060EditorToolbarActions\u0060 declares 32 required operations: \u0060newQuery\u0060, \u0060databaseRequiredSignalFor\u0060, \u0060connectionRequiredSignalFor\u0060, \u0060captureExecutionSnapshot\u0060, \u0060toolbarExecute\u0060, \u0060toolbarExecuteAll\u0060, \u0060toolbarExecuteInNewResultTab\u0060, \u0060cancelExecution\u0060, \u0060explain\u0060, \u0060formatSql\u0060, \u0060compressSql\u0060, \u0060toggleSqlKeywordCase\u0060, \u0060saveSql\u0060, \u0060saveRoutineToDatabase\u0060, \u0060saveAllTabs\u0060, \u0060openSqlFile\u0060, \u0060importResultArchive\u0060, \u0060pasteSqlInCondition\u0060, \u0060multiExecute\u0060, \u0060previewChanges\u0060, \u0060changeConnection\u0060, \u0060changeCatalog\u0060, \u0060changeDatabase\u0060, \u0060changeSchema\u0060, \u0060setDefaultDatabase\u0060, \u0060clearDefaultDatabase\u0060, \u0060activateSettingsPage\u0060, \u0060closeSettingsPage\u0060, \u0060activateDriverStore\u0060, \u0060closeDriverStore\u0060, \u0060activatePluginCenter\u0060, \u0060closePluginCenter\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":"apps/desktop/src/components/layout/editorToolbarActions.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d738203d2b871dda59ecac1858eca9dc691c5acaa97dca07fde246c20987cc"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: QueryEditorSurfaceHandle (24 required operations): \u0060QueryEditorSurfaceHandle\u0060 declares 24 required operations: \u0060focusSqlEditor\u0060, \u0060focusSearch\u0060, \u0060focusWhere\u0060, \u0060openGoToColumn\u0060, \u0060refreshData\u0060, \u0060toggleResultsPane\u0060, \u0060refreshQueryEditorCompletionCache\u0060, \u0060handleModRTarget\u0060, \u0060requestQueryEditorExecute\u0060, \u0060requestQueryEditorExecuteAll\u0060, \u0060captureQueryEditorExecutionSnapshot\u0060, \u0060requestQueryEditorExecuteInNewResultTab\u0060, \u0060requestQueryEditorPreviewChanges\u0060, \u0060shouldBlockQueryEditorExecutionShortcut\u0060, \u0060cancelQueryEditorExecutionViewport\u0060, \u0060acceptQueryEditorExecutionViewport\u0060, \u0060pasteClipboardAsSqlInCondition\u0060, \u0060applyTableStructureChanges\u0060, \u0060insertRedisCommand\u0060, \u0060executeRedisCommand\u0060, \u0060isRedisConsoleReady\u0060, \u0060previewStatementRange\u0060, \u0060focusStatementRange\u0060, \u0060focusErrorPosition\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":"apps/desktop/src/components/layout/querySurfaces.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc2754b16c1706e06db8ddc5254ab8bf64939eefeb8d0a84878611a60acc720"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: UseDataGridLargeValuesOptions (18 required operations): \u0060UseDataGridLargeValuesOptions\u0060 declares 18 required operations: \u0060gridScrollerElement\u0060, \u0060displayItemAt\u0060, \u0060getRowItem\u0060, \u0060tableColumnForGridColumn\u0060, \u0060formatCell\u0060, \u0060formatCellCached\u0060, \u0060scheduleCanvasDraw\u0060, \u0060clearCellFormatCache\u0060, \u0060invalidateResultEstimate\u0060, \u0060connectionIdentifierQuote\u0060, \u0060getConnectionConfig\u0060, \u0060uuid\u0060, \u0060translate\u0060, \u0060translateBackendError\u0060, \u0060appendDebugLog\u0060, \u0060toast\u0060, \u0060cloneRow\u0060, \u0060cloneRows\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":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7ca3030cc3a25be1df1dc0be8832dd3bc4a00fa6832683a1d95dc65a0c771a"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: InnerWebView.load_extensions: \u0060InnerWebView.load_extensions\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/wry/src/webview2/mod.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b413c5cd6b706946c75a3eee8ab474f8be4069046c81858f2b878c228ee2a2"}},{"ruleId":"ED3","level":"note","message":{"text":"Event not named in past tense: benchmarkMetadata: \u0060benchmarkMetadata\u0060 reads as an instruction, not a fact that happened: events describe something that already occurred. Name new events for the fact that occurred (e.g. \u0060OrderPlaced\u0060). Do not rename this one if it is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it, and a clearer name does not pay for that. If it has never been written or sent, renaming it now is safe."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/bench/agent_compare.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a0750eb239ae75b77ccbec9500c8ba9e109a19421d722fe5493147d394e85a"}},{"ruleId":"ED3","level":"note","message":{"text":"Event not named in past tense: rpcError: \u0060rpcError\u0060 reads as an instruction, not a fact that happened: events describe something that already occurred. Name new events for the fact that occurred (e.g. \u0060OrderPlaced\u0060). Do not rename this one if it is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it, and a clearer name does not pay for that. If it has never been written or sent, renaming it now is safe."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/main.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cd1dbd788b5e34e6776eea4e285d5f6a9b4413e153369cac20d9adf9918a9f"}},{"ruleId":"ED3","level":"note","message":{"text":"Event not named in past tense: AgentEvent: \u0060AgentEvent\u0060 reads as an instruction, not a fact that happened: events describe something that already occurred. Name new events for the fact that occurred (e.g. \u0060OrderPlaced\u0060). Do not rename this one if it is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it, and a clearer name does not pay for that. If it has never been written or sent, renaming it now is safe."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/agent_events.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b64a32508ab18e9899a8df930edc615a6deec2b8638e52bbb321d42ac2b465"}},{"ruleId":"ED3","level":"note","message":{"text":"Event not named in past tense: ReloadEvent: \u0060ReloadEvent\u0060 reads as an instruction, not a fact that happened: events describe something that already occurred. Name new events for the fact that occurred (e.g. \u0060OrderPlaced\u0060). Do not rename this one if it is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it, and a clearer name does not pay for that. If it has never been written or sent, renaming it now is safe."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/hot_reload.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff9bbc2ea661fa848b307ab085382fe9a58c4afffc9a58fe56735fbb46940fe"}},{"ruleId":"ED3","level":"note","message":{"text":"Event not named in past tense: DownloadEvent: \u0060DownloadEvent\u0060 reads as an instruction, not a fact that happened: events describe something that already occurred. Name new events for the fact that occurred (e.g. \u0060OrderPlaced\u0060). Do not rename this one if it is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it, and a clearer name does not pay for that. If it has never been written or sent, renaming it now is safe."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/tauri-plugin-updater/src/commands.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d897d318ab19c6931a0960955b46620d3245f7df3456dfc690fedb6f885923"}},{"ruleId":"ED3","level":"note","message":{"text":"Event not named in past tense: PageLoadEvent: \u0060PageLoadEvent\u0060 reads as an instruction, not a fact that happened: events describe something that already occurred. Name new events for the fact that occurred (e.g. \u0060OrderPlaced\u0060). Do not rename this one if it is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it, and a clearer name does not pay for that. If it has never been written or sent, renaming it now is safe."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/wry/src/lib.rs"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee5bc66e748bf8008c2eabdcdd9bbdb581e996f512a4caa8758d9c84ab2232c"}},{"ruleId":"ED3","level":"note","message":{"text":"Event not named in past tense: SidebarLayoutMonitorEvent: \u0060SidebarLayoutMonitorEvent\u0060 reads as an instruction, not a fact that happened: events describe something that already occurred. Name new events for the fact that occurred (e.g. \u0060OrderPlaced\u0060). Do not rename this one if it is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it, and a clearer name does not pay for that. If it has never been written or sent, renaming it now is safe."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"349fdcb5c86286be79eb40bbef708741a103ea53a9148b7f6e3addde904eb8c4"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 28/86 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060agents/drivers/access\u0060, \u0060agents/drivers/bigquery\u0060, \u0060agents/drivers/cache\u0060, \u0060agents/drivers/cassandra-go\u0060, \u0060agents/drivers/databend\u0060 and 53 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060deploy/plugin-stats-worker/worker.ts\u0060 reports through \u0060console.*\u0060 at line 98 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"86434038b62b64b4890b74a1d5698c835cdea58f047c12c942900875c6823d6a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060deploy/plugin-stats-worker/worker.ts\u0060 reports through \u0060console.*\u0060 at line 125 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1d7ba8c48e85a39a680da0082c3898995c3bd17b1389a921977b00901f3a81"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060deploy/plugin-stats-worker/worker.ts\u0060 reports through \u0060console.*\u0060 at line 384 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d1bcbf13347cda6f7a25dbbe334e787408fb2c63944c1011bd666f189965d6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060deploy/plugin-stats-worker/worker.ts\u0060 reports through \u0060console.*\u0060 at line 460 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4473d6fa4a92fda4d029ee75c1a599171b5b389811367d3e795f5a8a4b6213"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060deploy/plugin-stats-worker/worker.ts\u0060 reports through \u0060console.*\u0060 at line 498 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"27efddbb1c876fbdfef2ed63cd6bffccb3a5fec2af8e7f0b9bebcf5073952848"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/stores/savedSqlStore.ts\u0060 reports through \u0060console.*\u0060 at line 799 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"03259d3e9b59c5f886e6dc7a568343839c653d3cf42ede820471e38e88930697"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/stores/savedSqlStore.ts\u0060 reports through \u0060console.*\u0060 at line 879 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dee30074368432d538b577cfc1a87ffa8808c91ec2e1301ed4242e769225def"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/stores/savedSqlStore.ts\u0060 reports through \u0060console.*\u0060 at line 991 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aebbdaa315cffc4ec6ad9fa3f29e8bf0731275606a5b441aab78e864756969"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/stores/sqlExecutionTargetGroupStore.ts\u0060 reports through \u0060console.*\u0060 at line 67 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/sqlExecutionTargetGroupStore.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dfa8928bb042f368928fc0a4592166d6b99a3b9454f84f539bbf3ce1baa911"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/tabs/tabResultCache.ts\u0060 reports through \u0060console.*\u0060 at line 216 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"db87ffb7516e6904f2987ba41f7d8b4c06fcd21ea6441605dc9e1b23fb0720a3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/tabs/tabResultCache.ts\u0060 reports through \u0060console.*\u0060 at line 598 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4443c2cc375e50735dd9b7d208f658e626880425203faccac27c0915a59adb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/tabs/tabResultCache.ts\u0060 reports through \u0060console.*\u0060 at line 667 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c0034f752686167188af5bcab45a9b0a41288c2dfe209623b618b42c2dadea"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/tabs/tabResultCache.ts\u0060 reports through \u0060console.*\u0060 at line 742 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"7649334984cdff1863689b18ff6f4134354d7fbb3e9faff8d70807b0262f9eb2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/tabs/tabResultCache.ts\u0060 reports through \u0060console.*\u0060 at line 754 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88d713ff79f5ea82018239b7cb4da387ab6679c17bab9219444ff5ffe4b15e3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/tabs/tabResultCache.ts\u0060 reports through \u0060console.*\u0060 at line 909 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"487926bb5da0e221ded9978a3dd29ed24afcc14e8f89f9ce10413b29dbc79870"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sql/errorPosition.ts\u0060 reports through \u0060console.*\u0060 at line 51 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/errorPosition.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac092b1e9c8f6c1254e69613fb9b667a297c0553672485de4c2e779a848edb1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sql/sqlHighlighter.ts\u0060 reports through \u0060console.*\u0060 at line 33 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlHighlighter.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1621e8ec7b2fb542877bfa8530a7e011425bd537fd4894145559a5b305cba09d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sql/sqlHighlighter.ts\u0060 reports through \u0060console.*\u0060 at line 48 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlHighlighter.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf9cc395e47ac115e3216135ba88edd8f188751592ef7728cee6c975a7e86e5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sql/sqlRichText.ts\u0060 reports through \u0060console.*\u0060 at line 62 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlRichText.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4014eabfd4c1d580a224feaa5849aa67c6f5a6b859134f93248c0c04f0db3527"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts\u0060 reports through \u0060console.*\u0060 at line 735 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7a47734962bf7d3b4ccf583ac25c3bf8794d6c712e1a3902e903433192d6b6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts\u0060 reports through \u0060console.*\u0060 at line 738 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bf5e7e32c7c292bd7a1816e61642860e1dc05f60af1ed9423ee852e17e616a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts\u0060 reports through \u0060console.*\u0060 at line 783 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6a633273cab090462bfa22c00caaf76e92e831cf2a520f5117fca2409f35a1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts\u0060 reports through \u0060console.*\u0060 at line 789 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cc7d5e7690f4480f172a222920a5a76e31a5bb8e39597fe3574f77e6780c6e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts\u0060 reports through \u0060console.*\u0060 at line 793 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"421a12285714adf103e12893ff5540b14b85c9f10bd8d31185d0cc2bc32cdab4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts\u0060 reports through \u0060console.*\u0060 at line 804 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9976f39402ab2dc20a2363a04f12694bcb41f09117823096dbedc4af912973"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts\u0060 reports through \u0060console.*\u0060 at line 893 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffff98126126a632ba6114b580211a9ca533dadd66db752dc417ca405dca14ae"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/savedSql/savedSqlLibraryEvents.ts\u0060 reports through \u0060console.*\u0060 at line 16 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlLibraryEvents.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d6c8f2c19778d2a2682329e0d188b518a7683b208fd06d58c497978c2d8540"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/savedSql/savedSqlLibraryEvents.ts\u0060 reports through \u0060console.*\u0060 at line 28 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlLibraryEvents.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3d4e52857d5ecc2335332e24c7589a99070f9e9ee5b99e1ca7eba219a05aaf"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/query/queryCursorOffsetPagination.ts\u0060 reports through \u0060console.*\u0060 at line 71 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/query/queryCursorOffsetPagination.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a352e076fd36021c73fae785e5c282f5b56b87148e82175ee4bafa4f90da1ea"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/query/queryCursorOffsetPagination.ts\u0060 reports through \u0060console.*\u0060 at line 77 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/query/queryCursorOffsetPagination.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d709d0f3c7d81790a6a49d20d15ef985a63f76d6a1fc6fad73a250042274c4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/plugins/pluginFloatingWindow.ts\u0060 reports through \u0060console.*\u0060 at line 444 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8809c163cc79107ee515e857a88f8e6e6125ed01ee9e7946fa28e1638a23b51a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/plugins/pluginFloatingWindow.ts\u0060 reports through \u0060console.*\u0060 at line 453 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d4e5c3230e02f762f583cbd23989caf20c95aabe52e89446b887ac63865603"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/plugins/pluginFloatingWindow.ts\u0060 reports through \u0060console.*\u0060 at line 454 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde982f68b541d57ac5e6ff0f14f3635222455953647cf8708207ad51ed9e3cb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/plugins/pluginFloatingWindow.ts\u0060 reports through \u0060console.*\u0060 at line 499 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"202d57a8af1863e03699110f48d87c2c4e4e1d1dcd8a0c4153c044d96d5f730a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/plugins/pluginFloatingWindow.ts\u0060 reports through \u0060console.*\u0060 at line 522 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd565a13b352bd40db34f9a7b01baa515b56236a93d691e01c503c96c77783e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/plugins/pluginFloatingWindow.ts\u0060 reports through \u0060console.*\u0060 at line 816 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9bf5293626db5ceb0713817238858d5b9a032990595eed0ecc888eecc27b57"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/plugins/pluginFloatingWindow.ts\u0060 reports through \u0060console.*\u0060 at line 837 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"7753dcdf2c2aad4b133610e1005fcf40881fcbbe79419fabcb5e547b051832c2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/plugins/pluginFloatingWindow.ts\u0060 reports through \u0060console.*\u0060 at line 883 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d63cfead52f29633041a9a4cd885ba6232a7f21168b90b079cb85b16386cda"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/plugins/pluginHostBridge.ts\u0060 reports through \u0060console.*\u0060 at line 445 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d4584b74edbef70e466326147bc25a97381a377f8c5f916fb62c164986fe2b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/metadata/metadataRuntimeCache.ts\u0060 reports through \u0060console.*\u0060 at line 170 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/metadataRuntimeCache.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3684248314bbeeaf5dc0ff5b316e92a623fdfd0537006fca2d4c0f44c4029fa"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/metadata/metadataRuntimeCache.ts\u0060 reports through \u0060console.*\u0060 at line 172 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/metadataRuntimeCache.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c4c54108fccbcd01878aee2bc3025ec002ef3ed68fd61a667b3d2b2bf8443c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/metadata/tableMetadataCache.ts\u0060 reports through \u0060console.*\u0060 at line 80 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5162a3f775ce6406df750b3db3024851c61e227130b320ede5a9fc16f0eaf8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/metadata/tableMetadataCache.ts\u0060 reports through \u0060console.*\u0060 at line 96 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2f01100e7d29f7f7fd65d620acbeaa6aa599169e6400073197b93a8d522793"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/imports/navicatImport.ts\u0060 reports through \u0060console.*\u0060 at line 290 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8ff3683556a8c7bc7aaaa648de7278e15cf71fd9841dbb22799d60907d91dc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/export/exportReveal.ts\u0060 reports through \u0060console.*\u0060 at line 26 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/exportReveal.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5266254f3624de130b6d461d6509cccaaa63918b107c0758eff574a811976c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/editor/vimConfig.ts\u0060 reports through \u0060console.*\u0060 at line 30 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/vimConfig.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"307b595e1115bbbcf0a6b4262ec54e5af7e79d0cfbc93e142a1123f4a555c11c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/editor/vimConfig.ts\u0060 reports through \u0060console.*\u0060 at line 43 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/vimConfig.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6603933c69bd7210b9c9ff31319c24e833c4c344e490b79a73d1188018f1a131"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/editor/vimSystemClipboard.ts\u0060 reports through \u0060console.*\u0060 at line 35 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/vimSystemClipboard.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b8ef2d7ca143eeca568e62983a9d816c6e47b64842d46440e1472c080d8c54"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/editor/vimSystemClipboard.ts\u0060 reports through \u0060console.*\u0060 at line 66 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/vimSystemClipboard.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"70653ee463d874636130c5bfb53b99883ad2822d12b5b9160ea219ecc09f1f06"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/document/documentGridColumnVisibilityStorage.ts\u0060 reports through \u0060console.*\u0060 at line 26 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/document/documentGridColumnVisibilityStorage.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e7effa2578512cb6a2f0ef1b6c8eccd47b8c5a075c7b77ea2333524869ef71"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/database/dbAdminSql.ts\u0060 reports through \u0060console.*\u0060 at line 270 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a65ab87f2de4caec6d6bc83cfb12474e0fb3d987a47195c400f7a28b9a893bc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/database/dbAdminSql.ts\u0060 reports through \u0060console.*\u0060 at line 327 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e4bf8aa96916d81408bd54f46f50c7e779fa0771f7be212b369f2702089df1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/dataGrid/dataGenerate.ts\u0060 reports through \u0060console.*\u0060 at line 383 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"337ab8701eeef16b96849bc5dc32a3c551ea44379d50c4b1cef852f8395005de"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/dataGrid/dataGenerate.ts\u0060 reports through \u0060console.*\u0060 at line 1713 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ad0d2c71a56cbc8fda94257ec477cd51dc1f1a867d8db4ab72b8e32d492123"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/dataGrid/dataGridColumnLayoutStorage.ts\u0060 reports through \u0060console.*\u0060 at line 142 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnLayoutStorage.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9978c32d2e24876281c99b3db5605f2ea22feb093b35db79e445ac543c179b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/connection/driver-category-definitions.ts\u0060 reports through \u0060console.*\u0060 at line 127 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/driver-category-definitions.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1de2d01004d44e662b6f8cd00503926c205088f0fc783599c58f8fce2bc7c6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/backend/browserAppStateStorage.ts\u0060 reports through \u0060console.*\u0060 at line 67 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/browserAppStateStorage.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d95a286d937e1c91e1f993cc1f3841ac8a21b83e17ac34a751d5ba64005662e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/backend/safeStorage.ts\u0060 reports through \u0060console.*\u0060 at line 2 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/safeStorage.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa75eb0eafbd9e3cb5f778e8b31e54f4dff83ee664f0f7764266c2debf975818"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/appAppearance.ts\u0060 reports through \u0060console.*\u0060 at line 22 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/appAppearance.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"184f7b415aafa93e037bb03da1a1568f6dd27bd51b370c340a843162432a0463"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/detachedTabWindow.ts\u0060 reports through \u0060console.*\u0060 at line 73 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/detachedTabWindow.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa6bd48002068abd8f6c11df4e44ff04c47020daca32d66410792d4ec8812fb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/detachedTabWindow.ts\u0060 reports through \u0060console.*\u0060 at line 94 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/detachedTabWindow.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef447987089342a0b6ab30ad581e998ef39e44975b8b02705b69aa60aa8855f5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/detachedTabWindow.ts\u0060 reports through \u0060console.*\u0060 at line 105 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/detachedTabWindow.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c807d5ddae8b7fb1412bf0402b624d0e48a5c4c146e625d1388fcbc3c117593"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/openTabsRecovery.ts\u0060 reports through \u0060console.*\u0060 at line 26 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/openTabsRecovery.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"293e53a834c37b4a7d4c3111b91498c1b0a89c494c1943996558294cde0c3c22"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/promotedBuild.ts\u0060 reports through \u0060console.*\u0060 at line 30 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/promotedBuild.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"501c95ac153d5f8425c603de94452bfd4dbcd706f43dcc97f33f9d780e3a872e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/uiTuning.ts\u0060 reports through \u0060console.*\u0060 at line 67 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/uiTuning.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1828ca819ba6b83663c3f232ba5d4f38242aad3e7f129474b1b09bab50ac88"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/uiTuning.ts\u0060 reports through \u0060console.*\u0060 at line 69 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/uiTuning.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3724af318122d7ba00b6b66fc2a3cb9c1bcb422ca8a1f266795426753a7a5521"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/windowAlwaysOnTop.ts\u0060 reports through \u0060console.*\u0060 at line 14 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/windowAlwaysOnTop.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0241727830f60c5c95fb7bb5c4eb471772205971e35935350058eacd94731d78"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/windowAlwaysOnTop.ts\u0060 reports through \u0060console.*\u0060 at line 30 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/windowAlwaysOnTop.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"043231fba5bc3c622b5556bce11bede52b50a6891c221fd914edb584058c6581"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/windowAlwaysOnTop.ts\u0060 reports through \u0060console.*\u0060 at line 47 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/windowAlwaysOnTop.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4187707724306101c358f727245be8c308ab858264dd921bde163b223351d592"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/lib/app/windowAlwaysOnTop.ts\u0060 reports through \u0060console.*\u0060 at line 71 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/windowAlwaysOnTop.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"decf014f4d736ab487414f698f48fd4f0ebb7361e1f941dfde82e1936bfae045"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useBackgroundImage.ts\u0060 reports through \u0060console.*\u0060 at line 61 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useBackgroundImage.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"802a2560eae6bb7120c22cc7ad3babfb94a426431bcd7289d8c5c1489865c97f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 196 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f07a864c5eae98cd3896e7bcf29c7aeffa3e832a52f174ee93b12f30b6ec36"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 198 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"607c35d5988c53a2561c908df5cb082bce2b1282f6eff1a72154baad7ce4fe9a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 200 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e01d47f7e1562edc637ab4ce256f71301bfc54a58235e4876c7c3ba71ad512"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 216 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"174a780226d0c844b03d83ce0a9c200773ddcbfa9f5d98c24f78e30e4ecbcde3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 272 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0edd9a6c76e6106ab6307667733e5d45926b0cf78464f3936f0963bd9492d9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 274 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"638acb21382193d79b5690fb173f0ac0d696e1b1561eace57017050fadc7c4c1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 290 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b934596ef2616e5ca99ff8fe4bba5d0dd0c3aad1a7c17c09c1bc25a39ad2e931"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 358 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"735513739c9fb46d5ac2e980d793d9e4a0dce54a0b6fe375ea75eee21e96fb53"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 374 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9914814d5c7b57b57781ed8df1c34a05d361aa8dd2a58e3f5a1f726949ddd0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 376 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b179aff3ac487c20f427cde968eb0d1867a5a44ad32d0da4c733f3ae0a16ce3b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 378 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e137e6645fb85e7322b4af5c8db8dcc2baa1a1501680048f66820ef3ef0200"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 397 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a1436982a3d85b0e0bc963077070cb11deca21440a7bddc95086ac8bf68c52"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 400 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"650a32c03a7dd1204a2fdac51eeea9874455b294ef8d4ce0501961dca6048ed4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 403 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4885431245a6fdd657f16c235c1fcc9396f6efcd9ec1955d02c5d6e6f2747fd5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 409 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfcc4043c53c54fbd3cee7bcea89c4e8c67be779e594885c2d9eab279a479c2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 424 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5d997e8d72d266177b6399e3537c631e6ab5d31d0bfa87d85daf37c8ab7420"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 426 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"679002d74936cdd387666e411709ccac68938b3a8fe3cd183f0d4b24721e70c8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 437 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd8cec462eed02a28169b866a1d2e54cd7d1d10484ade16587ca88238c72cda"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 443 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7db6419d89f6fbb7a1281f59661ccbe796bd08037c9ec166eb714b5874f373"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 471 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc67de2b7916573cddd1668e6f2b0c6ab7529ec1918fc7b95ff22eba0fd8a0a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 474 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57dfb418c0161fcdb626b019eda1b97300750087ecae1a2d5f5d32dffa202f3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 487 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0dc808d823c872dd006e75559813e8d1c11eb8e62c57b1d3cc4db10e4ed2c3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 490 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c6fa9c2f2a74fbaf4bc1d8055400ac69dee873e7193606ca450bef9c935eb8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 496 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a3df49e7f172a9e16794c39e1648fbedceffbb632bbc8610e21931761d9004"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 505 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"63218bfe533120a9be936f570169f3bd3839b9f449ef4df0dc8bf048f4e6002a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 508 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1a0e471c69c78d14d0f68af0d98874bfbfc1ce5c2aa8bb5f3fb0e56197ec38"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 510 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95732b5c370cadf8eaf666bed91cbb0a600933103a60409f14a8d9e47f73a7f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 516 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eee3126e6bad633392d5e5a1ad64b5faa71dde9492255930554f138e9720322"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 534 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3865ca8881ed973fed71b5788edc80576c92aa48c7f2338dcfecf8dfa4da560"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridActions.ts\u0060 reports through \u0060console.*\u0060 at line 536 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f1b7104e6f14adc872f55b1a761f5e6e65fec1ab19818821c2ad3c363edbb9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDataGridConditionEditor.ts\u0060 reports through \u0060console.*\u0060 at line 582 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac4d9a8813b692b8ff7ca1343922a35b928752a99a3191765d80f2403d7f687"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDatabaseTableEmpty.ts\u0060 reports through \u0060console.*\u0060 at line 173 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDatabaseTableEmpty.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fce05052aaa2c8d93221e0b4344bee9dc25f3ac8679baac09da6c750e3c2c5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useDatabaseTableEmpty.ts\u0060 reports through \u0060console.*\u0060 at line 179 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDatabaseTableEmpty.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b333f096ab43cd1d4e524aa72d64f3ca1c751cb845770f533b717c11b75ade07"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useNavigationTargets.ts\u0060 reports through \u0060console.*\u0060 at line 216 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be993dc1d7e2b24b3ff51d174683b4cdbae6d9da3ccc2bfcc4b6c85877e8cc0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useNavigationTargets.ts\u0060 reports through \u0060console.*\u0060 at line 364 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c025f4aba410d55a5be7e82690e0b9f27b199cfc2216728570379ea459791e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts\u0060 reports through \u0060console.*\u0060 at line 127 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f4456d75ba8e556b6282868ab30281210415f4b4566fe1eaf799019d2c4bfa"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts\u0060 reports through \u0060console.*\u0060 at line 471 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c198f8b4b252c57398a4a5bd1bd571c23e03facb6b6d2d97f613c2f8ea7dc2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useSidebarTableMutationRuntime.ts\u0060 reports through \u0060console.*\u0060 at line 491 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTableMutationRuntime.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"591a2a2a9242a9394cd856324ee3e3130e576883546d79ed0f7fb57ad758c41c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useSidebarTableMutationRuntime.ts\u0060 reports through \u0060console.*\u0060 at line 511 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTableMutationRuntime.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d3ffab7672d6ecfa6a71c4777a0f326e48004bb467fcba56557dae0948d418"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060 reports through \u0060console.*\u0060 at line 58 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf9ea56d6c836c4c2a9a508b6f6c610dd04bbf81f2ae969c6d0f5f215993e3a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060 reports through \u0060console.*\u0060 at line 78 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"965d04e3bffcef29b9c81cb948376c1d28d5a9b44011a32fee6302ae278cefeb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060 reports through \u0060console.*\u0060 at line 97 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce289e1e6a17162fe98e225b3d5f4adf9289c66f6cb2c71ab284003252d387c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060 reports through \u0060console.*\u0060 at line 107 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5446c7ce7b752b45c6c7e841d16fa7878b4ce1b5ccac678703a90d4c461a78a9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060 reports through \u0060console.*\u0060 at line 128 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c464b4c08113ceaae4d4886d87862956465f863558f1bfc45f2282ff013c07a9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060 reports through \u0060console.*\u0060 at line 141 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e41774363e8c356c2e165ac0e995f76ac4772d73329e98bbda1652c6806ec6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060 reports through \u0060console.*\u0060 at line 154 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdff18f1348b690763df3065212662c2585dbadacd6ac2047ffbb7fe3ae01d7d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060 reports through \u0060console.*\u0060 at line 167 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ecaa3ee9eadebbdc9230183c948a924c7df33ac7268fb5403f48c3c4151fdc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060 reports through \u0060console.*\u0060 at line 180 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"774b136fdf544b7e125516f1a710233b28502f57900d0463a4b25c3bf2d5bb60"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/composables/useTauriEvents.ts\u0060 reports through \u0060console.*\u0060 at line 193 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"397408e38ae89f7fbfd852c14ea2462dd3123de2d9a53f9b07e51c2521c5718f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/components/editor/useQueryEditorCompletion.ts\u0060 reports through \u0060console.*\u0060 at line 805 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e95aed154ab71f084f3f413a29a84e2f6a7bdbd85ef884a93fedc9aa137f59"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/components/editor/useQueryEditorCompletion.ts\u0060 reports through \u0060console.*\u0060 at line 1899 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c62adfbd1647fd0b2c877065494dbfdeef29d99450d1298562e3c252411f288"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts\u0060 reports through \u0060console.*\u0060 at line 516 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecea8d97b1c0d8dd45d1e727b6b97cde93991ad2909387e6a8369e9f53b8c23"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/components/editor/useQueryEditorHover.ts\u0060 reports through \u0060console.*\u0060 at line 102 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb8924e0a84068418d3a69666794eed91ff735aeb9488fdd15fab337adba158"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/components/editor/useQueryEditorHover.ts\u0060 reports through \u0060console.*\u0060 at line 255 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"632cda018cba482f46115676b1b7d88374cbeafd08a46c33671b56e63346fe21"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/components/editor/useQueryEditorHover.ts\u0060 reports through \u0060console.*\u0060 at line 273 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"162cfe6ddb827a81ea97d41022a14236702d6bd45ae9141689944798b63cf08b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060apps/desktop/src/components/editor/useQueryEditorHover.ts\u0060 reports through \u0060console.*\u0060 at line 280 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d55a422331683ed1b76ed7452de9c2f3368d706d7b7b035b59caf53c94b917"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060.openConnection(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbfe188a631cee1d15216b177e7c6b7bbefa6b31a7d291a0991f0bde113ffb4"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060.openConnection(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1b860dedc640936bdfdef83f34598e99b0e2c1a591fc86909e569e92c5d128"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060.openConnection(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"550931170385ba4957e54a8a667b2ad5ed4024d0cc66520ac0324202536926c7"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060.openConnection(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"434fbb471faf05c82c36b54cd1235cd21e09c7b855e9de2ae51aac264bdb39f8"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060.openConnection(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1908ef8954d8b650d382a374c8f9e25ac4ecabd9a313660400e878930dbd999"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060urllib.request.urlopen(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/build_driver_zips.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"00976b17c9687ce3423c430c0bc29bff8e478480990c282cf6ba24079a13b894"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::builder()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316cff79853b01f67682852e4dc13ce646589ffb7b4d62ae3818683ded746f3"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::builder()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d19c58126269b6efb1c54e6b8b7e45ccc4ffd5cc231a425ac23a9ea202a6ab"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::new()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"66312ac82dfd8b083c4b8ff6816c961173bcac8b79489cb4556f760ff0e68c4f"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_manager.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb690abb2d2c84601e1ec14aa5169ca01dddecc4b655d3eae1550ae15dd47f2"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::builder()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/navicat_mysql_tunnel.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2865ad6028fe6a678f1542ce3cbc72f06c97e0dac3a9a81dba4abf56705321"}},{"ruleId":"PF1","level":"note","message":{"text":"Benchmarks don\u0027t track allocations: A Go testing.B suite exists but nothing turns on its allocation measurement \u2014 allocations (the main way hot code pressures a garbage collector or allocator) aren\u0027t being measured."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/integration_test.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cddbf2bf1d7a334658e94c2a103d6b9b465cf7584f0931e2f14c8978b5c205"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060enable_wal_mode\u0060 is async and calls thread::sleep \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"6808e5e33dede354c72f49863d54088fb90ae34504be68ed23b547e31e6e5e1d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060cleanup\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/bench/editor-scenarios.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e738416d65304effde354c2f8ee0f9492995460ad7ec77d37b9f142cb7672e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 46 sibling directories (357 clone groups): 357 duplicated blocks under apps/desktop/src/components/ have copies in at least two of the sibling directories admin, ai, auth, backup, chart, codeSnapshot (\u002B40 more sibling(s) not listed) \u2014 205 of them are reported below, and 152 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 357 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 357 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 357 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":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8881aa7a5f86ad531f55df4924a0381f4ebeb17251a20f21754d3dc4703c566d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (221 clone groups): 221 duplicated blocks under apps/desktop/src/ have copies in at least two of the sibling directories components, composables, lib, stores, types \u2014 135 of them are reported below, and 86 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 221 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 221 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 221 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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f4dac1db78bc96a615c6d36db1e1ca099f2bf475fcad990d8f0b3ad7922490"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 46 sibling directories (149 clone groups): 149 duplicated blocks under apps/desktop/src/lib/ have copies in at least two of the sibling directories ai, app, backend, backup, cloudSync, codeSnapshot (\u002B40 more sibling(s) not listed) \u2014 95 of them are reported below, and 54 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 149 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 149 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 149 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":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"7565db29ccfe907278ed0f2ea617a95ebae2aa40dbb2abce1604a422493d9fa2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (217 matched lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:1670 \u00B7 apps/desktop/src/lib/backend/tauri.ts:2110 \u2014 the two spans are one implementation copied and then locally edited \u2014 1200 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea061bc9a16dfbbd9aaa740821a9b2a3f7afde27a58625e5d2a97fc80824d2c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (192 matched lines \u00D7 2 locations): apps/desktop/src/components/admin/DamengRoleAdmin.vue:58 \u00B7 apps/desktop/src/components/admin/DamengUserAdmin.vue:81 \u2014 the two spans are one implementation copied and then locally edited \u2014 1634 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":"apps/desktop/src/components/admin/DamengRoleAdmin.vue"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"057a1edcce5bde0795ce6b67e93a7fc1fed3634f1196705b0236a2e28ee65156"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (178 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:1422 \u00B7 apps/desktop/src/components/transfer/TransferTaskTree.vue:333 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d118c9d4d19e2e0c18bd27085b562a78f34c6b2bc44b9a950f1c8a282e9d210"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (163 matched lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridFilterBuilder.vue:78 \u00B7 apps/desktop/src/components/grid/DataGridSortBuilder.vue:49 \u2014 the two spans are one implementation copied and then locally edited \u2014 1169 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":"apps/desktop/src/components/grid/DataGridFilterBuilder.vue"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0043a6c3389b496a40a0afa1d6225b1636e10e88786c691a52648b05f1b3aaed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (110 matched lines \u00D7 2 locations): apps/desktop/src/lib/metadata/objectDdlCache.ts:44 \u00B7 apps/desktop/src/lib/metadata/objectMetadataCache.ts:25 \u2014 the two spans are one implementation copied and then locally edited \u2014 1086 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":"apps/desktop/src/lib/metadata/objectDdlCache.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ccb0829b878bcfac78554e9e3b49f56ebe82d46cc6fcdd07cf8fbd93a44539"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (102 matched lines \u00D7 2 locations): apps/desktop/src/components/admin/MySqlDashboard.vue:32 \u00B7 apps/desktop/src/components/admin/PostgresDashboard.vue:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 1103 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":"apps/desktop/src/components/admin/MySqlDashboard.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f6ec59b0a26da05e92eedfe53afc5c7a6cbe82faf14394af5fc405e5bdc2c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (101 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue:84 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue:58 \u2014 the two spans are one implementation copied and then locally edited \u2014 589 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":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bca3e0a244a9dada6f5435bf10d26de5d5f2523d0b94f301bc8d08fe20b456"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (90 matched lines \u00D7 2 locations): apps/desktop/src/components/sidebar/TreeItem.vue:319 \u00B7 apps/desktop/src/lib/sidebar/treeNodeIcon.ts:54 \u2014 the two spans are one implementation copied and then locally edited \u2014 587 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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e5fc9b80d62690c54884675df70ba8668ccd625cb84b3eedcef4f9b12d39f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (81 matched lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridTextFilterWorkbench.vue:45 \u00B7 apps/desktop/src/components/grid/DataGridTextSortWorkbench.vue:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 610 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":"apps/desktop/src/components/grid/DataGridTextFilterWorkbench.vue"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cc7cf3b35e90584613aa8dac529afe4de7c4c2e624f8412f52abf63b3b2bc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (73 matched lines \u00D7 2 locations): apps/desktop/src/lib/app/documentJsonValues.ts:306 \u00B7 apps/desktop/src/lib/common/safeJsonFormat.ts:466 \u2014 the two spans are one implementation copied and then locally edited \u2014 596 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":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a512315fb1ee06a94da19d3bb238476c0428a0e5c2b9e4e43499d62eb0760b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (73 matched lines \u00D7 2 locations): apps/desktop/src/lib/metadata/objectDdlCache.ts:193 \u00B7 apps/desktop/src/lib/metadata/objectMetadataCache.ts:131 \u2014 the two spans are one implementation copied and then locally edited \u2014 569 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":"apps/desktop/src/lib/metadata/objectDdlCache.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b0189a8ab9ca1f44a09e0336125f439bc76e82c8807f2810c90a9f600426e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (72 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:1253 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:1487 \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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"40740e1ed823ea68e30c08bef6cf18e7c63853834bf0d1caef6c1918d4e33589"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (66 matched lines \u00D7 2 locations): apps/desktop/src/components/ui/LightDropdown.vue:107 \u00B7 apps/desktop/src/components/ui/LightDropdownMenu.vue:128 \u2014 the two spans are one implementation copied and then locally edited \u2014 471 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":"apps/desktop/src/components/ui/LightDropdown.vue"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfaa23c31341d26aecf2956f6ec4669408fd90ebe671549ce5d89bb560af4226"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (65 matched lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionTreeSelect.vue:96 \u00B7 apps/desktop/src/components/ui/searchable-select/SearchableSelect.vue:176 \u2014 the two spans are one implementation copied and then locally edited \u2014 441 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":"apps/desktop/src/components/connection/ConnectionTreeSelect.vue"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc98f415ad11ff32813a6d97cfa96739750776cbd4ab1f45133b80045f83c322"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4391 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4528 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4391}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a16bc24bd65ccd3d77fcc7fe06a7b193f503502e194ce21a1c9bce2f75386f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (62 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/ProducerConsumerPanel.vue:12 \u00B7 apps/desktop/src/components/mq/SendMessagePanel.vue:12 \u2014 the two spans are one implementation copied and then locally edited \u2014 401 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":"apps/desktop/src/components/mq/ProducerConsumerPanel.vue"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5629ef21194db051e7c635c40fda7f7abc8f5b859b79cdd29000c83ab52eb81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (61 matched lines \u00D7 2 locations): apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue:65 \u00B7 apps/desktop/src/components/grid/GridSnapshotDialog.vue:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 436 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":"apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f111ea0b46b29731dcd9ec1e5078eb4c6a2ca9148107b6ee5b5c47f040a06951"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (61 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/ConnectionTree.vue:1447 \u00B7 apps/desktop/src/components/sidebar/ConnectionTree.vue:1520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"5699042b974968923b9259ea4ec7868ebaad507778e5fd1eeea8b1578d44e154"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (57 matched lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginFilesystemTab.vue:20 \u00B7 apps/desktop/src/components/plugins/PluginWorkbenchTab.vue:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 408 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":"apps/desktop/src/components/plugins/PluginFilesystemTab.vue"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f3774decf0ed9095fd668a2b5700e737e84251d1a981d10c454bd275259ed2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (56 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlFormatter.ts:633 \u00B7 apps/desktop/src/lib/sql/sqlFormatter.ts:1004 \u2014 the two spans are one implementation copied and then locally edited \u2014 473 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"110790ce427367c05080b7128448a667e8d5c1e23694d517c901aa0242ec8fdb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (55 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/identifierSearch.ts:8 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:7095 \u2014 the two spans are one implementation copied and then locally edited \u2014 454 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":"apps/desktop/src/lib/sql/identifierSearch.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"226c966670d3f78d6d21edbd4a39c8a055cbd475cf115895e825ec080109265c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (54 matched lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridCanvasRuntime.ts:68 \u00B7 apps/desktop/src/composables/useDataGridScrollbars.ts:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 260 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridCanvasRuntime.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff12bac4caf88f05fa7b6602b031ab1900ac561c1c48f8827585652a1577edea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2 locations): apps/desktop/src/lib/backend/tauri.ts:393 \u00B7 apps/desktop/src/stores/settingsStore.ts:92 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7908809120d098121850041f45ca2ecf19422e9985bcd81cbd908f504025a3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/IdNumberParams.vue:37 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:708 \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":"apps/desktop/src/components/generate/params/IdNumberParams.vue"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"168c14a56a85c8e8819bd4a968e58dcba08f13893e53e52b64dc0908b9261be9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (49 matched lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginFileManager.vue:190 \u00B7 apps/desktop/src/composables/usePluginShortcutHeight.ts:64 \u2014 the two spans are one implementation copied and then locally edited \u2014 344 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":"apps/desktop/src/components/plugins/PluginFileManager.vue"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b96880ec6411005cfd4a191be4ab620190dc866b1375eec7747f51aa40d2033"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (49 matched lines \u00D7 2 locations): apps/desktop/src/lib/table/oraclePackageSaveAs.ts:38 \u00B7 apps/desktop/src/lib/table/oracleRoutineRename.ts:53 \u2014 the two spans are one implementation copied and then locally edited \u2014 541 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":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6466fb37487a2ba12d315aad2679aacdd9bae8d63ef4fb95d1c15155e50168f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (49 matched lines \u00D7 2 locations): apps/desktop/src/stores/savedSqlStore.ts:1061 \u00B7 apps/desktop/src/stores/transferTaskStore.ts:397 \u2014 the two spans are one implementation copied and then locally edited \u2014 599 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"143bbc5a2a4a75afdc406aaff8653887ba458d8bf04adc7932f07f50f34bd6aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffDeployStep.vue:380 \u00B7 apps/desktop/src/components/diff/SchemaDiffObjectTree.vue:43 \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":"apps/desktop/src/components/diff/SchemaDiffDeployStep.vue"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"379990ae908d0ea0138eae2a1b7f8edb8ceea3651b86171a5b6fdb007089e111"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:5254 \u00B7 apps/desktop/src/components/objects/ObjectSourceDialog.vue:277 \u2014 the two spans are one implementation copied and then locally edited \u2014 282 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cd06d0408dd51ce36c2ee3488ecee74579506d14e5ecfd4551664df3972d98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): apps/desktop/src/components/sidebar/VisibleNacosNamespacesDialog.vue:20 \u00B7 apps/desktop/src/components/sidebar/VisibleSchemasDialog.vue:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 334 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":"apps/desktop/src/components/sidebar/VisibleNacosNamespacesDialog.vue"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc30a64f8e4c5b38293a7660ff2b99ba45ef0b4d5f9414bcb523a055c5e7a72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (47 matched lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffConfigStep.vue:160 \u00B7 apps/desktop/src/components/diff/SchemaDiffConfigStep.vue:370 \u2014 the two spans are one implementation copied and then locally edited \u2014 343 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3699b475a983161f698f752d7241dcce7080e23672db9e65fa1759e6fbad572d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): apps/desktop/src/lib/backend/tauri.ts:6903 \u00B7 apps/desktop/src/lib/backend/tauri.ts:6955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":6903}}}],"partialFingerprints":{"codehealthFindingId/v1":"693e3066116c97463a21c4d8e8e08e56d788f5ef38df8a3f51fc12f25c5e4da5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:7214 \u00B7 apps/desktop/src/components/connection/TunnelProfileManager.vue:84 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":7214}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a07409a98688616f4015e837f168b90abc2c5cc19149ee0120f5334a1bb153"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2 locations): apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:879 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:925 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fce32d11403dcefe499882d3eae938f91cfa34b8bedc9bb9586e9f51d4e3600"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:3847 \u00B7 apps/desktop/src/lib/backend/http.ts:3920 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3847}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adceb4d5eb2f8030f4e6c8cf51d8635943e10b430548ef867e156a040973c87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:2515 \u00B7 apps/desktop/src/stores/queryStore.ts:2641 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"039335adbe0a5f3d180843955465ae44ffba578ceac2e30479bccad8b934f956"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:2944 \u00B7 apps/desktop/src/lib/backend/tauri.ts:542 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d16a5a4750e3628bdb1f661655425f302c868e2a52be09f73487d4a93bbd57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue:127 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:7317 \u2014 the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"749b1776eb757cfbf972095b4a5e4e536a115c3f5196db89645c6f653cba9193"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:3029 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:3177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":3029}}}],"partialFingerprints":{"codehealthFindingId/v1":"42189665ebce0a889257dd8b5adc496a80ce062517cb831d33cd4d1c8191f0f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/IdNumberParams.vue:149 \u00B7 apps/desktop/src/components/generate/params/SkuParams.vue:22 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/IdNumberParams.vue"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8846f5faadb7c1c2f27b177f36f0920f6ac3b34e895e2a9d43d8aae460a764"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (40 matched lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:993 \u00B7 apps/desktop/src/components/grid/DataGridBulkEditDialog.vue:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 336 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"717bf8b1883a98d57823238dca3543e8d8758432ad68719f02022e693cd482ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulAcl.vue:14 \u00B7 apps/desktop/src/components/consul/ConsulScope.vue:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 389 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":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"695508ed867541cbce9e526dcb6e57ad9bf009cecac7947940b45b590af39f05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): apps/desktop/src/components/mq/BrokerPanel.vue:47 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqMonitoringPanel.vue:36 \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":"apps/desktop/src/components/mq/BrokerPanel.vue"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1459f8c6ea4fdbbc89c24bbc676c321ad85f4820cc7c13690fe15651d4bc8bb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/NamespacesPanel.vue:23 \u00B7 apps/desktop/src/components/mq/TenantsPanel.vue:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 247 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":"apps/desktop/src/components/mq/NamespacesPanel.vue"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"95025e38b9375ba5bddcdb0c2eb6a4d04f5e538917d5b5b56936c90856060b88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:1972 \u00B7 apps/desktop/src/lib/sql/sqlVariables.ts:389 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6edb6373feae5ae47fdc19bfa22c2a16fccc0dda64fec70b087c812e14ef44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3031 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4394 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a975486c2f31d134f274045543d31ce29614bd72553aa1c0647e0911c5f6b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): apps/desktop/src/components/debug/VariablesPanel.vue:116 \u00B7 apps/desktop/src/components/debug/VariablesPanel.vue:169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/VariablesPanel.vue"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f390ce7028f000869b57c4f443cc8997ee4c0a3aebdb1a309b75d1966fd5820e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts:262 \u00B7 apps/desktop/src/lib/sql/sqlInListPaste.ts:87 \u2014 the two spans are one implementation copied and then locally edited \u2014 237 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":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eabcbc6d4400aae46dd7b409ede6ad7158de4ac1b5714af77f9b0c179cd44cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): apps/desktop/src/lib/database/mysqlProcessList.ts:73 \u00B7 apps/desktop/src/lib/database/postgresProcessList.ts:93 \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":"apps/desktop/src/lib/database/mysqlProcessList.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d726db95acdddbea13757b8fb21bc24fb3a42e270954478a5c2d07e5a6093ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5346 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5329 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b76131c55dd2b72c323892ab9d4cc1607054333f87a016d7e62c4ce56f230e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridFilterWorkbench.vue:13 \u00B7 apps/desktop/src/components/grid/DataGridTextFilterWorkbench.vue:16 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridFilterWorkbench.vue"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d60541a27c11936e1347efc7c1a7d15f168280fb6cef5ff427a961660348ab3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): apps/desktop/src/i18n/locales/en.ts:13701 \u00B7 apps/desktop/src/i18n/locales/nacosAccessControl.ts:137 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/locales/en.ts"},"region":{"startLine":13701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4352b479693a445936f02a8e7dc2550bb175c58ee892bb5154fdd93ef1a6b8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5564 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5540 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5564}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f923dbec1d23d58864efc64c6ce968f4e7be545d4d008a37731e9306d584ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:1039 \u00B7 apps/desktop/src/components/layout/SqlLibraryPanel.vue:1073 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd76bf6b4afc0ae53a294c1d8e2f19ad35490bc5ac5452e510d30d142d720341"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4057 \u00B7 apps/desktop/src/composables/useSidebarTableMutationRuntime.ts:129 \u2014 the two spans are one implementation copied and then locally edited \u2014 212 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"795229cb43a4b9fb7d7e942b16d668c42b5a88dfde595e2c2c9b46e039bb16a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): apps/desktop/src/components/transfer/DataTransferDialog.vue:1264 \u00B7 apps/desktop/src/components/transfer/DataTransferDialog.vue:1301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a541f92a2a5b3179933ce7286b620ffc93c8bcf910972bf20f8349f93ce36cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridFilterBuilder.ts:31 \u00B7 apps/desktop/src/composables/useDataGridSortBuilder.ts:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 361 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":"apps/desktop/src/composables/useDataGridFilterBuilder.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"25805f2525b2908c51298c7b3b8d9709df58a82a0091e5b65dd7d0f4449f5e1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): apps/desktop/src/lib/backend/tauri.ts:6459 \u00B7 apps/desktop/src/lib/backend/tauri.ts:6654 \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":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":6459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea87fb5dc73b104464faa5544a0bd8422a6594b2dbaddcd9e060cb8ee78e5b98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5295 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5266 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5295}}}],"partialFingerprints":{"codehealthFindingId/v1":"59412f250ecb7cecdb1dfa35e4561352e93d757507e8e571bdefd8ad7a138e0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): apps/desktop/src/lib/database/productionSafety.ts:307 \u00B7 apps/desktop/src/lib/sql/sqlRisk.ts:283 \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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0657f2fafe0eef28a3f8a0e6dfd5be483a60274556b51a96c7d51e29fe51d603"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): apps/desktop/src/lib/database/visibleDatabases.ts:41 \u00B7 apps/desktop/src/lib/database/visibleDatabases.ts:84 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/visibleDatabases.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5574c92c51986227b2fb78e2e8783bd55779352e78b60e4c610df799bc53c6a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): apps/desktop/src/components/generate/DataGenerateDialog.vue:147 \u00B7 apps/desktop/src/components/generate/DataGenerateDialog.vue:262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8bf89ec15de17bc2577e7835c053cd7af1793b89ed79963131aaf2edbf2f4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): apps/desktop/src/lib/ai/aiCodeHighlighter.ts:91 \u00B7 apps/desktop/src/lib/model/modelCodeHighlighter.ts:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 217 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":"apps/desktop/src/lib/ai/aiCodeHighlighter.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"86847741b77b3e38c9b1f5eefd6f5fcf70c60a81c5f8991b10d7f5f8c35c2daa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3 locations): apps/desktop/src/stores/connectionStore.ts:8864 \u00B7 apps/desktop/src/stores/connectionStore.ts:8895 \u00B7 apps/desktop/src/stores/connectionStore.ts:8926 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8864}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb53e85c7ab3a6d8198a8ce7effd7d044bf7bc24f7a02f42d2959ab8f5f9da91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/ExchangesPanel.vue:125 \u00B7 apps/desktop/src/components/mq/TopicsPanel.vue:290 \u2014 the two spans are one implementation copied and then locally edited \u2014 194 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":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f92e8107b90903d079f9f4dbd983d7e83812c1052ff603e8532ee280497c48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2656 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2702 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d80cfb042db41dccd2f5ac85ca850657b8dfa501565fe022dc312859322600"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:5207 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:5275 \u2014 the two spans are one implementation copied and then locally edited \u2014 178 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":5207}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a848cac2713816e28a876a9371e43bfaf1b8bc90fde7956449c5ece9aed2c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): apps/desktop/src/lib/elasticsearch/elasticsearchRequestRisk.ts:82 \u00B7 apps/desktop/src/lib/solr/solrRequestRisk.ts:145 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchRequestRisk.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4d00e0a2c0359b37c8e6f971d5688b4323025ad348fc4fadd2506fdaf7ce6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:2078 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:2220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad79874c66f6048ebdbf82205181a7ba3c0a13158020896ffc45dc42390907e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): apps/desktop/src/lib/app/documentStoreProvider.ts:651 \u00B7 apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts:265 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"3133bb58b1117bcc2358acd09aa394bd98921da67074339be2c0039ddb1f4a53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:2040 \u00B7 apps/desktop/src/lib/backend/tauri.ts:2476 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcc1b4a5e295b1a086a505c9d94dfcce2c92d0fd2c281068010b560757562f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4106 \u00B7 apps/desktop/src/lib/backend/tauri.ts:3975 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac5a08349b7195a021c43264abdc52f41f210400c296bf7a7f8fc7303d6d943"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5450 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5425 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb0c9302f64aeae253c303225658165c538da674e84bfda7956532428516c49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5653 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5631 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5653}}}],"partialFingerprints":{"codehealthFindingId/v1":"c555a78ae1c5925a3aa1a7c43c889b083bdaf3b19baa76f1ee3ba1d42a9ae615"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): apps/desktop/src/lib/diagram/elk-layout.ts:270 \u00B7 apps/desktop/src/lib/diagram/elk-layout.ts:349 \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":"apps/desktop/src/lib/diagram/elk-layout.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"548a60bf0041cb9f83d8aba280418f2b4608c2165f54533655d86571f866bc6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:2978 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:3221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d7bb1ce9aa8bf5750f51458c5500b3afb26beb9156404f9e884453a7234a23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorCompletion.ts:1014 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:1082 \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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b02cce14e5240db36d9d9e073b65e5e5e52b0c735f1908de89b06161b80292"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts:469 \u00B7 apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts:612 \u2014 the two spans are one implementation copied and then locally edited \u2014 252 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0ab219b769d6fad4f793a60205a46a55c643a49992c82d9668ec1400624477"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:3564 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:3638 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"2665603451600ae3b53645377f22ba198ceb6f81c2b15a3d391ad61e8345cc1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:14660 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:14705 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14660}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1248c0c2f815b6dffb7fa8867db86b0b782ec8c51d073625f8c0ce47771246"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): apps/desktop/src/components/objects/DatabaseBrowser.vue:350 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:1399 \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":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93603a975d0b877974173aeea1bdea4686c2e52d9f3c0da23ad6c3034d5ce60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:3441 \u00B7 apps/desktop/src/lib/backend/http.ts:3669 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5898a51247e6b5b3bd4b0988b78db5bad1a3e3e170b986ce2197c7aa0eb60fda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): apps/desktop/src/lib/backend/tauri.ts:2125 \u00B7 apps/desktop/src/lib/backend/tauri.ts:2158 \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":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"646f2ccf17496a372bb77eb850debea9a9be2a656e67e237cec4871280623a04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): apps/desktop/src/lib/imports/datagripImport.ts:156 \u00B7 apps/desktop/src/lib/imports/dbeaverImport.ts:161 \u2014 the two spans are one implementation copied and then locally edited \u2014 234 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":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f91d9746f95cab7c168b56c79b91fe590fbd9ac8d9fce41d36f024ddd2d9f77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarLayout.ts:649 \u00B7 apps/desktop/src/lib/table/tableVGroup.ts:391 \u2014 the two spans are one implementation copied and then locally edited \u2014 231 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":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc08a30a6b2c010da9e43a3c27d1b94d06f2a4d49f103abcbe0f8345d5f613e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts:123 \u00B7 apps/desktop/src/lib/sql/oracleSyntaxDiagnostics.ts:163 \u2014 the two spans are one implementation copied and then locally edited \u2014 223 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":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6625d3b48ab50873f36ac384bcc93c8b78024b565eb7d8b2acfb82fc92743409"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): apps/desktop/src/stores/savedSqlStore.ts:102 \u00B7 apps/desktop/src/stores/transferTaskStore.ts:12 \u2014 the two spans are one implementation copied and then locally edited \u2014 248 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a620e0b2e6ca3ec0ed4e1a39818263c80ddc8b794811a9fa095679f16a049c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/HostnameParams.vue:10 \u00B7 apps/desktop/src/components/generate/params/UrlParams.vue:10 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/HostnameParams.vue"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a250dc6efc0b58f5956d3b09ff258c423d612274a0a80bfa6500b1564878193"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:2366 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:2393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef8456dd4c88ee42618b03663f3db01703dda1091f04b6d08d5e29527ff6103"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4181 \u00B7 apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:482 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bac1c38d1d4c288711148d181762faaef1f783766d85bcf1ecf4b36552c4067"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlAnalysis.ts:946 \u00B7 apps/desktop/src/lib/sql/sqlAnalysis.ts:990 \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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee04b36f3a975d3b8f7be378895f10d891214f7bee13447822d26a915e54199"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (25 matched lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:1093 \u00B7 apps/desktop/src/components/editor/QueryHistory.vue:495 \u2014 the two spans are one implementation copied and then locally edited \u2014 160 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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4bbf3fda90760d03bc2cf8299950fda3c8761d1c1367ab36c7691ae732936c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): apps/desktop/src/components/mq/PermissionsPanel.vue:53 \u00B7 apps/desktop/src/components/mq/PoliciesPanel.vue:55 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/PermissionsPanel.vue"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da1f4d2a7f5dae52b0713db16968f08c948b3617b9cd60d583db98be05003b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosConfigDiffDialog.vue:71 \u00B7 apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue:386 \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":"apps/desktop/src/components/nacos/NacosConfigDiffDialog.vue"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"004397ac34b5fe7ac8cf9a2b264557d31bff96f1ce135517fecf6c9aa0db97aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisValueViewer.vue:2283 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:2312 \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":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"644873054a7190f1ca6fdbf6775fc2e7acb0e03d36ef6df4bf3455752c8d4c4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5851 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5900 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5851}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a757df3d5e291f98943f5bcfbfda2adb1252d2fbb047153beb9bf3a5dbfca5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts:90 \u00B7 apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts:125 \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":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed00d4f34bc7489ee46942f154caf697e510904aae849ee4b8e99b400ac815b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): apps/desktop/src/lib/metadata/tableMetadataCache.ts:99 \u00B7 apps/desktop/src/lib/metadata/tableMetadataCache.ts:132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4bc06b1c6af5e127588815921bd1f5d9510c9a1aec9536e6edd5c03a1f6171"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:2898 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:3119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":2898}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8d44b18f5ea4591f1b0785c3160cbc39b9c89d3eb8dec85ffc7345e5c85c12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdAccessControl.vue:107 \u00B7 apps/desktop/src/components/etcd/EtcdAdminConsole.vue:173 \u2014 the two spans are one implementation copied and then locally edited \u2014 186 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":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ba102ce45f7d30bae41e7ede34510debb1e86105ca0ff5b8fbe9bc0d097bf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): apps/desktop/src/components/generate/params/DateParams.vue:9 \u00B7 apps/desktop/src/components/generate/params/DateTimeParams.vue:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 285 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":"apps/desktop/src/components/generate/params/DateParams.vue"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dc7c9f33ca2a5c4e722221c20389463911ecd1e72f60bd09cb868c40ae3bd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/TopicsPanel.vue:443 \u00B7 apps/desktop/src/components/mq/TopicsPanel.vue:526 \u2014 the two spans are one implementation copied and then locally edited \u2014 130 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TopicsPanel.vue"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13320b426fb77723874050c23689addbd080193535d9f5ab96319b2db844135"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): apps/desktop/src/lib/database/productionSafety.ts:276 \u00B7 apps/desktop/src/lib/sql/sqlRisk.ts:252 \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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8502d241708a32cb1517e7e1bdc6b55a9c76179d82984a953c3b4d27f697559"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:1485 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:1596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fe11e8d979e7a95ec5c123890d598e10b8f0e2799eb6c24b1223360af9ed66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4 locations): apps/desktop/src/stores/connectionStore.ts:8790 \u00B7 apps/desktop/src/stores/connectionStore.ts:8876 \u00B7 apps/desktop/src/stores/connectionStore.ts:8907 \u00B7 apps/desktop/src/stores/connectionStore.ts:8938 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8790}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd37aeddef87b4b3ec0e8be05ba1a5dd456d1043028b8ce5ff1c10e5bdc6b9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/rabbitmq/RabbitMqClientsPanel.vue:11 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 195 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":"apps/desktop/src/components/mq/rabbitmq/RabbitMqClientsPanel.vue"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f718beb23a01fb75fe26a7567ffb965545204b64b9c87e4994d5fc24b8ac91da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): apps/desktop/src/components/transfer/DataTransferDialog.vue:509 \u00B7 apps/desktop/src/components/transfer/DataTransferDialog.vue:538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"7592f3d3e582d0d9b5496aa10b990db8b8a96712433b2a1168d01eadd3710bf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarLayout.ts:516 \u00B7 apps/desktop/src/lib/table/tableVGroup.ts:324 \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":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18916a7ad43b50ee8204ee34fe3d20b7e8d712be4a26e0eacc8c9f28d4aab4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:4476 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:4536 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:4813 \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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4476}}}],"partialFingerprints":{"codehealthFindingId/v1":"66459b76ba30dbf64b0f1000638f0111e4dfff2ee0227482b0e1b9421a4794fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): apps/desktop/src/components/admin/DatabaseUserAdmin.vue:864 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:6037 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"d558729ec4c390f0181b0cc0cd1e2e5e4252ea7a8a7c28f7c37aa7f65bd590fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): apps/desktop/src/components/admin/ProcessListPanel.vue:241 \u00B7 apps/desktop/src/components/admin/ProcessListPanel.vue:314 \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":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af47f57ea44a09439ef420f9d2b5a6d10c52dc3932b838404f2b14c5aff1344"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:5906 \u00B7 apps/desktop/src/lib/zookeeper/zookeeperConnection.ts:25 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":5906}}}],"partialFingerprints":{"codehealthFindingId/v1":"27160a2970d6189c00dcc750580c12a34b47c560ea248f4fbb221f54508fb7f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:7355 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:7378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":7355}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1082b4c19d78d455ebe014647a724b50c562ce079efdc13a06479ebcd70ef96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/SkuParams.vue:41 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:669 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SkuParams.vue"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c709f7441fbd0085e43c306a7bd162aa09f7ade10008250045d8637d2dc61288"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue:945 \u00B7 apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue:1010 \u2014 the two spans are one implementation copied and then locally edited \u2014 149 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6398e6a0980efc5035098c1279d405cfc827cab720af110b05e925ed3267ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:601 \u00B7 apps/desktop/src/components/ui/searchable-select/SearchableSelect.vue:265 \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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"628e0dbebe11d30b282de169dac22cebbcd4a55ac29795cf8f05df8b347a8d4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): apps/desktop/src/components/sidebar/TreeItem.vue:443 \u00B7 apps/desktop/src/lib/sidebar/treeNodeIcon.ts:144 \u2014 the two spans are one implementation copied and then locally edited \u2014 160 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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42a7fef726e0380ec48b06775c0135deef48eed6cd5f62aa8189d48ffc8bfd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5628 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5606 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5628}}}],"partialFingerprints":{"codehealthFindingId/v1":"787d4223ad5acd7bf857d6c10ded12fdf000a0298757fc0686a74a3620f17ebc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridSavedRowRefresh.ts:33 \u00B7 apps/desktop/src/lib/dataGrid/dataGridSelectionPersistence.ts:66 \u2014 the two spans are one implementation copied and then locally edited \u2014 242 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":"apps/desktop/src/lib/dataGrid/dataGridSavedRowRefresh.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2f5a61f162ecdba1d6f43157dd452683c1045f93f9b838db3f1002f44d94c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): apps/desktop/src/lib/export/exportPath.ts:34 \u00B7 apps/desktop/src/lib/export/exportPath.ts:67 \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":"apps/desktop/src/lib/export/exportPath.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"670a9dea4b81567f3ebe48b4d740048ed97eb297eba7ec7e64ce761b7e143d1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:2359 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:2797 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a13db5ab8be1ba105cc3708f2d68774e60055bab2ea19c76c9780409dd07e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:8288 \u00B7 apps/desktop/src/stores/connectionStore.ts:8335 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8288}}}],"partialFingerprints":{"codehealthFindingId/v1":"354a1ece3c0f47619965b6401ff0b8a8724b47917584941fdd3f0940f0021fd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffConfigStep.vue:514 \u00B7 apps/desktop/src/components/diff/SchemaDiffConfigStep.vue:685 \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":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7852c4ec61078ca8d81b6c91854215ad526e903bed561a31e22b60883ca6d4b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorCompletion.ts:1375 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:1924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a070e94871b0f61810160cd31b4b07f6582c32b74a8f7155381795530d813081"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/DepartmentParams.vue:26 \u00B7 apps/desktop/src/components/generate/params/IndustryParams.vue:26 \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":"apps/desktop/src/components/generate/params/DepartmentParams.vue"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f37b2d63ee6f4280de10563fd25daf8474cce4efb3a0c7af937c404899359ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:3267 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:3289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61d5ed559371c85d90bc708b44ae9cab5ffad027062de256b819c167ce86064"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:9084 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:9108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9084}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f438c4f511ab54e421dfcd3045295346330839f585f04e37d4e104fffea7e72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:14930 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:14956 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14930}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db3727e204a6c82c7eac73f0534951b47838390af4bb6e341d018cc7de9c176"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): apps/desktop/src/composables/useDataCompareSession.ts:454 \u00B7 apps/desktop/src/composables/useSchemaDiffSession.ts:417 \u2014 the two spans are one implementation copied and then locally edited \u2014 132 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":"apps/desktop/src/composables/useDataCompareSession.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9c2722732bbd5e129441eac691199292c28d6e21cae13972710c450bd0f73f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4337 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4182 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f739f4de36705044b31b849c3bdafe2290d079b78d79ba2092d6a839c906b55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5787 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5788 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5787}}}],"partialFingerprints":{"codehealthFindingId/v1":"785ce81ea67ceacf7c5302c4f44c8740f9ab7a046abfeb271773c1f23ceb476d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionUrl.ts:639 \u00B7 apps/desktop/src/lib/connection/connectionUrl.ts:661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"364949f1ecbc0d57d727f7f86cbd3fda9d6bb65b46e15bda8784c30928ebab0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3 locations): apps/desktop/src/stores/queryStore.ts:4215 \u00B7 apps/desktop/src/stores/queryStore.ts:4238 \u00B7 apps/desktop/src/stores/queryStore.ts:4261 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2479019d942cb1256206520bb78bff810733a40dafaea9ba45b38b6f75ccc31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:7514 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:7540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":7514}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cd3d8d3fe02e8d646f9dcee4151203303f5a7e7c082a8e8994a11cf4735e9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffConfigStep.vue:742 \u00B7 apps/desktop/src/components/diff/SchemaDiffDialog.vue:1578 \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":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"2491ddc64d3d062a5507e3b57a05b5c08c02217cb3bb628dfc1c40333178403d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue:165 \u00B7 apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue:189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb38f27cb2f79d1c37aeda4b1381472d1f495e1c0240f7bb6d2a9057c4e67d45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:1265 \u00B7 apps/desktop/src/components/redis/RedisKeyBrowser.vue:3542 \u2014 the two spans are one implementation copied and then locally edited \u2014 195 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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"25125da70cff37108a5e6462b872737ded2496309c80b1bc512ee40ee31ab0bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:5513 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:5536 \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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":5513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f433c1bd75a2131f95551b400704b26e8bfa9327c338dd50db10c7e8aab788"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/BarcodeParams.vue:35 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:626 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/BarcodeParams.vue"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c1c20aee52ef8c5732589bb5648a5303efb7f05a8c12a1c1659eaf67aed8ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): apps/desktop/src/components/grid/EnumCellEditor.vue:60 \u00B7 apps/desktop/src/components/grid/TemporalCellEditor.vue:225 \u2014 the two spans are one implementation copied and then locally edited \u2014 102 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":"apps/desktop/src/components/grid/EnumCellEditor.vue"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ccbbe7d4e3e32663a374254094fe4e0b0c2c372095b77abb049f18e77c3cf3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/MonitoringPanel.vue:347 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqMonitoringPanel.vue:66 \u2014 the two spans are one implementation copied and then locally edited \u2014 143 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":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd112d2dd0c2dae64767c561accb17eedad462f5e8fe2e81a7a566664caaa07b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/PermissionsPanel.vue:109 \u00B7 apps/desktop/src/components/mq/PermissionsPanel.vue:154 \u2014 the two spans are one implementation copied and then locally edited \u2014 116 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/PermissionsPanel.vue"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"493b3072fa455a599a147ede457f2bdb33fd31fe5fbf7e856284df4562f40fd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/components/mq/TenantsPanel.vue:106 \u00B7 apps/desktop/src/components/mq/TenantsPanel.vue:128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b310dc051fcd85258824aec47bbefbd02066b0db091d4e7f39274022b430b79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:624 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4280 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebe73ef13b87f23ab6c295f55f07c58af1df33e83babf668280354d49739ea7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisValueViewer.vue:2824 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:2848 \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":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":2824}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a05237e53f4b1ed1a44ff2da1ced307a2856ebcc3ffd615437c1d3e40439de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/composables/useDialogSources.ts:234 \u00B7 apps/desktop/src/composables/useDialogSources.ts:368 \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":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6144e22706b716c427c919f64dcd2f51bf1490b048bcc59240b0a30ca772551f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5135 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5007 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeb0704537eeb5f429b09352cee9b98ac07ad6f01eae4c7189d2fbe393476cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:3325 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:3350 \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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc480353661d56c4f17f7c378072f898c7267391ea965fadc82b2bfff97f364"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:6690 \u00B7 apps/desktop/src/stores/connectionStore.ts:6717 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6690}}}],"partialFingerprints":{"codehealthFindingId/v1":"274d0d868a125de148dbbaf46351a3ddc3369b2c7f8350866fcc97f331502e0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/mongo-shell/src/json.ts:233 \u00B7 packages/mongo-shell/src/json.ts:273 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"98214ec5e285b17c9268446e12159639b642d5fd5bdcbdd72b77c38bd8bf4ea7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/mongo-shell/src/json.ts:341 \u00B7 packages/mongo-shell/src/json.ts:454 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed130be6019651173954ed6c7ab1eb81fcf8c691c31333fdd98c29c5739a8db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:6949 \u00B7 apps/desktop/src/components/connection/TunnelProfileManager.vue:186 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6949}}}],"partialFingerprints":{"codehealthFindingId/v1":"06af769757ac257ff93233e4ce9c3f5508f9b222a215d17ea84acac28a82d013"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulKeyBrowser.vue:632 \u00B7 apps/desktop/src/components/kv/KvKeyBrowser.vue:633 \u2014 the two spans are one implementation copied and then locally edited \u2014 115 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":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad42279a67fc85106bf38ceac199e9e6e5fbd44b71e824d8ce3f7079a738d86a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/SubscriptionsPanel.vue:337 \u00B7 apps/desktop/src/components/mq/SubscriptionsPanel.vue:429 \u2014 the two spans are one implementation copied and then locally edited \u2014 111 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc1a771aa033cc9a0c11d1a2752494d27f28bf9e54a327a39925fe6061a397c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/components/objects/DatabaseBrowser.vue:155 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:845 \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":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"972da101587ba2f5569645a3383743c7f46f1b09ba48ba1406975d62b815f201"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/components/objects/DdlViewDialog.vue:417 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:495 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"909a376a0536754783ac109709a319ef17d2114ee149a8f3e606b42e4c3b5303"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginWorkbenchHost.vue:598 \u00B7 apps/desktop/src/components/plugins/PluginWorkbenchHost.vue:645 \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":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccc8f60a3a9001c19903a3f85dd4f9ef8de6cec252513919ffb2ca18b48e671"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/components/settings/SettingsTransferPanel.vue:111 \u00B7 apps/desktop/src/lib/backend/debugLog.ts:252 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/SettingsTransferPanel.vue"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"071a5567cdde08b6b2f9a6428555ceae4d421ef9d78c3e8d28f65cbe01139d35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:1075 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:1101 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:1242 \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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baef708f7bc693c31044c0d62f79c1f708e4bb0cc46554dde0cc6154b2bb7a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:2400 \u00B7 apps/desktop/src/lib/backend/http.ts:2525 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"191ee18033b6ad2380ee026bbdb719faca524a5afa3887cb4f6bac431efbd0ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4168 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4037 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52af0af280ceb01134a0db7183359b3af611ca580f830a6280b72f2b25cc71b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): apps/desktop/src/lib/dataGrid/dataGridConditionHistory.ts:25 \u00B7 apps/desktop/src/lib/redis/redisKeySearchHistory.ts:21 \u00B7 apps/desktop/src/lib/sql/sqlParameterHistory.ts:9 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridConditionHistory.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d795104e93efb7f722a6f2c7525a6decc2bbff1d929f56a32e5bfd75e391bb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleConstraints.ts:740 \u00B7 apps/desktop/src/lib/database/oracleConstraints.ts:764 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"112c1846dcd6eb1aa73d0e63392cfb7a01d8e79e6145711cb7ba495d1e3d8d78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): apps/desktop/src/lib/redis/codec/msgpack.ts:21 \u00B7 apps/desktop/src/lib/redis/codec/pickle.ts:605 \u2014 the two spans are one implementation copied and then locally edited \u2014 170 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":"apps/desktop/src/lib/redis/codec/msgpack.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f0c6542bb0b4e2d389681f4c7d06cdfd9ce9e349978affbc544487b1752b2b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:1482 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1636 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62cd4c0fbfc51178109ffe4a03d0fc174d0e1ac877884d928cfd209b1c29661"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:2535 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:2599 \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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10bc7dc88bcc50272ba16a723d9739f76c45e96bb73e34572557d7f90d3d266"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/lib/table/tableVGroup.ts:748 \u00B7 apps/desktop/src/lib/table/tableVGroup.ts:769 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d471a5439192d12f50b42fc1488195a4c9814337d188b54f726fca84158b1dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/desktop/src/stores/productionSafetyStore.ts:30 \u00B7 apps/desktop/src/stores/readOnlyUnlockStore.ts:100 \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":"apps/desktop/src/stores/productionSafetyStore.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a287d6cab907fd56501d68ed111515c639d469a335d6c660bef199f368d859"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): agents/drivers/oceanbase-oracle/scripts/verify-partition-ddl.ts:14 \u00B7 agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 201 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":"agents/drivers/oceanbase-oracle/scripts/verify-partition-ddl.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ebcfd3b17a31471863fdceb1435693aa878a07a114ef298da7df993796920f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): apps/desktop/src/App.vue:3264 \u00B7 apps/desktop/src/App.vue:3293 \u00B7 apps/desktop/src/App.vue:3324 \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":"apps/desktop/src/App.vue"},"region":{"startLine":3264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4bdd709047e523800a552bf8785fe0b6b6acbcc05272573267c42ec7f2c08b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/App.vue:3499 \u00B7 apps/desktop/src/App.vue:3581 \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":"apps/desktop/src/App.vue"},"region":{"startLine":3499}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc21bbd03d4c525cfc74b6c3092ea3543e1b68b28f002550fd635fb274efd30b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/components/admin/DatabaseUserAdmin.vue:955 \u00B7 apps/desktop/src/components/admin/DatabaseUserAdmin.vue:994 \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":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c9ebac5c29180a33f053ccb4054ca2d251eb9eefe16cdfe84c640a719784d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/components/common/ElasticsearchJsonResponsePanel.vue:157 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:2928 \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":"apps/desktop/src/components/common/ElasticsearchJsonResponsePanel.vue"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a43ab54796a0613e7ec1c0017ad1963e6c1ede769f04a4d6f8f1ec51760a06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:2575 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:2655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":2575}}}],"partialFingerprints":{"codehealthFindingId/v1":"daff7965dd9cd4f0d62799bc93484f5d5af6836b11533b00bc29c82489445150"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulAcl.vue:204 \u00B7 apps/desktop/src/components/consul/ConsulMesh.vue:272 \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":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3fe90ff50f7f5123b1c8b4842f08ce99c450117587a1665e151e3c4d7a3726"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:5839 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:5874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":5839}}}],"partialFingerprints":{"codehealthFindingId/v1":"663b415d7a5ca87676f46c6afc0fe3bd3e75d9ae933418011df2cca183160c8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:6461 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:6479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":6461}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e01b047659b00e63bd47629a9d7c43a5d93319cd4bd143636f59cc196cbc531"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorCompletion.ts:1286 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:1729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d91f33a987966d52dfc30c072b225a01f784a10eb0baae1f31011dcb9621f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue:54 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchTasksPage.vue:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 162 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":"apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5376ecf54620486f6a60fc4be2b7dfb968000f2c9e7add0ce06f2a65250031bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/components/objects/InstallExtensionDialog.vue:91 \u00B7 apps/desktop/src/components/objects/InstallExtensionDialog.vue:113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/InstallExtensionDialog.vue"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de5b88d4dc3f67a59e350f08d03f21479956c864aa226d84d160c9846df0b87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4774 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1638 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4774}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb53003b53e2f8e3278734250a91d221b59e4af686c08f9b40e94c1972588909"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:5534 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:5609 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":5534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81f6c412857c3f1aa22289271724b540812b0efd47a5825ec677b65bc4ca783"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:43 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:63 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"99879e7ebc6d18a0712b291cd8c494b58d2cc9e0955e7047bb687748387987dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:3513 \u00B7 apps/desktop/src/lib/backend/http.ts:3726 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3513}}}],"partialFingerprints":{"codehealthFindingId/v1":"155d8f013f54641747786507f94ef36f95b8bb4b3ffcf9dd12c603b0af65af55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/lib/common/safeJsonFormat.ts:651 \u00B7 apps/desktop/src/lib/common/safeJsonFormat.ts:688 \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":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"2974e218f2268a0d1ef86569132a46d7e094e709f663f6dcc0c333e39e991471"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/lib/database/productionSafety.ts:374 \u00B7 apps/desktop/src/lib/sql/sqlRisk.ts:507 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e802c0a10cd2a686c64a6e96447c61501065254df313e67b318af74c9d508135"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:1824 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1862 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"8263edc98b9f4a630dc6dcd3278473b2374dc7f483956a1f129f43300ed83cbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:1479 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:1804 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:1931 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:2298 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff5acd91ca525223a153406de165cb16d6e92ccc2c52917e20469148a9e10ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:1835 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:2341 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:2775 \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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"018d6b9060f84733bbe03844da166d1d27a5c41a6b9d5e220a37a8deb489c907"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/lib/table/oraclePackageSource.ts:37 \u00B7 apps/desktop/src/lib/table/oraclePackageSource.ts:55 \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":"apps/desktop/src/lib/table/oraclePackageSource.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5e1f065efcd1d7b836f2c38db6c9bdcae57bb4c37f02d58aae1616c94ad463"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:3113 \u00B7 apps/desktop/src/stores/connectionStore.ts:3190 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3113}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c15eb82f627c3b0d42e22c718b322cabb23929b3add707c0646e11087d2b6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): agents/drivers/oceanbase-oracle/scripts/verify-partition-ddl.ts:40 \u00B7 agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts:49 \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":"agents/drivers/oceanbase-oracle/scripts/verify-partition-ddl.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee14842eadffa718a66b61ab8cfb476b95ce28492800a19021762848b6a0a724"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/App.vue:2853 \u00B7 apps/desktop/src/App.vue:2897 \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":"apps/desktop/src/App.vue"},"region":{"startLine":2853}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32af277d28edcaaf67782a693d1cb88118c78f434caaab780b4792015df0ef2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:6731 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:6751 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6731}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb16958bea3a47cd53ea5f33be9cae5f9d80159a27c9e9058f7632e04c9807ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/components/diff/DiffHunkBuilder.ts:152 \u00B7 apps/desktop/src/lib/schema/schemaDiffDdlLocate.ts:14 \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":"apps/desktop/src/components/diff/DiffHunkBuilder.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d11ee7d50cfab314f295f545610ba87577062cafff312bba9a8130e8fb69704"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/components/document/MongoBucketBrowser.vue:38 \u00B7 apps/desktop/src/components/document/MongoGridFsBrowser.vue:19 \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":"apps/desktop/src/components/document/MongoBucketBrowser.vue"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"911771a9e2606d19bd00f4cc2f8cf0f42372ea07f75fc8412567da96930dd271"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4 locations): apps/desktop/src/components/generate/params/GenderParams.vue:9 \u00B7 apps/desktop/src/components/generate/params/JobTitleParams.vue:9 \u00B7 apps/desktop/src/components/generate/params/MaritalStatusParams.vue:9 \u00B7 apps/desktop/src/components/generate/params/TitleParams.vue:9 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/components/generate/params/GenderParams.vue"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4c20735cfe3993df508e5952530cfd1e56699f108390b45294695d8ffcbeed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:14748 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:1815 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14748}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ca805926697bd97a4182a71437f249b343861da063d6273f7795cd939b2252"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/components/import/TableImportDialog.vue:708 \u00B7 apps/desktop/src/components/import/TableImportDialog.vue:1265 \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":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58782940a2f06375ec4a53770f122dc9cecdc3dcb21c0b9495b188b2e016f18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): apps/desktop/src/components/mq/ProducerConsumerPanel.vue:491 \u00B7 apps/desktop/src/lib/mq/kafkaTopicStats.ts:27 \u00B7 apps/desktop/src/lib/mq/rocketmqMessageUtils.ts:20 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ProducerConsumerPanel.vue"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3f3a9e40e0b898d204662b7df8f88148d2444250d0af3f8157b33647809f84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2638 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2684 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2638}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a24954552e768b125c9647e3109c4fb537a4ebaa5756f3918475eb6fc432512"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/composables/useDialogSources.ts:284 \u00B7 apps/desktop/src/composables/useDialogSources.ts:399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"14475e38f6639676e29e7dfb17d3e31ad6357dd2d3d18e44dc2c52d3c550b5fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/lib/ai/richContent/aiChartSpec.ts:191 \u00B7 apps/desktop/src/lib/ai/richContent/aiChartSpec.ts:250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/richContent/aiChartSpec.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c0304955346176a55a88e8cac9c2d440105d802ec2a8fcfc0b5531d30b9da1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4050 \u00B7 apps/desktop/src/lib/backend/tauri.ts:7144 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab728633e81b262eec126ba978bd1b943acc8f6508d05fca8d8eff9ae36918d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5490 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5465 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5490}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0feebfc816fb9c9252bce290d4e143c4ad295477302d341ae4be344c8269bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarLayout.ts:622 \u00B7 apps/desktop/src/lib/table/tableVGroup.ts:371 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a34b2e1666583581efc0bdcbbc22f51075ee2c86e9f14bcf91b6083a0ba8e45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/diagnostics.ts:504 \u00B7 apps/desktop/src/lib/sql/semantic/diagnostics.ts:525 \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":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"447419df9eb8085b0e722b8ab7147c12b2c154646f6fc29e8473d909012b4ec3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletionLookupTarget.ts:31 \u00B7 apps/desktop/src/stores/queryStore.ts:773 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletionLookupTarget.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd05533844fa944e336d25e7d51abbb1d46453ae2cea73abaccfbc682732394"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlFormatter.ts:724 \u00B7 apps/desktop/src/lib/sql/sqlFormatter.ts:747 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cde947832b320fbe8063a16bd4467071864b7f918edfd20e550b03887fc79b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:2608 \u00B7 apps/desktop/src/stores/connectionStore.ts:8199 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53e117bd0a10bc6060fedf7677e0910159e57680645ecb76ec3d2695ef07ce3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:3180 \u00B7 apps/desktop/src/stores/connectionStore.ts:3463 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadad62191e0bfe04b0389f0d2d88b92ff86d7a4e27c63d2d7aec197d5b4ae0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/mongo-shell/src/json.ts:505 \u00B7 packages/mongo-shell/src/json.ts:576 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f159d15d26144d0be48cd22ba4899144ab7ec098bd339889613ebe3ae181031"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): apps/desktop/src/components/admin/DamengRoleAdmin.vue:254 \u00B7 apps/desktop/src/components/admin/DamengRoleAdmin.vue:275 \u00B7 apps/desktop/src/components/admin/DamengUserAdmin.vue:415 \u00B7 apps/desktop/src/components/admin/DamengUserAdmin.vue:436 \u2014 the 4 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":"apps/desktop/src/components/admin/DamengRoleAdmin.vue"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e876a856fc6158d1c93916f0ae4dfabdd2a085846c5d5eac062a25df89006fa0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:2802 \u00B7 apps/desktop/src/stores/connectionStore.ts:1811 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bf4cc6ab458848ac953b8043beeae6693b44968488c3c437af3ecc2cb22b8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:3856 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:3873 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"62880424194c97379271010b592585e13a2fcd81d5e12e3ba5f919eccdea3c7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulServices.vue:196 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a7de58cb0e8477b0f5f5cad61f437dd8c5f36ba124e87e1a27f28e7177bf20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/diff/FieldMappingPanel.vue:76 \u00B7 apps/desktop/src/lib/schema/schemaDiff.ts:112 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/FieldMappingPanel.vue"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bc1e3387d491d78c544fa91027654a9184e0d58be7e4c0746628005af10c15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:217 \u00B7 apps/desktop/src/components/layout/ContentArea.vue:605 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47004b2a6e0b5f116a96c206c30f4ca3edb74bdbddcb76ca53fd324bac0824c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/editor/MultiDbExecuteDialog.vue:653 \u00B7 apps/desktop/src/components/editor/MultiDbExecuteDialog.vue:674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"022bc60a744e436598d3456852ea91514928517b8df29a073ed747cf388d132b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts:314 \u00B7 apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts:332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5ab04d7ab6e842c22a6df801c79c64e2cc9e4b405509eae33c3de9473bc29c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): apps/desktop/src/components/generate/params/CompanyNameParams.vue:48 \u00B7 apps/desktop/src/components/generate/params/DepartmentParams.vue:26 \u00B7 apps/desktop/src/components/generate/params/IndustryParams.vue:26 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/CompanyNameParams.vue"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6361ce78c601a84e4c1a00af7e4920aacb316648c78062fc9c1fa7d361d0a15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/IdNumberParams.vue:192 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:829 \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":"apps/desktop/src/components/generate/params/IdNumberParams.vue"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"96695be5ff1abcca4b7d6d7bc10a782abae74d0aeca0d90d9de340049ce9d51e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:2221 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:6084 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":2221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c196ed4b4fa71ea990ca73ab958a872a9923dcb6e9b4a65b5477b1a1b1bff3fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/layout/QueryEditorSurface.vue:10 \u00B7 apps/desktop/src/components/layout/QueryResultSurface.vue:13 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/QueryEditorSurface.vue"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e77315d34c2babb02c6500fe4bf0dfd24fd3c5a7ea4f58208d81c9338bed8bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAccessControl.vue:411 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:354 \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":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c4653831edbfd95a0f13dc0d5df0f47cecedcc115b11e0dc4d7a98b3aab12e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:5102 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:5203 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5102}}}],"partialFingerprints":{"codehealthFindingId/v1":"18879f923360b8e63c5a37659000e1b0a77bde5c2f19552b4f6163bc276150db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:5121 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:5222 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb49f9dba8f73d0da69d09c683d6aa2371ac5ffc36a7cd33f8d9d79ebc1312c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:3637 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:3724 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3637}}}],"partialFingerprints":{"codehealthFindingId/v1":"873cb4301065722eb4f5c767cf4447c81658e36c9fda4ee0e78ad4fce58ecf4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExport.ts:1579 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1903 \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dff4b71c38c7a96e9768a214afb27a66f9554f8c2c11eed09a3fd9d8148f7b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExport.ts:2934 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:2986 \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2934}}}],"partialFingerprints":{"codehealthFindingId/v1":"67569a39f7e4cfce9fdcbbc169c1938fb769cc7d60386cf89cbbd77684c7b34c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/composables/useSqlExecution.ts:652 \u00B7 apps/desktop/src/composables/useSqlExecution.ts:943 \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":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5f313a34d627cfa24e1c43bf4f0a057e92aba0fcd64dd5a665ce96fbc90b41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): apps/desktop/src/lib/app/detachedTabWindow.ts:45 \u00B7 apps/desktop/src/lib/plugins/pluginFloatingWindow.ts:421 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"apps/desktop/src/lib/app/detachedTabWindow.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"11530d357c063ab873927bb7f00fda21a27aaee1ce2a5fa1149ba24a66b9de6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/lib/connection/tunnelProfiles.ts:12 \u00B7 apps/desktop/src/lib/nacos/nacosNamespaceCache.ts:13 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/tunnelProfiles.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d23c1108de2ad45c82d93b734203f06ed8944dc92aa19ba79d4844a87c8fa21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/customBasemap.ts:15 \u00B7 apps/desktop/src/lib/sql/sqlHighlighter.ts:54 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/customBasemap.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0e81821d29671ba40dde1f498809e7e6c3dacd08875f271907c467104e2f44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): apps/desktop/src/lib/database/databaseTree.ts:31 \u00B7 apps/desktop/src/lib/database/databaseTree.ts:81 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseTree.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"205ed5aae0a315fa1d58fb2e1b3e30c9da5a8d48a89318ccbdeb32127e400d39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleForeignKeys.ts:585 \u00B7 apps/desktop/src/lib/database/oracleForeignKeys.ts:715 \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":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de406e93eacd66046c24b1d92654d724d6069a8cb40a3cb1f3d24f38626f731"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoFormatter.ts:36 \u00B7 apps/desktop/src/lib/mongo/mongoFormatter.ts:61 \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":"apps/desktop/src/lib/mongo/mongoFormatter.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2235556ad4213950de63f310c6c4a3a60a85216e7665450ac1f6482962371f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/lib/nacos/nacosDashboard.ts:57 \u00B7 apps/desktop/src/lib/nacos/nacosDashboard.ts:74 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosDashboard.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcd60a5202f21821a393b16608dc667e165e8621b550b7e8d672af50aa06edd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): apps/desktop/src/lib/redis/redisCommandSafety.ts:255 \u00B7 apps/desktop/src/lib/redis/redisCommandTable.ts:470 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"apps/desktop/src/lib/redis/redisCommandSafety.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"19868ffa5745fdd256d58720146b62ccdb62b4791fa2b504d3a9edf8e2b5e10c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): apps/desktop/src/lib/redis/redisCompletion.ts:250 \u00B7 apps/desktop/src/lib/redis/redisCompletion.ts:266 \u2014 the two spans are one implementation copied and then locally edited \u2014 120 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3f01ec033c24c2dbd948ba12a6f1e99aeeb95470aa10a203fb936cafff70f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlAnalysis.ts:838 \u00B7 apps/desktop/src/lib/sql/sqlAnalysis.ts:941 \u00B7 apps/desktop/src/lib/sql/sqlAnalysis.ts:985 \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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5440adfcba2903dece843bfc593c9ff4b844ef93369fa0b922f729ddec4be7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlFormatter.ts:1123 \u00B7 apps/desktop/src/lib/sql/sqlFormatter.ts:1149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd58eeb6d56e3350419a2d6b4ea9c902b80bd84c6791d3fbec3ce3942d0d109"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:543 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:1280 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:1514 \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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c6acf20eae3327b448232346b845800bfdeb206643ad4d0bdfa1ba0b6ada98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:6920 \u00B7 apps/desktop/src/stores/connectionStore.ts:7089 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6920}}}],"partialFingerprints":{"codehealthFindingId/v1":"e554c3f98fdd3ca91412f2ff8b948d3f3f5a405c119de1f83975ef0aa35f24c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:7353 \u00B7 apps/desktop/src/stores/connectionStore.ts:7436 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e767b89cfd1705fbd4da0679c64c1d1770bf1cf88317ed57990f64e76023cd5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:10440 \u00B7 apps/desktop/src/stores/queryStore.ts:10498 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10440}}}],"partialFingerprints":{"codehealthFindingId/v1":"6646599709d2cfe32b2ec36a2734b4857550f6f9dc02d4561128d43d1f064ca4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): apps/desktop/src/stores/savedSqlStore.ts:1027 \u00B7 apps/desktop/src/stores/transferTaskStore.ts:250 \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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"3204748cdcaed538764e5e7cf18e96f9672ff997069f783fe68461380aea056e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareConfigSelector.vue:32 \u00B7 apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue:36 \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":"apps/desktop/src/components/diff/DataCompareConfigSelector.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e873cd8b1b064153c92c99a3adc96940781aaa7dc0a98b69bd8917377e73bc73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:3709 \u00B7 apps/desktop/src/components/editor/AiAssistant.vue:3732 \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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":3709}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6037b93e6454ea64730a0616ba218615d59986a2ed537c0e437df08572e06f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:4048 \u00B7 apps/desktop/src/components/plugins/PluginContributionsPanel.vue:1288 \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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":4048}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79e2f7952a5266044f4cfb800556b8ae2374aa95c1443054fdc39325c54939f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSearchPanel.vue:374 \u00B7 apps/desktop/src/components/editor/EditorSearchPanel.vue:390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSearchPanel.vue"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"c823665537c03c0dff54c99b1994d6900b8f567b319c6305244fbb53b52d135b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorCompletion.ts:1432 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:1979 \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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ca62bbdd13dd83ccff342f9c8c0cc74c0e406fc54520378909a87fc1ebfc1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdAccessControl.vue:264 \u00B7 apps/desktop/src/components/etcd/EtcdAccessControl.vue:314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6853049e72dcead99bb05d36133569f8e05eecde1bdc5895e40415d948049491"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:8422 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:8468 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d082463cfd2e776ac3019874aaef12cbbe4c1a05c758af208b88e3e585ac786d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:12840 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:12886 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":12840}}}],"partialFingerprints":{"codehealthFindingId/v1":"509eae7b9259729fe7d0d67029efef2f312382bc85291940291f469b6f5c1918"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridTableInfoPanels.vue:58 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:1696 \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":"apps/desktop/src/components/grid/DataGridTableInfoPanels.vue"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4236ca99c7f9c0a509de37fc0c6f50d36de7f3402f4250e88b10bf25dfacad0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): apps/desktop/src/components/kv/KvKeyBrowser.vue:633 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:1578 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"537e1d4ee4d070d5c98792ded088267d0f7872027278e8decd3b95c4fc0eb7c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue:431 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue:220 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a72a7b37f3c733ba4c7fd1d2fc002bb7da0103310dfdb907ae128305c26652a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 7 locations): apps/desktop/src/components/mq/ExchangesPanel.vue:334 \u00B7 apps/desktop/src/components/mq/NamespacesPanel.vue:97 \u00B7 apps/desktop/src/components/mq/SubscriptionsPanel.vue:344 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqClientsPanel.vue:112 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 6 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":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8fcea4fa50d528106b4f5e99031172a2df8d1ae7fca93f0b92b137ca6cd35e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAccessControl.vue:202 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:1729 \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":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"205948d76f34475e5e359195e60ee47f6c60c8b7edd2faac877be6f6808b3ec4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:2841 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4556 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2841}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bf524d8f90e9839ce54158088a72278fee4e250b1a6aa450824f466de90766"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4656 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:5737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"9270de101c9d5c327cd6928c9a9b2f0d42ea714bffc2c91ac4148b1aff0ab969"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisValueViewer.vue:618 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:635 \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":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a5bc7613670199e5a9758fdeb61e29b75a6a10c9e7d34f6f1da9891d61eca3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4692 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4692}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfb493e9ea97f23e340b99a0d5f8b44960971b7fbed4d5e6d23cf9f35473e43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/components/transfer/DataTransferDialog.vue:747 \u00B7 apps/desktop/src/components/transfer/DataTransferDialog.vue:815 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9ba83aee8ad0f7a8293c91a10b93ed64bf34f53600310840e9485d76d81d3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/composables/useNavigationTargets.ts:289 \u00B7 apps/desktop/src/composables/useNavigationTargets.ts:337 \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":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f36a0e1386b17f53c552693b3289f0efeb3686984c8aad679255c244d47fe0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/composables/useSqlExecution.ts:742 \u00B7 apps/desktop/src/composables/useSqlExecution.ts:776 \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":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d8035e14e5ece7dd654716c12beb3198d9137b7919660751448d89cc7f6fdd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/composables/useTabScroll.ts:34 \u00B7 apps/desktop/src/composables/useTabTitleTruncation.ts:47 \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":"apps/desktop/src/composables/useTabScroll.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc51185eca7fc6cffd8d39e9131d6c195762f16fb2daa1dc1790a8b5daa610e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/lib/app/documentJsonValues.ts:261 \u00B7 apps/desktop/src/lib/app/documentJsonValues.ts:285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2799a85157669e439a0eae4cd4fc3790b5c8e936e80d44228ef54209a8d2dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): apps/desktop/src/lib/app/documentStoreProvider.ts:157 \u00B7 apps/desktop/src/lib/app/documentStoreProvider.ts:173 \u00B7 apps/desktop/src/lib/app/documentStoreProvider.ts:189 \u2014 all 3 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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"588ba15894b6ecfd681e69ed579a14aec61e4b42ba6ace1b8ce25b9a0f58a988"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4681 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4809 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4681}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe92964c14e3ded2ff4a58adfdc3d5a5c352f6ea18b419932b0849317b3a8a76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionUrl.ts:572 \u00B7 apps/desktop/src/lib/connection/connectionUrl.ts:590 \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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45aff483365d1e9904dab749a760527a52115d95859a0966f22b8db28eb5e67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleCompileSql.ts:42 \u00B7 apps/desktop/src/lib/database/xuguCompileSql.ts:20 \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":"apps/desktop/src/lib/database/oracleCompileSql.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad34fd70278e5351ab8d4ed434d73fa4830effa045b19c96acd34cb26a35483"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/lib/editor/hoverTableSql.ts:377 \u00B7 apps/desktop/src/lib/schema/schemaDiffDdlNormalize.ts:21 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cf04347dcd131e202ebb82b27ce254f5b2901033f9fefd508fc48b192f5e21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:1895 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:1911 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"750a31b57ee1c2b8b1694f9696ed62ff1ece54a5f4cff46d317eb31a10843e3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoDocumentValues.ts:621 \u00B7 apps/desktop/src/lib/mongo/mongoDocumentValues.ts:638 \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":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd8549dbd2d8f493137a9ddfeca9e0c566ea7a019ef17d976513c741d8a92d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:527 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0be78bf4481ae5c80afe6766d9269062c18c0e84e28eaa964a6e4ba9b9cfe5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/firebirdObjectTemplates.ts:12 \u00B7 apps/desktop/src/lib/sidebar/mysqlObjectTemplates.ts:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 119 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":"apps/desktop/src/lib/sidebar/firebirdObjectTemplates.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb4dd48f2b71e367e1b54efb95e6477b5b8ed22572b0dd388051457fa0c5c18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): apps/desktop/src/lib/sql/sqlParameters.ts:933 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1036 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1190 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1382 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"7289fef70e0b561ca8122722fd1f0d5fbc77d4b24b3e0548ef3396606acb19c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/lib/tabs/tabPresentation.ts:367 \u00B7 apps/desktop/src/lib/tabs/tabPresentation.ts:383 \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":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"421584dcb0df00714ad9b387f578f71fcd887d5d842ff5c78472d2be25046cd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:8771 \u00B7 apps/desktop/src/stores/connectionStore.ts:8816 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c20b6f5732936faefe51befa10ec415792a02a39aa292f8f05297e23ea104aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/mcp-server/bin/dbx-mcp-server.js:27 \u00B7 packages/plugin-cli/bin/dbx-plugin.js:37 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp-server/bin/dbx-mcp-server.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2231f4e877525f68138b4471d8ea8cb1a988695841ccbb280ce21685a4d24b3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/admin/XuguUserPermissions.vue:72 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:1198 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ee75c8cbb6bf695e9968a9c0b56e33b0cb4f6ed7c460d48d56a2ef334d8a2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulKeyBrowser.vue:632 \u00B7 apps/desktop/src/components/etcd/EtcdAdminConsole.vue:294 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f991581da9e15fdaabf315916ca4f90bb492b77ff6fa3ff998880ab493315b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/diagram/DiagramToolbar.vue:71 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:2017 \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":"apps/desktop/src/components/diagram/DiagramToolbar.vue"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2f4c0fb85e12bff2e98b2f7ba4254c3e079d10fe30f62ccb5945500036b8de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/desktop/src/components/diff/CompareConnectionSelect.vue:7 \u00B7 apps/desktop/src/components/nacos/NacosNamespaceMultiSelect.vue:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/CompareConnectionSelect.vue"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e4a4cc1e153b3a2d8e05ae28fff5b3f3046b6595de8673441710616d1ada76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:880 \u00B7 apps/desktop/src/components/grid/DataGridFilterBuilder.vue:446 \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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cbf53b25a5b722bcd4cddcadcdd70737d90e2434d854324e6603f045e1c876"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/document/MongoBucketBrowser.vue:336 \u00B7 apps/desktop/src/components/document/MongoBucketBrowser.vue:351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoBucketBrowser.vue"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dbb291ba76635c4d4727ff69bf571aa842df04dde629cdbd40e3fadc05e603"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:2698 \u00B7 apps/desktop/src/components/editor/AiAssistant.vue:2778 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1a7539c34e8a99586cd6dc56f8e9027e9167d690e500a9c7f798e9fe47dee6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:6797 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:6836 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":6797}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbd29b655a9512f7a14f72b35091284c88aa3a6ea97551d1c3567ad5c5af573"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/desktop/src/components/editor/QueryHistory.vue:505 \u00B7 apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue:289 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 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":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"150a74124c659d43b619b5b4c6db3129d323384eb1532cd9be4003f61f56c106"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/editor/ThemeCustomizerDialog.vue:14 \u00B7 apps/desktop/src/components/grid/DataGridTypeColorSchemeDialog.vue:13 \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":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea361c01a6f47ae46f7b0a5b387698023034e07af0baa7d3ab7f90196ad37792"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorDocumentState.ts:337 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:831 \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":"apps/desktop/src/components/editor/useQueryEditorDocumentState.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9034dcc5c7342a05a37efc68c1d71c643018692761ac00548743d7f1d3b8453c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorTextActions.ts:102 \u00B7 apps/desktop/src/components/editor/useQueryEditorTextActions.ts:122 \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":"apps/desktop/src/components/editor/useQueryEditorTextActions.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"10589546f147ee11d924564d5ccfd95b87fa7c71347e88fef1fa60da09ba63bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorTextActions.ts:189 \u00B7 apps/desktop/src/components/editor/useQueryEditorTextActions.ts:218 \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":"apps/desktop/src/components/editor/useQueryEditorTextActions.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a543d40e73fb77c0406ac5e69dce7f90c664288704a10525f679b4af409d7bd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdAdminConsole.vue:294 \u00B7 apps/desktop/src/components/kv/KvKeyBrowser.vue:633 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAdminConsole.vue"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d3f96efbdc75119b83d752838444bb394a69b97c1ac6e0e96e30d6f3e7b205"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): apps/desktop/src/components/generate/params/ColorParams.vue:17 \u00B7 apps/desktop/src/components/generate/params/ProductCategoryParams.vue:17 \u00B7 apps/desktop/src/components/generate/params/SizeParams.vue:17 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/ColorParams.vue"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"566042b99aa02ce37092b78acb2cc81b25f9f3a8183c60c6c95175e5f556674f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/CreditCardNumberParams.vue:49 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:430 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/CreditCardNumberParams.vue"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"688c1682e8daac66cb685a9b7277886daf4b1da5d1d41f02b4a3d6b1b017d30a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/CreditCardNumberParams.vue:73 \u00B7 apps/desktop/src/components/generate/params/CreditCardTypeParams.vue:26 \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":"apps/desktop/src/components/generate/params/CreditCardNumberParams.vue"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d008911339fedbd06e5be3cd18b9cabc1e84a201a754c523da97b24148a9f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/desktop/src/components/generate/params/FilePathParams.vue:42 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:883 \u2014 the two spans are one implementation copied and then locally edited \u2014 186 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":"apps/desktop/src/components/generate/params/FilePathParams.vue"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"798f588d884c493ce9cf7460f479e61d3ee8281672836b5ad98887a8691a0e5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/layout/AppTabBar.vue:48 \u00B7 apps/desktop/src/components/layout/EditorGroup.vue:148 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/AppTabBar.vue"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c918851c13bec388e5dcf36be707c53e43309838ad950e4a332b1217f3f60d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/layout/EditorToolbar.vue:240 \u00B7 apps/desktop/src/composables/useMeasuredWidth.ts:42 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorToolbar.vue"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94dcacd0a323051d14d564cd400d079051eb786fe1cea057dbde7f57daaf6d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlFilePanel.vue:1003 \u00B7 apps/desktop/src/components/layout/SqlFilePanel.vue:1050 \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":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fa58179a78ddce923261f83c5e12c6d19ab1f808490c5c4f5ae32c069921fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:269 \u00B7 apps/desktop/src/components/layout/SqlLibraryPanel.vue:335 \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":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1902cabd2de606d7cdbb65f0b38cac9c29ac8579fe0d3a66a0795723fd795177"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:635 \u00B7 apps/desktop/src/components/objects/DdlViewDialog.vue:402 \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":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebce6f971a48c7c6c02e8063bf6fd199f784a30d1d95786b3690b4ff8c59b30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:2172 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:2328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5b47b1e6c6fdee82897ec6c71642a0aa64e54d261e5b17c6447d555469a85a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1109 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"674cd0d6059cb7eb19defe9f55dc173e66e8fc1db31b2e65f980dfaf7cb39509"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/TreeItem.vue:164 \u00B7 apps/desktop/src/components/sidebar/TreeItem.vue:850 \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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f96301fc940bd811a0103ed64484975adf1957f9201dab15569299515098917"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6525 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6656 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6525}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fe7e8f7255e50cf3765c1546612c1f419b03a8cd6936a40bd321af59addb1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/composables/useMeasuredWidth.ts:46 \u00B7 apps/desktop/src/composables/useToolbarOverflow.ts:77 \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":"apps/desktop/src/composables/useMeasuredWidth.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2714f5c612a63355cd754b539b2be7fc5664a255fecdd842b338b2bc2f1c0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 8 locations): apps/desktop/src/composables/useQuickOpen.ts:653 \u00B7 apps/desktop/src/composables/useQuickOpen.ts:669 \u00B7 apps/desktop/src/composables/useQuickOpen.ts:685 \u00B7 apps/desktop/src/composables/useQuickOpen.ts:701 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d547b2330cae6a42124ac583d49ab182a692f4aeff566a6745d2d29a8b748be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4011 \u00B7 apps/desktop/src/lib/backend/tauri.ts:7116 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4011}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a5ef5ec8c94d92a7202e815b638d2948405d27736f7613b90def69809fece6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5236 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5227 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5236}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e581ac0dd00fe30156198d9ccffd448bf9a9ee23646cc17def7d73fd0db552"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:2143 \u00B7 apps/desktop/src/lib/database/dbAdminSql.ts:381 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1558ba2c175cfb8f8d936f471de6a1409c9097c760566fbac8098eec8720acb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/desktop/src/lib/backend/tauri.ts:2589 \u00B7 apps/desktop/src/lib/database/dbAdminSql.ts:381 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"918c777f5dde0b82a83ca625bc46ef460887d4ff3167d834e7aa00b67e816448"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/common/safeJsonFormat.ts:673 \u00B7 apps/desktop/src/lib/common/safeJsonFormat.ts:706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9ea091e1065d6193f7e584eb1e554bf6dbe719d39aac81f86737096b04801c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts:28 \u00B7 apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts:43 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adf55781c1335d34b2e0ab78871497ab665d70968cbde5c81c000d382e69746"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/database/productionSafety.ts:354 \u00B7 apps/desktop/src/lib/sql/sqlRisk.ts:486 \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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a67b4e4b18af717dc511d609c7bcee2cf437116ba37a59ffe5fcb8a82b3c328"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/diagram/erDiagram.ts:250 \u00B7 apps/desktop/src/lib/diagram/match-engine.ts:65 \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":"apps/desktop/src/lib/diagram/erDiagram.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac37af2ac2e21674b60bd904f895635bc400027e12aafe42286af74050374a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/editor/codemirrorSqlParameters.ts:22 \u00B7 apps/desktop/src/lib/elasticsearch/elasticsearchLanguage.ts:64 \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":"apps/desktop/src/lib/editor/codemirrorSqlParameters.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5216f9bb927cfffd5b8315e68b06f22a927199260a75da954d4a0f7a4485afba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/desktop/src/lib/imports/anotherRedisImport.ts:5 \u00B7 apps/desktop/src/lib/imports/redisDesktopManagerImport.ts:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 132 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":"apps/desktop/src/lib/imports/anotherRedisImport.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8d6a7c90cb966a64454b7caa5e41200a972477a9a5a646cb6b387c47bb371f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/imports/datagripImport.ts:384 \u00B7 apps/desktop/src/lib/imports/datagripImport.ts:423 \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":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ee567fb1e6df85f703d41652688c49cba439b988cfc50360de9e4518d55915"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:214 \u00B7 apps/desktop/src/lib/mongo/mongoSyntaxDiagnostics.ts:171 \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1e60b54ec2604c4db750dfed8b829bde60a8766bb93e1771e1be4f2c6f2593"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts:190 \u00B7 apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts:221 \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":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"daded80c9700357301cf40630c53a8246402ea62a6126b4f8412eff16f7d0ac8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarConnectionSelection.ts:16 \u00B7 apps/desktop/src/lib/sidebar/sidebarConnectionSelection.ts:33 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarConnectionSelection.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c2e6ad00d76fa3ef9ec12d68ec3ef720a6945aac93d3abfe60e136c04bf158"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/sql/ddlDisplay.ts:456 \u00B7 apps/desktop/src/lib/sql/ddlDisplay.ts:504 \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":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbc7dd3d3ed0061bca55697d323b644ea231bae9b7b1dc996c28e48a8daf09f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/insertValueHints.ts:108 \u00B7 apps/desktop/src/lib/sql/insertValueHints.ts:129 \u2014 the two spans are one implementation copied and then locally edited \u2014 131 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"510e74b728b422b49547910a9f2b630ace4cd034664d4eee436cd2ea3dfa85df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/diagnostics.ts:105 \u00B7 apps/desktop/src/lib/sql/semantic/diagnostics.ts:188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8873d614cbd14c84f6647d455994767f1ee3eb9024ee08056e7faf95d5acee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:525 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1564 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d0d0e58d12f081378f2579598415e2e61c9ae3ba0c9ab7df41b99c08b6ec7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleRoutineRename.ts:577 \u00B7 apps/desktop/src/lib/table/oracleRoutineRename.ts:634 \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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b78c9f097e9c05e7edf8cc5762a80ed5571288206b951f6ad8dafa17899ec62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/lib/table/tableVGroup.ts:493 \u00B7 apps/desktop/src/lib/table/tableVGroup.ts:528 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f986f4627a210d8f9787e7916190b50bf460b94f6fb792ca997c4fdf74a68b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:7262 \u00B7 apps/desktop/src/stores/connectionStore.ts:7309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f860b6efa5dcbbd853cc4936b763b21946c6dedac58dfba9fda2ba7671fd53f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): apps/desktop/src/stores/queryStore.ts:6904 \u00B7 apps/desktop/src/stores/queryStore.ts:6939 \u00B7 apps/desktop/src/stores/queryStore.ts:6992 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6904}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ac62a46ad50420d058e19b5fc00cc556e2da664c8acace49ae87a349fdaa4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:7599 \u00B7 apps/desktop/src/stores/queryStore.ts:7883 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7599}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e4c22530f3b672839fb6fc04619b7490a4c9157835521432bbceb60a226853"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:8831 \u00B7 apps/desktop/src/stores/queryStore.ts:9380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8831}}}],"partialFingerprints":{"codehealthFindingId/v1":"1648b9dc156ddef34129d1405cb0ba47b2bf800f27848c22aba6ae62b0f14f36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:9294 \u00B7 apps/desktop/src/stores/queryStore.ts:10028 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52e7e43841e1e482a8a8f9325833344879de073817728092dd6b89bb16fd03e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): deploy/plugin-stats-worker/worker.ts:172 \u00B7 deploy/plugin-stats-worker/worker.ts:270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"423a857b32981921cac679e08bac09e9209349b1acba01e6b704ee231dd0e252"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/release.mjs:156 \u00B7 scripts/release.mjs:213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fa30c55bbeb6361dbef7055175a4321e9ccd100a6f917c582b8c530df3a83a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/App.vue:1823 \u00B7 apps/desktop/src/stores/savedSqlStore.ts:956 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b161543b45064ff49b36a73b29bf19db2c2480987ffb4b927e67073acba6b04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): apps/desktop/src/App.vue:3624 \u00B7 apps/desktop/src/lib/sql/queryCursorTableTarget.ts:65 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 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":"apps/desktop/src/App.vue"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00979769d70ee2a1b3118f48cc7af34327f0e50b0b66ad0a05123262bd200a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/admin/XuguServerDashboard.vue:261 \u00B7 apps/desktop/src/components/nacos/NacosDashboard.vue:291 \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":"apps/desktop/src/components/admin/XuguServerDashboard.vue"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf2560445288f0912f5bf89e7312ebb2ea98904784cbb2309a831d99eea004a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): apps/desktop/src/components/ai/rich/AiChartRenderer.vue:59 \u00B7 apps/desktop/src/lib/export/diagramFormats.ts:207 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 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":"apps/desktop/src/components/ai/rich/AiChartRenderer.vue"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d92f19aab36068ce901655928e26f8851ad863ac685e2363eb5fc3054d8b41b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue:158 \u00B7 apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue:181 \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":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"701eb28fc22349a375a4b2d53b5acfaeb5f11fee058d24a79a996a11e2b846d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:1300 \u00B7 apps/desktop/src/components/config/DriverStoreDialog.vue:1331 \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":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d4cbea25557787eafa622be5412be3b44071be50208eb867f9d4268af320df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:3120 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:3134 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":3120}}}],"partialFingerprints":{"codehealthFindingId/v1":"468cd3418b260b3def68b4bec9dcdd7b951df2e36a6bbe3e874c7d4b18f4ccfd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:3822 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:3846 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":3822}}}],"partialFingerprints":{"codehealthFindingId/v1":"6376e520c51d8efdc7837420eec185f4cc8690e87f8f93758582bb8caf8282cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:5973 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:5995 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":5973}}}],"partialFingerprints":{"codehealthFindingId/v1":"7877affacbe8b9dee950689939f61eb12164644f590d26c368891d9100f1395f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulAcl.vue:114 \u00B7 apps/desktop/src/components/consul/ConsulAcl.vue:139 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7930d7c36aeabec9a6d30b2fcb8d5c4f786520bc54f411bf060856863dd5ac9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulKeyBrowser.vue:635 \u00B7 apps/desktop/src/components/grid/DataGridFilterBuilder.vue:480 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f22eab9251802a3d269c3430eba1a100e2274f3ab744a85407062dfcfd15a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): apps/desktop/src/components/debug/PlDebugLaunchDialog.vue:48 \u00B7 apps/desktop/src/components/debug/PlDebugSourceEditor.vue:179 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"apps/desktop/src/components/debug/PlDebugLaunchDialog.vue"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeaeb65a8aa23fe170224c37ff2f20cfcb8af4325d2b030138b9c1c3d347eb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/diff/DiffHunkBuilder.ts:448 \u00B7 apps/desktop/src/components/diff/DiffHunkBuilder.ts:461 \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":"apps/desktop/src/components/diff/DiffHunkBuilder.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9a315f97a8a3bc057e6806a3013703c521fc6f25679de1f1ccecc6edb6750e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/diff/FieldMappingPanel.vue:45 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:3320 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/FieldMappingPanel.vue"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"623c22875b48106f6f1db2c89802922aaacffd38c55a3bcab3fe9adce2f13877"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffDeployStep.vue:243 \u00B7 apps/desktop/src/components/diff/SchemaDiffObjectTree.vue:20 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDeployStep.vue"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"03edcd81937f773207a404dfa36dff6274420c3672d89b28022322eb8e45ab4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/document/MongoBucketBrowser.vue:406 \u00B7 apps/desktop/src/components/document/MongoGridFsBrowser.vue:165 \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":"apps/desktop/src/components/document/MongoBucketBrowser.vue"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04b51021b7608c5a60648d30bb771a688ee8cacb8f3fea1db85fa0e04eb9919"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/document/MongoBucketBrowser.vue:424 \u00B7 apps/desktop/src/components/document/MongoGridFsBrowser.vue:182 \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":"apps/desktop/src/components/document/MongoBucketBrowser.vue"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"98821500e0ac0a9f6ffcab23cc64a72c7ae3fc1f3f9d3c72ea81c3306b335ac2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:6232 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:6265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":6232}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6d550e293f6a18e2261d5a8ca52f943aa2684f2ff632beec101808376998df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/editor/MultiSourceMergeView.vue:94 \u00B7 apps/desktop/src/components/mq/RocketMqTraceDetailDialog.vue:60 \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":"apps/desktop/src/components/editor/MultiSourceMergeView.vue"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"59294f2fbae07a025ce9c1a8585eadf8869a4ec6a7b0867b2a12d896ae1f2ece"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts:230 \u00B7 apps/desktop/src/lib/sql/semantic/references.ts:17 \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":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6e490af569145dee728de4023f2833aed1705294616f776fa067271cd205f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdKeyBrowser.vue:973 \u00B7 apps/desktop/src/components/kv/KvKeyBrowser.vue:552 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da1c059dd92e52959716005a6b5953ec799325eb320ff1ac543d746cbd31833"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:9419 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:9433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9419}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f744227529121751a6ef392b4b60660568431a960154c3df5c5706c61606c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridSortWorkbench.vue:19 \u00B7 apps/desktop/src/components/grid/DataGridTextSortWorkbench.vue:23 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridSortWorkbench.vue"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7324c1fae46199e3efc10c118aeb31b8b91d185f7c91a2e2a9e39826995be059"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlFilePanel.vue:1182 \u00B7 apps/desktop/src/components/layout/SqlFilePanel.vue:1209 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee4a6ac68c5fe18069ce4304064440cc40a8dd240e74b6106df7fe57eabf175"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/mq/ExchangesPanel.vue:18 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue:12 \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":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"060a334bd5773c69656e4ce3f62a36235e1d549a11052b1be5fba03dbf6c7271"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/KafkaConsumerGroupsPanel.vue:11 \u00B7 apps/desktop/src/components/mq/SubscriptionsPanel.vue:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"apps/desktop/src/components/mq/KafkaConsumerGroupsPanel.vue"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"976bf339a7b904b05ef1708d8c7169a9fc2197fb243e2ceef4c208b135a53519"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/PoliciesPanel.vue:7 \u00B7 apps/desktop/src/components/mq/RawApiPanel.vue:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/PoliciesPanel.vue"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"143211f9e52ecc8a68dc56f56e8647f48b3d7b5f697253177a0591de7435b70d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAccessControl.vue:220 \u00B7 apps/desktop/src/components/nacos/NacosAccessControl.vue:242 \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":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e329c302af3731f80d665b0e3e9ff48d31d9ebdfbcc177bb21740ff6a140f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3268 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:5114 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:5215 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f37a53cfa63c8d234c8b694054a8bb5c726f6181f1159aef1b059dd6af5ac35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3294 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:5133 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:5234 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2018e41939ed3ae5e175a822a1cb6f8e705aeb70b6920af836c14ebe4bd63c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:3619 \u00B7 apps/desktop/src/components/redis/RedisKeyBrowser.vue:3646 \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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":3619}}}],"partialFingerprints":{"codehealthFindingId/v1":"10477b45d29ce6d97593b21d9b83ef33f889585b5b648e9e765b6ca32d61db39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): apps/desktop/src/components/sidebar/ConnectionTree.vue:2819 \u00B7 apps/desktop/src/components/sidebar/ConnectionTree.vue:2833 \u00B7 apps/desktop/src/components/sidebar/ConnectionTree.vue:2865 \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":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"101ea02747fc0a5a02a455c1e011ffbd40733c6a8b6e8394529c16216b41f731"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6552 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6681 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6796 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:7110 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6552}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60143d492a0bd481ed6976d9cbbc48cdc56732d03ec3455a9bf5953b570c75d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/components/transfer/DataTransferDialog.vue:487 \u00B7 apps/desktop/src/components/transfer/DataTransferDialog.vue:583 \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":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"93652f821ab205d5d50007eb23bed8ffd91d515443a01400b76c2890eca416e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridActions.ts:221 \u00B7 apps/desktop/src/composables/useDataGridActions.ts:243 \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":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35a1efccf83762513e05e941f96a65bd565591303ac477e9fc819e6f56785f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridColumnResize.ts:117 \u00B7 apps/desktop/src/composables/useDataGridColumnResize.ts:132 \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":"apps/desktop/src/composables/useDataGridColumnResize.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6f6feabe63674a106b53e8588f0f72ee8565825eb56ca7f11611934d55e91f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExport.ts:1675 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b208b1847dd0b4914f89c7a5c258321444ae4a297bce40601a0e8fcabb6ada1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExport.ts:2016 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:2238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a253acfd0870c2c6fca33af633a7c161a3894420da3f687b314039663ab1d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/composables/useDialogSources.ts:197 \u00B7 apps/desktop/src/composables/useDialogSources.ts:264 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ded200676bf425a4f15a4f84b8fe702c30e986dcc4a746018c30e3048178380"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): apps/desktop/src/composables/useNavigationTargets.ts:164 \u00B7 apps/desktop/src/composables/useNavigationTargets.ts:290 \u00B7 apps/desktop/src/composables/useNavigationTargets.ts:338 \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":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb7087182dccbe71be5ba8573bfd08a7b1eabbf5ba5b79e5040eddf1d004204"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:223 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:245 \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":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7971d9bfcf0d54c3ddad3cd381b5bd51ba76365399e39759711ccaeb0e2db1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:824 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:869 \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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"172fbe757551a84a39d0e9e5498230b6f71798236cbe20d3eece1304f4509bbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): apps/desktop/src/composables/useTauriEvents.ts:134 \u00B7 apps/desktop/src/composables/useTauriEvents.ts:160 \u00B7 apps/desktop/src/composables/useTauriEvents.ts:186 \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":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84165379348b352743b38411a85f8e2e2d8bdc88313d12663ee4b47029ef851"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:772 \u00B7 apps/desktop/src/lib/backend/http.ts:1017 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87b163ff7fed80b8ed9991167115cb4f0d8a5b2690d281fbc74bd4ddd288013"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:1538 \u00B7 apps/desktop/src/lib/backend/tauri.ts:3013 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2f32c170e8c963c5503af97a3a0ea4279250f1819446dcd56b5a7e1c626787"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:3476 \u00B7 apps/desktop/src/lib/backend/http.ts:3696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3476}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e6074d5189e4d5eeee76dcfcc1e677cd2d90a00ebc620e80c5931e40f0288e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4498 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4630 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0318d67c6309f6a2eff0e55bf305f246ad4259d64038567271d9741dad830cd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4717 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4845 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4717}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b84272e163d6508ded99cf175a196ed36b6a987a66fa706ce60763fa6d29b98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataCompare.ts:160 \u00B7 apps/desktop/src/stores/connectionStore.ts:9963 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataCompare.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3962bd5c901d45428d687622481a0ad12f4c094f8be2b3fd0cc1113a565058a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/database/databaseAuthorizationPlan.ts:542 \u00B7 apps/desktop/src/lib/database/databaseAuthorizationPlan.ts:555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d100d6bad8448c6993917c5b307c1424d097a5eaa5c13630808881d66ebf44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/database/dbAdminSql.ts:160 \u00B7 apps/desktop/src/lib/database/dbAdminSql.ts:216 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4326f4ffe6dc6864d5746b7579b59e5e5f12aa1f790030a921ec615b7aab7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleConstraints.ts:197 \u00B7 apps/desktop/src/lib/table/oraclePackageSource.ts:14 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e6b5d485f8925ab2dbd0f69bfdd76f43a405239899a48a1f8b89d487774892"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/globalSearch/globalSearchSettings.ts:8 \u00B7 apps/desktop/src/lib/sqlFile/sqlFileFolders.ts:8 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/globalSearch/globalSearchSettings.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5971cbbf9c386d2832a8ce3c9cadd05ae7d8e81ba7812fbce0397749431e53d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/nacos/nacosAdmin.ts:504 \u00B7 apps/desktop/src/lib/savedSql/savedSqlSearch.ts:32 \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":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"be11b2ba0d08fa333346746104cf81a81e2b1de0d7bda938cc26c1af8282b338"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/redis/redisValuePresentation.ts:872 \u00B7 apps/desktop/src/lib/redis/redisValuePresentation.ts:908 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e79f23be49e889adb147d88bf1163287121b676db51faf16b2fa43674a55dab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/settings/settingsTransfer.ts:604 \u00B7 apps/desktop/src/lib/settings/settingsTransfer.ts:628 \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":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e9e09d3fe177edc9ab3d6eb94571dccf2e5f62b8d38a6160312ee4950f89b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/executableStatementRangeCache.ts:148 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:850 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"apps/desktop/src/lib/sql/executableStatementRangeCache.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b399379685fc55ca7ab11d8b80e06986af73a8c91c558db989a8fbc87a1a64b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:3930 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:3970 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:6016 \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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3930}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf21825d06ac7884bcac42ac14a7fd31adb4caa1bab20810a997527211ef5227"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:603 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb8565b20132ae25e982c6b9dd768ce850e39e4e804c37facfa6283bcfbfc76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:2313 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:2328 \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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf951b692abe0bbb13198dff8fbeee4e9e83dfcb7ba612b10fc4918bb0601933"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): apps/desktop/src/lib/table/oracleRoutineRename.ts:89 \u00B7 apps/desktop/src/lib/table/oracleTableRename.ts:104 \u00B7 apps/desktop/src/lib/table/oracleViewRename.ts:65 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"555fe26b9233d7365e36662062a932a07e0122d6775b8d487bd7f863d23b50e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleTypeDataMapping.ts:180 \u00B7 apps/desktop/src/lib/table/oracleTypeDataMapping.ts:207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeDataMapping.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc55b74c201a8ce46996a1321e872a9c383d9bdf541b57accb60fc9807db388"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/lib/table/tableStructureEditorState.ts:1647 \u00B7 apps/desktop/src/lib/table/tableStructureEditorState.ts:1661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"84348d8427f7d8e3e51c6916bb8145342d65322eb6e089374dd4a6ed92c8a982"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): apps/desktop/src/stores/connectionStore.ts:2345 \u00B7 apps/desktop/src/stores/connectionStore.ts:2373 \u00B7 apps/desktop/src/stores/connectionStore.ts:2387 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5925529e03f0a41aada24ab0beab115d58b1b72e670fb63492f49be9e7a75759"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:6936 \u00B7 apps/desktop/src/stores/connectionStore.ts:6972 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6936}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d852ba0dae7d222986e440c25d1dffff572398c4d3e2f0922c7ad8bc015f592"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:10209 \u00B7 apps/desktop/src/stores/connectionStore.ts:10230 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f08b77528a627f674c2f5ed1313b216069b8a9177d399705a172217f39dedb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:11333 \u00B7 apps/desktop/src/stores/queryStore.ts:11845 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11333}}}],"partialFingerprints":{"codehealthFindingId/v1":"59187d9c9bc04a8048b8369631166c7b159806ea1733709c4fc08bcb61a3f038"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): agents/scripts/build_offline_jdbc_payload.mjs:10 \u00B7 agents/scripts/verify_offline_jdbc_release.mjs:10 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/build_offline_jdbc_payload.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51b96acf7861771187319a05a9b1ffd361acc9b99df5a529a1c12986875c23c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/App.vue:4095 \u00B7 apps/desktop/src/App.vue:4130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":4095}}}],"partialFingerprints":{"codehealthFindingId/v1":"978efc72ec7f7fe70a2914ee0851d9ba035037ad4f841eaadb5a812d3aa05bb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/admin/ProcessListPanel.vue:227 \u00B7 apps/desktop/src/components/admin/ProcessListPanel.vue:292 \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":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"04527bd65acb7ac1366960cd0f8a244b95469fc34d703bd66e1197dc4094aea2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue:98 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:226 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"905fd8745f3bce75a8625b19bb9e2f2ce724686ba67daed9a6a8c428f98c1be3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:498 \u00B7 apps/desktop/src/components/config/DriverStoreDialog.vue:617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3031cc9145b27354cbfc15d63459fabb9699d5cffd010e842410da51fe8a1f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:1217 \u00B7 apps/desktop/src/components/config/DriverStoreDialog.vue:1230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f63aa3eecc23a4f6407125c9e271a416489c339af3a7a9cf1ee504212c846ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:1963 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:1988 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"754339b25383b04637de5b18ff9dc2627167061d31e05d2358e76b62f73ab0da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:2818 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:2853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":2818}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c846d18f323ff51dde2666d97b7d374fec33afbee2c606a62cae9b87fe418cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:4223 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:4244 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4223}}}],"partialFingerprints":{"codehealthFindingId/v1":"48519f25a376e656bdeb338178d11b3592885306112dfcf4c6a02d03c23fb28e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:4388 \u00B7 apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue:60 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4388}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67cddd615c2ca0d01bf8ee82f2dc36d9509bcdf1075ec7265875257b7f572ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/components/consul/ConsulTools.vue:67 \u00B7 apps/desktop/src/components/consul/ConsulTools.vue:80 \u00B7 apps/desktop/src/components/consul/ConsulTools.vue:93 \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":"apps/desktop/src/components/consul/ConsulTools.vue"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d6f26e024c5edbf81e38aaaeeafeb30cd338ea5c12dc763a071e46c0be34a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): apps/desktop/src/components/diagram/DiagramToolbar.vue:71 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:2017 \u00B7 apps/desktop/src/components/editor/MultiSourceMergeView.vue:84 \u00B7 apps/desktop/src/components/quick-open/QuickOpenDialog.vue:257 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/components/diagram/DiagramToolbar.vue"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc5ba216dffc9d324450b0bc87ccaa79ef324b24e0b2c4c71ec0bc4390b0124"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:2784 \u00B7 apps/desktop/src/components/grid/DataGridQueryControls.vue:166 \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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":2784}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4aa3ed17781238c8123cc47c8753c7e3421b336052b1892838a8eb6f93f6dfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/dolt/DoltVersionControl.vue:97 \u00B7 apps/desktop/src/components/vector/VectorBrowser.vue:36 \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":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2159019165e1ff1c0f3abe1b659076ead33e8a9709fd61398c82cba9ad80262a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:6482 \u00B7 apps/desktop/src/components/mqtt/MqttPublishDialog.vue:187 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6482}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aba3655097992c170ad625de590c3393639002ac5b493de3234afb06359548"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:1964 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:3708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316bc6af2f10793c5b944241e5a4dd063f87bff72a3263bd8650aabcec929d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/generate/DataGenerateDialog.vue:358 \u00B7 apps/desktop/src/components/generate/DataGenerateDialog.vue:372 \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":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c514afe7b244626539d17e39ccffddfb00a4287077e46526b34a9ea248a90bdd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/generate/DataGenerateDialog.vue:484 \u00B7 apps/desktop/src/components/generate/DataGenerateDialog.vue:513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"d576b9715febd5831eb5a25037f57f43336f1f0a155749a0cf391acb7cc0c0a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/CreditCardNumberParams.vue:9 \u00B7 apps/desktop/src/components/generate/params/CreditCardTypeParams.vue:9 \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":"apps/desktop/src/components/generate/params/CreditCardNumberParams.vue"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dd04472859aad1a1a6a46b56834158653e99430276960721e669a348e9f0d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/CreditCardTypeParams.vue:22 \u00B7 apps/desktop/src/components/generate/params/IdNumberParams.vue:21 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/CreditCardTypeParams.vue"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd82d06b91786ae2d0d73255abb4bd66de065678b362463c3457ffb9c8f8815"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/desktop/src/components/generate/params/MacAddressParams.vue:2 \u00B7 apps/desktop/src/components/generate/params/SkuParams.vue:3 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 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":"apps/desktop/src/components/generate/params/MacAddressParams.vue"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfe4443aed599d6991b2514264154e29bd2747d2452dad092812bddc72eee60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:3087 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:3117 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":3087}}}],"partialFingerprints":{"codehealthFindingId/v1":"334b6e27f57dd622d500d5a1834530bc8ff264415f762e9ee1616b406fac893a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:4330 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:4415 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":4330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e4891967501c1c27a66cfe1d075b329fa989e0cf6275d851e2fcc138dd8517"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 8 locations): apps/desktop/src/components/grid/DataGrid.vue:7480 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:7503 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:7517 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:7531 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":7480}}}],"partialFingerprints":{"codehealthFindingId/v1":"f934d3ab5f4469eecfed5057a28f23b72647a8f46952356b55e7ebd294d6817a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:13636 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:2303 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":13636}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38208b7cd3c9b4e537b775ed1a57af4aaddf22a60f0583ae7701321eb4b2f73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): apps/desktop/src/components/grid/DataGridFilterWorkbench.vue:58 \u00B7 apps/desktop/src/components/grid/DataGridSortWorkbench.vue:32 \u00B7 apps/desktop/src/components/grid/DataGridTextFilterWorkbench.vue:133 \u00B7 apps/desktop/src/components/grid/DataGridTextSortWorkbench.vue:110 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/components/grid/DataGridFilterWorkbench.vue"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68d74d7bb0b5a5454e3a1d3b02c6961a98f8052edd1569363e3754a745259c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/desktop/src/components/grid/ImagePreviewDialog.vue:7 \u00B7 apps/desktop/src/components/tabs/TabSwitcherDialog.vue:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/ImagePreviewDialog.vue"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d764df8c927136694d00925bdedb04ea4f1e8f9b39902308ef56fa2d808a6103"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/import/TableImportDialog.vue:338 \u00B7 apps/desktop/src/components/import/TableImportDialog.vue:1736 \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":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3257956a1bd34275fc1381764772188ad108c881edad3040e50754129ec6d3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/layout/EditorGroup.vue:62 \u00B7 apps/desktop/src/components/layout/SqlEditorWorkspace.vue:49 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorGroup.vue"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfec77297df45631bf8174f9c31e2a3b7537a65dd66004e250ce598b885ec49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/layout/QueryResultToolbarActions.vue:37 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:469 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/QueryResultToolbarActions.vue"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b218e5e1fb96eb9127bd460be9e375216df957e768285e50a7602f8d28daac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:139 \u00B7 apps/desktop/src/components/transfer/TransferTaskTree.vue:119 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"44990403c7e52c947325924c16e5f8c68bd90f7d3ab18a1b40c7966f850a9190"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/desktop/src/components/meilisearch/MeilisearchIndexView.vue:52 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue:240 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"apps/desktop/src/components/meilisearch/MeilisearchIndexView.vue"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cf29cec806e06a6da866b72a594e76bdeeb81cb80144b467b8943ef83b2bac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/desktop/src/components/meilisearch/MeilisearchOverviewPage.vue:50 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchTasksPage.vue:175 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"apps/desktop/src/components/meilisearch/MeilisearchOverviewPage.vue"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"992704de3cbbd405a8563f6b55e4bec46ff9c7ef84bdccd6110c1fbf5f0b65c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 8 locations): apps/desktop/src/components/mq/ExchangesPanel.vue:240 \u00B7 apps/desktop/src/components/mq/ExchangesPanel.vue:330 \u00B7 apps/desktop/src/components/mq/NamespacesPanel.vue:93 \u00B7 apps/desktop/src/components/mq/SubscriptionsPanel.vue:340 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aae612769f7fdef8f84ead1b2b4d40f606cc977b04872c7c5888c266f9da651"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): apps/desktop/src/components/mq/ExchangesPanel.vue:276 \u00B7 apps/desktop/src/components/mq/NamespacesPanel.vue:58 \u00B7 apps/desktop/src/components/mq/TenantsPanel.vue:63 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue:179 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6567694390023e271adbdde2fc12cdde5f7139ed9487b4e15a7b696b33b1a1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/MessageBrowser.vue:90 \u00B7 apps/desktop/src/components/mq/MessageBrowser.vue:118 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MessageBrowser.vue"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"699f97b933cc9e475b2013eeaf2b3cb8b7a84ba7b727ef6a724c9b21bd000011"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/components/mq/TenantsPanel.vue:51 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqClientsPanel.vue:53 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue:63 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea427b0f5975be7a6512a66861ea59886bb4fc3f37bf46114fc2403d103c1725"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue:79 \u00B7 apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue:93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4560fe616fa73336ac4f3b9fd008e63d0584a88f9a54d5a995f505b2985f3b9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue:261 \u00B7 apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue:279 \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":"apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49a5c6a60039adc0980e88fb9a09e767a17dfb1667621c70c25306b29c5ec37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:523 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:540 \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":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6693c6b1f8b7cc5338cda338d432f30949f231ba284a599312e276191b6f6d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:2996 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4355 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2996}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ae74c67a8dc448227de9cafeea4fa9289fddb003c269099989ce452cb09934"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3906 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:4017 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3906}}}],"partialFingerprints":{"codehealthFindingId/v1":"750ddb88305084dc3cbf42121bd5fd06c198d92505ff7b32c0722c6ef3a4ca4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4869 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:6263 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4869}}}],"partialFingerprints":{"codehealthFindingId/v1":"9345d1e2a61e5aadb7e8bb90f128df77ad694b83f8e0e953af8452d9cb61d9f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:1681 \u00B7 apps/desktop/src/components/redis/RedisKeyBrowser.vue:1711 \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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcde45e574f16f8eaaf508612a8178d461c94160db2c429196d81051bac63dab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/desktop/src/components/settings/SettingsTransferPanel.vue:156 \u00B7 apps/desktop/src/components/settings/SettingsTransferPanel.vue:184 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/SettingsTransferPanel.vue"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa5e1a01325d8978fc4b0e348864e9592f4a7a522191495b49a349fe11f6e14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5828 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5875 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5828}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49f5c45f3e1da21a28d5e21442198aafb11e8a4cc6dfe43384cc9b8f2ece734"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8578 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8673 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":8578}}}],"partialFingerprints":{"codehealthFindingId/v1":"081b710a9ab82201fcc84b0c4584524777e1a60dbf1b186e32f68b71f09b34a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:5565 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:5659 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":5565}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdb2e01ec87e7ba43af6fbbf7a36130955217e1a57ef440464ed9f72c6c0780"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6595 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6708 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6595}}}],"partialFingerprints":{"codehealthFindingId/v1":"158aba64bc514a4e59ac623beb821372b853cfc1bb7acae4279960a0172c8ba1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6686 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6801 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:7115 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6686}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f7a77adb9d9369b1df43626f43c8ad6a57b98c669953bd9d9ff53db89ed5eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): apps/desktop/src/composables/useDataGridExport.ts:1649 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1701 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1754 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1829 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a88b4e4058230497ea60426719eabf06a96a00e9e760a65d220f0c670ff412"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/composables/useDataGridExport.ts:1742 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1817 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1842 \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bdd7c02e76a1491ff01634f6dee3f8ea94cbafdf01cff642fff68efe2c5349"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExport.ts:2259 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:2319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d0f621d61eafc6f8ecc9e0f415411bff0867c24797fcb8beb9b0631ac045d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/composables/usePluginShortcutHeight.ts:79 \u00B7 apps/desktop/src/composables/usePluginShortcutSort.ts:82 \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":"apps/desktop/src/composables/usePluginShortcutHeight.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1eec4eeb3fce963e1f2629d2c439344173d8050e42247c6938f1c1050e8810"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/composables/useSqlExecution.ts:408 \u00B7 apps/desktop/src/composables/useSqlExecution.ts:439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"5631330300757bcf8455ce0efc3af210abf19b38e49ef6280c394100e7e73f53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/composables/useTabScroll.ts:122 \u00B7 apps/desktop/src/composables/useVerticalOverlayScrollbar.ts:131 \u00B7 apps/desktop/src/composables/useVerticalOverlayScrollbar.ts:145 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTabScroll.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"00afb292a2be3501d7128e79666950d160c4f8f978d8f3e6d80a32ff6d967a98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/app/changelog.ts:133 \u00B7 apps/desktop/src/lib/app/changelog.ts:161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/changelog.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"48500cf1308d7bfe8752299128d9752c7a28ab8262577e438fa556ed69bb2c2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/backend/browserAppStateStorage.ts:9 \u00B7 apps/desktop/src/lib/nacos/nacosReplaceHistoryStorage.ts:10 \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":"apps/desktop/src/lib/backend/browserAppStateStorage.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0cface84de47dc5ec7c6edc07fd08993f355c2b9c779bdd9db95f1665ef73a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): apps/desktop/src/lib/backend/http.ts:1917 \u00B7 apps/desktop/src/lib/backend/http.ts:4136 \u00B7 apps/desktop/src/lib/backend/tauri.ts:2370 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4005 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"630667b9427d90d8b8bfd76fc209f88ab52923874a1a8d135f0bb6439d178eb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:2487 \u00B7 apps/desktop/src/lib/backend/tauri.ts:836 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2487}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a15f40736290f9553090e8ca8d3f0e53b4ffc9f7d9e0a155801397420ebdcc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:3107 \u00B7 apps/desktop/src/lib/backend/tauri.ts:1376 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92c6e1983e8de9dcc3078b465b50ce8a933e4a9a47f807c6976deb2add626c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4641 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4769 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4641}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ec2c1eedde6ce4658c9472131c9ca9d9c40560e188d28e258d8da687681813"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionUrl.ts:906 \u00B7 apps/desktop/src/lib/connection/connectionUrl.ts:919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f2604a8e467588ef206454c1d3294d093538c33771686977c389da3a10342c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts:29 \u00B7 apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts:42 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"98004f59d7e5295086339b91337f955259daa6cc64e8b0735a9099c4d3c97190"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/database/dbAdminSql.ts:287 \u00B7 apps/desktop/src/lib/database/dbAdminSql.ts:305 \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":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d28a3b3ea2ea29856491bec1f3a9f3d234a9c812f5584062d798052f7362a31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/desktop/src/lib/document/gridFsBrowser.ts:58 \u00B7 apps/desktop/src/lib/document/gridFsBrowser.ts:114 \u2014 the two spans are one implementation copied and then locally edited \u2014 104 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/document/gridFsBrowser.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1c3f5738b0d07d353f8489df097b8779aef51bda36171f543c23638251c0ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/desktop/src/lib/editor/hoverTableLookup.ts:53 \u00B7 apps/desktop/src/lib/sql/queryCursorTableTarget.ts:66 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"apps/desktop/src/lib/editor/hoverTableLookup.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"290d93819c5912b73ff9867780fd4579a6ea11e595d04bed1dce69a6ab433099"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/editor/hoverTableSql.ts:400 \u00B7 apps/desktop/src/lib/editor/hoverTableSql.ts:425 \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":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d909a45079ed091c1b71dc01d6654e8bdaf4b7b0957bf20b6b630a1b7d55c53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/metadata/tableMetadataCache.ts:200 \u00B7 apps/desktop/src/lib/metadata/tableMetadataCache.ts:358 \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":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"153a019053ea8c9e54feadddf100c9d4d20eda4dc4527611dd38a6f671abb86a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/query/queryResultDefaultView.ts:67 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:2472 \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":"apps/desktop/src/lib/query/queryResultDefaultView.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc4df526f4fc2dad51d578c99915d97ba65973843da7ac7949fde78a9385255"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/savedSql/savedSqlTreeRows.ts:61 \u00B7 apps/desktop/src/lib/savedSql/savedSqlTreeRows.ts:95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlTreeRows.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a8dc9246983e0da322e163a9da2b0f1160ee306848a348b656bb43bd8468b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/lib/schema/schemaDiff.ts:831 \u00B7 apps/desktop/src/lib/schema/schemaDiff.ts:846 \u00B7 apps/desktop/src/lib/schema/schemaDiff.ts:859 \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":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca4cd43a07144928c5f3a189abbefb5fa0439e088b53399cb2b79442a9313a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/lib/schema/schemaDiffDdlNormalize.ts:28 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1976 \u00B7 apps/desktop/src/lib/sql/sqlVariables.ts:393 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffDdlNormalize.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7289001291a4fc4273f90f032afac7b1073ac06353b8f72804ce699690ba31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarLayout.ts:480 \u00B7 apps/desktop/src/lib/table/tableVGroup.ts:298 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d669b6ddab5145f2f681e2e1433a75f02344bf5127dae9e800fb45bb4a8e450"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/treeNodeClick.ts:171 \u00B7 apps/desktop/src/lib/sidebar/treeNodeClick.ts:218 \u2014 the two spans are one implementation copied and then locally edited \u2014 117 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dd4753b5d4e9a5e0a491b396b9f8cad57e61477d0513583b0f404983a8363f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/lib/sql/cypherFormatter.ts:113 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1972 \u00B7 apps/desktop/src/lib/sql/sqlVariables.ts:389 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e35a95c7ae6b1b253d82da7f14103dfd5bb06cd3a9cc7541630328aa3a993b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/dialect.ts:116 \u00B7 apps/desktop/src/lib/sql/semantic/dialect.ts:168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/dialect.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4caefefeda1a0aacabd72e0a5f823d105d1653efc4fad93f0a0ee2733d289022"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:7307 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:7343 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:7372 \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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7307}}}],"partialFingerprints":{"codehealthFindingId/v1":"174362d3481e0870aacf26706594bb33ea989992440236e6862bb18ad6fa1785"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 11 locations): apps/desktop/src/lib/sql/sqlParameters.ts:379 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:830 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1052 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1206 \u00B7 \u002B7 more site(s) not listed \u2014 all 11 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4aa84cbc2c044830d3abf50cca8ced606a53f1a5ac8366b0a5172aa304bbfd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): apps/desktop/src/lib/sql/sqlParameters.ts:452 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:935 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1038 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1192 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"518f8e1d48f41c20214d9e3314c43f525968bcc5fd072f744e7495049b0a3c4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): apps/desktop/src/lib/sql/sqlParameters.ts:960 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1067 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1221 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1409 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b275bfd3ddee9ec00fdefe55d188015cf3bc11e12183ca6ecb7bf18f4e4afc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:1359 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1717 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c516813556c13be3615f8a9a05d5ff4ca4d80dc554b599196214e00258ea19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:1405 \u00B7 apps/desktop/src/lib/sql/sqlVariables.ts:99 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"01446ddc2cc1eb79b4a404e8d4d1766c888b36fd8676d5688a5a3ef86ba61dc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlParameters.ts:1459 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1499 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1653 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61f416f75f599b313b8eed4bcb666c0c48e5478dae0d1575c3536f1518738f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:2591 \u00B7 apps/desktop/src/stores/connectionStore.ts:8181 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6749f98f5ba1bf50f341d935c729d364404d024e609ddf117e950e51c13f68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): apps/desktop/src/stores/connectionStore.ts:8720 \u00B7 apps/desktop/src/stores/connectionStore.ts:8764 \u00B7 apps/desktop/src/stores/connectionStore.ts:8809 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8720}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0e26013a71ec7fa25ac420cc8dc1aad1df38c54f5ba58c819165ece3405814"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): apps/desktop/src/stores/connectionStore.ts:8758 \u00B7 apps/desktop/src/stores/connectionStore.ts:8803 \u00B7 apps/desktop/src/stores/connectionStore.ts:8889 \u00B7 apps/desktop/src/stores/connectionStore.ts:8920 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8758}}}],"partialFingerprints":{"codehealthFindingId/v1":"037aa73317b36daa897dfb389d47713d7912c42e7e4b8e28093dbd6fc1fe3ffd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:5415 \u00B7 apps/desktop/src/stores/queryStore.ts:5475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5415}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2541e2c4569f5fbbd0f25093c47fa12c15e46ae93d76d0482ac2c5e54ba2d36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:9280 \u00B7 apps/desktop/src/stores/queryStore.ts:10014 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9280}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dc77a638cb611279002f209811a36400420a5660fec46dec1750336a0fa655"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/App.vue:1217 \u00B7 apps/desktop/src/App.vue:1254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fab870af621fd7cb978c3637b5d1830e05fd33242c78db732f8b505902006b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/components/admin/ProcessListPanel.vue:137 \u00B7 apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue:349 \u2014 the two spans are one implementation copied and then locally edited \u2014 94 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"250dbd643ba944eeeadf61fbb9435bdec7bad3bd1348ce0633713d26942f5755"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue:750 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:7581 \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":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"e769a68569c958a28ad9e3bad400e33f403f977a2f0d986aac91814646a4694f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulHealth.vue:310 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:498 \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":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e88c0da266f01345802ad0e0bf255a2cfb01a9cb6f4ad12ddb16d1ea6712d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulServices.vue:407 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"6279ff53e95fe87329992b161c40d23507f8939d9326c5634086a3542a250538"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:799 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:1626 \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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61f434a7c27ac8e728125d29ae8c71135b3b99b5151aaa79e2308f581ca49d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:875 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:921 \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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"099925cab5dd5ba210f5bfd45094452d1905b140d7e826372067aefc7baba6aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:2800 \u00B7 apps/desktop/src/components/grid/DataGridQueryControls.vue:179 \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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec07f3f48471fc30237b99cfc4197aa2c8d5fc1d1075e84adca80dff474a4c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/components/dolt/DoltDiffTable.vue:107 \u00B7 apps/desktop/src/lib/mq/rabbitmqQueueFeatures.ts:37 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/components/dolt/DoltDiffTable.vue"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bee4432022c737d770a1c3bf92d30190fc6912fff85aec37405c94ca9f17c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:943 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b22dac5472f46b34e982a2d047573e2f4839cb95fb163698ab93426e3ac8ecf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:1940 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:3636 \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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"de17c763f26d9d108bb8a0803cf0ba9e16b4b863ec32c9bee1bbdd8aa95d71fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:3006 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:3254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":3006}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4c0ccad344827c1a8463dd0103f2009eafea218fe1184233bef8ddea4703ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:3884 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:3895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":3884}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1280742c55f783ac20c9ceae11a07ed9e41d2566dc16f50fcc400e0e5c95485"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:5280 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:5302 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:5334 \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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":5280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3299de92bf83ed37a273f8f08c9a767c8d0783350930caabea8036199aee00ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:5313 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:5345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":5313}}}],"partialFingerprints":{"codehealthFindingId/v1":"79be76741236f61716720ef7528848f6e0eec1cfe9f78ffd5e0f0ff20fdebccc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:5738 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:5750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":5738}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0d988978423ad2758b34929fcddd03d18cfa332124576e6af23805bd2a4050"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/QueryEditor.vue:680 \u00B7 apps/desktop/src/composables/useCellDetailEditor.ts:150 \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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"18071016edbe7bdc107b6e8904f9a597167041afb6083011c612bbaa10977b35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/QueryEditor.vue:780 \u00B7 apps/desktop/src/components/editor/QueryEditor.vue:800 \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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d493c0435c0bf3bd270ac731ef13974d292732f0ac9c81fc9370daee8fbb7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): apps/desktop/src/components/editor/QueryEditor.vue:1929 \u00B7 apps/desktop/src/components/editor/QueryEditor.vue:1999 \u00B7 apps/desktop/src/components/editor/QueryEditor.vue:2039 \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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f521262fa73d5271214ef25f59ee376f1ced5aff2c6bdbc4a45dfb4875f411ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/QueryEditor.vue:2283 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:486 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad59689e7a81b5c44070255352542039b72efff9a7a696a9c329442fa69e028d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue:378 \u00B7 apps/desktop/src/components/generate/DataGenerateDialog.vue:890 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b49bd942706b1dafcc013487cfc036ffb32a4949e90fa195e8372bcc47d339"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/TableStructurePeekDialog.vue:67 \u00B7 apps/desktop/src/components/grid/DataGridTableInfoPanels.vue:65 \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":"apps/desktop/src/components/editor/TableStructurePeekDialog.vue"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd7e9eea98c814d75a8f750044eb0d6338e06014ea05e479f52aa57dbe96eea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/editor/ThemeCustomizerDialog.vue:362 \u00B7 apps/desktop/src/components/editor/ThemeCustomizerDialog.vue:447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41f9b1d0c4ca759f00b9dc1209e428814e586f3e1c6407562421ea006521a16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdDashboard.vue:111 \u00B7 apps/desktop/src/components/solr/SolrAdmin.vue:503 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdDashboard.vue"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3fc8bab5b17d2bca3a2be3dad7da97b3b50ec352c793b5720e1aa485b875a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/export/DatabaseExportDialog.vue:152 \u00B7 apps/desktop/src/components/export/ExportProgressDialog.vue:85 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f5b9e7f457d562d3bedb80f645fbb976e0f5e5ab3a2bfeef2f68f04d50792c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/export/DatabaseExportDialog.vue:781 \u00B7 apps/desktop/src/components/export/DatabaseExportDialog.vue:942 \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":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc988829e0ce8dd87a470d2a4addafc0a5283d0fb738710158fdcc7abae23f76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): apps/desktop/src/components/generate/params/CityParams.vue:66 \u00B7 apps/desktop/src/components/generate/params/CompanyNameParams.vue:48 \u00B7 apps/desktop/src/components/generate/params/DepartmentParams.vue:26 \u00B7 apps/desktop/src/components/generate/params/IndustryParams.vue:26 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/components/generate/params/CityParams.vue"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c174b0859550703b50a540b20f841a8eb7824c520e3d1da9500ff1048ed74989"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): apps/desktop/src/components/generate/params/FilePathParams.vue:81 \u00B7 apps/desktop/src/components/generate/params/FullNameParams.vue:66 \u00B7 apps/desktop/src/components/generate/params/PhoneParams.vue:62 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/FilePathParams.vue"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e663deac0bea64f06bfec2be1aa69136542fe43d5f3aad18c29c6fbe609fd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/IdNumberParams.vue:123 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:799 \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":"apps/desktop/src/components/generate/params/IdNumberParams.vue"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8373a115e99c00c6ed2fc149c6f44fb273da465f5f82aa3407c84f11d38704"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/IpAddressParams.vue:22 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:692 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/IpAddressParams.vue"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be7fec933bf10156ac9761ef4874d7d0090db073e19347a55072cff6bdaa796"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:1059 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:3357 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"7effb372dff12634e04cd1d8d197fbd71e7276df3c27ac1e89969b0b705e128d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:6834 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:6925 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":6834}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ee95d29464e8bf0aebeebb3567a8821e12b3326c7978704a80685ded96cd70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:6953 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:6982 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":6953}}}],"partialFingerprints":{"codehealthFindingId/v1":"336ecc50ded6b0164fd444e6bc6333d0f070aef24c81a6c5c70b116dbbdbe85a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:8807 \u00B7 apps/desktop/src/composables/useDataGridEditor.ts:788 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8807}}}],"partialFingerprints":{"codehealthFindingId/v1":"5685b94af4b14c7e3e1b6627ade957284eb407aa3fb0c8e5708d339fcd28f3ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridFilterBuilder.vue:336 \u00B7 apps/desktop/src/components/grid/DataGridSortBuilder.vue:98 \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":"apps/desktop/src/components/grid/DataGridFilterBuilder.vue"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c259d4c1b355e615e1d1c73a067263281c5e7f2000d4c7c2ba95f0e9b5317b0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridMongoJsonPreview.vue:29 \u00B7 apps/desktop/src/composables/useDataGridCellDetail.ts:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"apps/desktop/src/components/grid/DataGridMongoJsonPreview.vue"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb96f07b4132a3324501da1a8396dad14889d4e91c6114770990e78b135f0136"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlFilePanel.vue:460 \u00B7 apps/desktop/src/components/layout/SqlFilePanel.vue:590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba8c4b9da0ca087ad2c3be5cddc71cf7e71056059c14ee31c35e193f65cbe99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:395 \u00B7 apps/desktop/src/components/transfer/TransferTaskTree.vue:63 \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":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"575238f3cbfdb2543c0977fc5a0b19d45983370ae5d384e200678689e2b74dab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/components/mq/BrokerPanel.vue:8 \u00B7 apps/desktop/src/components/mq/PermissionsPanel.vue:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/BrokerPanel.vue"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c08443cfa6554f3415dad1b4931a92b6c76e61d5b93652a2bddbdcca0f3fecd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/mq/ExchangesPanel.vue:255 \u00B7 apps/desktop/src/components/mq/ExchangesPanel.vue:302 \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":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f225e9dd9f3f61c1f550cff7da13bd54dcf96d1aaf554b974d301d413af99de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/mq/MonitoringPanel.vue:175 \u00B7 apps/desktop/src/components/mq/SubscriptionsPanel.vue:154 \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":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fea0de50d29b3609f278d45bfe92282b4e6d4f8afaf13f78d3e13b7583ab5fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/mq/MonitoringPanel.vue:314 \u00B7 apps/desktop/src/components/mq/ProducerConsumerPanel.vue:486 \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":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa1ef6f9714bddf56d9b4348411b65df9f09d8ac25baebe1a35ff7ec9de34f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/mq/ProducerConsumerPanel.vue:465 \u00B7 apps/desktop/src/components/mq/ProducerConsumerPanel.vue: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":"apps/desktop/src/components/mq/ProducerConsumerPanel.vue"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"189e44161d4923696d855bf498002b315f27666670721cae37347f49759d61c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue:166 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue:243 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue:183 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45257a2d483f46f9874f0c1da01a427c7621fb3ea7a910d75b9737ee7770d0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/objects/EventTriggerDetailsDialog.vue:9 \u00B7 apps/desktop/src/components/objects/ExtensionDetailsDialog.vue:9 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/EventTriggerDetailsDialog.vue"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e7866dc5c75040d1a3ed4ec2654de7eb3457bd1a3a523cabe2b04fe59ea45f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:2975 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4339 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51d157603aa2522e10d3ad8bc5abdbca9d774bce904de7e5f1ad6d4e4477609"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3089 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4457 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3089}}}],"partialFingerprints":{"codehealthFindingId/v1":"4901ee84cee14e2fddce51c2150e4dab83a338071f0aa0db29eb2f871a9f73dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3225 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4801 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3225}}}],"partialFingerprints":{"codehealthFindingId/v1":"278f4739f638f33ba8eda3213632fcc4ab7425ac1d5e77bb62dab551bb2333d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:5004 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:6451 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5004}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aac6801e758478dabaaba86172485f2e0c04eefd2aa5b32984968edff28aa8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:5340 \u00B7 apps/desktop/src/lib/table/objectSourceTabSave.ts:52 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5340}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b0d0c827ba2f79efb110f9d4ebba2bd5f2ca8e751cf3c7aa6b2b3a9f5e7e47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:6242 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:6322 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b05abebf550d92f0daad5e1dd66cef301fc0696797d73fc0b8df3676c82e19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginFileManager.vue:34 \u00B7 apps/desktop/src/components/structure/StarRocksLayoutCopyDialog.vue:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"apps/desktop/src/components/plugins/PluginFileManager.vue"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff7fa10c15bd81485f73c4c6b0b4052fe8447fc4a2f4d5db70709bc6c3d2b46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginWorkbenchHost.vue:246 \u00B7 apps/desktop/src/lib/plugins/pluginFieldPicker.ts:51 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8d7ea085f98ae4b8a651a00599ec6d48ccdbcfa5b2e8a97f6bb96088dd3503"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisDashboard.vue:211 \u00B7 apps/desktop/src/components/redis/RedisDashboard.vue:240 \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":"apps/desktop/src/components/redis/RedisDashboard.vue"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e4027221d042ffe0b1eb777bb9af6d34b09dc3c81dea287b8e54691669b295"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1688 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:6483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb089b9f158f8b65b7d8c13136032743f6668342304cd353288b4c3203c96ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2065 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:3079 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55c49f6ad1699a0eb89f19bef0aebcbf93c4c0be67fdcc047ab0ddbc4b62ac2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2247 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2271 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2283 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2317 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a20ecb7175975a2113d3acd1cdf88c6f70acd4c068280947699d5fd49dc4883"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/TreeItem.vue:467 \u00B7 apps/desktop/src/lib/sidebar/treeNodeIcon.ts:164 \u2014 the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e576bf3a8efb1fa5e13e0e49e1438944f1965260f9c097206284f35e146db78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:2395 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:3933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbcb1a26c44ed07ef9352e9dcf79f5d8cdbfeeaa691b461bbd7796f3090bcb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6710 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6823 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6710}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51521e6a125ea2af350e5bc227a60958598c18764c78edd69a7bdc8c1cfb133"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:4208 \u00B7 apps/desktop/src/composables/useDataGridTableMetadataLoaders.ts:214 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4208}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a16d5ff0bdc95acc0df48ea0df2b36dc68124c82a199f123726f57a630104e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/components/ui/PasswordInput.vue:26 \u00B7 apps/desktop/src/components/ui/PasswordTextarea.vue:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/PasswordInput.vue"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25abfa28369552a166311a3997200bfa2862e0bd54804d8099816c423739aa5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/components/ui/dropdown-menu/DropdownMenuCheckboxItem.vue:11 \u00B7 apps/desktop/src/components/ui/dropdown-menu/DropdownMenuRadioItem.vue:11 \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":"apps/desktop/src/components/ui/dropdown-menu/DropdownMenuCheckboxItem.vue"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ba3128e6afe9438068d995cd26a119ca5ea72e721755ba5be2221c6a49f8c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridActions.ts:436 \u00B7 apps/desktop/src/composables/useDataGridActions.ts:489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd08e06111ad557f256052faccc11ff4c4bf7eb4216917d25725e76712e5e58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridColumnLayout.ts:340 \u00B7 apps/desktop/src/composables/useDataGridColumnLayout.ts:357 \u2014 the two spans are one implementation copied and then locally edited \u2014 127 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"99525737157554eef8520bd4f73a8c7a36aad9ad985736f9e8699aeb4cc3d1d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridEditor.ts:1463 \u00B7 apps/desktop/src/composables/useDataGridEditor.ts:1715 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c0608f838dcde2cee24bb4c33f06354b0f12069e6c9905f51d9e4d5f7a3e25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExport.ts:465 \u00B7 apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:500 \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"858fe7de2e3d4f57f5c412450fa0ffdc2567196d3854e0a05f429fa020c6b855"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExport.ts:1715 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1768 \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac42be809a58711215c4e0642d7c5ea19a237b01ab3b1e701c32d2377d245c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExtractor.ts:238 \u00B7 apps/desktop/src/composables/useDataGridExtractor.ts:255 \u2014 the two spans are one implementation copied and then locally edited \u2014 184 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f66040f39fbb1b5b572b61e03cd8856092e43bd7b68ef2894c75001d33d158"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/composables/useDragSort.ts:158 \u00B7 apps/desktop/src/composables/useDragSort.ts:194 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDragSort.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e671de7cafacf25744bf099eea10dcc84046dd43bf7e0075f4b10a100588dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/composables/useSaveSqlFolderSelection.ts:50 \u00B7 apps/desktop/src/composables/useSaveSqlFolderSelection.ts:74 \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":"apps/desktop/src/composables/useSaveSqlFolderSelection.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"36044bcb3b34e0a6ca019188717c2e94d4f190912958dfac8cc9b802b5f840d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarDataOpenRuntime.ts:193 \u00B7 apps/desktop/src/stores/queryStore.ts:2039 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDataOpenRuntime.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f492a41e8634235b1955b3782372d3aa3abf25f896b1e6a402319fd8208ea5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:266 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:1220 \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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2105faa9bf77d1ca4417957de60c646da5f6860962586dd5bf48cb167799f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:478 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c0574bddff6b031c98cd9e997876e5ad9f16d3c22b3503491f809551331e14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4221 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4084 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2da8d978736e4043e1eadc61c4acc88256d6a44cd344a62baf1bf0ce7987ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4285 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4135 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad38aed323d2444f20c46ccf5c8aca24d2f6c9a030b0c443002a050b111a0785"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): apps/desktop/src/lib/backend/tauri.ts:2852 \u00B7 apps/desktop/src/lib/backend/tauri.ts:2883 \u00B7 apps/desktop/src/lib/backend/tauri.ts:2911 \u2014 all 3 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":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"864756877b4dbc551bcd4951d0ea9d926972f595991220d072bed7e326f4040a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts:36 \u00B7 apps/desktop/src/lib/cloudSync/snippetAutoUploadConfig.ts:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb2b3e697c59877afc7bff2255efcc98a7902a225d873b9fa56de8ca2209409"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/lib/common/safeJsonFormat.ts:445 \u00B7 apps/desktop/src/lib/dataGrid/dataGridDetail.ts:236 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7f9f96d68276e0f109f20340ce7154e5ba5c149c2607b3af4d82429405d07c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/connection/cassandraTlsOptions.ts:12 \u00B7 apps/desktop/src/lib/connection/kafkaTlsOptions.ts:7 \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":"apps/desktop/src/lib/connection/cassandraTlsOptions.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b446f03f4b5c2bbe38f7f61462854fd98753b4700b76fc8c5cc938573455bde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionConfigTransfer.ts:79 \u00B7 apps/desktop/src/lib/connection/connectionConfigTransfer.ts:95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionConfigTransfer.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d99dbbc7b42bbdee99a9c0070e3584bd5e11d89383235a204dd6d7920d2100f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/cqlLiteralJson.ts:77 \u00B7 apps/desktop/src/lib/dataGrid/cqlLiteralJson.ts:94 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cqlLiteralJson.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac62ff9c294d606f42a01477edb4a15af7c649df0fb1a1505ffe13a40b426ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGenerate.ts:280 \u00B7 apps/desktop/src/lib/table/tableStructureEditorState.ts:1054 \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":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9144f1dccd64aa261a8201d7a99cc8d11ff590ac08dbc47999f5f9a8172193c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridConditionHistory.ts:56 \u00B7 apps/desktop/src/lib/dataGrid/dataGridConditionHistory.ts:68 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridConditionHistory.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b8e21b353efa170dc8e8259d127c5a6fbfe35ad833c81f26ee571310a8f7b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/document/gridfsFiles.ts:98 \u00B7 apps/desktop/src/lib/export/xlsxExport.ts:35 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/document/gridfsFiles.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e748a2514e3a6888540ea74614fb7ca304fe13c5c4335e796daa4072cd0e17d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/lib/editor/codemirrorShellLineCommentHighlight.ts:55 \u00B7 apps/desktop/src/lib/editor/codemirrorShowWhitespace.ts:53 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorShellLineCommentHighlight.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e149c23f657376204c11903fefcca451cba37cae712cdf079d5a49a324c287"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/lib/editor/queryEditorParenthesisMouseSelection.ts:48 \u00B7 apps/desktop/src/lib/editor/queryEditorStringMouseSelection.ts:55 \u2014 the two spans are one implementation copied and then locally edited \u2014 142 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":"apps/desktop/src/lib/editor/queryEditorParenthesisMouseSelection.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"effbf1f58852e0388801d4228b7556f6196627f430e0240654dfd27e94ed5e12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/metadata/tableMetadataCache.ts:275 \u00B7 apps/desktop/src/lib/metadata/tableMetadataCache.ts:415 \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":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c105f1fb7c27d9e0c8914aedfae7fe4f655e739ab415eaac9acc9e98de2b8f7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/model/modelRendererRegistry.ts:67 \u00B7 apps/desktop/src/lib/model/modelRendererRegistry.ts:79 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/model/modelRendererRegistry.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f2fbbdb8f358c349eddbda40b9025a7be476c11a8a00bee49fed14302ced5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:2131 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:2180 \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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfac495600b082f192a0cdf1cbc4d7894d0baa63c193fe157f070e8c64addfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/mq/rocketmqTraceUtils.ts:95 \u00B7 apps/desktop/src/lib/mq/rocketmqTraceUtils.ts:129 \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":"apps/desktop/src/lib/mq/rocketmqTraceUtils.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abe6a40449b4e584cf6db1abe180ced5ac22dcaadde0630155a6d6a57a40f66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/mq/thriftBinary.ts:278 \u00B7 apps/desktop/src/lib/mq/thriftBinary.ts:301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/thriftBinary.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b2163779ddf413dce687400f702972da776102f898d32bb731913a4b1fdb90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/plugins/pluginHostBridge.ts:1738 \u00B7 apps/desktop/src/lib/plugins/pluginHostBridge.ts:1766 \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":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"737867ba019493e63fe49d5b878861069dda72c1ecb76435305e926abd3de771"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/lib/redis/codec/pickle.ts:626 \u00B7 apps/desktop/src/lib/redis/redisValuePresentation.ts:928 \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":"apps/desktop/src/lib/redis/codec/pickle.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"9473422d0c3e8f9eeac2e29dc7a167cc0861bb4512e0e66c48841cfcbbab46fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/lib/schema/oracleRoutineDeploy.ts:177 \u00B7 apps/desktop/src/lib/schema/oracleRoutineDeploy.ts:199 \u2014 the two spans are one implementation copied and then locally edited \u2014 148 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9873677489346800ca7502bc6f8f654af5a8f2851650b66ae93a496071366f13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarLayout.ts:77 \u00B7 apps/desktop/src/lib/sidebar/sidebarLayout.ts:117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"252e2227005f2a7919e7b60b11d9efd58af91563a40a4d3677699bc8dbc3a123"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarSearchTree.ts:34 \u00B7 apps/desktop/src/lib/sidebar/sidebarTableSearchControl.ts:30 \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":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9862b513f5cecfa0021541957e6cbc22a1235c7fb5f255584f64a29d2d359b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlAnalysis.ts:810 \u00B7 apps/desktop/src/lib/sql/sqlNavigation.ts:327 \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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c6b4170a231345b2f3ea5560776c47d35790746fed50b42a0dbff15c782e5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlAnalysis.ts:907 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:2721 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdcedcd2349a73bc34d65ff8fd23879677e87fc4fe83c6fb23be06adaff598d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:3382 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:3399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3382}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ee665a8c9f33ea6ef24bc3104114758d23d8e4a4fd344641f7372269c6469f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:1527 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f923f92a738f08c253744e9531b716b5d113c9310482af9a9eed42396e1bcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlVariables.ts:197 \u00B7 apps/desktop/src/lib/sql/sqlVariables.ts:208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba49ba29fef34d99b48adb042a1bb0738e503c8dbdec2bd98df4dfe738535e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/table/oraclePackageSaveAs.ts:205 \u00B7 apps/desktop/src/lib/table/oraclePackageSaveAs.ts:219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86ac65e96f09e26fa30e37834115bcf31e72093ada514be9f21d1adfd778464"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleRoutineRename.ts:458 \u00B7 apps/desktop/src/lib/table/oracleTableRename.ts:490 \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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0681029ecfbe159ee443d593a061ae991c4e1248dc6464a966225098f6acef98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleTableRename.ts:135 \u00B7 apps/desktop/src/lib/table/oracleViewRename.ts:94 \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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d12f5570fd0ccb55cec741263b23010bf189171a0fcd1f75fcc95856389bd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/lib/table/tableStructureEditorState.ts:919 \u00B7 apps/desktop/src/lib/table/tableStructureEditorState.ts:930 \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":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"c498a4fe55de766fcd780da22457ef03a3e31ac191ad3c40052df3c44015623e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:8072 \u00B7 apps/desktop/src/stores/connectionStore.ts:8115 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8072}}}],"partialFingerprints":{"codehealthFindingId/v1":"2140a61645e41c65e301ef78a11b0a3b5bb51a5d357a241b3945a166f46e856c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:10094 \u00B7 apps/desktop/src/stores/connectionStore.ts:10107 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10094}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f78865ad016ccc902a8bb9245235d81320d3d6a2da5669b1ca009d59e5df9ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7 locations): apps/desktop/src/stores/queryStore.ts:4102 \u00B7 apps/desktop/src/stores/queryStore.ts:4125 \u00B7 apps/desktop/src/stores/queryStore.ts:4148 \u00B7 apps/desktop/src/stores/queryStore.ts:4231 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4102}}}],"partialFingerprints":{"codehealthFindingId/v1":"88153a0b95122a811fe47d4fda828dc18a5017692446127051ce0d6f9c0414ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:4974 \u00B7 apps/desktop/src/stores/queryStore.ts:4987 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4974}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd56f169e2ceeba50c78a8d7c23543a40d165c7e414b99c0077520959448b2b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/App.vue:960 \u00B7 apps/desktop/src/App.vue:972 \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":"apps/desktop/src/App.vue"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf2177d64fa8379eaa5d82c3385604fba5a1741d53a5def614cb5e07a042c49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/App.vue:4203 \u00B7 apps/desktop/src/App.vue:4230 \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":"apps/desktop/src/App.vue"},"region":{"startLine":4203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7645523f544b866fb6284178017e312cf23c8938908e12cdbe4bd70b052019"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/App.vue:5093 \u00B7 apps/desktop/src/App.vue:5105 \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":"apps/desktop/src/App.vue"},"region":{"startLine":5093}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da5ddf5599ca54d14d6802117262bc55ef0035e69baabfb60ba5965f7805c22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/App.vue:2718 \u00B7 apps/desktop/src/components/editor/QueryEditor.vue:1947 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 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":"apps/desktop/src/App.vue"},"region":{"startLine":2718}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5d6ef9fac0546ca4dba83433505cb9715cf389bea7a0716bceb778c034cc2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/App.vue:3624 \u00B7 apps/desktop/src/lib/editor/hoverTableLookup.ts:58 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"apps/desktop/src/App.vue"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b517d3906a5cf58ef181df21f249367dc27cb01c67ab45a30bbcb016006d91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/components/admin/DatabaseJobAdmin.vue:374 \u00B7 apps/desktop/src/components/admin/DatabaseJobAdmin.vue:430 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe17bf351270c512afa0598a95e755f709719925816db810e44b166334bf59ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/common/TextContentSearchBar.vue:115 \u00B7 apps/desktop/src/components/editor/TableStructurePeekDialog.vue:221 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/TextContentSearchBar.vue"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6ee8915e9fa6b65d76630e76a6417933ecd7fb64a5f52e66afcf4368d21e5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/common/VirtualScrollArea.vue:13 \u00B7 apps/desktop/src/composables/useDataGridSelection.ts:53 \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":"apps/desktop/src/components/common/VirtualScrollArea.vue"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b856cdc79630e450a1044793d222646e7d36414764311d7c62111424ba1dbed1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:1426 \u00B7 apps/desktop/src/components/config/DriverStoreDialog.vue:1437 \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":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d5dfbace119ad565e2fb3a624d6f61d582feee7ca4e9009dc4166670d6b6a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:582 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:631 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:645 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"491c9ecd14fe8f948e4372595f40c50616eb281521780984a1926f22da21505d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:1087 \u00B7 apps/desktop/src/components/redis/RedisKeyBrowser.vue:232 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"b686ccfb4b4d5410c1ed0b03f4388477ae9def546ee30265bdb49b55686f9690"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:1979 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:2013 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71732cf37c162533e24d83752c9d5ab08fb8d8095ca3a241bd2e5260951d49f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:4127 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:4194 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4127}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d3db5c4bcbdfcc6a3cd3bde858d99a7736a5d005166ef97b868fa67b599400"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:6251 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:6289 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6251}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ce619e6e33105c8d35fc045f3d1a7b7128e8745e723c22796cba9e1d2b21c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:6476 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:6508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6476}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c306569ac4e848289f7b6bb25c7bbefee53f22b77f02b2f2bba3ad8cf685e1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulHealth.vue:37 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:28 \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":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45b9e377de505f6d9caf72416e003d95696bf7bfc97c62d2a707835a980e801"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulHealth.vue:375 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:600 \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":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"9648a1db7d3228fb2d72d2b26091b2c108b508f780ec4210b3fc4a8f812c9be9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): apps/desktop/src/components/consul/ConsulKeyBrowser.vue:509 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:521 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:538 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:552 \u2014 the 4 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":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57d1119f58fc1786bf93d21e241fa3fcb674557263703bf6dd6d4525760efd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:63 \u00B7 apps/desktop/src/components/generate/DataGenerateDialog.vue:28 \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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"326df1fda249f94cabf5292fd2e4ff8689052a60d5c04e0ca4434aecc5305fb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:726 \u00B7 apps/desktop/src/components/transfer/DataTransferDialog.vue:576 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31bc816a35b3b07f1d85ca918214526c14f3bc24d4844213dca0fd199b5e3da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:1191 \u00B7 apps/desktop/src/components/diff/DataCompareDialog.vue:1205 \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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20a84b71837e3167a22636c7fd96c01083b90ad7a10fb28f5fb4524f5f24734"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:1214 \u00B7 apps/desktop/src/components/diff/DataCompareDialog.vue:1225 \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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb90346ea4a2ba9b3d387efa6add0ee59027d7bffd7b17da6683f9851708ef2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/document/DamengDumpDialog.vue:158 \u00B7 apps/desktop/src/components/document/MongoDatabaseDumpDialog.vue:279 \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":"apps/desktop/src/components/document/DamengDumpDialog.vue"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5c08eea3f416db0cec10332f813f64900a776f6e35be5baf3955da97fc5d36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/document/MongoGridFsBrowser.vue:163 \u00B7 apps/desktop/src/components/document/MongoGridFsBrowser.vue:180 \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":"apps/desktop/src/components/document/MongoGridFsBrowser.vue"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e3f8c293d13b50dfd5f62c7ef581e7882b095f58593e06fb47b01d40afe66d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/components/dolt/DoltCellDiffDialog.vue:42 \u00B7 apps/desktop/src/components/grid/DataGridValueDiffDialog.vue:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/components/dolt/DoltCellDiffDialog.vue"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"db39e7eaf18cf73c5dd652820c1ba9f8664007a610f84daecca493d1a20b2395"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/components/dolt/DoltDiffPagination.vue:15 \u00B7 apps/desktop/src/components/mq/shared/MqListPagination.vue:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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":"apps/desktop/src/components/dolt/DoltDiffPagination.vue"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d107409960869459443e6f4791e75d50d8065992ce743d964979bdc849d806"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/dolt/DoltVersionControl.vue:1235 \u00B7 apps/desktop/src/components/nacos/NacosConfigDiffDialog.vue:116 \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":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"681bd446908affd656f70c44c09a7cc7d7c9f9208ee66975fe89d085b93d9c53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:3431 \u00B7 apps/desktop/src/components/editor/AiAssistant.vue:3444 \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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":3431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87885736ce433732e7cdddccd6319fd6071d2be00d416df43cb20f6a1cd74df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:6317 \u00B7 apps/desktop/src/components/mqtt/MqttPublishDialog.vue:164 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e5af79ae6e5e15a23efea6f89e47e819c41c5dcad06a715851e92c17230ee7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:6499 \u00B7 apps/desktop/src/components/mqtt/MqttPublishDialog.vue:209 \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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5e60ab6acdc40cc72f76eafa2cc875c825896a333c34d87fa5a16cb007de2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:2086 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:2200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66426211908d6884870721863851bd0f9ad4eacd3bc162e81049b3066613835"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:5810 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:6509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":5810}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48080430c1932f84ecfb4b7cc1b7ec2ebf752cf402e90637ac5abbf8c1e9a3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:6573 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:6593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":6573}}}],"partialFingerprints":{"codehealthFindingId/v1":"4475180d83a81692849d919348dd29e8571d2ef860bc3800f075550ed13019bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:8158 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:8204 \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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":8158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19ebe877c3876294f4d23b01e75d9a692a761fb21aaabf58cfb8efaa6a2b695"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/editor/queryEditorSqlExtensions.ts:143 \u00B7 apps/desktop/src/components/editor/queryEditorSqlExtensions.ts:200 \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":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3817fbcc943b77727f1816f2551c4affb59b0cc7b9ed62fcbafc200946440f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdAccessControl.vue:32 \u00B7 apps/desktop/src/composables/useDialogSources.ts:14 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c0db62085698403fb4059facb7b4deb9dd261dc591a3d07b8095ebac3ffa04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/components/explain/ExplainPlanViewer.vue:163 \u00B7 apps/desktop/src/components/layout/QueryMessagesView.vue:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"apps/desktop/src/components/explain/ExplainPlanViewer.vue"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ae22e80090a0195a9f9a4972675855fe6c8382b1f77896fd6c6df572bdf798"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/ProductNameParams.vue:28 \u00B7 apps/desktop/src/components/generate/params/WeightUnitParams.vue:19 \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":"apps/desktop/src/components/generate/params/ProductNameParams.vue"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f71bbe35fd7e23997005e750116cbad0487307723ed032ee1078d8629e711f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:3334 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:2783 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":3334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e97fe06d48ec26d09fd5e2d286f97ec655c64659b8f2063fb33f8f01c398b99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:3542 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:3553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":3542}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c59b7ca404b00d90be48b0dcde14c43f70d9f0a4216e869609893574a0ef6c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:11047 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:11088 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11047}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4c8efe458fd53e32d1c7218aadf04c94c7b8adaf2d5d8f0e0596625a4e6bec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:13694 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:454 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":13694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca0e8f3b30e51e10e4da8310db84429aeafaaaa4a2d452ac6b9ce2dd3fb944f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:14023 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:1951 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14023}}}],"partialFingerprints":{"codehealthFindingId/v1":"643e78224cba57d6128a57916b79112c60a80d4ce322162206370ec4f9f23e10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridCellDetailTextPreview.vue:40 \u00B7 apps/desktop/src/components/grid/DataGridValueTransform.vue:124 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridCellDetailTextPreview.vue"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d945642febdf3a8e526bf1dde63225cb577ace6c2357ff4d3496127d6d5963d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridConditionEditor.vue:296 \u00B7 apps/desktop/src/components/grid/DataGridConditionEditor.vue:309 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridConditionEditor.vue"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"647fa50f729fa16f981cbb0ce8242c651ac1137fab4c4e22fb8be83b3c9545a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridFilterBuilder.vue:355 \u00B7 apps/desktop/src/components/grid/DataGridFilterBuilder.vue:366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridFilterBuilder.vue"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"da45fa64fb184ff415b3e940ff4285c0542ffcea2c344ec87d62ee5598901378"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:885 \u00B7 apps/desktop/src/components/transfer/TransferTaskTree.vue:137 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b22f453a81a5f18b4a390ef08e08883fc9112b2e0a394537a5f90c07fb58442"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/layout/UpdateDialog.vue:249 \u00B7 apps/desktop/src/components/settings/ChangelogPanel.vue:89 \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":"apps/desktop/src/components/layout/UpdateDialog.vue"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f508d8297cd4dfd4af3b695736b6c727c9cc2845398d28f2472e858329c840a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue:423 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue:445 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"276c1485244b6e205d182030bfd3551a5965711c2aa586b16f3e02820a0104e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/meilisearch/MeilisearchMultiSelect.vue:32 \u00B7 apps/desktop/src/components/nacos/NacosNamespaceMultiSelect.vue:51 \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":"apps/desktop/src/components/meilisearch/MeilisearchMultiSelect.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01858e344271dfe2c3119e1e0c662574150a21228cbef70ea13df491b3e4343"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/mq/ExchangesPanel.vue:94 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqClientsPanel.vue:50 \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":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cddd9773405db38776a1b5943fdf2ccfed05f8a899274fceef234448b34740f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/mq/NamespacesPanel.vue:40 \u00B7 apps/desktop/src/components/mq/TopicsPanel.vue:252 \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":"apps/desktop/src/components/mq/NamespacesPanel.vue"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"941d819580d5e8c59f0dc788905b311623b16004c90ce382bd4df421e8284359"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue:242 \u00B7 apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue:264 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d33d50c4a0570d6240c027443e3279a97242943ae7fdaaaa4726e4b5c36958b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAccessControl.vue:119 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:272 \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":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5a715d169fe3b4e8317fde4b7debe2f2956092be5f18d48f35fc843755ffab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:1319 \u00B7 apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue:260 \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":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36a2edf34864b02b1e9b2c7e5608dbbeafc36548390097b2894e54aacaa6d68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/objects/DdlViewDialog.vue:402 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:482 \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":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8645bfcbe59259a9909b4d2399fba22155c20b2c7daffa1d3c3a436e80cc0945"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:1521 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:1533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7819ce2f3ee35d342cbbcadb068df672665a9b5f98814fc849e7e85725c5a14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:2045 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:2108 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"af35980508e0d431c94293f9e542fa7d3d7660ca2add0a94f7dd58de95457806"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:2874 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4591 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dd5b4f0e9bae5761b1e3d65ba86b71effb6d11c9a5405a54c258a639a302ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3012 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4375 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"7973868ab084c6cfb4389933ffe477e1b666fae95f715e5ee60ac51943ef1bb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3100 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4472 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3fb166b9209a2994810f50aaf6961932e0c0da0b6c9a32593f31f95cd4c625"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3342 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:3789 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8247724d593debaabc8f0612e86452c37e727527355e28721ea67ffc8e3372"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3996 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:4069 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3996}}}],"partialFingerprints":{"codehealthFindingId/v1":"8541209eea1b442c65f1d70712025a08bbb8cd5db58802eab4581a681926624e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/objects/OracleTypeManagementDialog.vue:137 \u00B7 apps/desktop/src/components/objects/OracleTypeManagementDialog.vue:189 \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":"apps/desktop/src/components/objects/OracleTypeManagementDialog.vue"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a495aeb010c43cbaabf8224d8b9f47f111c68c94a2fb1060522f11fbc0809109"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginContributionsPanel.vue:990 \u00B7 apps/desktop/src/components/plugins/PluginContributionsPanel.vue:1003 \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":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d55a9e2f21b835047dd75bea5c2dd8d70aaaeebcad63b2312089d84365d71f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginWorkbenchHost.vue:346 \u00B7 apps/desktop/src/components/plugins/PluginWorkbenchHost.vue:376 \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":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca7595570fc3b66b3a97d8b9612720418faf498d53f1fd4b5b81b9fa44c1c08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:2537 \u00B7 apps/desktop/src/components/redis/RedisKeyBrowser.vue:2583 \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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c727cd5ca103b4794f90bde626b51c377033a9096cb8213a99891c3036df20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisPubSubPanel.vue:135 \u00B7 apps/desktop/src/components/redis/RedisPubSubPanel.vue:146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisPubSubPanel.vue"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"963505333b5a305e27b367c3ecfe8347432c92fd4f3419266f9f777be200757e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/ConnectionTree.vue:3001 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1676 \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":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":3001}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf752ea435d0e66d9fe3d970896500144182405d7b6a997f5ca391b866a60fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2549 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2669 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2715 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec873c2a1e11c83546d549b963cb557355de8b8128406bb107ecb23ae7cdf0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2561 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2680 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2726 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31b9b01def95d7194713c2a46b7d7ba55ec6e95ef1e636f6029507a2e317bd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8020 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8541 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":8020}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3c018e500c24142e31b9bdeed194d6783a8441bd1a52dce060294d6e8dc281"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue:22 \u00B7 apps/desktop/src/components/sidebar/VisibleNacosNamespacesDialog.vue:13 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efa13dc2d1b8c81b96addc0324b3db1ed0c97d97bc5f1b343597977fc163e91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:3655 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:3710 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3655}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17d4c963c25445f58690ede6429774e68744a728355f208c81ef2254b8df066"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:4017 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:8237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4017}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1d31b7ee1ac13035aa57121386f543f50772e6b36cfbce193527a996c14480"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/composables/useAiModelCatalog.ts:132 \u00B7 apps/desktop/src/composables/useAiModelCatalog.ts:169 \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":"apps/desktop/src/composables/useAiModelCatalog.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a53570159cde2d96e7febfe74b865848a91f7bff9b7d97d4e8e436e5b796fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/composables/useAppUpdater.ts:624 \u00B7 apps/desktop/src/composables/useAppUpdater.ts:646 \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":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"465c4d3ffa0eaae6f6262b06f15b0ea136aaeade0bc63b4fceba3d7124d7d341"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/composables/useDataCompareSession.ts:445 \u00B7 apps/desktop/src/composables/useDataGenerateSession.ts:330 \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":"apps/desktop/src/composables/useDataCompareSession.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc31cc6bd620a1fb546cb91f444bffd697224b5fba190d51f7aec420221af85f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridLargeValues.ts:708 \u00B7 apps/desktop/src/composables/useDataGridLargeValues.ts:762 \u2014 the two spans are one implementation copied and then locally edited \u2014 142 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"50110c771ea71265a630ec1905c5d8f9ebe60f2e7d3483c70710ec9fd34a469f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridSelection.ts:471 \u00B7 apps/desktop/src/composables/useDataGridSelection.ts:592 \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":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fa27d6543fd477757c62dd0e8cbf7f052679d658ac12a474cf38af1a9f23fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/composables/useDialogSources.ts:172 \u00B7 apps/desktop/src/composables/useDialogSources.ts:362 \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":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"691ca13a3e903988ac852692d2bad3de915a87b22ca982a0f7df293d1520e708"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:1230 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:1263 \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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c681b5a288ba9afe6fa0bb7747dffebd8d4ad053096607deb1da0cc493d0c65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:469 \u00B7 apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:669 \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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8fd5aedde48d7d9e61a0d25e8e6ad307ac0496ce618690342304089ee211f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:804 \u00B7 apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:883 \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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a4f23db725468e743745e2cbd036651f50c1abdf8399565d05f09164c8373b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/ai/ai.ts:504 \u00B7 apps/desktop/src/lib/ai/ai.ts:585 \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":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a3ee5e9cfd467feeeb9b71c997003d7c6913257e5de593a67e777e6ca26992"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:1421 \u00B7 apps/desktop/src/lib/backend/tauri.ts:2048 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bc183c2b71c3ab6aa52c812c08ee7112191a5ccbe1c109b0e6a269d3cfff8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:1864 \u00B7 apps/desktop/src/lib/backend/http.ts:1885 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"c329e6316597d45f39e7d48d1ab060e3b808cc0496d73d7c5bee442731a55ded"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:3823 \u00B7 apps/desktop/src/lib/backend/http.ts:3962 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3823}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c68347a6cb66c42eb7d565e2ecd68c09e3d7dcce0f5e4664e0d48bb76a748a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5159 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5031 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0b2e1ed481b98fa0249698cbbe3b3ff06bdd19fa7fa6928213fe756a8c7367"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/lib/common/jsonCopyValue.ts:1 \u00B7 apps/desktop/src/lib/common/safeJsonFormat.ts:445 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/jsonCopyValue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccde67876fa9ed1bbe9b56d16b8758710f6ebf2c8b5c42e0808866286d1fc11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/lib/common/jsonCopyValue.ts:1 \u00B7 apps/desktop/src/lib/dataGrid/dataGridDetail.ts:236 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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":"apps/desktop/src/lib/common/jsonCopyValue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1a81a3941ccc42563dd834e5e1c2afb2e678664fdf811cbeed5539086eb92d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionPresentation.ts:21 \u00B7 apps/desktop/src/lib/connection/connectionPresentation.ts:91 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionPresentation.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91fbab227efaae57cfb8b2aeb9b3294fc6afc7bba85c481086b8ade92ec9ec8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/connection/sqlServerLegacyCompatibility.ts:43 \u00B7 apps/desktop/src/lib/table/tableStructureEditorState.ts:1023 \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":"apps/desktop/src/lib/connection/sqlServerLegacyCompatibility.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de65d1e0b92b237fe7adcf15bde87a343c793e2b581b1ee91ca6e9487845efb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts:212 \u00B7 apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts:242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb08154f87c70fad7f7721ba741988d341a6cdfd9ce78450d7da3e60b7f9e746"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridTranspose.ts:270 \u00B7 apps/desktop/src/lib/dataGrid/dataGridTranspose.ts:289 \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":"apps/desktop/src/lib/dataGrid/dataGridTranspose.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"936cb0ed72a8fc3d8e7901b36a8e125baf47395d7d394909a26f08c2cf418b5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/database/jdbcDialect.ts:216 \u00B7 apps/desktop/src/lib/database/jdbcDialect.ts:437 \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":"apps/desktop/src/lib/database/jdbcDialect.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51ed3cf70e2e81522ed5b8c5d2aa593163c2981d726a219bccebcc338902088"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/lib/database/jdbcDialect.ts:327 \u00B7 apps/desktop/src/lib/database/jdbcDialect.ts:389 \u2014 the two spans are one implementation copied and then locally edited \u2014 130 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/jdbcDialect.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9fa372c8daeaf1c232e403312050347cb31fca6e4b648f730477025a308770"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleConstraints.ts:528 \u00B7 apps/desktop/src/lib/database/oracleConstraints.ts:550 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8cf0d113498824a37d8cb20f999e414252841218e6866ad26cce4bd6be9053"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleSessionManagement.ts:88 \u00B7 apps/desktop/src/lib/database/oracleSessionManagement.ts:167 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionManagement.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"736db42808ee2f4be5d39cbba0c66514454f1883666437d6330593e957c00328"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/document/gridfsFiles.ts:130 \u00B7 apps/desktop/src/lib/export/xlsxExport.ts:306 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/document/gridfsFiles.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc23a4c667abab115ee6f665f0608bdcb804478a123e3f08dde0c6d7716c0c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/dolt/doltVersionControl.ts:154 \u00B7 apps/desktop/src/lib/dolt/doltVersionControl.ts:179 \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":"apps/desktop/src/lib/dolt/doltVersionControl.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b4f9301f7b8b4c364d5149d4c75df8a0e9a5fae1f664b4b1716f0eb174ac1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/lib/editor/codemirrorExternalSearchHighlights.ts:28 \u00B7 apps/desktop/src/lib/editor/codemirrorSqlUnknownObjectHighlights.ts:58 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorExternalSearchHighlights.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa29f87be53cf70916a534e38d3c49fec55bb4322a6f8b8f27ab675f8556677"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/editor/sqlIntentionActions.ts:301 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:2471 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffcabc8a9a75c28afe2a14cfd3e62473368dc08c6fceb33cd9a2b500074dd9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts:179 \u00B7 apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts:190 \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":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bf71add020e3d00e09ebb417b09e2520d9495e6fc7f975e2a9dad7d1bce8cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/lib/imports/navicatImport.ts:72 \u00B7 apps/desktop/src/lib/mqtt/mqttPayloadCodec.ts:150 \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":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bb463ddd3ad310c802ac13419bed75f49528465c286d092b28adfe6489b9f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:388 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeac9a449b8ec96ce105f664212e585c804ed76794fdebeb2b863caa6f02f5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/plugins/pluginAiRecommendations.ts:12 \u00B7 plugins/sdk/dev-host/server.mjs:34 \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":"apps/desktop/src/lib/plugins/pluginAiRecommendations.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2def7e4d347daabe6d0fe930d3efe64ed7cee025b0516424ad507dc00924604"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/plugins/pluginCommandPalette.ts:70 \u00B7 apps/desktop/src/lib/plugins/pluginCommandRegistry.ts:139 \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":"apps/desktop/src/lib/plugins/pluginCommandPalette.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47e9c6d8690d885f6eaf9df650943937a398d29a5333e48050acb733302105e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/redis/codec/javaSerialized.ts:479 \u00B7 apps/desktop/src/lib/redis/codec/javaSerialized.ts:497 \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":"apps/desktop/src/lib/redis/codec/javaSerialized.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8388b5230fa97c3a50aa228e49630d81e41c30b7d99cd23c4acbc5b6691a91a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/redis/codec/pickle.ts:144 \u00B7 apps/desktop/src/lib/redis/codec/pickle.ts:289 \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":"apps/desktop/src/lib/redis/codec/pickle.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2825353832eedf3d0f8d48cd2bdba6a24fa4b05ca761a2fb09b94d9d508dfbff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarConnectionConnect.ts:7 \u00B7 apps/desktop/src/lib/sidebar/sidebarConnectionDisconnect.ts:7 \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":"apps/desktop/src/lib/sidebar/sidebarConnectionConnect.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26b509cc49084cf2185b18ec5e04cc306e654d6cdb105bf677e90bf7eac526f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/lib/soql/soqlCompletion.ts:334 \u00B7 apps/desktop/src/lib/soql/soqlCompletion.ts:350 \u2014 the two spans are one implementation copied and then locally edited \u2014 126 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/soql/soqlCompletion.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99a9c918c4bbf4f8dd535ee889a021593e2d73ad97a9b53656cd191d4bdcd66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/sql/ddlDisplay.ts:282 \u00B7 apps/desktop/src/lib/sql/ddlDisplay.ts:371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7019851e3852c04ea43c2730fe8ce6140166fdb7d21a97e7795646237733588c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/ddlStorage.ts:91 \u00B7 apps/desktop/src/lib/sql/ddlStorage.ts:216 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a6b9308b8156aae2f8dd60dceaf6076679bb9bee7e14ca329a8266d3629c15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts:190 \u00B7 apps/desktop/src/lib/sql/sqlFormatter.ts:393 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0fd5c80a927fef9a49da5b2fb8262ef6c9d71c559a794c330908098db6f9f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/completion.ts:301 \u00B7 apps/desktop/src/lib/sql/semantic/model.ts:904 \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":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1aa25558519433623d34dc920eda2eac0e62c031ad65465b42c6fc02fcf568"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleRoutineRename.ts:201 \u00B7 apps/desktop/src/lib/table/oracleTableRename.ts:449 \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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce9801c681b4ae18c0139888d169950b0d078c698c3c16d4953beafd2e9374c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/lib/tabs/tabResultCache.ts:642 \u00B7 apps/desktop/src/lib/tabs/tabResultCache.ts:674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c7d838af29a819e7b0748ee1eee79e3f0d90548ffad072026c3ba24e44ab15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): apps/desktop/src/stores/connectionStore.ts:6904 \u00B7 apps/desktop/src/stores/connectionStore.ts:6944 \u00B7 apps/desktop/src/stores/connectionStore.ts:6999 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6904}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0daae3623c533a2aff681eaf372e771c609f280b86d799fc1788fc61f2a75c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/stores/plDebugStore.ts:382 \u00B7 apps/desktop/src/stores/plDebugStore.ts:963 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"7648e7fa5f17e69757f1fa52d19a8b0ee1b1df196a3d148221e0f6ca9c8f0560"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/stores/plDebugStore.ts:1332 \u00B7 apps/desktop/src/stores/plDebugStore.ts:1753 \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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a03ae7610972d993b4f2e67a0a180b5e2988b508c8b52457685f5a04bce99eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 12 locations): apps/desktop/src/stores/queryStore.ts:4090 \u00B7 apps/desktop/src/stores/queryStore.ts:4113 \u00B7 apps/desktop/src/stores/queryStore.ts:4136 \u00B7 apps/desktop/src/stores/queryStore.ts:4159 \u00B7 \u002B8 more site(s) not listed \u2014 all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4090}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3d40bbdf346054c82c0d382f0012f8093aa227850d5b6648ac330fda38b24a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): apps/desktop/src/stores/queryStore.ts:4165 \u00B7 apps/desktop/src/stores/queryStore.ts:4225 \u00B7 apps/desktop/src/stores/queryStore.ts:4248 \u00B7 apps/desktop/src/stores/queryStore.ts:4271 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c26ecf9dc647049eab9373ae08cf8cc05e2570f771f31314854e308a8e93ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:4202 \u00B7 apps/desktop/src/stores/queryStore.ts:4294 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4202}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cb7ccc3e9a3559680b168f965b0603d0fcc789a191dc5ae45fd96df75c24f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:8820 \u00B7 apps/desktop/src/stores/queryStore.ts:9293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8820}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d6be35e8f5f5b0e648664dc1f715ceeeb198b7d59167e15d50414bc98ff9ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts:175 \u00B7 agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts:184 \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":"agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9964de99e974d9f1003418e303fb63bc85638783d2362faf555c27725f5b8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/App.vue:630 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:4431 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe78ad8f75dcbbfdfb63f8eda6ffbf2e62088cf43d35cb8c9da465cbe650704"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/admin/PostgresDashboard.vue:17 \u00B7 apps/desktop/src/components/nacos/NacosDashboard.vue:32 \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":"apps/desktop/src/components/admin/PostgresDashboard.vue"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"061585e8d3eef4e3b75d0b7e3071990979b66f05d591dfd406736701d17e8f2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/config/AgentOfflineExportDialog.vue:29 \u00B7 apps/desktop/src/components/config/ConfigConnectionSelectDialog.vue:27 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/AgentOfflineExportDialog.vue"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9530eb4db46c3b4b75db66a762e79cc524268c0b3a5ec845b4acb4ccb1409b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:382 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:617 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7bb452246ddc454e8b4ec609618e44fa6b7f1b0574d009efe7f304d19b8571"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:419 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:432 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"658a4238803e9a1d2645db439a658aa37f0bb5ad026bd9b7598ecd83e29f019c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:5159 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:5171 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":5159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd55ebe138094dd4003d64fd07d99b0a1a70c96933fb9e7c9404a539d181533c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:6498 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:5258 \u00B7 apps/desktop/src/components/objects/ObjectSourceDialog.vue:281 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8822edb558393b908d9e71d08df2437eb9e08bf609adb6e0c06e184262f6a3fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:7035 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:7045 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":7035}}}],"partialFingerprints":{"codehealthFindingId/v1":"8529c62d44e5366fcbdbfaec97f4d55f9a3430ff58630f5bac2eab5be18588a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulHealth.vue:52 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:70 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7051a70f12ab6e7e736d0115e7ce686115b7e62661d0ea07ec7e42ef29b467"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): apps/desktop/src/components/consul/ConsulHealth.vue:110 \u00B7 apps/desktop/src/components/consul/ConsulKeyBrowser.vue:97 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:150 \u00B7 apps/desktop/src/components/consul/ConsulWorkspace.vue:61 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"43426c64adf803cc56bcd816a937d30a85e43db4c83ea9589b3d4ba058c20da9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulHealth.vue:123 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:289 \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":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"91235af865eb8b0cc21523286abeb425602113f1a4db2943ee2ec84a53929bcd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulTools.vue:46 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:162 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulTools.vue"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d3e14937cadd41941fa107ba5140c4999687fd2a6ea42c656a1d206077d318"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/debug/PlDebugRecoveryDialog.vue:9 \u00B7 apps/desktop/src/components/objects/OracleTypeManagementDialog.vue:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"apps/desktop/src/components/debug/PlDebugRecoveryDialog.vue"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8da4c8b7ca233cb2b25b192b6e86b38f312764bc4d7094384ad7d4bc0cef62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/diff/CompareKeyColumnsSelect.vue:42 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchMultiSelect.vue:18 \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":"apps/desktop/src/components/diff/CompareKeyColumnsSelect.vue"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56dce5b305b62a420354dfc23516a9a028d7b5403bc67fe353e009375dfcbd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:673 \u00B7 apps/desktop/src/stores/queryStore.ts:9308 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8e600b2609bd59b24d004c14d85358fdc2e4acc9dac5234d4cd7ef3ba18d08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/diff/FieldMappingDialog.vue:81 \u00B7 apps/desktop/src/stores/connectionStore.ts:11540 \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":"apps/desktop/src/components/diff/FieldMappingDialog.vue"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e26cefb972177f3d431c9bbccc85d4e234e7dfae95027f4eed342da433f9f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue:79 \u00B7 apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:147 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac33fb6be872f263fe8693b34f63f899d8047fc8e2428d2bcab113971ca7afd0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffDialog.vue:184 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:196 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf61797aff798ae0774979606d9313b4d803419bbd0cb6fd42d1c326a39d68b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:682 \u00B7 apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:844 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ddea15c7e4f48fb54b107cd11a29ad25f4bb0d0f8f29dc8103dbc92ad38c3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/dolt/DoltRevisionSelector.vue:108 \u00B7 apps/desktop/src/components/mq/shared/RocketMqTopicSelect.vue:142 \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":"apps/desktop/src/components/dolt/DoltRevisionSelector.vue"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"befbc42435e81ce64498d95465e24d6a46b23ef7a07d38b031fdefff0b547a0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:3157 \u00B7 apps/desktop/src/lib/ai/ai.ts:1249 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":3157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac34854cb1ac937be341b6da065079cba0d3c116a971f741f4db442ab4212aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:4204 \u00B7 apps/desktop/src/components/layout/UpdateDialog.vue:251 \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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":4204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ac13691c9727136f290c76d1686502f92f8d7174ab657c4a2e5d76198a1e06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorCompletion.ts:561 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:598 \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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6eab6dda4dc26b2e1f2c9df7b4470d52ccc09b0c89b9fa519f58c3fc0510d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorCompletion.ts:759 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:812 \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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3a97a3239313317dade0fa0854f8a10d56371f8128238c823fc0e9ba42e002"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorTextActions.ts:61 \u00B7 apps/desktop/src/components/editor/useQueryEditorTextActions.ts:72 \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":"apps/desktop/src/components/editor/useQueryEditorTextActions.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39abedd2c68f2f9739a68085793fc4bbea6f6b8069eb169419a3b5572a50c4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdAdminConsole.vue:297 \u00B7 apps/desktop/src/components/grid/DataGridFilterBuilder.vue:480 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"apps/desktop/src/components/etcd/EtcdAdminConsole.vue"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a3b4a2dffc6483438033be117d1ccbc2f3a8c63a510caebe53fca0be67c839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdKeyBrowser.vue:240 \u00B7 apps/desktop/src/components/etcd/EtcdKeyBrowser.vue:250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb14b02c7575c7167f11d4be94eb812dbe778aa43f7f03e0ca855fb5311070b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/export/DatabaseExportDialog.vue:174 \u00B7 apps/desktop/src/components/export/ExportProgressPopover.vue:49 \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":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1509c83310fdaeb11d8bd90f4bcb1b5e6dfa3f34c08f60ccde078578ff70e5c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/export/ExportProgressPopover.vue:201 \u00B7 apps/desktop/src/components/export/ExportProgressPopover.vue:213 \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":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf91036fb368c0dd3df97e775343320bedc8b8448b193127628262081b138a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/export/ExportProgressPopover.vue:364 \u00B7 apps/desktop/src/components/sql-file/FailureDetailsList.vue:58 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"666b769acad7c26278df52ebe6d499cf19dcd7569e3b79bab2daad06db4f84af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/BarcodeParams.vue:69 \u00B7 apps/desktop/src/components/generate/params/IdNumberParams.vue:214 \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":"apps/desktop/src/components/generate/params/BarcodeParams.vue"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c89443b4211f4b8ff64b93961029f01d061c63d2db8f667cffa8d1f17914a33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/EnumParams.vue:13 \u00B7 apps/desktop/src/components/generate/params/PaymentMethodParams.vue:18 \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":"apps/desktop/src/components/generate/params/EnumParams.vue"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"02533250f47b6bd88f3a4777c7996a35569bd14bdabb59c88e64f51196178dcd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/components/generate/params/FileExtensionParams.vue:29 \u00B7 apps/desktop/src/components/generate/params/PhoneParams.vue:47 \u00B7 apps/desktop/src/components/generate/params/WeightUnitParams.vue:15 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/FileExtensionParams.vue"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e30dfb064b566c40a47fe6e8862ddf5c86008aa27756fe990f9eb6e47cb756c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/FileNameParams.vue:28 \u00B7 apps/desktop/src/components/generate/params/FilePathParams.vue:31 \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":"apps/desktop/src/components/generate/params/FileNameParams.vue"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa755041737eb84257ea0f902ed51d43f5eb29248a10de3f8d698802dcd2803"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/FullNameParams.vue:50 \u00B7 apps/desktop/src/components/generate/params/PhoneParams.vue:50 \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":"apps/desktop/src/components/generate/params/FullNameParams.vue"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1525bd39f18b4f5cae85557c004c9a2c7812aa6b2d50d943be7e9930edc29adc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/components/generate/params/JobTitleParams.vue:32 \u00B7 apps/desktop/src/components/generate/params/MaritalStatusParams.vue:32 \u00B7 apps/desktop/src/components/generate/params/TitleParams.vue:32 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/JobTitleParams.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ab64ac67585c453e7627f7176bea0e7efcc9621fd132e93788f87ab6fbfc70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/generate/params/RegexParams.vue:8 \u00B7 apps/desktop/src/components/generate/params/SocialIdParams.vue:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"apps/desktop/src/components/generate/params/RegexParams.vue"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea33b8607201260275a983f7049aa17bb8aa035fde52c22988b5a974b446134e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:9374 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:9391 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7d33b30a5880e3ddf8e0a0b038f577ffc281ff434c6865ef84b5de82f0fb6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:9719 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:9766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9719}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f6dac8eefbe2cfe7e38e6927587062f9b524d2be428d8d0d55582aac95a0ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:11675 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:12928 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11675}}}],"partialFingerprints":{"codehealthFindingId/v1":"610745484064556094e5af545f716ff07dbeab5798204828d73992ec4a63b247"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:12106 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:12139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":12106}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef87b89a72518a8e60a306bd34a479ee1411eb124b45df3b28296fbcffdba0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:13414 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:13430 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":13414}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e61ed78012ee44ee9729c69eb4de3afea893b79cc2030d15bfab1d9a9b00a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:2812 \u00B7 apps/desktop/src/components/grid/DataGridSearchBar.vue:119 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5393a62f220712752f4438983b7ef7eb9e193f3813b42d6f4f1916a0f43a74a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/layout/AppSidebar.vue:108 \u00B7 apps/desktop/src/components/sidebar/ConnectionTree.vue:2355 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/AppSidebar.vue"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"507fce7c0d6f75d84279bedf7b1c491110a9bb688f5fa7750f44825eea6b1dba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/layout/ContentArea.vue:1526 \u00B7 apps/desktop/src/components/layout/ContentArea.vue:1538 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cfe17be6ba5b4607cea475736c5ddd30b3fdff2e10f3a72abcc174d02c8b80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/layout/EditorGroup.vue:51 \u00B7 apps/desktop/src/components/layout/SqlEditorWorkspace.vue:38 \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":"apps/desktop/src/components/layout/EditorGroup.vue"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f467adba64478c08d975b134b6697b8ac0235423ce9812aafd4ea0be29d3aa94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlFilePanel.vue:275 \u00B7 apps/desktop/src/components/layout/SqlLibraryPanel.vue:333 \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":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f95f32b396bf67eaff1b7c8486125679156abc7b46951b1cbaadd49c9dc156"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/components/layout/SqlFilePanel.vue:1156 \u00B7 apps/desktop/src/components/layout/SqlFilePanel.vue:1184 \u00B7 apps/desktop/src/components/layout/SqlFilePanel.vue:1211 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"797e871c2bf16bd648350ba1657d454c408fb347c14d653054d06199622d5b75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:169 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2082 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c2942f42a2d755d97bd24ffc6862f9df0b32312b3dadf083120d2d1c15a0cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/mq/MessageQueryPanel.vue:75 \u00B7 apps/desktop/src/components/mq/ProducerConsumerPanel.vue:79 \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":"apps/desktop/src/components/mq/MessageQueryPanel.vue"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4da1dd79a873360d207931cd3b7ae9f58bc2cc9f9a4070dbc2b03ce0a4bc9f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosConfigDiffPane.vue:75 \u00B7 apps/desktop/src/lib/editor/codemirrorSqlUnknownObjectHighlights.ts:58 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"apps/desktop/src/components/nacos/NacosConfigDiffPane.vue"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe9a4dae241c41d26e97859a2d15b8eccd097a987cc84a73992b409e9373970"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/objects/CustomTypeInfoPanel.vue:113 \u00B7 apps/desktop/src/components/objects/CustomTypeInfoPanel.vue:196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/CustomTypeInfoPanel.vue"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"945cf811df57af71bc0adcc309f561ac2c798f7b510baa249a7703eb31c5a1aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/components/objects/MySqlEventEditor.vue:88 \u00B7 apps/desktop/src/components/plugins/PluginFilesystemTab.vue:44 \u00B7 apps/desktop/src/components/plugins/PluginWorkbenchTab.vue:51 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/MySqlEventEditor.vue"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb402294f2d3a53424fbb76d632f4cb4660e116852aaeca012d6bddb5e40ca54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:688 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:827 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8952d2fe0e301f07425a1ecff9fd1a8c380e8533f57f01e03ea56767e1f269f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:2813 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:2957 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2813}}}],"partialFingerprints":{"codehealthFindingId/v1":"58227cd1efcabfc3264a2654aacb43804a1a616b45487b6352bfa22591ef6802"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:2826 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4511 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"534aecb15e2690c0b64b23ef6ba05fdd48f5da3b2dff06361f744c87b0cce2b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3145 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:3157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f13acbf5f61d43a631c5aa0f013f70e30c205eea8ed03c0e1a588bb37e8fcdc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3525 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:3730 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3525}}}],"partialFingerprints":{"codehealthFindingId/v1":"40616345bdc71f6f5cad8a291685f9b63f3a8c96be1f3ffe6b0f76b5fac01ef6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4083 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5263 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4083}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3f8abe738d1c020145f5113282b61545280d872430bf02bd084a1c23ba32ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4534 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:6247 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9598af1365d09c3b073bfe4daf4b8add856f3751f6647df1b87faf521137e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue:124 \u00B7 apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue:147 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"829912b38aa572bc7bce122327d2ff1fbb4b1032555c1ac79b92dd35608ddc07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginWorkbenchTab.vue:139 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:9228 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginWorkbenchTab.vue"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ad937046b04550f93f3c0db1cc96d1b6695bd7df659cefd4b47212f150afb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisDashboard.vue:79 \u00B7 apps/desktop/src/components/redis/RedisSlowlogPanel.vue:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 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":"apps/desktop/src/components/redis/RedisDashboard.vue"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"566e606dc81af063743e840f834220a709649c828fbb27c5db20e323a5aeae63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:2933 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:2645 \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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":2933}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d38db9cf918ea7ca116893af2438367734f4ae703256f2bbe2c41a6d551575a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:3028 \u00B7 apps/desktop/src/components/redis/RedisKeyBrowser.vue:3037 \u00B7 apps/desktop/src/components/redis/RedisKeyBrowser.vue:3046 \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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":3028}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea93b6a3d587266b529a77840336df3f8eaa466c96b0389577736a023db667c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisValueViewer.vue:1070 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:1206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55e617d9dc081135d13b6d592d741b40626e9686086ab080a52ffca9d056025"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/search/DatabaseSearchPanel.vue:245 \u00B7 apps/desktop/src/components/search/DatabaseSearchPanel.vue:271 \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":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d448ec6b684694e0a170a92232de177b5fee5777478c3137a452b1726819bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/ConnectionTree.vue:2851 \u00B7 apps/desktop/src/components/sidebar/ConnectionTree.vue:2860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2851}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81d5e18fcf07556ec30f66f2363eaea2c03a53cbba7fb7659ba347f3e8888ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:3958 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:3969 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3958}}}],"partialFingerprints":{"codehealthFindingId/v1":"7563ae9366e20ade74c4c90bf13881db55c75bae0fb931903ce3906d755e46cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5026 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5202 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5252 \u00B7 apps/desktop/src/composables/useSidebarTableMutationRuntime.ts:483 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5026}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf392e377479df9193085446fab1276811a1e37db1bc69b386ca651076b13122"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/sidebar/TreeItem.vue:802 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:387 \u2014 the two spans are one implementation copied and then locally edited \u2014 126 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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2beb7798fe3e6c74c5557b3b99da0a35db1d48784fb8e9f2662444cfd9a2b6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:60 \u00B7 apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:108 \u00B7 apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:128 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc64adab98e6a3a978eeaa1770c53792f637364b00d50df6d196130d16795f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/components/sidebar/visibleDatabasesDialogState.ts:97 \u00B7 apps/desktop/src/lib/redis/redisKeyTemplates.ts:9 \u00B7 apps/desktop/src/lib/sidebar/sidebarTableNameDisplay.ts:3 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/visibleDatabasesDialogState.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e346fdb88fc9a9ffa0092c0b0ffa156bdea9f189da6cfe134662a21f208107"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/solr/SolrAdmin.vue:468 \u00B7 apps/desktop/src/components/solr/SolrAdmin.vue:491 \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":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca7632648b970e1c8fea2c6e36f4536d30730345ebf288fcffd9be984dd89ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue:466 \u00B7 apps/desktop/src/lib/sql/sqlFileOpen.ts:174 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e3b8c3ac68cdc7152f046fe902fcada42abf1d17aa08b0e6c86ce33191fcd0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/structure/TablePartitionsPanel.vue:35 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:776 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 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":"apps/desktop/src/components/structure/TablePartitionsPanel.vue"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d93ff0ddbf914105a5bc8a3524941b4872dc206fb0dd1c2054538f9bb0dde5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:3439 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:3494 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3439}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acb53209910c7fcc1613cc3e5961c01b51057ce0eeb77d9009a53471ed6abd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6541 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6541}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7202771cfca81dfdc5fce509b2dc7a246530741641d55405fcc7d010f10305f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6770 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6864 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:7273 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6770}}}],"partialFingerprints":{"codehealthFindingId/v1":"3335441c3506864eb797f9b102f79588292e44d0fe6917172a7223002d9baae0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6452 \u00B7 apps/desktop/src/composables/useSqlExecution.ts:149 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6452}}}],"partialFingerprints":{"codehealthFindingId/v1":"c127522bbc649f28b32e0c75fc9ec6dcd2d04b2ce2a21ad6628e009ca2d9bbab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/transfer/queryResultTransferDdl.ts:152 \u00B7 apps/desktop/src/components/transfer/queryResultTransferDdl.ts:164 \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":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0f8c102f85bac1ac92605c55d2a154c6100a4e9e59bee7cb7886ea9c1bde42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/transfer/queryResultTransferValues.ts:168 \u00B7 apps/desktop/src/components/transfer/queryResultTransferValues.ts:255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c074f51ff84c2c25f2feaa56056d8b7d6288a7ebc002070a81d64a7b9ea3405"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/ui/LightTooltip.vue:231 \u00B7 apps/desktop/src/components/ui/LightTooltip.vue:241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/LightTooltip.vue"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c190985b514c0fe4d11bb7f66ca31106551ad0698ee821cb88751e02bc82714a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/components/ui/date-time-picker/DateTimePicker.vue:108 \u00B7 apps/desktop/src/components/ui/date-time-picker/DateTimePicker.vue:118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/date-time-picker/DateTimePicker.vue"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6462fdd179f4ce848ba2609b8dc70546f452ee5eb75d37155c2c5e7627ff1bcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExport.ts:1569 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1893 \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"452d50b8d0b13e5cbdeeb1b2c0d4d9daec1c597c33b42ffb05d2baf8a10231d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/composables/useDataGridExport.ts:1785 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1857 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:3002 \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba04c591d25eb2683fe9d98049bdb134e620ffce004bb87024e50f853a7786ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExport.ts:2289 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:2366 \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab48d67b46ffdda5d3f07247b6173fd10f3a2b112e98c93e35610e29436054fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/composables/useDialogSources.ts:53 \u00B7 apps/desktop/src/composables/useDialogSources.ts:85 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"30238ca7bf32d67ab453bab61d1b4421e195ee10cc49e176973f1f677e32ba16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/composables/useDockResize.ts:86 \u00B7 apps/desktop/src/composables/usePanelResize.ts:118 \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":"apps/desktop/src/composables/useDockResize.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4925bc844dc2648e7a17532a4e783638ce35d2f30930d353bfa4534158f443d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/composables/useExportTracker.ts:981 \u00B7 apps/desktop/src/composables/useExportTracker.ts:1000 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0e321663de24778a7a78cd6aec75a80c623830f0a8e4562d1f7acfbadeaaa0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:252 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:387 \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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10a7373e8d94e598f9087ea08deeaaec188ab83d8ee9e092715421967ebf74a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/backend/browserAppStateStorage.ts:29 \u00B7 apps/desktop/src/lib/tabs/tabResultCache.ts:202 \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":"apps/desktop/src/lib/backend/browserAppStateStorage.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cb8e68f1dd5eb874c7a13775c12136da04eb5330d0a068812326d5334e9c3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/backend/configCrypto.ts:48 \u00B7 apps/desktop/src/lib/redis/redisCommandPreview.ts:52 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/configCrypto.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"56af1caab53d6f6b092e22b16717c05670e9da79a34ba652911b34a8fda35e0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/lib/backend/debugLog.ts:260 \u00B7 apps/desktop/src/lib/export/saveTextFile.ts:31 \u00B7 apps/desktop/src/lib/savedSql/savedSqlExport.ts:36 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/debugLog.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8654f6d540348bcdb618a871f6009b8ce2513e52aaf0b931767c0a070bbe2854"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:461 \u00B7 apps/desktop/src/lib/backend/http.ts:481 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e180b7034a908340115f4459cf5cf9fb194d4de514bbbff6f16054d3403b921"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:1454 \u00B7 apps/desktop/src/lib/backend/tauri.ts:2093 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3e0c73b9431c1428011a14df3d656fdd7ef02e7e56755841a28f815c0080d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:1995 \u00B7 apps/desktop/src/lib/backend/tauri.ts:2305 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"3765a104ef27000312baebbbdcdcb4d35aedc0c85117927edd6ee62d833a24ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4515 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4647 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4515}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ae9ddc10eb9c9777ada96bf76e9b365465ad00e003452cabc30d019284a31b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4615 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4743 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4615}}}],"partialFingerprints":{"codehealthFindingId/v1":"019e88923f0b3d1815588926ce32dda7731b17708b3f149af215cada7bd5d11b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/lib/backend/tauri.ts:2797 \u00B7 apps/desktop/src/lib/dataGrid/dataGridSql.ts:177 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"f547988e93703122996de12461af8669e9a526ce0f865f7f7f6294a35d32a704"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/common/color.ts:15 \u00B7 apps/desktop/src/lib/common/color.ts:45 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/color.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad48c5ccaee45c73294b0964e1ab19adeed33dbf6aac717f6083d1cce1ae52f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionDatabaseInfo.ts:22 \u00B7 apps/desktop/src/lib/plugins/frontendPlugin.ts:429 \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":"apps/desktop/src/lib/connection/connectionDatabaseInfo.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"994aff3a0c6bb99e9fadad37ae0d9cd3cec0ec9d4ccd5b3896d48bb022a99896"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionUrl.ts:316 \u00B7 apps/desktop/src/lib/connection/connectionUrl.ts:363 \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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74304dc5cc71979daf2801e040e3f156d8843b881b952ef960a3dc454db5516"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/cellDetailPresentation.ts:113 \u00B7 apps/desktop/src/lib/dataGrid/cellDetailPresentation.ts:148 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellDetailPresentation.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e9cc9542e0a28dca21f79cc89b31d8bd191f5c53c4d07b9359a3d93a2fe9a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridColumnLookup.ts:72 \u00B7 apps/desktop/src/lib/dataGrid/dataGridColumnLookup.ts:85 \u2014 the two spans are one implementation copied and then locally edited \u2014 105 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnLookup.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"617b3bdc70ee47646b507cbea18d2d56404dbaefe9788d241fc54425c02ca090"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridPaintTheme.ts:145 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:348 \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":"apps/desktop/src/lib/dataGrid/dataGridPaintTheme.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6308dbcfe0af5242d739629b107cd3c5909fbfebccc9c90daa47da694dce5d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/lib/database/damengPrincipalAdmin.ts:355 \u00B7 apps/desktop/src/lib/database/damengPrincipalAdmin.ts:383 \u00B7 apps/desktop/src/lib/database/damengPrincipalAdmin.ts:395 \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":"apps/desktop/src/lib/database/damengPrincipalAdmin.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a540c303e3fe0e2699ff6910609609ee883ee96de52ee84fca6fb7699a20419"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/database/dbAdminSql.ts:148 \u00B7 apps/desktop/src/lib/database/dbAdminSql.ts:196 \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":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6d6e8ac9616b15a435693b1ce45663d45f801e2f0d73bca204bc476fe9f5a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/lib/database/oracleConstraints.ts:732 \u00B7 apps/desktop/src/lib/database/oracleForeignKeys.ts:711 \u00B7 apps/desktop/src/lib/database/oracleIndexes.ts:399 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cff4e73cc109153640ae5131d688ad89600348da6de4f5fe36d845672649e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/database/visibleDatabases.ts:213 \u00B7 apps/desktop/src/lib/database/visibleDatabases.ts:295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/visibleDatabases.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd5f9f13bd734ae35bec3db7681f543bc41efaefed01e7ce954e3fa54cbd0a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/lib/editor/shellLineCommentRanges.ts:20 \u00B7 apps/desktop/src/lib/editor/sqlIntentionActions.ts:303 \u00B7 apps/desktop/src/lib/query/queryResultDefaultView.ts:67 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/shellLineCommentRanges.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c2e969db36fab3f8c38dd3a41a9cb083180a5699ffd8e6f51e044cc5b4a16a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts:330 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:1779 \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":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"815094bebe4765c234b3e838062777ad4370a0e314cbdf0c667780640a724247"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts:345 \u00B7 apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts:355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"db276f555da2574ce798d9892199ad02af89d9a52b45a04e7b8cfca9105a35ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/export/saveDiagramExport.ts:5 \u00B7 apps/desktop/src/lib/export/saveDiagramExport.ts:28 \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":"apps/desktop/src/lib/export/saveDiagramExport.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad9d2a7a74f8fc50c71a4ec075a073557969b60649de8919e779810984905f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/graph/nebulaGraph.ts:99 \u00B7 apps/desktop/src/lib/graph/neo4jGraph.ts:75 \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":"apps/desktop/src/lib/graph/nebulaGraph.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9dbf7962ed132b46c8ac7674c1afb6244644478edfce9878be547ad1515047"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/metadata/tableMetadataCache.ts:240 \u00B7 apps/desktop/src/lib/metadata/tableMetadataCache.ts:372 \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":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9f2b8665d70f6160a5a0767970ef24d43782e99ac3504d7eee9c45b976351b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:1607 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:1629 \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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"52be752528f872174fb232f5a34653327a199ec986486103fbcc68ea52ff92fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:1847 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:1896 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:1912 \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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fbc894145a47334963975daa6d3ea12caad49fe766a29b50b6e7b359a7b366"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoSql.ts:218 \u00B7 apps/desktop/src/lib/mongo/mongoSql.ts:307 \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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce49d7a2c5186ec67e4ba5cf5a9b30345f6650bab0c0b889623574e0170b1ddd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/redis/codec/pickle.ts:156 \u00B7 apps/desktop/src/lib/redis/codec/pickle.ts:177 \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":"apps/desktop/src/lib/redis/codec/pickle.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"909cba47122afbae1beeca96e780e7be767bf75e8591758489d18894c2883ce6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/connectionListSort.ts:8 \u00B7 apps/desktop/src/lib/sidebar/connectionListSort.ts:18 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/connectionListSort.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3718af24c6e28e2f9b354328ebf9cf3c495dd6c5f65b12cd3d741e9575cd03e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarLayout.ts:60 \u00B7 apps/desktop/src/lib/sidebar/sidebarLayout.ts:129 \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":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94a718bdd73d2419bab1898b48345af57f93f7b524da46f475d9640956f8b5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarLayout.ts:396 \u00B7 apps/desktop/src/lib/table/tableVGroup.ts:232 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5386e3f6b0e0ecf37a21c5e58bb1b0d11be1e18c352651b1af540e996f7eab4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/solr/solrRequestRisk.ts:46 \u00B7 apps/desktop/src/lib/solr/solrRequestRisk.ts:64 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/solr/solrRequestRisk.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"baced1a8c87e645f9261cf3436835e3e9bd262841da9023c6795681180c985dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/cypherFormatter.ts:504 \u00B7 apps/desktop/src/lib/sql/cypherFormatter.ts:524 \u2014 the two spans are one implementation copied and then locally edited \u2014 123 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d310a0a419016fef4b6fb18114126a0075ef6734a306af66a242993ccc503f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/sql/ddlDisplay.ts:76 \u00B7 apps/desktop/src/lib/sql/ddlDisplay.ts:120 \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":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c02dab3b94e1c79a6b2043aa5193448a5620f7283318208e177a26c0ed16f08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/insertValueHints.ts:452 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:2583 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"74608eebadf92ca864a9387b501561d3fd1f1ab61dd1e23a8d4c9852c19867c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlParameters.ts:571 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1405 \u00B7 apps/desktop/src/lib/sql/sqlVariables.ts:99 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbb4204f6571d2f67115c4f7bae0d6315281560f384acaa7aa09406827b0ac4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:1756 \u00B7 apps/desktop/src/lib/sql/sqlVariables.ts:370 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d933d39d49fc936756f10d49ad57cdde24a1a84bf3be957bbdf095faaa6cd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:2866 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:2876 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2866}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb56776e1e9e2261cdf17da84ddfa1c9cea6ca1a0215effdbc6d89a4cafb4b62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleTypeDataMapping.ts:110 \u00B7 apps/desktop/src/lib/table/oracleTypeManagement.ts:618 \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":"apps/desktop/src/lib/table/oracleTypeDataMapping.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7c09fb23b7556f3625e92d3ed57579ea410a2f72e359fec378d1e63d33b1c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/table/routineExecutionSql.ts:122 \u00B7 apps/desktop/src/lib/table/routineExecutionSql.ts:154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineExecutionSql.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4544d1eb961f4301041f0ef803ad99cb173944603f33a993cddfb77b9bba874"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/lib/tabs/tabMenu.ts:44 \u00B7 apps/desktop/src/lib/tabs/tabMenu.ts:54 \u00B7 apps/desktop/src/lib/tabs/tabMenu.ts:91 \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":"apps/desktop/src/lib/tabs/tabMenu.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08ae2f91588b4b35fe49cebbced5a8cf8ccbbc6a6b1d005df33c03999120ec9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/lib/tabs/tabResultCache.ts:442 \u00B7 apps/desktop/src/lib/tabs/tabResultCache.ts:484 \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":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf542f797265b633a2fb82a203a56ca20b1cb94ee009c26bedddf7d01a7857e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/stores/connectionPasswordPromptStore.ts:32 \u00B7 apps/desktop/src/stores/productionSafetyStore.ts:30 \u00B7 apps/desktop/src/stores/readOnlyUnlockStore.ts:100 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionPasswordPromptStore.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b59bd0f5685575109fce3a54acdc317a2f873c9464c8970c5e0f403f80d3ef6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/connectionPasswordPromptStore.ts:46 \u00B7 apps/desktop/src/stores/productionSafetyStore.ts:46 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionPasswordPromptStore.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"18205982cd0d0fce6cfac055f63f51af44305cd08430c40ead849eb1d2463290"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:1693 \u00B7 apps/desktop/src/stores/connectionStore.ts:5670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"92426ead86db8464471394ab6bbf7bf5ac1c543c7f2e1806f2a8bfbc15579efc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/stores/connectionStore.ts:2372 \u00B7 apps/desktop/src/stores/connectionStore.ts:2386 \u00B7 apps/desktop/src/stores/connectionStore.ts:2400 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"21437fe9e0a394f14367380febf312ab894830437cb59cb097d79c844497d29a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:6418 \u00B7 apps/desktop/src/stores/connectionStore.ts:6445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6418}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4c49a0e947abde59176c4d8c9bd73ddd3f310a6200a9eae6bdafaf86c2211c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): apps/desktop/src/stores/connectionStore.ts:6644 \u00B7 apps/desktop/src/stores/connectionStore.ts:6688 \u00B7 apps/desktop/src/stores/connectionStore.ts:6715 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6644}}}],"partialFingerprints":{"codehealthFindingId/v1":"e939936ca06982e194ba21b7d0d32901cc5c3935f14f3a4de21240e82dc7b03a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:7196 \u00B7 apps/desktop/src/stores/connectionStore.ts:7325 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7196}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f5806d7f46f02440b4cfc37e7310fa8bb677513d5b19eeda9a55e008d7c582"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:7208 \u00B7 apps/desktop/src/stores/connectionStore.ts:7299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7208}}}],"partialFingerprints":{"codehealthFindingId/v1":"364f0ee3e19d81fc88dfbc86beb79c239bbbf1cdd0064a1cc98f1d01b3382658"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:7390 \u00B7 apps/desktop/src/stores/connectionStore.ts:7491 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea9e8036c8b74bfa86c7371909702889998e2154f72b311267d720a02badc34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/productionSafetyStore.ts:64 \u00B7 apps/desktop/src/stores/sqlExecutionDangerStore.ts:112 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/productionSafetyStore.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33fc332e42aeadce4fde92b9f6fddfd20386913530961ae43cc7fc96d0a91ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:1406 \u00B7 apps/desktop/src/stores/queryStore.ts:1456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d837c413d880cf24bf116f725d9dbea0fa9fce0a1746efe14f479958de0fd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 13 locations): apps/desktop/src/stores/queryStore.ts:4019 \u00B7 apps/desktop/src/stores/queryStore.ts:4086 \u00B7 apps/desktop/src/stores/queryStore.ts:4109 \u00B7 apps/desktop/src/stores/queryStore.ts:4132 \u00B7 \u002B9 more site(s) not listed \u2014 all 13 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4019}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27ee05ed2003c18f57c38cb5454621983244e5f699013f085d0e5b4b6b03bf1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:4448 \u00B7 apps/desktop/src/stores/queryStore.ts:4513 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11d6910fa34f5aa5b0c3e69860ab57240a7bbd7f84a7216697439b6d2200e6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:5505 \u00B7 apps/desktop/src/stores/queryStore.ts:5516 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5505}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc069f3d43e8a76775fa834e40d310760bd1b4175d7d9ae33bc971035443483"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:9047 \u00B7 apps/desktop/src/stores/queryStore.ts:9147 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9047}}}],"partialFingerprints":{"codehealthFindingId/v1":"802e81f87665cca8ebe981d9d3701fd7f991cffed53abb38a502fbcfb373b665"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/desktop/src/stores/savedSqlStore.ts:1018 \u00B7 apps/desktop/src/stores/transferTaskStore.ts:437 \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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"829197ea9f6fe7599f557cd7012058ceb62adf8af4c2407317b5d4b60ff77772"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): apps/desktop/src/App.vue:509 \u00B7 apps/desktop/src/components/admin/XuguUserPermissions.vue:70 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:400 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:635 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"101551775af4ecdc65bf08cc7328e8c86de4474a37c51081d88fb8f9dd39f3bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/App.vue:853 \u00B7 apps/desktop/src/App.vue: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":"apps/desktop/src/App.vue"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5605437c6f4880d69dc22c6d0c487f082121536b1fbaebfa45a4d5db51fbfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/App.vue:2761 \u00B7 apps/desktop/src/App.vue:2861 \u00B7 apps/desktop/src/App.vue:2905 \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":"apps/desktop/src/App.vue"},"region":{"startLine":2761}}}],"partialFingerprints":{"codehealthFindingId/v1":"17847fae919fb4b94c7ad4a35e28c39a63fbc47f9ac547d527d45a0797c848fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/App.vue:4276 \u00B7 apps/desktop/src/App.vue:4303 \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":"apps/desktop/src/App.vue"},"region":{"startLine":4276}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7ee31a972f3f2ded251dcc1eb4491ace46128fd9e2721448e5c7cc26063859"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/App.vue:4294 \u00B7 apps/desktop/src/App.vue:4321 \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":"apps/desktop/src/App.vue"},"region":{"startLine":4294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f46dba3ee81f3ab310659c6b1831ab8ad2be920f081955c63bd04b3db138efd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/App.vue:5271 \u00B7 apps/desktop/src/components/editor/useQueryEditorTextActions.ts:145 \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":"apps/desktop/src/App.vue"},"region":{"startLine":5271}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4061ea12768fc5ddbf9eb4affe3766f96138039156ba6918613abfab4b9b25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/App.vue:5430 \u00B7 apps/desktop/src/App.vue:5538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":5430}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab8bf07ad36cfde868ea5934326184e6efd398b64221fbd586b8dd27b0b8e9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/App.vue:5447 \u00B7 apps/desktop/src/App.vue:5551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":5447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd0c9530ae6c0d812684193abf5aa365b3b06abced5e71bad9feb050474d69e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 11 locations): apps/desktop/src/components/admin/DamengUserAdmin.vue:85 \u00B7 apps/desktop/src/components/admin/DatabaseUserAdmin.vue:68 \u00B7 apps/desktop/src/components/admin/XuguUserPermissions.vue:78 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:1204 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 copies are spread across 11 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbe76476108d17097d1f88374c231d1fcc34fcf3e4583e6849611979f647e86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/admin/DatabaseJobAdmin.vue:100 \u00B7 apps/desktop/src/components/objects/ObjectSourceDialog.vue:96 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b63c2871531e667b8ae82a5a08bc7fca832d45bffa57d20cc6f67680196658"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/admin/DatabaseJobAdmin.vue:167 \u00B7 apps/desktop/src/components/admin/DatabaseJobAdmin.vue:252 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5cc711da6386eab1d405bad3e1a4b0cb0f33f86ba03b016aeae9f9b9d08c80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 16 locations): apps/desktop/src/components/admin/DatabaseUserAdmin.vue:124 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:1092 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:1833 \u00B7 apps/desktop/src/components/consul/ConsulTools.vue:49 \u00B7 \u002B12 more site(s) not listed \u2014 the 16 copies are spread across 12 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":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab68cd2f55e20a870774ca6c7b75206e6c9739dfad63f33488b432d59917762"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/admin/ProcessListPanel.vue:288 \u00B7 apps/desktop/src/components/admin/ProcessListPanel.vue:495 \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":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24b367e1337a57370a64b7ff9045ccef784e7d2638fcdad929c98b4666ed157"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/auth/LoginPage.vue:20 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:982 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:1816 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/auth/LoginPage.vue"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdfa0c05b5516591c0e0dc44983e3722a47c912616d757512d9831bf3b910b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:750 \u00B7 apps/desktop/src/components/config/DriverStoreDialog.vue:803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b008d1916d6fcafdfe52d37191c7fe0c84330f4a10f1661d61dc9658bbef28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:916 \u00B7 apps/desktop/src/components/dolt/DoltVersionControl.vue:105 \u00B7 apps/desktop/src/components/vector/VectorBrowser.vue:40 \u00B7 apps/desktop/src/composables/useDataGridColumnFormatter.ts:93 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa891ca2fa37ff6a870dabfbfe3196c5fc4fe7910fd98af6b7fab96d7aee164"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:1386 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:7563 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ec786c85c49fa476b8c93cc9a4febccace662d37900037dcf836f011d9cb4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 13 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:960 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:1097 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:1171 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:1217 \u00B7 \u002B9 more site(s) not listed \u2014 the 13 copies are spread across 7 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"221de71fcec122ff79e6fd02dfd26c39c54e5777d411a7132fe5fe93a2977008"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:1205 \u00B7 apps/desktop/src/components/consul/ConsulTools.vue:37 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:321 \u00B7 apps/desktop/src/components/diff/DataCompareDialog.vue:95 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 8 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8803ba76049b8245f03c0e6fe16fc302a5ba89dae2f4a27cb9fcc93fd9e846a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:1815 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:815 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"deae29316d2181a6100ba3176aa493b275164458b3ee8f14f31af951f6dc4ab5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:4079 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:4128 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:4195 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:4234 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4079}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfde07c195e22af594d47b27d199d228e456cba7a49dadf5fad90d1687261283"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:7055 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:7064 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":7055}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a119ddcddba544e9738bd72804cd3d10541ef3fc1a2d80d7a923ace6e917f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulAcl.vue:85 \u00B7 apps/desktop/src/components/consul/ConsulScope.vue:54 \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":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"97020e1104ba732c6928fe5c921d2f2a4f5d44f11cda44e5b35de6877ddf86c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulAcl.vue:142 \u00B7 apps/desktop/src/components/objects/OracleTypeDataMappingPanel.vue:58 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9235a02eb52ed72a88b4235d1f8924d50cf99d8996186cb31a6bbb626045fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/consul/ConsulHealth.vue:23 \u00B7 apps/desktop/src/composables/useDialogSources.ts:83 \u00B7 apps/desktop/src/composables/useDialogSources.ts:108 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f214354573d60af6374c21571a5f614823bea2325da507e2926fad610513daef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): apps/desktop/src/components/consul/ConsulHealth.vue:158 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:202 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:224 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:253 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6dedb6fff74eed954de318e0d962d44003bfebd962544b16850b1b3bb1b64b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulKeyBrowser.vue:285 \u00B7 apps/desktop/src/components/consul/ConsulKeyBrowser.vue: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":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1af585db4484ab5763bef043631afff3ee9f037886915264ba17b6ea05576a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulMesh.vue:42 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:200 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d44e873064706412e7fee315cb37b112286cb50ad5ed870705991a6ae706adb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulSessions.vue:32 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:4438 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"344a2d81e8ced73cfcf2a83c3dd6a64292a5e47b0f171418568d3c9a3a313ead"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/debug/PlDebugResultValue.vue:23 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:639 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:649 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugResultValue.vue"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d6a1eb5d7555c2f31be5785ba70643b842ace5066bbc6d88fc9bcc731f9186"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/diagram/DiagramInspector.vue:138 \u00B7 apps/desktop/src/components/diagram/DiagramInspector.vue:147 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/DiagramInspector.vue"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfaf9d82585594edb65a59e57d72525736e9f99d3d351d086aa09104e0e94d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:319 \u00B7 apps/desktop/src/components/document/MongoDatabaseDumpDialog.vue:39 \u00B7 apps/desktop/src/components/editor/EditorSearchPanel.vue:29 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:121 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"55787fab6035e108de21ed18f386c7f3ec9fbb179eaad79fd2e545b309bea233"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:1327 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:1357 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:1528 \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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dacd2f64a722cb9135745026cba8db7806a3d31c77831aea4ba5366b32ea1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:1370 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:1408 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:1422 \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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"074637124f203549f0293a9961e1560f90e6729be23733984cc3c7a61fdefc16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:2175 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:2184 \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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ba66d157d7f28206e45ae7b71ed6ea60f9f600d6d2aab988c2e78d6942774e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:96 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:194 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:202 \u00B7 apps/desktop/src/composables/useDataGridColumnFormatter.ts:108 \u2014 the 4 copies are spread across 3 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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ea7b6f18348a0970e61894ad9bb7824a0321d7b6f44b33767d1f8974ea3fc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:912 \u00B7 apps/desktop/src/components/diff/DataCompareDialog.vue:932 \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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4dbb487dae4c81508b29fd007d46ef7f42278fd5ce3f70ff5fe50b49cf1026"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue:98 \u00B7 apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue:378 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"apps/desktop/src/components/diff/SchemaDiffConfigSelector.vue"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6197e6b15baa7ef9db62e2a906567bbc4f95f138fcc777eca569571d1014e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffDialog.vue:124 \u00B7 apps/desktop/src/components/document/DamengDumpDialog.vue:33 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc31fe6dc1869fcfc7a7be498cc84808332a5fa2acb6db393c8916b0d65f831"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffDialog.vue:705 \u00B7 apps/desktop/src/components/diff/SchemaDiffDialog.vue:1482 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"029f6b13216f5c03da95fa466247efc0c1e7054b357bd1ff69605a5ee572c779"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffDialog.vue:1468 \u00B7 apps/desktop/src/components/diff/SchemaDiffDialog.vue:1565 \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":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6453f035a0da7bc93352822a8142e4c6753e663418fc0f674dbda36d5b44ee53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:1882 \u00B7 apps/desktop/src/components/vector/VectorBrowser.vue:374 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"41709f39eeb49d221ae9f5760fc85c3da15de8f75992d6677ae73b7b7ec4f59a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:2089 \u00B7 apps/desktop/src/components/vector/VectorBrowser.vue:407 \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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bc8f7ab2fa82a414f8217a352c664849e6f09548390c58ff4d6c4080483c01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:1483 \u00B7 apps/desktop/src/lib/document/gridFsBrowser.ts:47 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac654a5981f03122d930d7b9bdddceca66a5d49d70bf3b64f0c35424518e4fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/document/MongoBucketBrowser.vue:377 \u00B7 apps/desktop/src/lib/dataGrid/binaryCellDownload.ts:62 \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":"apps/desktop/src/components/document/MongoBucketBrowser.vue"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53d88dbca814a579276f0834355e7c8b0554d49888de8219a931ec9202868b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/dolt/DoltVersionControl.vue:716 \u00B7 apps/desktop/src/components/dolt/DoltVersionControl.vue:725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"530bd7aee6d6ac7b112f7080e99425aefcc35a27cfe3964fe4699a44d104a853"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/editor/AiAssistant.vue:5273 \u00B7 apps/desktop/src/components/editor/AiAssistant.vue:5284 \u00B7 apps/desktop/src/components/editor/AiAssistant.vue:5293 \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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":5273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0aa858495239c501b8a48dd1a5c37071c236a6e6406bff36d3529e53675e175"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/editor/ColumnInfoPanel.vue:45 \u00B7 apps/desktop/src/components/editor/QueryHistory.vue:118 \u00B7 apps/desktop/src/components/editor/SqlPreviewPanel.vue:155 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/ColumnInfoPanel.vue"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b095e1a4ad9c7040fd2475430f432ab9f2d140115fa31c7dd571dad1529fb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/editor/DelimitedListDialog.vue:142 \u00B7 apps/desktop/src/components/editor/SqlParameterDialog.vue:153 \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":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bb6dceb88475b4465362eb28682c41c0a856a843c48e9fffb03d6046b6a49b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:2473 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:6377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d09caaf07d5c3427e8dbb48a2ad96c1bd6e0110ae5e725daaa46cf4fd43305c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:4429 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:193 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:168 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:2365 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":4429}}}],"partialFingerprints":{"codehealthFindingId/v1":"847775cf211bfb5e0543db8ad9c9578465ec99d0dfb5816c8c6edc5117fd632f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:4439 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchSettingsPage.vue:32 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":4439}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b46f33f21864725f8bd03fc5ecab99adcc9ec4b6240e4baffb155a7c98a4a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:7453 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:7462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7453}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63b9130a23cb8d5e08f5d4222b2fbd84ae750d0a6cbe31a009ce6cc6a9e664b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:7970 \u00B7 apps/desktop/src/components/editor/QueryEditor.vue:1248 \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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7970}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2a582e61125ceefc5215b841168bee3187888c6bb2dec6db95b5b789de1681"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:4430 \u00B7 apps/desktop/src/components/lineage/FieldLineageDialog.vue:52 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:198 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":4430}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaa3159ed2fe4dc8649d56454c124b59f7a221a4a96240f26bc9cbeb15ecd5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/editor/QueryEditor.vue:1158 \u00B7 apps/desktop/src/components/editor/useQueryEditorTextActions.ts:270 \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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e41ee95353a5a25fc13d3160f2aa63246b258a9502fe129e852897e87617987"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/editor/QueryHistory.vue:118 \u00B7 apps/desktop/src/components/layout/ContentArea.vue:2086 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"988241cd287da7a85553d4a67a3f13ed4bee5f49ed6cb25bd8bb2f69115aa832"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/editor/SqlParameterDialog.vue:82 \u00B7 apps/desktop/src/components/editor/SqlParameterDialog.vue:91 \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":"apps/desktop/src/components/editor/SqlParameterDialog.vue"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f519ee27ba5ce4a1e435814d6bcd019476f71060488500bb15d32f049099b438"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/components/editor/queryEditorSqlExtensions.ts:612 \u00B7 apps/desktop/src/lib/editor/queryEditorLineNumbers.ts:32 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09d480ad10ec6466afcf33454ab39dd3eb5eae8eccd7b0f3177690c6b744ac5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorHover.ts:52 \u00B7 apps/desktop/src/lib/sql/semantic/completion.ts:102 \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":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"849df315b14100eb44f2ea94ebed3d7a04d19dae239a0f3841fd86da4f5687a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdAccessControl.vue:329 \u00B7 apps/desktop/src/components/etcd/EtcdAccessControl.vue:338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bcd3ea75161c758f869100e5a3f8b2b55ec0aa02fc5498aa0f33e2e8f6cf3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdAdminConsole.vue:90 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:125 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAdminConsole.vue"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bcf6e443e0407d5f97d34dbe0cd09b6a49c4c70cdf4b8dbfe5408303ec7a79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdKeyBrowser.vue:148 \u00B7 apps/desktop/src/components/settings/McpDatabaseAccessDialog.vue:29 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"112be5612c888db85b88c9af16a2c03b329a63417722c72538824d6338a645c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/etcd/EtcdKeyBrowser.vue:596 \u00B7 apps/desktop/src/components/etcd/EtcdKeyBrowser.vue:744 \u00B7 apps/desktop/src/components/etcd/EtcdKeyBrowser.vue:1099 \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":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9023fea46b7a3f7e31cdb9324cb651c544af64f4eb3bd5cfa9739cbec5f3f17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/generate/DataGenerateDialog.vue:801 \u00B7 apps/desktop/src/lib/dataGrid/binaryCellDownload.ts:524 \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":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"a458ea85121946d7da7499f19ded46796dec8e30154f9eeed0161d8918aa4b6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/DateTimeParams.vue:14 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:369 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/DateTimeParams.vue"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9074665dea99b986f5dd5fbcc01a5acb6af156e12ea63be44f2470999f710caf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/ProductNameParams.vue:10 \u00B7 apps/desktop/src/components/generate/params/WeightUnitParams.vue:10 \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":"apps/desktop/src/components/generate/params/ProductNameParams.vue"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e02dd444f80127e05a273f7a95ff249681ad3ef42a9d8923996db93a61c1f9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:1455 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:1854 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb69761d1a7d0436a679c673e16e7062232f8e6f3ff0b72f9eae32197baa0326"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:14442 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:14498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14442}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a5172c26d1887e16d5c4370849b09c9f534542bdfac9ed5c74c93855865dca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridDetailDialogs.vue:51 \u00B7 apps/desktop/src/components/grid/DataGridDetailDialogs.vue:60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridDetailDialogs.vue"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46817cd214707829324879b7eb31f93d16ca948a7b23d0b7de868c2fced6854"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/grid/GridSnapshotDialog.vue:24 \u00B7 apps/desktop/src/composables/useDatabaseTableEmpty.ts:45 \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":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb2af4c7db6de9586391b7fd62baa0a7c8600176d22472255b12b60a198942a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): apps/desktop/src/components/grid/LayerPreviewDialog.vue:639 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:1376 \u00B7 apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts:446 \u00B7 apps/desktop/src/lib/savedSql/savedSqlExport.ts:27 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b7db487265bc7a6592f7953582f742e867d2c0b16853225f8088e02e83a6dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/grid/TemporalCellEditor.vue:144 \u00B7 apps/desktop/src/components/grid/TemporalCellEditor.vue:172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c5df0baee37f87d89221a9281ff32af7c6b65376fe6fdcdf1f86307fb1ac20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/import/TableImportDialog.vue:1159 \u00B7 apps/desktop/src/components/plugins/PluginContributionsPanel.vue:1143 \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":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97cd6da9b2eab10d2f57e8b383ba9ab4b2d32d63206c91fd69bbeef60ceade5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/AiRunsClosePromptDialog.vue:6 \u00B7 apps/desktop/src/components/layout/BackgroundTasksClosePromptDialog.vue:9 \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":"apps/desktop/src/components/layout/AiRunsClosePromptDialog.vue"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c2b0564adeb1ee6fa09f8eba767bb459ac92781ab7d0b1dac65f3ae5e436e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/AppSidebar.vue:52 \u00B7 apps/desktop/src/components/layout/WelcomeScreen.vue:49 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/AppSidebar.vue"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ba44fbe36d3d8d0dd29d62f9bb785edc7b0eebc9fa2e4a0e1dc6950eed861b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): apps/desktop/src/components/layout/ContentArea.vue:756 \u00B7 apps/desktop/src/components/layout/ContentArea.vue:1884 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue:353 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue:380 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d2fb9de3d1d47855420858f4a0c6ad6bc5bc7c1b08d32a3581b2cef570584b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/EditorGroupTabBar.vue:1761 \u00B7 apps/desktop/src/components/layout/EditorGroupTabBar.vue:1770 \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":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bdf98a492a59fab49d4784fc170b6e2fc9622f46720c4c3488492c624ef2ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlFilePanel.vue:636 \u00B7 apps/desktop/src/composables/useLargeSqlFileFallback.ts:19 \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":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"538fae38093623e8e35722bd84d956ca456b6fee6c732f177a2b8abe8f6e3e02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlFilePanel.vue:1020 \u00B7 apps/desktop/src/components/layout/SqlFilePanel.vue:1072 \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":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39b0c434e1601c633916912c3b05121ae1ef117232852ad99cbd677ed8cdf50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlFilePanel.vue:1070 \u00B7 apps/desktop/src/components/layout/SqlFilePanel.vue:1138 \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":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4de2a97474703573d9963b417110adff181fee0e5e8d4700d8e9c679281a5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlFilePanel.vue:1142 \u00B7 apps/desktop/src/components/layout/SqlLibraryPanel.vue:1230 \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":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2299eab573aa05324140f3c0036cec6e69917c012bc88c4c95e9885c8e70f23f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:906 \u00B7 apps/desktop/src/components/transfer/TransferTaskTree.vue:152 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4eb6b67a77a0913d85766b87919bad059856702c66e4b548b839ae2bc9c62e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:962 \u00B7 apps/desktop/src/components/transfer/TransferTaskTree.vue:226 \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":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9cad2b095d5b28f352e73123d5192de87358cb0b1791c59f162c53a74db54b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:1208 \u00B7 apps/desktop/src/components/layout/SqlLibraryPanel.vue:1217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc45478c084e55b5c7d9784c81d1b63eca20d2481cc1f0c29957777c72a8a6aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/layout/UpdateDialog.vue:286 \u00B7 apps/desktop/src/components/settings/ChangelogPanel.vue:75 \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":"apps/desktop/src/components/layout/UpdateDialog.vue"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1116dbf168a80c19b657b51b64df49c9aaefc8e3e2a6a94985765f789018c822"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/mq/MonitoringPanel.vue:127 \u00B7 apps/desktop/src/components/mq/ProducerConsumerPanel.vue:453 \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":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7fb0f24b1757a80614c3eb4b00768ee10542f17cca29351dd487f623b855f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/mq/MqAdminConsole.vue:281 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue:105 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue:79 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MqAdminConsole.vue"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce86067dfb1ebcbf646a33b8396f451ad3434018eca5b5a1283791292dd5e52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue:32 \u00B7 apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue:45 \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":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"560c0791f0c013c285219b359f3bcebcbf6395c8b0f5fda9c28c32e5ba58c5f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/mqtt/MqttAdminConsole.vue:165 \u00B7 apps/desktop/src/composables/useExportTracker.ts:257 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b289aa6e4ba6c16c7d61f6ee8c9bb37c570ff83d5017a68da3124ee6a49512"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:954 \u00B7 apps/desktop/src/lib/nacos/nacosConfigLanguage.ts:4 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0a871a84acc7c629a209a9d0d498f0ed7f472221185d5e39bd15f680195d58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:1268 \u00B7 apps/desktop/src/lib/backend/http.ts:4005 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02fd8908b1538e481bbdac96413ec2971d2f640d80e8cdd5f8882ce9e44b0b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:2732 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:2744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced18e584c30d5306c9e790cebbc6f2adb397731f8a135f015b99edbb6446b3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/objects/DatabaseBrowser.vue:124 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:965 \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":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6125319d3509ec8a885f574e4a8b1d8286f6c8b5c6e58322b5f273f603283d0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/components/objects/DdlViewDialog.vue:157 \u00B7 apps/desktop/src/components/objects/DdlViewDialog.vue:197 \u2014 the two spans are one implementation copied and then locally edited \u2014 107 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26c9a342a299fdd3a070a603ec66e2095e4afac7c6da52f95adfbb0eabfb8d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/components/objects/DdlViewDialog.vue:369 \u00B7 apps/desktop/src/composables/useDialogEditorFocusRestore.ts:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"879a3e9bec5a97064b2191f20deefc51ad9ff75db89dc013f23e265d7ba78008"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/objects/ElasticsearchIndexMetadataDialog.vue:69 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6515 \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":"apps/desktop/src/components/objects/ElasticsearchIndexMetadataDialog.vue"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7698784c7f90152d8e7760b6d539430cd33b8b963834f6076f635eedf38d5d24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:2895 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:3048 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4411 \u2014 the 3 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5a161107b8b18afbada0b3ae74084c268ee30678c1c26d0a5fd324e45f825e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4297 \u00B7 apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:742 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c8dbe29d24d73d9b8251ec4592d21363e36d56e635b9117a8332b1c1b268db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4729 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:3094 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4729}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4d5389588161dc1febc8fde4afcebcf9e8d4738db505656b07e50f159f8dc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4741 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1615 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e8774062ddf1b6c662d9719097414b35b81e8ba66b9111f538226868cd0c52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4885 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:6280 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4885}}}],"partialFingerprints":{"codehealthFindingId/v1":"df60559d8457009b6ffceeda1a4e51728f448f9d0efa1996370f07bf8be1b15b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/components/objects/OracleTypeDataMappingPanel.vue:50 \u00B7 apps/desktop/src/components/objects/OracleTypeDataMappingPanel.vue:70 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleTypeDataMappingPanel.vue"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6f3928aa16d8df2bfbc50f1d7346634dc50f4dc828fe4ec6dbaf5590e03ff0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginContributionsPanel.vue:272 \u00B7 apps/desktop/src/composables/usePluginShortcuts.ts:55 \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":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea450414ad54c495bd6da67f3b43efa1a2e2d8df20d45580a489b65090d6ec14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): apps/desktop/src/components/plugins/PluginWorkbenchHost.vue:192 \u00B7 apps/desktop/src/lib/common/clipboard.ts:240 \u00B7 apps/desktop/src/lib/dataGrid/cellImageUrl.ts:104 \u00B7 apps/desktop/src/lib/plugins/pluginHostBridge.ts:1909 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 6 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8f3d5fc103be016795afdff54137531a2f3f43e964bb64cf484371509569bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:205 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:177 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b839c71082d5cb9a086eabe3699b303a86d9c743f6393db559b1eb5451aa28f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:635 \u00B7 apps/desktop/src/components/redis/RedisKeyBrowser.vue:667 \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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"61471b9979d7ff6c550b22f158b86982ecdc7740aaa52462b6b13b65a8462180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:2425 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:2108 \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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":2425}}}],"partialFingerprints":{"codehealthFindingId/v1":"355b3d5e29d82cdaaed31551f0c86ae187f50bafb61874eabec07c88810c66b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:2842 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:2639 \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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"2490fd5f54082cf02fe02956fad4d28aa530915a77321aa1901e22d608bb8f67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisValueViewer.vue:827 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:836 \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":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"4906b11158ce5b5afdbd7c971ad3b93a0ba25f81024519dda004de586d2c8eeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisValueViewer.vue:1736 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:1745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b25955f3b70159b390de0b41ee930a399acb128c92b92fab2198eb72fcd368a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisValueViewer.vue:1989 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:2439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fd81d691991d8ce323bdd1cb75747dfc2d8440eee97fd491762bf8daabfe9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/ConnectionTree.vue:2088 \u00B7 apps/desktop/src/components/sidebar/ConnectionTree.vue:2098 \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":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4f90a2f79b22ff360b3a5eb84e826fd492c9d7da2e10282128b7d74ff648db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2222 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2241 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20ac5f1e5d444f7db20bdec12bb70e27df7dfc2d20d11e39347aa84f1c700bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2916 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2929 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52affa060babf4179e398f2c2b68dc3957e29852496828854dfd98aef38a416"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4684 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4726 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4684}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fd914e0cd91af90d25e127bd7365dca8773a27b979478a82b5aeac8d856cdf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5542 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5614 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5542}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ec8508e0aa63d53163e551bed7d3183a6978e7194f1f78b2d5abe1124a7627"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:6597 \u00B7 apps/desktop/src/components/sidebar/TreeItem.vue:788 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":6597}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0cbf8798d483446abe86b2364818cdf6763c6ed8e18c6f6c6fab2d39be8be8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/TreeItem.vue:560 \u00B7 apps/desktop/src/components/sidebar/TreeItem.vue:568 \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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94341c739f781bcb62ebc3973f3144e26db118b259ac2111b80369eaa46e50c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue:144 \u00B7 apps/desktop/src/components/sidebar/VisibleSchemasDialog.vue:125 \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":"apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"53671a1a823ff0da481265eda22d019d4467abded4d6fcadfa08226ace1dc27f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:32 \u00B7 apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:47 \u00B7 apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:117 \u00B7 apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:132 \u2014 all 4 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e29626394cc66652cbf7a9229adbfa252f62a3bb623951178d9e34946dac8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:645 \u00B7 apps/desktop/src/composables/useDialogSources.ts:50 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e4ede245151499c3b9f786585af678ea1460647343f679f8949fc030016f2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:2333 \u00B7 apps/desktop/src/composables/useDataGridColumnFormatter.ts:109 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2375e4730b09a7246fb1935d5f756f32b83ec31c04bca364fbd5368766fd40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:5095 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:5684 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":5095}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30a131be24ce344aeea4d403d2c89d42c8f8d42dc7c8c49b395a7da4ff25ee3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6793 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:7107 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6793}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b1d5a54d5c415cc56a5ff0e3c5a6a1c1aab2a887d4a36c7c0f11056ba442f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/components/tabs/RecentClosedTabsDialog.vue:8 \u00B7 apps/desktop/src/components/tabs/TabSwitcherDialog.vue:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/tabs/RecentClosedTabsDialog.vue"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c9f5838f5bd4cc86b9193b8532d792131725ec683fb6470955ae060bbf0f9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/components/transfer/ObjectSelectionTree.vue:180 \u00B7 apps/desktop/src/components/transfer/ObjectSelectionTree.vue:195 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/ObjectSelectionTree.vue"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"965ef77511320e1fed0451758985d4850a8293f98be6b4f2414be04d146b2938"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/components/transfer/TransferTaskTree.vue:151 \u00B7 apps/desktop/src/components/transfer/TransferTaskTree.vue:162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/TransferTaskTree.vue"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09883a32418a2bbcad350e0a9136f4872791d42192297a5625a607130d09a32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10 locations): apps/desktop/src/composables/useDataGridExport.ts:1607 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1650 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1678 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1702 \u00B7 \u002B6 more site(s) not listed \u2014 all 10 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaa9591f06ea380c52e93c731142c25a7748aa1adbc7d0b080282f5d3689042"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): apps/desktop/src/composables/useDataGridExport.ts:1661 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1689 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1713 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1741 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"489ff0f69f04373f1e0efebfd9dbe42193797f99884c275cf9bf1f44f6fe9729"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:213 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:272 \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":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a154dadf3104f732e45f0aa291c780a8b4b10faa50d715106617f521897d8d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:849 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:886 \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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d328b7192542a7c4b452a5cfb83af35e58158f8d220452df6a40dcfa91ec491"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:327 \u00B7 apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:341 \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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"939095d8cf003ff3cf8c9ebe7fc89cae5c5af1fe98c8c36d03e47c65c1f43d09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/ai/aiProposalDetect.ts:114 \u00B7 apps/desktop/src/lib/ai/aiProposalDetect.ts:208 \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":"apps/desktop/src/lib/ai/aiProposalDetect.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f8a0db06bb4448cfc12d45a1393252c9555fe75080ac634d12d48991fc96b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/ai/richContent/aiChartSpec.ts:139 \u00B7 apps/desktop/src/lib/ai/richContent/aiChartSpec.ts:241 \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":"apps/desktop/src/lib/ai/richContent/aiChartSpec.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d303c141300755fb8922522e98b6eaee9e9d5a2167d95b8362c688e35944e9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/backend/errorUtils.ts:70 \u00B7 packages/mongo-shell/src/json.ts:270 \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":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c39d9af5d0961cef6a1b0e7b149d6be9f6f13e364600081363d3e4f56fb8a09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): apps/desktop/src/lib/backend/http.ts:980 \u00B7 apps/desktop/src/lib/backend/http.ts:1029 \u00B7 apps/desktop/src/lib/backend/http.ts:3478 \u00B7 apps/desktop/src/lib/backend/http.ts:3698 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ef801c05609bc8796464bdf7b8df5a7f98d42c349b47f6469eaffb7ef0dbfd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): apps/desktop/src/lib/backend/http.ts:2732 \u00B7 apps/desktop/src/lib/backend/http.ts:2741 \u00B7 apps/desktop/src/lib/backend/http.ts:2754 \u00B7 apps/desktop/src/lib/backend/http.ts:2767 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0b03e9969f6ab8660490145af83534692e979141c6af29d99b675b8d42d2ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/lib/backend/http.ts:2741 \u00B7 apps/desktop/src/lib/backend/http.ts:2754 \u00B7 apps/desktop/src/lib/backend/http.ts:2767 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10c6ff290098d7cac153995d08b331a515c9449516131c599112c6392cc4aea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5876 \u00B7 apps/desktop/src/lib/backend/tauri.ts:6023 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5876}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa38e40f6119d449cedd61df4eabfec6885f006e3d7da1bd3bcd19f79212d4ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): apps/desktop/src/lib/common/clipboard.ts:240 \u00B7 apps/desktop/src/lib/dataGrid/cellImageUrl.ts:104 \u00B7 apps/desktop/src/lib/plugins/pluginHostBridge.ts:1909 \u00B7 apps/desktop/src/lib/tabs/tabResultCache.ts:551 \u2014 the 4 copies are spread across 4 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb313bba62438a02663bab95081641e2b74ece4aca0d2d9910e14c9012466ead"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionDatabaseInfo.ts:88 \u00B7 apps/desktop/src/lib/sql/sqlTextFingerprint.ts:1 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDatabaseInfo.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"229032696744d599d5ffc7740f2fe7dda45e3f9e790ce03ecc570c7ff15673fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/lib/dataGrid/cellImageUrl.ts:104 \u00B7 apps/desktop/src/lib/plugins/pluginHostBridge.ts:1909 \u00B7 apps/desktop/src/lib/tabs/tabResultCache.ts:551 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellImageUrl.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a7a2ba367db04407ada18ad1bfdef1e6d36411dbe00bdbebb8b244daff9e58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridDetail.ts:255 \u00B7 apps/desktop/src/lib/dataGrid/dataGridDetail.ts:278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridDetail.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d174c2c7c79077bdb5f425f1bd7774a5d3f3d5ad0afc4640d17fe37a8d815a40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridLargeValues.ts:81 \u00B7 apps/desktop/src/lib/dataGrid/dataGridLargeValues.ts:91 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridLargeValues.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace8d49f87e38d47ad259f8cff26e94af7aa795690b666c81cf0d81313ff3988"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridTranspose.ts:148 \u00B7 apps/desktop/src/lib/dataGrid/dataGridTranspose.ts:365 \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":"apps/desktop/src/lib/dataGrid/dataGridTranspose.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1623cd1b4923968bdc520cd8df7e7d273d853b62e840ca6d6ebbafbdab1a659"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): apps/desktop/src/lib/dataGrid/dataGridViewStateCache.ts:202 \u00B7 apps/desktop/src/lib/plugins/pluginUiHtmlCache.ts:26 \u00B7 apps/desktop/src/lib/tabs/documentBrowserStateCache.ts:92 \u00B7 apps/desktop/src/lib/tabs/redisKeyBrowserStateCache.ts:27 \u2014 the 4 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridViewStateCache.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5eb12d057d0e831265f9b90af9342aad6d1066d5c4cf74e74275c5c044a20c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/geometryPreview.ts:108 \u00B7 apps/desktop/src/lib/dataGrid/geometryPreview.ts:347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4cf4036ea71ef5352148eff815b773ba82b67c1e8afd00f7a19f57550215ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/regexGenerate.ts:145 \u00B7 apps/desktop/src/lib/dataGrid/regexGenerate.ts:154 \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":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2474835901b05789f8346bfeb438ef246277dfc9acbf53ebe464011558469cab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/lib/database/databaseUserAdmin.ts:151 \u00B7 apps/desktop/src/lib/database/databaseUserAdmin.ts:171 \u00B7 apps/desktop/src/lib/database/databaseUserAdmin.ts:328 \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":"apps/desktop/src/lib/database/databaseUserAdmin.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab29327b79dcdddf28fbfc69348b5ad669cf88dd50757e8acb5aff3fc3725620"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/database/databaseUserAdmin.ts:171 \u00B7 apps/desktop/src/lib/database/databaseUserAdmin.ts:328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseUserAdmin.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7090eee67006cdb8f3b69192322e78de9a33091dfc94e118f45982e379f4c70b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleSessionManagement.ts:103 \u00B7 apps/desktop/src/lib/database/oracleSessionManagement.ts:132 \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":"apps/desktop/src/lib/database/oracleSessionManagement.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09a8b4aefedc3ab1800295f525349caabd9c8781caee9f85e00c99821808d18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/diagram/engineeringDiagram.ts:221 \u00B7 apps/desktop/src/lib/diagram/engineeringDiagram.ts:234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/engineeringDiagram.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"405f51c35e13f7d298e31185c1dab5bab8a24eac988d2af7157eee7f3620cf7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/diagram/graph-store.ts:55 \u00B7 apps/desktop/src/lib/diagram/graph-store.ts:64 \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":"apps/desktop/src/lib/diagram/graph-store.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fa95746ecefc39e19a5002cc950fd98098117fdec3f38f0c7b7553964573f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/lib/diagram/match-storage.ts:7 \u00B7 apps/desktop/src/lib/diagram/match-storage.ts:21 \u00B7 apps/desktop/src/lib/diagram/match-storage.ts:35 \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":"apps/desktop/src/lib/diagram/match-storage.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d13cea92a51ba34f401c1de6025d2344d262fb4b3f747c77e23ad10f6a7ec9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/editor/codemirrorInsertValueHints.ts:88 \u00B7 apps/desktop/src/lib/sql/insertValueHints.ts:376 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorInsertValueHints.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd92f7c8bdf4c72f9141e76d0718d350ed2a516c6fda8f3d78b926fcac7e6852"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/editor/hoverTableLookup.ts:97 \u00B7 apps/desktop/src/lib/editor/hoverTableLookup.ts:114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/hoverTableLookup.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abe770b6c39363e2302a0380445ab60b042ade5960d845d87fd318f013b7623"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/editor/queryEditorNativeSelection.ts:561 \u00B7 apps/desktop/src/lib/editor/queryEditorNativeSelection.ts:689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorNativeSelection.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d85a2d8c4b7258fd0e4215300acfd6efad5f026867566dfd31750295fc47696"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/export/saveDiagramExport.ts:18 \u00B7 apps/desktop/src/lib/query/queryResultArchiveFile.ts:7 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/saveDiagramExport.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"073e5dee27dd6a1ce7692408f8c80f0385c19fedbf58aa4701afab4a2cba6e15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/lib/graph/graphCompletion.ts:183 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:7221 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletion.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1c0dca8387d3ddefc89de65f8d8fdb08f508d8ee93bef77469c071a8bf3666"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/kv/etcdDashboardError.ts:12 \u00B7 apps/desktop/src/lib/kv/kvMutationError.ts:14 \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":"apps/desktop/src/lib/kv/etcdDashboardError.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacbbab32a8775259afc489d87f827aba047de47b42d76918076d43ad4181b8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/metadata/metadataLoadBudget.ts:9 \u00B7 apps/desktop/src/lib/table/objectBrowserRowsLoadGuard.ts:29 \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":"apps/desktop/src/lib/metadata/metadataLoadBudget.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f312a57c6b4469b4d6ac8dc5f1d1f060a40c0a96b31bd0cb994ebe3450a518"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/lib/metadata/treeNodeLoadHandle.ts:56 \u00B7 apps/desktop/src/lib/metadata/treeNodeLoadHandle.ts:76 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/treeNodeLoadHandle.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"592a705d06899bc4a0182bff7e4a6a23f4b1f0ed77407a7fe5bc01d2f9903d98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/lib/model/modelTemplates.ts:10 \u00B7 apps/desktop/src/lib/settings/settingsTransfer.ts:513 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/model/modelTemplates.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78897ffb7bcec9b7e7465a301c8100b9ea36a088b5816c63e07cb65349e6ae5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:597 \u00B7 packages/mongo-shell/src/aggregate.ts:53 \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d47e5b3dc605b0b06c91a48c5fb100e227c2ad7542b2aa4589409e6c2d7664"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:1469 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:1570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e31abb4128922cb0799cd123723cb831c8d7007a0567097032618a14ce23949"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoSql.ts:581 \u00B7 apps/desktop/src/lib/table/routineParameters.ts:252 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf9d2034c0e355474c733649c292703937df90491cfba2b5aa6264b6144875d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/mq/rocketmqMessageUtils.ts:24 \u00B7 apps/desktop/src/lib/redis/redisCommandDocs.ts:65 \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":"apps/desktop/src/lib/mq/rocketmqMessageUtils.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb052bc2b8f3101c0dd3b00aa62d76b09a018dfe3fc79cbab442d5dc53e9013a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/nacos/nacosContentReplace.ts:185 \u00B7 apps/desktop/src/lib/nacos/nacosContentReplace.ts:235 \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":"apps/desktop/src/lib/nacos/nacosContentReplace.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfd6a54984218873eaaf59e10fd02ff6c43ea826314f4f279afb3f2e165da60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/lib/nacos/nacosDashboard.ts:44 \u00B7 apps/desktop/src/lib/nacos/nacosDashboard.ts:57 \u00B7 apps/desktop/src/lib/nacos/nacosDashboard.ts:74 \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":"apps/desktop/src/lib/nacos/nacosDashboard.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f02bd7701e1601f38d3637a6a472d14aee5bd7645acd90aa7d306fdbb962fb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/plugins/frontendPlugin.ts:93 \u00B7 apps/desktop/src/lib/plugins/frontendPlugin.ts:115 \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":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a857f7b56b1eac698dce92b8973b4cc4e8c3be99e1ab51e56027fb4ce85896"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/redis/redisQueryResult.ts:24 \u00B7 apps/desktop/src/lib/redis/redisQueryResult.ts:37 \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":"apps/desktop/src/lib/redis/redisQueryResult.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f6e22956ffb2b530672d99a2e5820a1586ba6724d7e16154f7f5c22513c094"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/settings/settingsTransfer.ts:752 \u00B7 apps/desktop/src/lib/settings/settingsTransfer.ts:796 \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":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80812eef6498429f68045522d030be4557dc990304a85959d8624f8b146129a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts:359 \u00B7 apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts:371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d568a9bb6e8070f908242fe0f9bcd0056d7d2a1edd49edb1568d6dfc5e82606a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/sql/cypherReadOnly.ts:7 \u00B7 apps/desktop/src/lib/sql/sqlServerQueryWrapping.ts:34 \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":"apps/desktop/src/lib/sql/cypherReadOnly.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d40c53bc19e3740667400c8df74cb6e952d12d9412ebe8d39c8fdc39acce01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/desktop/src/lib/sql/insertValueHints.ts:198 \u00B7 apps/desktop/src/lib/sql/semantic/model.ts:200 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed0dd3472cb04dafa0965c17e9fbeabdbc2519dcd7982b4ee4593694e342997"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:4925 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:4946 \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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4925}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1199502a2244931d50f5a831b8f6e77c410b0c10b1942a14b5900392eb54a69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlFormatterConfig.ts:184 \u00B7 apps/desktop/src/lib/sql/sqlFormatterConfig.ts:192 \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":"apps/desktop/src/lib/sql/sqlFormatterConfig.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab471855e0852c4b6497fa90314cd39c97f6255a87077b3423c8dfd41200ab0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:850 \u00B7 apps/desktop/src/lib/sql/sqlVariables.ts:219 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"105a53e08719e4ed7efe55c2d9508eba5e88f9c9212e0215f91704de16734401"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:607 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ca84fbfb1767ff408b3332d8ac788cf7d5adba45d7ff2102737a2905aaebc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleRoutineRename.ts:67 \u00B7 apps/desktop/src/lib/table/oracleTableRename.ts:87 \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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"53956e9cfd2aa4504e5b4e78b08b33a5f5cdfce60424c06b394954bc31a5aa25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/lib/tabs/tabPresentation.ts:342 \u00B7 apps/desktop/src/lib/tabs/tabPresentation.ts:359 \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":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f635d471acabf09a851499c121e21cb0ea8be95f0a89f705029a4d109a75f33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/lib/tabs/tabResultCache.ts:363 \u00B7 apps/desktop/src/lib/tabs/tabResultCache.ts:434 \u00B7 apps/desktop/src/lib/tabs/tabResultCache.ts:476 \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":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"125fcdd904a430adcdbc026c6ae076b84daa8b34ad147c0f741bb1a1acd24a35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/stores/connectionStore.ts:649 \u00B7 apps/desktop/src/stores/connectionStore.ts:665 \u00B7 apps/desktop/src/stores/connectionStore.ts:677 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5cba231705f40c7c9a084fd5eb9a827b207dd50300b6d1449d35e2cc74edf9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:6962 \u00B7 apps/desktop/src/stores/connectionStore.ts:7145 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6962}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9b789a65f9beb6578cb9615c0bd2ee00a6b883778704085ec129f32066856f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:9946 \u00B7 apps/desktop/src/stores/connectionStore.ts:9955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9946}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a64a36d49b7028f5ce7196adc362ccc3ae94e166cb1070e230023e6e4515a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/desktop/src/stores/connectionStore.ts:10126 \u00B7 apps/desktop/src/stores/connectionStore.ts:10147 \u00B7 apps/desktop/src/stores/connectionStore.ts:10202 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba6242f1591f863dfe0d2e45dc7076e18f1c308400bfa533b0fd4c61afa9be7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:11438 \u00B7 apps/desktop/src/stores/connectionStore.ts:11463 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11438}}}],"partialFingerprints":{"codehealthFindingId/v1":"3406f4bea170184d0ca9b2654e1c3999eca145af4b910667b9543f129d5abcc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:6432 \u00B7 apps/desktop/src/stores/queryStore.ts:6494 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6432}}}],"partialFingerprints":{"codehealthFindingId/v1":"8147689b157d9be2b48681f7136fff031d108e3d42b34e6bd1e8bc155be2b7bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:6449 \u00B7 apps/desktop/src/stores/queryStore.ts:6518 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6449}}}],"partialFingerprints":{"codehealthFindingId/v1":"31668bf2d0ef1a6034934c1c35398ed7879af9cc5a4cc55e7030bcee2cbebbc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:8320 \u00B7 apps/desktop/src/stores/queryStore.ts:8351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8320}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc51811a8e281c2a74a83546f0ff68ee36d30c8379caed7aae6fee92526f74ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:10408 \u00B7 apps/desktop/src/stores/queryStore.ts:10534 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10408}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c5d20faf98d96bd8392f0e5e2c2fc808f462e122b878dcc32cfa326dab05b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:10495 \u00B7 apps/desktop/src/stores/queryStore.ts:10693 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10495}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e6500e01c5417ced8e9ef97c6696ddbf61660e0dac48ef6539862c628a148d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:10553 \u00B7 apps/desktop/src/stores/queryStore.ts:10565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d92d8bdf7e4add618d961af40b4b690e5b8cdf1568793a46f52c70368e77b98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:10626 \u00B7 apps/desktop/src/stores/queryStore.ts:10755 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10626}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e57f1a6f517b1ca7eb37f59f62e06d9aff0877da506a2358c533abcbe554bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/App.vue:1157 \u00B7 apps/desktop/src/App.vue:1165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"31709e61cf2a9f860691464b14778c4f3ba8c52ee2b40517acb12b06de31fa95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/App.vue:1854 \u00B7 apps/desktop/src/components/layout/SqlLibraryPanel.vue:144 \u00B7 apps/desktop/src/components/transfer/TransferTaskTree.vue:124 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc0e8e79b88813ada270239295b7bb86d22876946885fb44ba03a057a7e8a4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/App.vue:2370 \u00B7 apps/desktop/src/App.vue:2404 \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":"apps/desktop/src/App.vue"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac0820b39d1666bff14989d6ac2bcb7b0abe4c665c66100ef04e402f02dcb12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/App.vue:5556 \u00B7 apps/desktop/src/lib/editor/sqlHoverLayout.ts:103 \u00B7 apps/desktop/src/lib/editor/sqlHoverSearch.ts:309 \u00B7 apps/desktop/src/lib/editor/sqlHoverSearch.ts:344 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":5556}}}],"partialFingerprints":{"codehealthFindingId/v1":"1766cc9a767382870e464422436d9bfc5aec27e0a64318244cffc0240a63dfc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/App.vue:1132 \u00B7 apps/desktop/src/components/layout/EditorGroup.vue:167 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"apps/desktop/src/App.vue"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb2f249f1af26c26d8deffc56cd038b1c5b8b900b0a1e5b002777039d9d9068"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/admin/DamengUserAdmin.vue:124 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:4426 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df0810eaeae96626d882d3cb823fd7930026185860b7d1f06c24319e341145b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/components/admin/DatabaseJobAdmin.vue:573 \u00B7 apps/desktop/src/components/admin/XuguUserPermissions.vue:514 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"6882dea4dce78c285564703352d0ef1db023c2c8b97d0c837f4b682ee2693d07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/admin/DatabaseUserAdmin.vue:69 \u00B7 apps/desktop/src/components/editor/EditorSearchPanel.vue:31 \u00B7 apps/desktop/src/components/grid/GridSnapshotDialog.vue:25 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c0a38644fcb547765ec07eb87ad066329d2c9dba85d3326594361942018fd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/components/admin/DatabaseUserAdmin.vue:288 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5676 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0474dee437c9d213aa2ae2ff2b49e8938073684859fc4944c273e84dd046616"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/admin/XuguServerDashboard.vue:50 \u00B7 apps/desktop/src/components/transfer/DataTransferDialog.vue:139 \u00B7 apps/desktop/src/components/transfer/DataTransferDialog.vue:243 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguServerDashboard.vue"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa4f581ebcdada50f3b7fc9b26b753812f80f859d01c452b22cd485d2ca6d73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/common/ElasticsearchJsonResponsePanel.vue:108 \u00B7 apps/desktop/src/components/objects/ElasticsearchIndexMetadataDialog.vue:69 \u00B7 apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:332 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/ElasticsearchJsonResponsePanel.vue"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3ff25d90b382b2429c782eb21f413c1ecf585190dd307a98398e711c8a9bdb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): apps/desktop/src/components/common/VirtualScrollArea.vue:141 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:3583 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:3657 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:2875 \u00B7 \u002B1 more site(s) not listed \u2014 the 4 copies are spread across 4 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/VirtualScrollArea.vue"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bd6a248ee6747ef6a1ef43e9c78d8420ab084f624797e7512085456eb27718"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 15 locations): apps/desktop/src/components/config/ConfigConnectionSelectDialog.vue:121 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:6202 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:6332 \u00B7 apps/desktop/src/components/diff/SchemaDiffObjectTree.vue:114 \u00B7 \u002B11 more site(s) not listed \u2014 the 14 copies are spread across 10 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/ConfigConnectionSelectDialog.vue"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d5b770cedbd4bcdfae8a80d59dbd91d2a09f7efc6c28e12c6a695dfad4e1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:200 \u00B7 apps/desktop/src/components/config/DriverStoreDialog.vue:915 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:1241 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:13679 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 5 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"10854dc4e659997a8b74d7eb859334d84cb5c7cd4197680f4991a30e4b47c4fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:217 \u00B7 apps/desktop/src/components/config/DriverStoreDialog.vue:914 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:1240 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue:78 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 4 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7316e2009649ef03471eeb3bb1b87aa1ea6ad98378353c7073a366fd656eef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:398 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue:73 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfef90afa9f61ebdf95dee748f62bf07aecaef0671b3a70dc502b5ff801e2e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:1198 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:421 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"832c7447bd2d2839edc83e546011960d24504d41abc2a7f35a8948631425212e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:4143 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:4150 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:4157 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a933ce799d3c3ab98c7bc252b7dd5ac226261f28be38563ea540f31cfa28b561"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:4174 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:4181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab21abb8ddcb4ecb7f490cf62d53c461e31c96eac7a98185d7f4f7999f5407c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:4199 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:4211 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc63dc678f539acaba4d01bb73725fcda33c07499e2bce88ca5dbbec68250e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:5580 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:5587 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":5580}}}],"partialFingerprints":{"codehealthFindingId/v1":"1490a409610c6f051259a9f5359a903ba5ac939f9cfa16f5e4f71f414250f0a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:5890 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:5898 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":5890}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7793736a7abc9b5bfbc8415219981b7f94cd6a1dca1b4881688da47b73bbe57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:383 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:392 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:618 \u00B7 apps/desktop/src/composables/useComponentUpdates.ts:56 \u2014 the 4 copies are spread across 3 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e74dfcb0b41962af37dece9ff15f231652b39206fa3a16fae73993d64d319f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/components/consul/ConsulAcl.vue:44 \u00B7 apps/desktop/src/components/consul/ConsulMesh.vue:22 \u00B7 apps/desktop/src/components/consul/ConsulScope.vue:32 \u00B7 apps/desktop/src/components/consul/ConsulTools.vue:17 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0f99864210ab66b119c26633e22fb848f5227a5a51e17f973b58bc090abb85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/consul/ConsulMesh.vue:29 \u00B7 apps/desktop/src/components/etcd/EtcdAccessControl.vue:23 \u00B7 apps/desktop/src/components/settings/McpDatabaseAccessDialog.vue:33 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0fcb199d6469cf753fbd7b0f7106a5898d3bfc78020e6493e5c2715fbd1037"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/consul/ConsulServices.vue:136 \u00B7 apps/desktop/src/components/consul/ConsulSessions.vue:83 \u00B7 apps/desktop/src/stores/queryStore.ts:882 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ca8ac253933b4d1f6e238c0fbc340a0aae0dbda4bc510d38de066ea8bc9313"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulServices.vue:217 \u00B7 apps/desktop/src/components/consul/ConsulServices.vue:239 \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":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b03c9c09a223cf2df1da2490cadbe01138e523121ca91cd8c8205b172060ed6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/debug/PlDebugSourceEditor.vue:73 \u00B7 apps/desktop/src/components/nacos/NacosConfigCodeViewer.vue:23 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugSourceEditor.vue"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a60d225b4c09c54cd2205fc28bfcd0b400e0613a671ce4a6bec405523c8b7b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:147 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue: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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6278805394d64f97c84dcfd4f5f05d74d64fb198fbac4999b8237ed984b6555e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:310 \u00B7 apps/desktop/src/components/diff/DataCompareDialog.vue:74 \u00B7 apps/desktop/src/components/diff/DataCompareDialog.vue:83 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:647 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 4 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a292c23928402881cd041af2fe7cfaf88ae71d902f62226a41d25901d7a7887e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:706 \u00B7 apps/desktop/src/components/diff/DataCompareDialog.vue:777 \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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec639bb10b5ba13407a8955067b785fd9ecb66d2dda51d1d868754af1bf8e056"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:1234 \u00B7 apps/desktop/src/components/diff/DataCompareDialog.vue:1243 \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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"325ce741e5cc46d16616363030e24bb6fe2623908a4893e2147097d27473c099"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue:69 \u00B7 apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue:76 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd997e7eb242319e0e834b5f8f923a609eb3f8decd515d04b229db4ef2a7f3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffObjectTree.vue:106 \u00B7 apps/desktop/src/lib/schema/schemaDiff.ts:1337 \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":"apps/desktop/src/components/diff/SchemaDiffObjectTree.vue"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ec2dd65138057f9c0ebedf844f991026e04c2255a9881e0ea399344156f819"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/components/document/MongoDatabaseDumpDialog.vue:102 \u00B7 apps/desktop/src/components/document/MongoDatabaseDumpDialog.vue:177 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoDatabaseDumpDialog.vue"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd641cdf90ebd4aa60655cbaa0fb15a38e37bfcec8350c63bd401971496cc7e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/dolt/DoltCellDiffDialog.vue:16 \u00B7 apps/desktop/src/components/grid/DataGridValueDiffDialog.vue:13 \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":"apps/desktop/src/components/dolt/DoltCellDiffDialog.vue"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9815c465ecc8b05dc9dd4c1e412c331902d686c91f31ba158fb50e49d4089119"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): apps/desktop/src/components/editor/AiAssistant.vue:1898 \u00B7 apps/desktop/src/components/editor/QueryHistory.vue:65 \u00B7 apps/desktop/src/components/kv/KvKeyBrowser.vue:279 \u00B7 apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue:33 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ba7575991917c70879edd4c5fb5c820fbb4598881a81b76c2c46ecd00c77b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue:409 \u00B7 apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue:417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1a9f295bee986305e61cc5fde2fcd919fe7382381ccb8843b3501010fdb4d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:7053 \u00B7 apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue:27 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7053}}}],"partialFingerprints":{"codehealthFindingId/v1":"a965b23496b09bf96e2d3931375f7edb78bd0d050c67d9ddd5e8e2c790eb72aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:7069 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:7078 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7069}}}],"partialFingerprints":{"codehealthFindingId/v1":"777c402af30e95760e200010e156eec8f5f38ddf243925a031ac2cca2b3f0b00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:7076 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:657 \u00B7 apps/desktop/src/components/transfer/DataTransferDialog.vue:136 \u00B7 apps/desktop/src/components/transfer/DataTransferDialog.vue:240 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7076}}}],"partialFingerprints":{"codehealthFindingId/v1":"3999bc13fbe6b8bd8dca726390efe8ed89bbb6a695426689ce6bd561f9cde054"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/components/editor/QueryEditor.vue:872 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:1198 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b21e990eeeb57bad57e1d32e20a22d6f089487e6b6d53b99bcef04c5de0ff6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue:63 \u00B7 apps/desktop/src/components/settings/McpDatabaseAccessDialog.vue:31 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6041115189fa9dd815919f9059c913425df2d6a1a91e6b9248545b1cf4f3b110"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts:466 \u00B7 apps/desktop/src/composables/useDataGridColumnLayout.ts:975 \u00B7 apps/desktop/src/composables/useSqlFileReorder.ts:32 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f90a6021ccc4f2254f2878f7c214bdfc079df96b3cdefd4cf33c712e4d1e43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/components/editor/useQueryEditorCompletion.ts:628 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:657 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:703 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:765 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f5ade901b6505905a5e73060f46abd003806c97bddde2c0e5e0b19a967d347"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts:157 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts:174 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ef847d00c1a236ee68a335dfbb1abf2e9aed038d08f7c71a2e2df9c3267a96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdAccessControl.vue:208 \u00B7 apps/desktop/src/components/etcd/EtcdAccessControl.vue:218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42c7cb74bc76fa21c49d9ab6ad0c9ebd406554ebd916b06020bd653003620ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdKeyBrowser.vue:163 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:149 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e72eea19cec585c4df8b0cec6060cef419b9941ba9bdbd653f5ed738f8c505"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7 locations): apps/desktop/src/components/generate/params/AddressParams.vue:77 \u00B7 apps/desktop/src/components/generate/params/CityParams.vue:81 \u00B7 apps/desktop/src/components/generate/params/CompanyNameParams.vue:59 \u00B7 apps/desktop/src/components/generate/params/DepartmentParams.vue:37 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/AddressParams.vue"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3945b6285cb97e01b21baec4fefe1938a44973f2d7b78383fe870a29d13e43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/components/generate/params/AddressParams.vue:27 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:228 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"apps/desktop/src/components/generate/params/AddressParams.vue"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd3ba75ebbc7cc56b1896cdbdd0bda61169ad43f6c26c146f86e71a332af1a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/components/generate/params/EnumParams.vue:4 \u00B7 apps/desktop/src/components/generate/params/ImageBinaryParams.vue:3 \u00B7 apps/desktop/src/components/generate/params/SequenceParams.vue:5 \u00B7 apps/desktop/src/components/generate/params/TimeParams.vue:5 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/components/generate/params/EnumParams.vue"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b2c3930bab403dddabd5acd8e7a9a13ff7b19d648aab9e692d73a1d10b5e9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/generate/params/EnumParams.vue:6 \u00B7 apps/desktop/src/components/generate/params/NumberParams.vue:8 \u00B7 apps/desktop/src/components/generate/params/SequenceParams.vue:7 \u2014 the 3 copies are spread across 3 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":"apps/desktop/src/components/generate/params/EnumParams.vue"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb31e2186e4608785bfc199b60fcac467bd4b6fd7885cb74df8dc4e32608ed2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/FullNameParams.vue:29 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:999 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/FullNameParams.vue"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c57ab3b9c5444f244ce2b90967257de88be42edfd83fbecd969ec0bf609de8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/IdNumberParams.vue:95 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:764 \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":"apps/desktop/src/components/generate/params/IdNumberParams.vue"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6ecd89d733a886e1c9e369511985232b55eae6b532096c2f135323f10a6917"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:1221 \u00B7 apps/desktop/src/composables/useDialogSources.ts:50 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b804ba2946ef1d33dbf9af45f47b1ec401953cd053c422342a6d7ee9c54d0fa8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/grid/DataGrid.vue:3508 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:3590 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:2828 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":3508}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37f595a1eff439dcd898f3145a7a91f6a86b1feb3abc76937292dc69e854854"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:11581 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:11607 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11581}}}],"partialFingerprints":{"codehealthFindingId/v1":"64efb80136e6e7b25440bdf4add2597f6e17a4fa60c860c0f507782d9608c560"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/grid/TemporalCellEditor.vue:68 \u00B7 apps/desktop/src/lib/dataGrid/dataGridTemporalEditor.ts:141 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/TemporalCellEditor.vue"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4993f687f3bb593375b3848eb903bbb7b060d251adb0650488aad14f74daafbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/import/TableImportDialog.vue:190 \u00B7 apps/desktop/src/components/ui/CustomContextMenu.vue:45 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc91eaa0f47644412fa6483cbee7cbc91ce6c3e781fcd0c87dbeaf2dbd45048"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/import/TableImportDialog.vue:663 \u00B7 apps/desktop/src/lib/dataGrid/dataCompare.ts:163 \u00B7 apps/desktop/src/stores/connectionStore.ts:9966 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"b689d43ca05b1e1e455f80d66f0c1de6dd196be1d4827029a44b9cf4347439c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/components/kv/KvKeyBrowser.vue:280 \u00B7 apps/desktop/src/components/nacos/NacosAccessControl.vue:63 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:305 \u00B7 apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue:34 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae38327330836fe7986c904c9efe2328949296a4bdcf75caf7b5ab9e35c4d461"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/kv/KvKeyBrowser.vue:288 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:274 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dbd47ee2bc43af1c92b6c573111cae932b636eff10c809853420a22ff55275"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/components/kv/KvKeyBrowser.vue:898 \u00B7 apps/desktop/src/components/kv/KvKeyBrowser.vue:913 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bb2a326dc7cb22b87001815159d5b1c8ef3047a2600ae4479ee993a0fe7459"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/layout/EditorGroupTabBar.vue:866 \u00B7 apps/desktop/src/components/layout/EditorGroupTabBar.vue:887 \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":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3fd66a0dda1cda6b7bfe02c1b11e651042869d33309efe32f7e10a22490a22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:209 \u00B7 apps/desktop/src/components/layout/SqlLibraryPanel.vue: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":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc032fe16c9736816b0c55c778da55170320ffd5f515cc7ab69735b52c1dcbd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:352 \u00B7 apps/desktop/src/components/layout/SqlLibraryPanel.vue:361 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:5251 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2915 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"553b0de14ea13fde4d1b1d0cc236adb7213214f20ec758e824d98d756668742a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue:73 \u00B7 apps/desktop/src/components/objects/CustomTypeInfoPanel.vue:31 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"479a73aa9a7e66e43147ea6ed663d496d2489208f3800dcb210b3c6575c5d11e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/meilisearch/MeilisearchOverviewPage.vue:20 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:433 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchOverviewPage.vue"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ae569f415f773a852f4fa55b8121f6b5346260270dcad679776a46c4f3ced8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): apps/desktop/src/components/mq/SendMessagePanel.vue:32 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:674 \u00B7 apps/desktop/src/composables/useDialogSources.ts:58 \u00B7 apps/desktop/src/composables/useDialogSources.ts:83 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 3 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a6d440434a6bca6f781d1e30eadd6202edfdadf10593b41f097a576a407a7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/mq/TenantsPanel.vue:166 \u00B7 apps/desktop/src/components/mq/TenantsPanel.vue:178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"00eb2e8b6a4c182490d2dc415efce0ec200d5ba50b1ebd74a4b17adb9855c1a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue:116 \u00B7 apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue:124 \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":"apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d55a71c05b9c2f948b32a3d34ca63bd3ed758df048274b67fdfb547a64052f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/mqtt/MqttAdminConsole.vue:162 \u00B7 apps/desktop/src/composables/useExportTracker.ts:254 \u00B7 apps/desktop/src/lib/app/windowContext.ts:42 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"936f0e2ccf727bcb5d2f0ec0dd0369c8b9210efa753a26a5a6e8e84e87ffb4f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/mqtt/MqttPublishDialog.vue:28 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:230 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"11db45787c2085ae58185bd3581dd153f5574514386a136ba63dc6c261747fe6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAccessControl.vue:56 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:147 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"34634bb53f31e20a9c51cbf7eaacedd9eba3c02e1002211fc0e8ed9c2094eac2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAccessControl.vue:357 \u00B7 apps/desktop/src/components/nacos/NacosAccessControl.vue:366 \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":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b507b3125b45ef42dae9a8adfdff2e099912c69531b24ac4a039df6f68554c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAccessControl.vue:396 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:339 \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":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d96a1969e86969d54b9d6faa60e5f83090b366d5c00262783dd6b3ac88b2681"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:150 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:263 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e921bd229d432b0d1857b6815344ab593d2aafa633409309fcf5a5078a17e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:225 \u00B7 apps/desktop/src/components/plugins/PluginContributionsPanel.vue:137 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda3bf2869b05cd8889a3dfa0b9cec730b73131278b2633df071e2af58fadb31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:237 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:139 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f46dd1a19ca11d189d83e9ed89cc98a3503b4286596c43976802debf4034edc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue:36 \u00B7 apps/desktop/src/stores/historyStore.ts:25 \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":"apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"60994f14a535d5eb0e68a190408e999ee6a5a6cc5131bbe057a2337fa20ae08c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:310 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:324 \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":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5761ad8ab58a33c8256b85abaabb2cfc2c1f04ff79d769d8ab711d07181da224"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/objects/DatabaseBrowser.vue:302 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:4609 \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":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38b7f25e77cb604d8a16460b9f5a8c45b400afd14875b37ef5093ab58b6ca31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/objects/DdlViewDialog.vue:65 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:335 \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":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d92f682674c963ff5aa50d68a95342e685fd883fc64d889dde1eaab3c137204"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/objects/MySqlEventEditor.vue:39 \u00B7 apps/desktop/src/components/objects/MySqlEventEditor.vue:46 \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":"apps/desktop/src/components/objects/MySqlEventEditor.vue"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a111aa48fd831c5c722c5a865a2e5a2b7c3a5b03e984c4ba3e0d1edff2e41af2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:389 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:206 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dc2a40be74c0367eb950050d1317b3c521e0da6f909069315cded417a1e651"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:431 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:137 \u00B7 apps/desktop/src/stores/historyStore.ts:24 \u2014 the 3 copies are spread across 3 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb9befc38daa877f291183b89165d5557ac4c55fde043e2b20d3c97fbe27025"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3396 \u00B7 apps/desktop/src/stores/connectionStore.ts:11539 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"15559b48040d043948e12d92230e5a7c1d2a71d431d5a5f7f47ceb92a6d907dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3865 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4974 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"721a7f26236e9f519f07922410057c4c3de549fae4c94fdcf8a6aff3fecd61d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3886 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4995 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3886}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8ca849e73b05030eaa55d10d3b593253f89e6ace9f49a632c2a7c98dc6d2c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:5141 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:5242 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8816e83b9ba2719706d305e58da7d9630e3765417da034d0f3e968503b0ed8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:6394 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:6435 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d08ee959c64b3550d9a025b0521125ca675a0747c52ce7f40d9166d81f23135"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:6413 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:6424 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fea4c173898b4fa3f9480c9ef0c9ca9debe3cd143852b011bfe9df8864c3444"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginAiAccessSection.vue:36 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:759 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginAiAccessSection.vue"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7626b794d65615ece1a758def6c436b5282d04c984f5c83363ffcb531109d047"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:233 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:808 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1df69ead23bb327cca6ff88616f967f9b8c914f581385a7a58a2b35618d8d40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisKeyBrowser.vue:3001 \u00B7 apps/desktop/src/components/redis/RedisKeyBrowser.vue:3008 \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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":3001}}}],"partialFingerprints":{"codehealthFindingId/v1":"009816db654d12181d7116091f639d36f443d3c1abc8a79745aaa8dacf0b1ffd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/redis/RedisValueViewer.vue:2101 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2928 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:3032 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4917ea2f9bf6e3b1318c929e9d98e6256c2be4c8e5def922834c0a68a70dfdc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisValueViewer.vue:2697 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:2764 \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":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb83e0c6cb586cbf389f58859a455072d730a362527b6b2798c6ef58ea5a8e08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/settings/McpPluginScopeEditor.vue:32 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:2336 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpPluginScopeEditor.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7955d37a8fe86df16231f4d94db2df68b7a15fbfd480388cf574df81d04d78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/settings/WebLoginCaptchaSetting.vue:17 \u00B7 apps/desktop/src/components/sidebar/VisibleSchemasDialog.vue:40 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/WebLoginCaptchaSetting.vue"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee342a91179d0bcba97cd72103b60defa2acd81253c41e28eeb55d2966e3e09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/ConnectionTree.vue:2925 \u00B7 apps/desktop/src/components/sidebar/ConnectionTree.vue:2935 \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":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd9f28416947e50ac89d9cacc30b4afe58c603f1dc6950d37214a2d2c0fbc26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2201 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2249 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2261 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2273 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"672f731c6d52fd6df60a751975774810dbb8646536f6adba2957b4e21119a861"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2925 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:3029 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e24293d25f4120fbb18423fb83052f7297e75d8db1e17d416033528096f359"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:3378 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4854 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4871 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5216 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3160e521d273729a890866cf2049f97d47c5f3531ff17e8a04a9997cd36433eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:3424 \u00B7 apps/desktop/src/composables/useSidebarTableMutationRuntime.ts:178 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"02804914d4cf9a74d76982da834dc225254685a30b3e191bdbb5eda48fe60257"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4833 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4862 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4833}}}],"partialFingerprints":{"codehealthFindingId/v1":"145e24691c1aca310c5125b8ec292488859ec48cb8c14bb3f87f1b3534a5e474"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5048 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5872 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5048}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda50b5d8753f3e6b376adc2ba14f364c560bd690a580be258421c0760d5d144"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5971 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:1055 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5971}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d52d41031e9866f98d9cc226d4df7f8c3a33a066aa3bfd9396a1af7e72d660c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8767 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8817 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":8767}}}],"partialFingerprints":{"codehealthFindingId/v1":"299c6f458d9ac9d74873a4bfe307873d8b93381246d528c71585889cfc399093"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:9192 \u00B7 apps/desktop/src/lib/plugins/pluginContext.ts:107 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":9192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e00aa130cb4d249061418ebbb2da27793fe9ff3a15b40b24eb02a3737783ebf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/TreeItem.vue:1087 \u00B7 apps/desktop/src/components/sidebar/TreeItem.vue:1095 \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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aef07c4e3ca7ee78293619025ab431c0ffefa6c94d074c0de5a66d3c59df031"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:91 \u00B7 apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:103 \u00B7 apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:123 \u00B7 apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:137 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea466e266d291eff109ec993e6851f716afa429df55c2288c45b2ca388d1e2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:104 \u00B7 apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:124 \u00B7 apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts:205 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/sidebarTreeDialogState.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c69655132718dc2c6f0f2535065787a51016e44b7ee466194e2f7a633bba14e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue:921 \u00B7 apps/desktop/src/lib/backend/tauri.ts:6907 \u00B7 apps/desktop/src/lib/backend/tauri.ts:6959 \u00B7 apps/desktop/src/lib/backend/tauri.ts:7058 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ec2aff70054ac7a1234712a78200d73c335ef724bf8f0889a2637bda6e1583"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:2317 \u00B7 apps/desktop/src/components/ui/LightDropdown.vue:78 \u00B7 apps/desktop/src/components/ui/LightDropdownMenu.vue:90 \u00B7 apps/desktop/src/components/ui/LightTooltip.vue:29 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78b0c6cadb876f85440e09f3c7650ef69e99d50b275782906e8a5df852d5491"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:3621 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:3655 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:3710 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef15671b04e3623df8f5cd1480b1b78b3eb7ead3691850d39f664c65643ee9f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6492 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6502 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6492}}}],"partialFingerprints":{"codehealthFindingId/v1":"275ed7398f804102a62534c9581c87dbbf90ea77bb8a3b93d2f27bc71581fa39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/components/transfer/QueryResultTransferDialog.vue:264 \u00B7 apps/desktop/src/lib/model/modelRendererRegistry.ts:220 \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":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87f5af2b7de16730c70c26499665414ffe815d4826a5218532fdaca1a67a973"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/components/ui/date-time-picker/dateTimePicker.ts:27 \u00B7 apps/desktop/src/lib/database/xuguUserPermissions.ts:517 \u00B7 apps/desktop/src/lib/influxdb/influxDbV1Delete.ts:148 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/date-time-picker/dateTimePicker.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"92717a56882ff1ef19c33519033d09c30d416310689b09caad20313f0a1433fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridCellDetailEdit.ts:177 \u00B7 apps/desktop/src/composables/useDataGridCellDetailEdit.ts:239 \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":"apps/desktop/src/composables/useDataGridCellDetailEdit.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f8771305bb45ea6c6e2a23f3b354023afa43ce81dd04049c520685ef1f3931"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridEditor.ts:764 \u00B7 apps/desktop/src/composables/useDataGridEditor.ts:772 \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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd470c70a87872641b986d329a76992749292059817ddfce11c1164ee7958e3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridLargeValues.ts:601 \u00B7 apps/desktop/src/composables/useDataGridLargeValues.ts:745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ba028ce4b2e30cec49a2273c344a6ff124540383743ac6e1fc8c1a05df9d4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridSelection.ts:767 \u00B7 apps/desktop/src/lib/dataGrid/dataGridSelectionPersistence.ts:126 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c91a54adea5c80eb4a7afd47f7a2f93813b24f81469ad922a1bbc1b8b8ce78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:104 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:439 \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":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"422fb3a21409b27a24f55d94a004f9bd29b6250d83627ca6ae430f10ad3f59e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:130 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:359 \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":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d30d3d7ff554cc3cf142521463596569e6758410ad3d8d2baffb9b89050522"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:593 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:637 \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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb869bb45fe9cc26f0c244ad17455e465408d24007850ecb70e2098c3188182"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/composables/useSqlExecution.ts:769 \u00B7 apps/desktop/src/composables/useSqlExecution.ts:786 \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":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8105a9bf559cb9f5ce2fb7a5eba6e121d6ce02f640a2919cd0b055d1cee777"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/composables/useTauriEvents.ts:41 \u00B7 apps/desktop/src/composables/useTauriEvents.ts:118 \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":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e979d8225cb185df85f021def3345b7df28f9fc44a5472c1bcdcc408dada500"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/ai/aiProposalDetect.ts:150 \u00B7 apps/desktop/src/lib/ai/aiProposalDetect.ts:164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiProposalDetect.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"425066817e00fd9c24182652a77ae2b7141f7b3e857b09fb0aa12671eee805aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/ai/aiTypography.ts:26 \u00B7 apps/desktop/src/stores/settingsStore.ts:310 \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":"apps/desktop/src/lib/ai/aiTypography.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfce84ba46b8ee52c4b6aebb10f449855a094476e2cadf86c9b283bb0e00b2d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/lib/ai/richContent/aiChartSpec.ts:124 \u00B7 apps/desktop/src/lib/dataGrid/chartData.ts:3 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"apps/desktop/src/lib/ai/richContent/aiChartSpec.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88dbbff70e06a07e359a8e577f9e58749b2f1b72b08c2d45bc4155e94eb17fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:432 \u00B7 apps/desktop/src/lib/backend/mq-http.ts:59 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"715e266e31e7af4dd72f08a7b2253cff197b6316c838f86c0952d6a843afc424"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:865 \u00B7 apps/desktop/src/lib/backend/http.ts:877 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbc50f28764216ab1a6a3647b46987cf632ed3033a1b0e7041ccce1d80f7e37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:923 \u00B7 apps/desktop/src/lib/backend/http.ts:936 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b243bad9b9ce56f41270876596c0de4237a9b13ed7ad0d86bc4ee50fdefe95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): apps/desktop/src/lib/backend/http.ts:3404 \u00B7 apps/desktop/src/lib/backend/http.ts:3599 \u00B7 apps/desktop/src/lib/backend/http.ts:3712 \u00B7 apps/desktop/src/lib/backend/http.ts:3754 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c695afcb5dbc32121b90f3e5d29f243f26168b03d895fed0a3e039694c4f63af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/lib/backend/http.ts:3710 \u00B7 apps/desktop/src/lib/backend/http.ts:3752 \u00B7 apps/desktop/src/lib/backend/http.ts:3801 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3710}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e9f46de5dadb8e110a9c0c94503301ad331dbf867985e02fc25722369a8c51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:3756 \u00B7 apps/desktop/src/lib/backend/http.ts:3807 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"321a957e710148342e2912f2ac9ecb3bf229952d310e50e322ddeb6fd6368123"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5187 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5161 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3cffa6eac873653de78d65173df0e19c677a9aa63f9875b67b2e25bed1385d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5206 \u00B7 apps/desktop/src/lib/backend/http.ts:5259 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5206}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e2cd78eb66066d74a9cad5899bca34505f1c0c5a9c0d3bec7685ffac68c86a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5275 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5258 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f97bbb0906a993e35ff950da54e42679e242de61151417c6f19c6348c317b03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/backend/mq-http.ts:77 \u00B7 apps/desktop/src/lib/backend/mq-tauri.ts:66 \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":"apps/desktop/src/lib/backend/mq-http.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d75d80e5e34746816bf860527803db466a890cc4a79b5f38aec28f1adbe3b71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/backend/mq-http.ts:200 \u00B7 apps/desktop/src/lib/backend/mq-tauri.ts:193 \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":"apps/desktop/src/lib/backend/mq-http.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e217c24d7e13e0fe2cc165ea989702e78c60a89f07fc906f02d7fc05801cc69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/common/safeJsonFormat.ts:550 \u00B7 apps/desktop/src/lib/common/safeJsonFormat.ts:559 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d1a46f38de63eb4f5530be000594e2f520710f8cbd5497c90f78b3faea11db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/connection/recentConnections.ts:6 \u00B7 apps/desktop/src/lib/mq/mqTenantForm.ts:5 \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":"apps/desktop/src/lib/connection/recentConnections.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17173484a3c4679a2b21e4dab1858c6652ba63d771bacf9d8d58460fe0fdc38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/connection/timeoutLimits.ts:29 \u00B7 apps/desktop/src/lib/connection/timeoutLimits.ts:39 \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":"apps/desktop/src/lib/connection/timeoutLimits.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d266a1f0df97df44df03aa12a0bdf7001108c6da5f49770bc42b091cc4d9ce9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/connection/xuguDatabase.ts:3 \u00B7 apps/desktop/src/lib/database/databaseUserAdmin.ts:779 \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":"apps/desktop/src/lib/connection/xuguDatabase.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb52430a6e47fef394c227d7456a33b97b1367da2eb424b2b44614796d0c49f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/chartData.ts:3 \u00B7 apps/desktop/src/lib/dataGrid/gridSelection.ts:127 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/lib/dataGrid/chartData.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfdd6918ecc59ff9ccb74d81342e8c22822935a338741fa6f093bf78955454b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts:243 \u00B7 apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts:252 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a868dcec55110fd0931c1f233e54b95c1dbfdbd4b8b0d18e25429b2572f428a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/regexGenerate.ts:248 \u00B7 apps/desktop/src/lib/dataGrid/regexGenerate.ts:255 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2b36c8615188d47eb4687ed2c00ec3abe78c0dbeb5c39c29eb3574a06a7923"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/database/damengJobAdmin.ts:175 \u00B7 apps/desktop/src/lib/database/damengPrincipalAdmin.ts:573 \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":"apps/desktop/src/lib/database/damengJobAdmin.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8db98d1e402f72086dba11c21784d0cfe794bf2687abfc8fa64469ab406b61e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/database/damengSslOptions.ts:52 \u00B7 apps/desktop/src/lib/database/hiveKerberosOptions.ts:74 \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":"apps/desktop/src/lib/database/damengSslOptions.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fc7003a7c367969283718be2cac9cb4273255a27d62dd0099340f3f6c72526"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/debug/plDebugComposite.ts:120 \u00B7 apps/desktop/src/lib/debug/plDebugComposite.ts:130 \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":"apps/desktop/src/lib/debug/plDebugComposite.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f91d196878578ac5874ec14cdbc42b50a4d7fbf640f71218adc0754177d3f95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/lib/diagram/elk-layout.ts:125 \u00B7 apps/desktop/src/lib/diagram/ltr-auto-layout.ts:152 \u00B7 apps/desktop/src/lib/diagram/size-layer.ts:54 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/elk-layout.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e0943fb0eec37d990a8dac4204259f153d760e6605915ab0e2cf51e4e0a1b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): apps/desktop/src/lib/diagram/match-engine.ts:62 \u00B7 apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts:658 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:2673 \u00B7 apps/desktop/src/lib/sql/semantic/cteNavigation.ts:168 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/match-engine.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"879aa171385268dc662638bb029850aa38c408d118c352cc38b310ed377c4c9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/editor/queryEditorLineComment.ts:39 \u00B7 apps/desktop/src/lib/editor/queryEditorSelectionCaseShortcut.ts:6 \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":"apps/desktop/src/lib/editor/queryEditorLineComment.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba34e32bfee087cc24e7598cf48fd958dd1ae7d1ac575c07e1d8ced926889374"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/lib/model/modelRendererRegistry.ts:51 \u00B7 apps/desktop/src/lib/model/modelRendererRegistry.ts:63 \u00B7 apps/desktop/src/lib/model/modelRendererRegistry.ts:75 \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":"apps/desktop/src/lib/model/modelRendererRegistry.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d68c59ed9559e53b94d3e5ce36b81955b52c0210d66b4fd93eaa6161e3c7ff2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:897 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:989 \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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3d82fee20a3a61d406fb3d69ae5897deacba3cb84b03ef8ff5e7d323e8f16c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:1215 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:1312 \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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"899f8bbe945ecab4d643f83dfd85512ded82515325282cdb695c502899a30cf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:1684 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:1696 \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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f8d9d9776cf2fc07de1399f202025d1b223a5fe2ca2534385f2b73b788efd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoFormatter.ts:149 \u00B7 apps/desktop/src/lib/mongo/mongoFormatter.ts:161 \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":"apps/desktop/src/lib/mongo/mongoFormatter.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf02d5d89ea6d6ce5d26187cda14421878822b8c8a32f99a70b12182ee2c20a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:378 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:436 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:640 \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9876c645e288350d3dfab526807251b83e080d9dd2cae582e5b5c674d50e0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:474 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:524 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:540 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:556 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c935ae62c3fd3de4b863f235559e92db750f44c684571346b6d81ed9993c03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:625 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:677 \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d701ed6ca908d867df4e4c976d5c1680870c1c56c20d6f82ebe973ffcc8082"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:688 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:717 \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5cb3408c0afc007b51e61e59c87cf33ed5891040b5b4f338457b5917f0213e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:763 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:1148 \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a70ddb86d3c0544d8332ab37f3f42ce7d029c63d002fc0237b42fccde7a1228"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:938 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:949 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:986 \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cea341b6067fde686a9021caddbf66a74dacb667e1aa3a897d668ceaaf0af59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/nacos/nacosConfigValidation.ts:36 \u00B7 apps/desktop/src/lib/nacos/nacosYamlDiagnostics.ts:168 \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":"apps/desktop/src/lib/nacos/nacosConfigValidation.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cc4a29c6e4e23ecd790ffb728ae303efcf62ea3b86d45e087c3fab954e40ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/plugins/pluginHostBridge.ts:1759 \u00B7 apps/desktop/src/lib/plugins/pluginHostBridge.ts:1833 \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":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1884943fe0a48f2ee70a24579ed638bccc4476a75bac75a35baf1549b4f5ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/redis/codec/javaSerialized.ts:493 \u00B7 apps/desktop/src/lib/redis/codec/javaSerialized.ts:509 \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":"apps/desktop/src/lib/redis/codec/javaSerialized.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a1fd5202cd1bbe523e8a893e501d9ca868403f3216f5822e46abce86d49f98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/redis/redisCommandPreview.ts:257 \u00B7 apps/desktop/src/lib/redis/redisCommandPreview.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":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b8487e8430bd53f9d473d7194b85c902571a70537bc848ab594c73f07caa83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/redis/redisKeyGroupIndex.ts:48 \u00B7 apps/desktop/src/lib/redis/redisKeyGroupIndex.ts:216 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyGroupIndex.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb40c8b37d75b74b6c642cde19d395541c44317c9e763fbc02e2e3377554c8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/desktop/src/lib/settings/settingsTransfer.ts:524 \u00B7 apps/desktop/src/lib/sql/sqlFormatterConfig.ts:249 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"f930d74d2791c89cad2a2bf29a15fcf67b44da507b99516ed509a422ce5df936"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts:332 \u00B7 apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts:356 \u00B7 apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts:368 \u00B7 apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts:379 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84c9895f34b6454afaa04171c6013a313d219adebe08b9c3060b08f361fd034"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarLayout.ts:321 \u00B7 apps/desktop/src/lib/sidebar/sidebarLayout.ts:342 \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":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5124b5a61c61fea56e9f938a07f6175039d06ca3f151723cf3e383a42344704c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/sql/externalSqlFileTarget.ts:77 \u00B7 apps/desktop/src/lib/sql/externalSqlFileTarget.ts:91 \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":"apps/desktop/src/lib/sql/externalSqlFileTarget.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"49570cd56487426c567a31bdaae38e4de2dd8e5b0bfebc7d4fc5082d41f085ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts:181 \u00B7 apps/desktop/src/lib/sql/oracleSyntaxDiagnostics.ts:223 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:2005 \u00B7 apps/desktop/src/lib/sql/sqlVariables.ts:421 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7bbec22da397ee648ed13356a9a0495f7e036a553b5a39ca0bdf79a5daaaaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/sql/queryError.ts:6 \u00B7 apps/desktop/src/lib/sql/queryError.ts:19 \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":"apps/desktop/src/lib/sql/queryError.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aff5ea3e88780b18dce4355cfe09b0b5efda58b73f81aa9ac6ddb31d907bce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/cteNavigation.ts:225 \u00B7 apps/desktop/src/lib/sql/semantic/cteNavigation.ts:235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/cteNavigation.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05432a2a36114a1ab638811eb21a4e2e4b4d65c95c77d788bba82560304b447"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/model.ts:879 \u00B7 apps/desktop/src/lib/sql/semantic/model.ts:978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4600db0f06e082fd120b491935b5617d42ede9afa35cbab5ebe5c56317c43e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlAnalysis.ts:440 \u00B7 apps/desktop/src/lib/sql/sqlAnalysis.ts:558 \u00B7 apps/desktop/src/lib/sql/sqlAnalysis.ts:594 \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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"7933c5db8e3dcc5e3be1edc16cfeb1f384c9652d25d2d2211ebbb709a81ea439"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:4806 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:4860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e657bc56851ccefbf94bf38530dc73d8d7019d80c8d917800942af0b880d62fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:5431 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:5731 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5431}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bc7a377d8c4602fc30f8e28aa13b9e0579e61d15e8bc505fa1a420ade8a599"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlDiagnosticAnalysis.worker.ts:3 \u00B7 apps/desktop/src/lib/sql/sqlStatementAnalysis.worker.ts:3 \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":"apps/desktop/src/lib/sql/sqlDiagnosticAnalysis.worker.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafbef1629c076cc5c78224a2d5ff18dddadbd179e1ef0d0e2d34dd30b4f7324"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlNavigation.ts:452 \u00B7 apps/desktop/src/lib/sql/sqlNavigation.ts:482 \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":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bacd12b4ad8903f09d626b87d4889ea9a1debeb882a001ea0d359d38c9ab1a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:1546 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"409df91ba8e0a5b08636f488795434a3ae9bf2fd12327006f4193e2e7c2aad6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): apps/desktop/src/lib/table/objectBrowserRowsCache.ts:74 \u00B7 apps/desktop/src/lib/tabs/documentBrowserStateCache.ts:104 \u00B7 apps/desktop/src/lib/tabs/redisKeyBrowserStateCache.ts:37 \u00B7 apps/desktop/src/stores/connectionStore.ts:3850 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRowsCache.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d83bae45b9ff643923f162b65039ba09d91db20df139f48e37cc2644fb5720"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/table/routineExecutionSql.ts:111 \u00B7 apps/desktop/src/lib/table/routineExecutionSql.ts:139 \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":"apps/desktop/src/lib/table/routineExecutionSql.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e59051d54062d6547b6d2ae238e8b0255f09b4bb303a4da861e17c20ac2e160"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/table/routineExecutionSql.ts:135 \u00B7 apps/desktop/src/lib/table/routineExecutionSql.ts:169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineExecutionSql.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d1dfe204515ced662aef28ff157bd021a9249490deedb8b265d2dc8c5f0207"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/lib/table/tableTree.ts:744 \u00B7 apps/desktop/src/lib/table/tableTree.ts:1075 \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":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd84eb2ca09c1cf86ddef5249ababb227eb33c85580c1dd491f3ca4bb4488a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/desktop/src/stores/connectionStore.ts:2300 \u00B7 apps/desktop/src/stores/connectionStore.ts:2314 \u00B7 apps/desktop/src/stores/connectionStore.ts:4722 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"938f049bce8b91f714646d0c24647684b3402d8f57a045bc32a82400b13812a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:3148 \u00B7 apps/desktop/src/stores/connectionStore.ts:3432 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"958acfd8f201ac40722976bfbf8948acca1ad42be2205b4ddd50348f04ade2b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:6522 \u00B7 apps/desktop/src/stores/connectionStore.ts:7454 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6522}}}],"partialFingerprints":{"codehealthFindingId/v1":"972ebd02374588e77bc16f7fd4793ef050636ca7b87e412ad3e09c00d80cf547"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:10238 \u00B7 apps/desktop/src/stores/connectionStore.ts:10300 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10238}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ddf9dc47744c9cb1dab5928d859eae934cd198ef9b4d056516cff68cca84ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:11620 \u00B7 apps/desktop/src/stores/connectionStore.ts:11704 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11620}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b799349751f19cf0619f03b899de595e7cf4b0b0154e2e03693a82d763b30a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:2273 \u00B7 apps/desktop/src/stores/queryStore.ts:2285 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13d4b93b56012fc48cbb8578ed3fb5cbc0e6213cc6c617d4d67dcb54edca105"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:5430 \u00B7 apps/desktop/src/stores/queryStore.ts:5489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a465aef6a9500df4068709b2a5722922c219ca649a27eccf924f1d629cd18e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:10615 \u00B7 apps/desktop/src/stores/queryStore.ts:10747 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10615}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56f3b54686f099daf972243e6ecdb550e567cd4b89469324c70e0d89e8566ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:10696 \u00B7 apps/desktop/src/stores/queryStore.ts:10750 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10696}}}],"partialFingerprints":{"codehealthFindingId/v1":"491a2c07c77c92aadc92aad5914590c6fa3e0070ef8d3ab792ec129662783d68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/savedSqlStore.ts:1001 \u00B7 apps/desktop/src/stores/transferTaskStore.ts:424 \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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12218ff2b5b1c40cb1adf94c357a14e376afa94f467006c3c5219067821113f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/savedSqlStore.ts:1179 \u00B7 apps/desktop/src/stores/savedSqlStore.ts:1190 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f576d593796659ce7928ee767a60c88d48129e8e258b04eb0d165df8c94f4b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/settingsStore.ts:1828 \u00B7 apps/desktop/src/stores/settingsStore.ts:1838 \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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccb4941eb72c8c2ebb56032102673def6a5b15fe6bfc20277ec36a321feb9be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/desktop/src/stores/settingsStore.ts:2192 \u00B7 apps/desktop/src/stores/settingsStore.ts:2210 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3079c820711e8326dbc79d07b9be949fea27371e0bff9f665ba4823b83645bfe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/mongo-shell/src/json.ts:600 \u00B7 packages/mongo-shell/src/json.ts:615 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3e6b8670cde9aba99b1349f4f0d683514206ed8524c940af95c6390d3bb622"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): apps/desktop/src/components/admin/DatabaseUserAdmin.vue:142 \u00B7 apps/desktop/src/components/admin/XuguUserPermissions.vue:60 \u00B7 apps/desktop/src/components/consul/ConsulTools.vue:32 \u00B7 apps/desktop/src/components/editor/AiAssistant.vue:1408 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f382b8ee3e9ff263cff93b378239120c9ea6d324255fecc2225370007907e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/admin/ProcessListPanel.vue:213 \u00B7 apps/desktop/src/components/admin/ProcessListPanel.vue:265 \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":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd51ad4f667e034ee9314754e1a412c93be97ba01b4b0b693bbb69634eb74bde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/admin/XuguServerDashboard.vue:212 \u00B7 apps/desktop/src/components/admin/XuguServerDashboard.vue:218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguServerDashboard.vue"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"045f24c803ca85a0cf4b13201c8c29f76be429e7ac85abc1c2744739f451a6af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7 locations): apps/desktop/src/components/common/VirtualScrollArea.vue:11 \u00B7 apps/desktop/src/components/config/DriverStoreDialog.vue:206 \u00B7 apps/desktop/src/components/config/DriverStoreDialog.vue:222 \u00B7 apps/desktop/src/components/dolt/DoltVersionControl.vue:127 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 6 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":"apps/desktop/src/components/common/VirtualScrollArea.vue"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9efbe77797e6b9980c29b71744ceb758076f38dc0138a063f038b85ce3c89c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:1102 \u00B7 apps/desktop/src/components/config/DriverStoreDialog.vue:1111 \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":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"61766331de0536c77f9459972b86dac5afd7222e4d1aa0c49d48a173e201fef6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:911 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:956 \u00B7 apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:317 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:55 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4067d4760d7f41b3f6408b7a340587c0d4dc7d64088851dd029ad9c3deba91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:441 \u00B7 apps/desktop/src/components/export/ExportProgressPopover.vue:39 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b557b6b44a2c5405e7eb503146770d0d60dcffff2128947eeb4c6d816ce29de7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:879 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:6665 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"6089321440e3d70a89861ef91ae7a98ef749b55323bb1f87943fc552ddfcacb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:906 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue: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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06d8f593b4c5aed0fb3576c716831321e8f5e0bf6816822cce7e3d6a1c1a085"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:1518 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:1685 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:3090 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"582a2d3b25326677284e49da83889334b6f4fcc257dee752505487a0d1565c69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:3195 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:3260 \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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac4e8a1cc00319415ca0ec97e3effe040f42af968a1b66b27c491165cb1cfe7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:4471 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:4478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4471}}}],"partialFingerprints":{"codehealthFindingId/v1":"360769aa62d71bc45fb86f0fc4e1b8427a3645cb524bccd845c716401d770ee3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/components/connection/ConnectionDialog.vue:5833 \u00B7 apps/desktop/src/lib/connection/connectionErrorHints.ts:51 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":5833}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d73e7f8369338510998f98a1d6c4ce68f525dc89009c4117891e8bd2630feb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulAcl.vue:11 \u00B7 apps/desktop/src/components/consul/ConsulOperator.vue:10 \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":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf32a86087a9f0bb2fab6f7fb2595ec365c0a08afda0029c5aea387e4ecdf85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulKeyBrowser.vue:303 \u00B7 apps/desktop/src/components/generate/ModelGenerateDialog.vue:124 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0b0635fe3aea5cd9c8ee928b06829903ba92fb6d4add38863ea8062e5875ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): apps/desktop/src/components/consul/ConsulKeyBrowser.vue:64 \u00B7 apps/desktop/src/components/consul/ConsulKeyBrowser.vue:73 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:13578 \u00B7 apps/desktop/src/components/layout/ResultSetNavigator.vue:34 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 4 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"662edf8d9f20ed252c76ccb0f4a221a9d3e76df4fbc0cad4a10bc757b1ec3065"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulMesh.vue:107 \u00B7 apps/desktop/src/components/consul/ConsulMesh.vue:113 \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":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f134ab92c7c5b27ddf093ca7f1778a43e8e16d50544950beed153b8f02472b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulMesh.vue:120 \u00B7 apps/desktop/src/components/consul/ConsulScope.vue:56 \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":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d765508c1a9ac3dc002d62a9349fb3d9e3c81ac30c1c8636a4cf4d77d26fe43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/components/consul/ConsulScope.vue:21 \u00B7 apps/desktop/src/components/debug/VariablesPanel.vue:15 \u00B7 apps/desktop/src/components/debug/VariablesPanel.vue:21 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulScope.vue"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b2ec344f3aeb70d95c258da7fd82e8f041b8ea9200aeeb02d177ab982c8287"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/consul/ConsulServices.vue:53 \u00B7 apps/desktop/src/components/redis/RedisPluginCodecView.vue:12 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9251a7d1655c5a3818966f433f406e1901b1cf907dbabd024f3f2878f80ef28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/debug/PlDebugSourceEditor.vue:141 \u00B7 apps/desktop/src/lib/debug/plDebugFrameSource.ts:84 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugSourceEditor.vue"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b40335a64ca8f395afde7d7c9748b03c1c73af169619ea6836447870f744f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7 locations): apps/desktop/src/components/debug/VariablesPanel.vue:17 \u00B7 apps/desktop/src/components/debug/VariablesPanel.vue:24 \u00B7 apps/desktop/src/components/dolt/DoltVersionControl.vue:126 \u00B7 apps/desktop/src/components/grid/DataGridColumnLayoutPopover.vue:35 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 6 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":"apps/desktop/src/components/debug/VariablesPanel.vue"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62f4f106b50fa5d905a8b23b8a5913432968b4219d815f4bc4f3d2b5e23f4c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/diagram/DiagramSchemaSelect.vue:25 \u00B7 apps/desktop/src/components/meilisearch/MeilisearchMultiSelect.vue:23 \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":"apps/desktop/src/components/diagram/DiagramSchemaSelect.vue"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff666bbd2858a1278eb5ae451fb59045a7cd956c31a5308adcb64b3cafb9ea32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/diagram/SchemaDiagramDialog.vue:66 \u00B7 apps/desktop/src/components/diff/SchemaDiffDialog.vue:94 \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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"53645fcbb13220fa228d0309b8f6cfd13909fedc2c4c90ef992d8b1dcef040de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffConfigStep.vue:580 \u00B7 apps/desktop/src/components/diff/SchemaDiffConfigStep.vue:623 \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":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"82485f7ab5029194857f82781b450a8a1eaeef5907cfff143cab410fb08f722a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:330 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:289 \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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"305a4081e054c54bd754a473be5e0b0083519c564b9d3b8dcedb4d8fa1ccc464"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/document/DocumentBrowser.vue:542 \u00B7 apps/desktop/src/components/document/JsonEditNode.vue:36 \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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8ca978bfc7431793c69f5379e4c99b41d4bc7937532140b95ea95bdc96b729"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): apps/desktop/src/components/dolt/DoltVersionControl.vue:121 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:7075 \u00B7 apps/desktop/src/components/export/DatabaseExportDialog.vue:62 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:656 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adea7b5fe1521947212849801ae1d020da2e43210fab7386632df7a6625fdd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:2468 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:1185 \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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcdc2968c6d7e79d163d29134e846257e3c8e3f663b647df5cd219dc1b3d3d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:4651 \u00B7 apps/desktop/src/components/editor/AiAssistant.vue:4657 \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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":4651}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee34755e23a0ae859936fc603df3db725216c4a93d8dd00d3da20b127e20bfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/editor/AiAssistant.vue:4682 \u00B7 apps/desktop/src/components/editor/AiAssistant.vue:4707 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":4682}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc70469c84d09d5b4d8aeb0dd76ceb1308c265c3ccdc9242490dcbd3f6632154"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/components/editor/DelimitedListDialog.vue:142 \u00B7 apps/desktop/src/components/editor/SqlParameterDialog.vue:153 \u00B7 apps/desktop/src/components/ui/ErrorBanner.vue:33 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f256eed3f0540df2ebbdb9fff7889761613caa139a50af45d5bb94264abc2b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/editor/MultiDbExecuteDialog.vue:739 \u00B7 apps/desktop/src/components/etcd/EtcdAccessControl.vue:99 \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":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e6f714957659a82abc078314d423a94be2e262075f91328493e54a82ec29a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/components/editor/QueryEditor.vue:2915 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:572 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b302d775e8e4ec356f67e3e79c676cc2050a0da3e33dccb839b5864f1bd306f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/components/editor/QueryEditor.vue:2915 \u00B7 apps/desktop/src/components/nacos/NacosConfigDiffPane.vue:30 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fff06558847c86a933be56b295430f6510a5693cf03a1e96489cbc498841594"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/components/editor/queryEditorCodeMirrorRuntime.ts:43 \u00B7 apps/desktop/src/components/editor/queryEditorCodeMirrorRuntime.ts:51 \u00B7 apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts:36 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorCodeMirrorRuntime.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc58cc58254633f0eb6bdc6b37fef524a9a168d93925e040c57a991f8e1e4b60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/editor/queryEditorCodeMirrorRuntime.ts:55 \u00B7 apps/desktop/src/components/editor/queryEditorCodeMirrorRuntime.ts:61 \u2014 all 2 copies are in the same file, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorCodeMirrorRuntime.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"77220e9be0be20a1ccb5d5218f6e9b3e4dc2c7f63ea4db91cee566a070c138ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/editor/queryEditorHoverContent.ts:56 \u00B7 apps/desktop/src/components/layout/EditorGroupTabBar.vue:1677 \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":"apps/desktop/src/components/editor/queryEditorHoverContent.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c11b8fd7b935c2d331bd678109bbbf6870ee8b985311701d43312c8277d47d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts:231 \u00B7 apps/desktop/src/components/grid/DataGridFilterBuilder.vue:323 \u00B7 apps/desktop/src/components/grid/DataGridSortBuilder.vue:311 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d4fc3154ffe663cc0a9156749e88bc0859bf4b5ee8ec5bfb504f2723a59d23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorCompletion.ts:443 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:471 \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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c15567f9bb53bec6e7d3d79091b1a939f5ca8df01ad9c2800e77f984d9c1c7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorCompletion.ts:931 \u00B7 apps/desktop/src/components/editor/useQueryEditorCompletion.ts:946 \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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"279e05f705c91302c7e423bb6f8fcd62e48cc09b7deb89b055a23666bf35f81d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts:386 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:6255 \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":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec530f7f8f7ee459dfff59ac98b02f229557f2837cc05369eb4aba0e42f9799"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): apps/desktop/src/components/editor/useQueryEditorPointer.ts:138 \u00B7 apps/desktop/src/components/grid/DataGridFilterBuilder.vue:323 \u00B7 apps/desktop/src/components/grid/DataGridSortBuilder.vue:311 \u00B7 apps/desktop/src/composables/useDataGridColumnLayout.ts:829 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorPointer.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9378b80693975da1510ad069365ce140dae69ea7ef1baa82cf99d783a8d34696"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdAdminConsole.vue:68 \u00B7 apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue:46 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAdminConsole.vue"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f6927c4c6afacea9196a610f0b11ed7527d0d9e79a484a71413a6d61c740c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/explain/ExplainPlanDiagram.vue:106 \u00B7 apps/desktop/src/components/explain/ExplainPlanNodeTree.vue:24 \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":"apps/desktop/src/components/explain/ExplainPlanDiagram.vue"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc5c480a91fdc13b3cc5179b93f1b90e2b8e543a5e575e7285bacbd8fab19c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): apps/desktop/src/components/export/DatabaseExportDialog.vue:60 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:54 \u00B7 apps/desktop/src/components/settings/McpDatabaseAccessDialog.vue:35 \u00B7 apps/desktop/src/components/transfer/DataTransferDialog.vue:141 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 4 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf935f60d0109e261b23d57e45f2a5af782ed8c34927f46a9914da286d32bdb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/export/DatabaseExportDialog.vue:261 \u00B7 apps/desktop/src/components/export/SqlInsertModeDialog.vue:36 \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":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c863043e009674008adaed2823a79dd03facdf3bab56b62d3c8813f5e7a410"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/export/ExportProgressPopover.vue:163 \u00B7 apps/desktop/src/components/export/ExportProgressPopover.vue:170 \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":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5aa52b3622994f776df73a9990e7db9b5e3c18ad932139f20bbc1e907e50a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/export/databaseExportTableFilter.ts:14 \u00B7 apps/desktop/src/lib/common/searchPattern.ts:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/databaseExportTableFilter.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e07671200ea5b600fe4e780eeee3294fe166ebc7840fce9f3960cc8d9f6417b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): apps/desktop/src/components/generate/params/AddressParams.vue:47 \u00B7 apps/desktop/src/components/generate/params/DateParams.vue:31 \u00B7 apps/desktop/src/components/generate/params/DateTimeParams.vue:39 \u00B7 apps/desktop/src/components/generate/params/FilePathParams.vue:84 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 6 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/AddressParams.vue"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa21bbe31c56f0cba66e6e34c1c09cb82e1b02df2129825fe29a82756515d119"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/CityParams.vue:11 \u00B7 apps/desktop/src/components/generate/params/PhoneParams.vue:12 \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":"apps/desktop/src/components/generate/params/CityParams.vue"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3edc5a47aa8dc5c2daf8f4c6d2da500a1a8823b032dd1cd471b591b0785498c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10 locations): apps/desktop/src/components/generate/params/CompanyNameParams.vue:9 \u00B7 apps/desktop/src/components/generate/params/CreditCardDateParams.vue:11 \u00B7 apps/desktop/src/components/generate/params/CreditCardNumberParams.vue:9 \u00B7 apps/desktop/src/components/generate/params/CreditCardTypeParams.vue:9 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 10 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":"apps/desktop/src/components/generate/params/CompanyNameParams.vue"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"af06c2c93606ab57e12bade00b56a0282a8448ecaa3630056a21b1b6915304be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/PhoneParams.vue:32 \u00B7 apps/desktop/src/components/generate/params/PhoneParams.vue:43 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/PhoneParams.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f38ef3def0553d162b109f4555e7e69ba0ea51150cb1d4fc732f1cb01485748"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/RegionParams.vue:48 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:943 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/RegionParams.vue"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fc45a6efb576d36f77a0e79eaae874c56d17cf739edd7afdf11a54a3d57386"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/components/generate/params/UuidParams.vue:12 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:1845 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/UuidParams.vue"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"026e759b99ded2c6411628a6caad26a75386e65eb55ea79fd1856b1a1bf03b72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:1359 \u00B7 apps/desktop/src/components/ui/ColorSpectrumPicker.vue:23 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcfed111dfe14b166b167f341fb4a10a87615387d1b393f763aa91b4c63763d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:6332 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:6396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":6332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd8124f46b7df1ff7766da6e81efb5516195d1a5c519558f32a3cd92bde9dd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:8442 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:8488 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8442}}}],"partialFingerprints":{"codehealthFindingId/v1":"7597cc4c65b69039f0717b06262989a034fb8542cd45acfab3004570cc6db685"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:8832 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:8856 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8832}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de561844aba5f3c63f391089a548476068ffc5ad24ec4b3c1b55422c489ec97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/components/grid/DataGrid.vue:9349 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:9374 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:9391 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c5853550dba18cc98bb2a3790f854e65806e1cc86ff54828909c188efcdc97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:10169 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:10179 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":10169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fa51d24149264420ab255298aa9d7609e5c94c4251b59c69ce66f3c63e28f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:11061 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:11103 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11061}}}],"partialFingerprints":{"codehealthFindingId/v1":"4648bb6dd2d00204b3c3a6e9019a8e439befb7b23c472aaf163e9eb237c177f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:8037 \u00B7 apps/desktop/src/composables/useDataGridCellDetail.ts:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8037}}}],"partialFingerprints":{"codehealthFindingId/v1":"4612cc1a3dc5a8c8a79a720ce6afe7cd77f786c3a529d8e430ed71da66c8c938"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:2258 \u00B7 apps/desktop/src/composables/useDataGridSearch.ts:276 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb24de5711e0dd6e92942e6a950b150536cbfeade97293e51e88d5b1f3259827"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGridInsertRowsDialog.vue:37 \u00B7 apps/desktop/src/components/sidebar/SqlTemplateInsertRowsDialog.vue:26 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridInsertRowsDialog.vue"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa7e0c33e65fb8143961e125dd785f965e510752b03bb46904aecc8930da6aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/grid/LayerPreviewDialog.vue:316 \u00B7 apps/desktop/src/lib/redis/redisValuePresentation.ts:483 \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":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1f51e3f142f32c07b4bdab329e316482c4fb1c18a2f3a25a31a07104c83a77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): apps/desktop/src/components/layout/AppSidebar.vue:182 \u00B7 apps/desktop/src/components/plugins/PluginContributionsPanel.vue:698 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:120 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:467 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/AppSidebar.vue"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d3011e7e67554d33ae94d9e08b0bac8129ab6f4ef30a6110715bdf8cc810ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/layout/AppSidebar.vue:192 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:4627 \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":"apps/desktop/src/components/layout/AppSidebar.vue"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac84d8dcb5f3f1d4ffabfc0596f0867a0877d90a116b80a0212c5746826a42d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/layout/EditorGroup.vue:89 \u00B7 apps/desktop/src/components/layout/QueryEditorSurface.vue:34 \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":"apps/desktop/src/components/layout/EditorGroup.vue"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e88fdced4949e2c1b76616c13096e2f52a5c1afc108c7ccd8aae260035863fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/layout/EditorToolbar.vue:555 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:320 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorToolbar.vue"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff17c798dcbe570033ef1bb2f3cc025c630981ea9f89abb95011f5afae128ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlEditorWorkspace.vue:189 \u00B7 apps/desktop/src/components/layout/SqlEditorWorkspace.vue:208 \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":"apps/desktop/src/components/layout/SqlEditorWorkspace.vue"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc42d1f2c298623846632ea96a66c4139d6fa43577e1f55dfd9263950fbdb88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:632 \u00B7 apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue:28 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"d998bf82a003f3ce1063951da71cc9812517eac87d495eab33ff575af1be74a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:1292 \u00B7 apps/desktop/src/components/layout/SqlLibraryPanel.vue:1303 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7522f67c1ccaf23d5921c2cdfff6fbb1d55b656c64e2ceb95d45f736926ad127"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlLibraryPanel.vue:1161 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1664 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a1ac2bf5db102b282ee65b6f5756d3beed7821230a763f3bb25ce78167a0e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue:169 \u00B7 apps/desktop/src/lib/app/documentJsonValues.ts:202 \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":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"57992921f8ebceb9b947aaea1f62bed7befac66929481d7e4c5a7d5b88ea8870"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/mq/MonitoringPanel.vue:147 \u00B7 apps/desktop/src/components/mq/MonitoringPanel.vue:162 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b947bca652e692d69c07f48c037dbb36bd3e56ff27b163e04e4d043b7b913976"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/mq/PoliciesPanel.vue:95 \u00B7 apps/desktop/src/components/mq/PoliciesPanel.vue:109 \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":"apps/desktop/src/components/mq/PoliciesPanel.vue"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc701de5f500da3d1c3e89578ea437aa35a503c60b28cb1ef58357da4ac4149a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/mq/ProducerConsumerPanel.vue:48 \u00B7 apps/desktop/src/components/structure/StarRocksAlterStatus.vue:10 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ProducerConsumerPanel.vue"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdb5a0f658dc95bfd0f5517e349307c94fc05cbbbaaca76ab9158248df2a6e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/mq/rabbitmq/RabbitMqMonitoringPanel.vue:112 \u00B7 apps/desktop/src/components/solr/SolrAdmin.vue:516 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rabbitmq/RabbitMqMonitoringPanel.vue"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3a9c40be7cb38f611456359c4c1bd3629b1cc7a2f77bdb349fb8beb7e4dc87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:161 \u00B7 apps/desktop/src/components/nacos/NacosAdminConsole.vue:272 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74403a35394f0aeb6d735fd734bb43882c2927863b44d545cb117cc370addda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosAdminConsole.vue:874 \u00B7 apps/desktop/src/lib/nacos/nacosConfigLanguage.ts:14 \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":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecf344958a6a73068e3364a9428a39ea517f643d3d5014eaf84c4e9b85770fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:318 \u00B7 apps/desktop/src/components/nacos/NacosRoleAccessControl.vue:325 \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":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e16c148636d829aaeafb249d7b9f1733d40a351f48649778ee784f85d1ae87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3389 \u00B7 apps/desktop/src/composables/useSidebarTreeExportRuntime.ts:135 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b00b7f769e000c414231f6c190bf778a5cd571f5f4ec7fc178e32a884059f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:4967 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:6408 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4967}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ca17d993774347da8d1df5112494604b741a67947779df1ac731ba19b922a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1131 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1149 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7586b750a2d0972904ca2e78199ac58ba6b4030f7d867a9dec84d2446097a459"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1259 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1265 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4157a5254f01417851c1ceccbeecb515d002aafbe1ebf6962a76fab9b3e80aed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:6446 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:6461 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":6446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a363a331662ab299577c5bc70f8110f1febbb5cce869815189c35d1c89b41b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:7772 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8237 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":7772}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e020ad85256963a02a9b5a2700565819d66efdf89bc1fef50d49d417a6f11ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8654 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":8654}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d94f5356bdff0e8d8b55699a0e4a9574c691bdde1e724f89a308f7b85bf1d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/TreeItem.vue:781 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:369 \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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6451cc57494a1007c9f94829ba23eba3cdda2f133eaa7e196dcc80ea84937b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/solr/SolrAdmin.vue:446 \u00B7 apps/desktop/src/components/solr/SolrAdmin.vue:464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c516f46577d685f564071db107196d5148046480068df88c9b00f60eabdb67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue:477 \u00B7 apps/desktop/src/lib/table/tableImport.ts:82 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f86d0bcd95eed556dfab86a41e195c45f8b96e6a55e812c81fa7d7b2531392"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue:252 \u00B7 apps/desktop/src/lib/diagram/layer-store.ts:84 \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":"apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f86e3175d04c7daff700665780c1c3ebe6418ae2e9bd207efab41cd9b4f01b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/components/structure/StarRocksAlterLayoutEditor.vue:11 \u00B7 apps/desktop/src/components/structure/StructureColumnMultiSelect.vue:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"apps/desktop/src/components/structure/StarRocksAlterLayoutEditor.vue"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5d798cc49ec46971c8646e062ec707ee86dc2315ddbde489ba4e6a5019dcd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/structure/StarRocksPhysicalOptionsEditor.vue:22 \u00B7 apps/desktop/src/components/structure/StarRocksSortKeyEditor.vue:31 \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":"apps/desktop/src/components/structure/StarRocksPhysicalOptionsEditor.vue"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"691f3eb90ee16a70a06cfe6c8d347f54b682ce42887cf73c86435a15d4e8e905"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:2377 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:2390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"399a48c08ef9c200bb1b83c3ca82afced7fb6dab6fc1b7c9d13b2e8c4efe1306"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): apps/desktop/src/components/ui/dropdown-menu/DropdownMenuCheckboxItem.vue:8 \u00B7 apps/desktop/src/components/ui/dropdown-menu/DropdownMenuRadioItem.vue:8 \u00B7 apps/desktop/src/components/ui/dropdown-menu/DropdownMenuSubContent.vue:6 \u00B7 apps/desktop/src/components/ui/tabs/Tabs.vue:5 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/components/ui/dropdown-menu/DropdownMenuCheckboxItem.vue"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f155c0dd880647d70c90a3f3aa4b9d3a8aadede7e81f84f7277a59731b358959"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridActions.ts:398 \u00B7 apps/desktop/src/composables/useDataGridActions.ts:469 \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":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2c60d94331db8cbf4bd7718fa2fc98266ac438993c73f861395c1548fe00b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridColumnLayout.ts:89 \u00B7 apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts:325 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc81c013597fd68825486ce1ffb774ba20765efb90a32672ed9b38db6f5dbed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExport.ts:1560 \u00B7 apps/desktop/src/composables/useDataGridExport.ts:1669 \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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa37235c3aa52f154fcfadce47538bdea3bd96f436b4d1150248e2de3d6fe57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/composables/useFileDrop.ts:120 \u00B7 apps/desktop/src/composables/useFileDrop.ts:135 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useFileDrop.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fa5e4a9fd51f4b3aac02e95c33a4165861db81924cc5119f5b71286847fc35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:168 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:184 \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":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d032f4efced819dc9fe90378ef13b3046917c1b9f763f0aa644d3f44fd6814fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:298 \u00B7 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts:316 \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":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b310f57927465e3c448d4f3876b39768a27eef5dd5bd49981b10759bf870dabc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:552 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:1235 \u00B7 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts:1268 \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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc936b61f5ead568af9292eb9c9f6cc9e5d8cfba81c76769bec007d6064ec44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/composables/useSidebarTreeToolRuntime.ts:207 \u00B7 apps/desktop/src/composables/useSidebarTreeToolRuntime.ts:213 \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":"apps/desktop/src/composables/useSidebarTreeToolRuntime.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6042b15b219ad362efcd0edbce225e5a81f56f19546bc8137f90eab132a06813"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/composables/useSqlExecution.ts:387 \u00B7 apps/desktop/src/composables/useSqlExecution.ts:725 \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":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb0b61346d686e3c26f4baf9433e45cf86063a12e0812aad9bafc6ab8197f87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/ai/aiCodeHighlighter.ts:46 \u00B7 apps/desktop/src/lib/common/shikiJsonHighlighter.ts:12 \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":"apps/desktop/src/lib/ai/aiCodeHighlighter.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cb42915435283c5432f84c9e2d037077f5941a20ca956f38d13b2abe5ab46f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/app/documentStoreProvider.ts:611 \u00B7 apps/desktop/src/lib/app/documentStoreProvider.ts:617 \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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd43d7930a2b24c3e126835856b769bcabfb3b86a9a626fd8f5951ed1d9aaae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/app/pinnedItems.ts:113 \u00B7 apps/desktop/src/lib/app/pinnedItems.ts:209 \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":"apps/desktop/src/lib/app/pinnedItems.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55255fb5545dc9d696458b5a341691cfe046bd8cdd24962da9429ca5ccefbd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/app/uiTuning.ts:56 \u00B7 apps/desktop/src/lib/editor/vimConfig.ts:22 \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":"apps/desktop/src/lib/app/uiTuning.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b7f44254a577815abf77b72bc8987d1ec7db72786f90666a9d4639324af985"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/backend/debugLog.ts:160 \u00B7 apps/desktop/src/lib/dataGrid/dataGridTemporalEditor.ts:81 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/debugLog.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cb19dfb4f250b9627a83613db345a3e53861db3a86763c3d20eee62590e1b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): apps/desktop/src/lib/backend/http.ts:1256 \u00B7 apps/desktop/src/lib/backend/http.ts:1275 \u00B7 apps/desktop/src/lib/backend/http.ts:1283 \u00B7 apps/desktop/src/lib/backend/http.ts:1619 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad86c2e49c4194285b61fa91ad2b8e21d7c58d0d06d722c181c8bce69e1b413"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): apps/desktop/src/lib/backend/http.ts:1279 \u00B7 apps/desktop/src/lib/backend/http.ts:1287 \u00B7 apps/desktop/src/lib/backend/http.ts:1464 \u00B7 apps/desktop/src/lib/backend/http.ts:1611 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c072c3067e4a23eb60e1094e0a134a8b20b17f7dc08971bbb6e3c6b409d9211"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): apps/desktop/src/lib/backend/http.ts:1291 \u00B7 apps/desktop/src/lib/backend/http.ts:1379 \u00B7 apps/desktop/src/lib/backend/http.ts:1460 \u00B7 apps/desktop/src/lib/backend/http.ts:1595 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3780ff3d489b94228a717bbbcee2af6933600567492ee7d810b79bc7a50d54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:2392 \u00B7 apps/desktop/src/lib/backend/http.ts:3398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c875268e0ad1c0c24736c30de009fc7e31058057c3c4135f0d751f1f2df02449"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4482 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4617 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4482}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f1277f2780ad9d508fb400d93931eb9c1451040dacfaa6d28f30c62982294f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 25 locations): apps/desktop/src/lib/backend/http.ts:4538 \u00B7 apps/desktop/src/lib/backend/http.ts:4571 \u00B7 apps/desktop/src/lib/backend/http.ts:4583 \u00B7 apps/desktop/src/lib/backend/http.ts:4591 \u00B7 \u002B21 more site(s) not listed \u2014 the 25 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4538}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9b79d270ceca5a89c8ad80ea97147e3270daa3dcd5d930089c81f04bcbbbc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 20 locations): apps/desktop/src/lib/backend/http.ts:4595 \u00B7 apps/desktop/src/lib/backend/http.ts:4623 \u00B7 apps/desktop/src/lib/backend/http.ts:4720 \u00B7 apps/desktop/src/lib/backend/http.ts:4729 \u00B7 \u002B16 more site(s) not listed \u2014 the 20 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4595}}}],"partialFingerprints":{"codehealthFindingId/v1":"67815569d465075eae71b27167be67a80609c8184902bd403012de3672145049"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): apps/desktop/src/lib/backend/http.ts:4607 \u00B7 apps/desktop/src/lib/backend/http.ts:5765 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4735 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5765 \u2014 the 4 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4607}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba4c38dfedf964329f107163aad91796b0ec206ef88c0e034a7728f1eda3dc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): apps/desktop/src/lib/backend/http.ts:4626 \u00B7 apps/desktop/src/lib/backend/http.ts:4765 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4691 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4754 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4626}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a769026a4e5f926589aefa680bcefdc1db068ac642bd0ca22d775bac89c87ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/lib/backend/http.ts:4656 \u00B7 apps/desktop/src/lib/backend/http.ts:4662 \u00B7 apps/desktop/src/lib/backend/http.ts:4668 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ab36136b1673a82b6696e12b8b7db5a94ab8ba64a15bba3b7220f527851e9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4750 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4878 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4750}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac7ff1c9a0830de00b09a594dd0c032f11618f261c30a92d812e15892ceed61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): apps/desktop/src/lib/backend/http.ts:4771 \u00B7 apps/desktop/src/lib/backend/http.ts:4814 \u00B7 apps/desktop/src/lib/backend/http.ts:5124 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4899 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4771}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70d6d9306aaa899ca10eeb2afa086d503ea2540b076b2a8009cd3f962937092"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4778 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4906 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4778}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4283d4b1a601411e457bd1cdf941fefd3d0e2253bc463e654920b94c07bde29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8 locations): apps/desktop/src/lib/backend/http.ts:4784 \u00B7 apps/desktop/src/lib/backend/http.ts:4790 \u00B7 apps/desktop/src/lib/backend/http.ts:4799 \u00B7 apps/desktop/src/lib/backend/http.ts:4805 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4784}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a1eef37495251cff4302ba51ec7ea1328c6a1457247dd103efb80292467293"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4811 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4939 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4811}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5668f05663f46a3a66adcb158cea1948e0735c393a8a95409a29a4b92fcbfbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): apps/desktop/src/lib/backend/http.ts:4823 \u00B7 apps/desktop/src/lib/backend/http.ts:4850 \u00B7 apps/desktop/src/lib/backend/http.ts:4865 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4951 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4823}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f1be4101bef7959acf2a010ad6becde527af125d9203b49f158a4a1dae16cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/lib/backend/http.ts:4829 \u00B7 apps/desktop/src/lib/backend/http.ts:4844 \u00B7 apps/desktop/src/lib/backend/http.ts:4856 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4829}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfa7c1051924f66849e1ffe1ef299eda8f62116762daf3e4a3e26e5760c5b21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:5761 \u00B7 apps/desktop/src/lib/backend/tauri.ts:5761 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5761}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d449968cdf0df798acb450602e482495d478b414a2f81ada6d8b2ca37270f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:2127 \u00B7 apps/desktop/src/lib/database/createDatabaseSql.ts:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d367a3b77e985d2fc4b599d1a214dd7727a071989df788d4462e03509d36858"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): apps/desktop/src/lib/backend/mq-http.ts:93 \u00B7 apps/desktop/src/lib/backend/mq-http.ts:134 \u00B7 apps/desktop/src/lib/backend/mq-tauri.ts:82 \u00B7 apps/desktop/src/lib/backend/mq-tauri.ts:124 \u2014 the 4 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":"apps/desktop/src/lib/backend/mq-http.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03cee13256c44946e6236cfcbb8ca1f79e15fba013ad707ad7db204d50af88d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/backend/mq-http.ts:138 \u00B7 apps/desktop/src/lib/backend/mq-tauri.ts:128 \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":"apps/desktop/src/lib/backend/mq-http.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d902fb39111bcf59bce1f7979f0d11f76f4060414d377144357a2cfaef343365"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/lib/backend/tauri.ts:4784 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4790 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4796 \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":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":4784}}}],"partialFingerprints":{"codehealthFindingId/v1":"5386c1cba9065e6b5514c7d54112f9d3364c741764b870d039fe886a3acf4a4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/lib/backend/tauri.ts:2573 \u00B7 apps/desktop/src/lib/database/createDatabaseSql.ts:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"f188b593e33abc0962b9acc59175acfd09f069666bc556d8b71aab9a8cec7799"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/common/boundedTextPreview.ts:24 \u00B7 apps/desktop/src/lib/common/boundedTextPreview.ts:31 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/boundedTextPreview.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cfcd13fa68e68d1150711c70c23d71cb979e16f8d28da66cbb8c54a8f9ab3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/common/clipboard.ts:249 \u00B7 apps/desktop/src/lib/common/clipboard.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":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24892b202c7c2e9d5a78b114104a32629a09e8834f75999669f43811d7e1802"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/common/textDiff.ts:67 \u00B7 apps/desktop/src/lib/sql/insertValueHints.ts:810 \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":"apps/desktop/src/lib/common/textDiff.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd2b8edc0d3c34096a7c42a2a0a461f91e08e8794cdabf0d0a98cb76dc456f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionPickerTree.ts:54 \u00B7 apps/desktop/src/lib/sidebar/sidebarLayout.ts:252 \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":"apps/desktop/src/lib/connection/connectionPickerTree.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"10783d407df691c719d5f30e56a2db00390b6d992ee80425bcac97df0f6ae554"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionUrl.ts:131 \u00B7 apps/desktop/src/lib/redis/codec/pickle.ts:447 \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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec429ae0507a13e4ca5e3766db58cb6716f436b5a7179eaf8ee283a0cb529c87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionUrl.ts:322 \u00B7 apps/desktop/src/lib/database/h2Connection.ts:28 \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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c65010e336bc7781486c79f80c0e13313f1448a0eb9e06f3e613bd48c60ff15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/binaryCellDownload.ts:195 \u00B7 apps/desktop/src/lib/dataGrid/cellImageUrl.ts:54 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/lib/dataGrid/binaryCellDownload.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b85818f955de42525aca2854b09a2ef9fec0575af90b6eddc44daa3a1cb1c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGenerate.ts:771 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:778 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f087e2481be383525134bcdc2f2554f88434657af9e2dcb467eb9ca9f474b56b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts:120 \u00B7 apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts:129 \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":"apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d169e086a23d4e2be8d27166b022a5fa48a643cd6eca8cb61fa1f690077ac985"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts:47 \u00B7 apps/desktop/src/lib/document/documentGridColumnVisibilityStorage.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d5ad9013b1a7cbc44ce7735d1664317dee6d68e995dc9bbb97905b369fc684"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.ts:57 \u00B7 apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.ts:75 \u00B7 apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.ts:89 \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":"apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f49231b9fd568e02cfeb7367f5b4fe19bd10847184567abce1a56b33d42ca0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridSelectionFrames.ts:114 \u00B7 apps/desktop/src/lib/dataGrid/dataGridSelectionFrames.ts:133 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSelectionFrames.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"246a75613e67e926d0fb3e82083ee997f1364242b383bd9a003ccca6af302990"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/lib/dataGrid/geometryPreview.ts:125 \u00B7 apps/desktop/src/lib/dataGrid/geometryPreview.ts:151 \u00B7 apps/desktop/src/lib/dataGrid/geometryPreview.ts:184 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3592cb36558f7d936fb27428c6cb4e7dba281857f82fde5bc4ec2faec7cb61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/geometryPreview.ts:147 \u00B7 apps/desktop/src/lib/dataGrid/geometryPreview.ts:180 \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":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0f613dedf537cbd594dbb1e9a019fad2a375741e239cd8eddc775bd4d2118c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/database/databaseAuthorizationPlan.ts:232 \u00B7 apps/desktop/src/lib/database/databaseAuthorizationPlan.ts:254 \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":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1125433e6efcf38e879960db05a0d40a9af63f11a03835b98fb9e3aa5ffd2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/database/mysqlServerStatus.ts:67 \u00B7 apps/desktop/src/lib/database/postgresServerStatus.ts:297 \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":"apps/desktop/src/lib/database/mysqlServerStatus.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6429bb5e8d12d18da722b7a416f22132b19ca54b2afcf6ce0c7584049b6d197"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts:441 \u00B7 apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts:450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2308cdf5b53be42f39b3141a8df411a553aa7336e47c909f168cad545fad5f0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleConstraints.ts:670 \u00B7 apps/desktop/src/lib/database/oracleConstraints.ts:683 \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":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9b40d21832d8461c8bbbfef347bdabd9f3d79a10405a47cbfb85658ad56f60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/database/visibleDatabases.ts:26 \u00B7 apps/desktop/src/lib/database/visibleDatabases.ts:32 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/visibleDatabases.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ac87be38fa474d06f39a1b654bdbe743bc2e470ce2ba83e622a2bccef42033"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/database/xuguUserPermissions.ts:390 \u00B7 apps/desktop/src/lib/database/xuguUserPermissions.ts:414 \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":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb3110584b1e716cd44207c602f6ac52b60f3560efddbfae56ea8a0ee412e16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/database/xuguUserPermissions.ts:614 \u00B7 apps/desktop/src/lib/database/xuguUserPermissions.ts:650 \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":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02efb174d5bf7c44c71fe241e2f010a0748077fe30317c21367be57242bea42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/debug/plDebugAnonymousBlock.ts:46 \u00B7 apps/desktop/src/lib/mongo/mongoSql.ts:588 \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":"apps/desktop/src/lib/debug/plDebugAnonymousBlock.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"90934cac91e25022d1ee4bb15605c1130b91bad92c4f9476c4367f16d7d0962f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/diagram/erDiagram.ts:49 \u00B7 apps/desktop/src/lib/diagram/erDiagram.ts:57 \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":"apps/desktop/src/lib/diagram/erDiagram.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c83b06fbcb86bf138357b90eb0569022705a8c58e86aeb48c443be2e4eb7d8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): apps/desktop/src/lib/diagram/match-engine.ts:63 \u00B7 apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts:659 \u00B7 apps/desktop/src/lib/metadata/completionTreeIndex.ts:54 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:2674 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 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":"apps/desktop/src/lib/diagram/match-engine.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce6ab5f234f723a73456ea8f6ab8faf9bdbb690333c9067efd6f46ba0e35389"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/lib/editor/excludedCompletions.ts:4 \u00B7 apps/desktop/src/lib/editor/hoverTableLookup.ts:136 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/lib/editor/excludedCompletions.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"834ae9514f67d222df32daea7a58d4a098e03c6c480a6da605b4b9f14a4afcb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/editor/keyboardShortcuts.ts:278 \u00B7 apps/desktop/src/lib/editor/keyboardShortcuts.ts:286 \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":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"821165d8cb4817d9172e469d84e5a564aeea13269955c01275ccb260d836cbe6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): apps/desktop/src/lib/editor/keyboardShortcuts.ts:298 \u00B7 apps/desktop/src/lib/editor/keyboardShortcuts.ts:437 \u00B7 apps/desktop/src/lib/editor/keyboardShortcuts.ts:449 \u00B7 apps/desktop/src/lib/editor/keyboardShortcuts.ts:509 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a178a4f5271e9463b731aa115d2ec2a7c04fb8f140a28be0647b8b64f7ced4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/editor/keyboardShortcuts.ts:371 \u00B7 apps/desktop/src/lib/editor/keyboardShortcuts.ts:378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfafb24cb60a7f17d8bf021d81871821085b5ac811c8bf0f77825852fa91748"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/lib/editor/queryEditorFormatSelection.ts:37 \u00B7 apps/desktop/src/lib/sql/doris/functions.ts:13 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:332 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorFormatSelection.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b414295c841cf6b90e9595c963fe3772dce069d1031b3994916b27c1795953"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/editor/queryEditorFormatSelection.ts:107 \u00B7 apps/desktop/src/lib/editor/queryEditorFormatSelection.ts:113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorFormatSelection.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9f6ac2155adfd75d862f21c149297121f34b5ac7af1c7f182da91be533638a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/export/diagramFormats.ts:60 \u00B7 apps/desktop/src/lib/export/diagramFormats.ts:67 \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":"apps/desktop/src/lib/export/diagramFormats.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3c97c8242dfbd93adb8c2b4488a8ad581d977aa5e53fe6a304822e06937710"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/lib/kv/kvKeyTree.ts:169 \u00B7 apps/desktop/src/lib/sidebar/sidebarLayout.ts:96 \u00B7 apps/desktop/src/lib/sidebar/sidebarLayout.ts:143 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/kvKeyTree.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9e36a203e9ccbe466b1795365238b701424d9486bad24884e9692595a7e8a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/mcp/mcpConfigTemplates.ts:82 \u00B7 apps/desktop/src/lib/mcp/mcpConfigTemplates.ts: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":"apps/desktop/src/lib/mcp/mcpConfigTemplates.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"976c6a96746aec7090ee64f49da5411db43ffcb0d192e22218c183206ba4b5ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:2063 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:3559 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f800df50ece51b2882e7ddac377ef636feb6e9b957d4442a0a11404e99f598"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoDocumentValues.ts:531 \u00B7 apps/desktop/src/lib/mongo/mongoDocumentValues.ts:563 \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":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"042dba4bd6a1b0321d94456a4255fbac756d982857e5ed2000f0a624cd72f653"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoDocumentValues.ts:212 \u00B7 apps/desktop/src/lib/mongo/mongoScriptRecorder.ts:165 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 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":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9979b1fb7c94ced1d591032fd94341f0cb30e670876dee4f1e471eb9602c8b72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:438 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:579 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:642 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:666 \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bd064613f752349e6c28637e4d85295c8996e5981c8eb6622c1e9e5d2ccc17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:754 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:768 \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ece71fa9abdac21f81d280278d669960f192478c99510cb361d5951efd509b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:919 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:928 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:938 \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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe06997d80af52175641faa5dc167b00af1dce03694773a85f342ccea45ba85d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/mq/kafkaTopicStats.ts:27 \u00B7 apps/desktop/src/lib/mq/mqPolicyForms.ts:197 \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":"apps/desktop/src/lib/mq/kafkaTopicStats.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f3e8bd6e119ae6086bc7cd978fdbb7f86e3d4d410a5fafbca353cd6dafba64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/nacos/nacosNamespaceCache.ts:35 \u00B7 apps/desktop/src/lib/sidebar/elasticsearchIndexActions.ts:95 \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":"apps/desktop/src/lib/nacos/nacosNamespaceCache.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cab6d6ef6642380be68ef057a026c11b161b41f8d77a11742975ace3212d6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): apps/desktop/src/lib/naming/namingStyleTransformers.ts:36 \u00B7 apps/desktop/src/lib/sidebar/sidebarSearch.ts:109 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/lib/naming/namingStyleTransformers.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e044c389440575b5573ceedd59c8a41d30a78fa87c10982c8edc2be6c970822f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/plugins/frontendPlugin.ts:111 \u00B7 apps/desktop/src/lib/plugins/frontendPlugin.ts:133 \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":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69a16dcf76dcec7659e121e902940fc6627662eb0d3798f58cf5f5074cb98e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/redis/redisKeyTemplates.ts:7 \u00B7 apps/desktop/src/lib/sidebar/sidebarTableNameDisplay.ts:2 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyTemplates.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c14c0080065ca2e55bb735b457eeda5add683f67c4daee37105ee8554b9369"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/mongoCollectionMutation.ts:85 \u00B7 apps/desktop/src/lib/sidebar/mongoCollectionMutation.ts:117 \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":"apps/desktop/src/lib/sidebar/mongoCollectionMutation.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ea79b87c5cd3e5dfaea9b069d0242f3e481eddee394983cb20397d26fc87ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarTableNameCopy.ts:129 \u00B7 apps/desktop/src/lib/sidebar/sidebarTableNameCopy.ts:146 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTableNameCopy.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"de36741ad9305c749529739580db6013ac63b462faaaebdf6a59749f9bdb34d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarTreeRuntime.ts:18 \u00B7 apps/desktop/src/lib/sidebar/sidebarTreeRuntime.ts:45 \u2014 all 2 copies are in the same file, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTreeRuntime.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a085fa14b641e94f27a9933443b0c6c331418ce95ececc6c82a28ca339ef00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/layout/printer.ts:126 \u00B7 apps/desktop/src/lib/sql/layout/printer.ts:211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a8c006666262fbd0fd176533998c9822921df4f12dffe91d2492e7edd63610"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/lib/sql/layout/printer.ts:287 \u00B7 apps/desktop/src/lib/sql/layout/printer.ts:298 \u00B7 apps/desktop/src/lib/sql/layout/printer.ts:310 \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":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3900b331a6430562efd09b98cbcb54ac8506a0319e7becfb54793dff80d47b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/diagnostics.ts:677 \u00B7 apps/desktop/src/lib/sql/semantic/references.ts:44 \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":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb3cb63f933a25132ffd55d618276e8cf1710925095dd688e0149d13b7535f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/tokens.ts:200 \u00B7 apps/desktop/src/lib/sql/semantic/tokens.ts:207 \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":"apps/desktop/src/lib/sql/semantic/tokens.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ad7a7a09e4cf67b1df26e5f3b66f7e1169134123040101e20079afd3c451aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:824 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:1697 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"0800659c1eb41afb17d39377ab83c04b33f1c2b8808539b740ca36833c849e9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:2832 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:2872 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2832}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5135474d9a1ec880bf71275ffd8bd582a349f766ef73812666fbd8539fab738"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:4460 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:4468 \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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4460}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2a78cae8761ef42cb2d49ede49fb1461d0e2b8b385c95e5e9b7f765a23cc93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:5123 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:5138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b0089e719df86e6993018e45f4a9728b08c68c48418ae1fce53b39e1c2f288"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:5303 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:5592 \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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6a1c625b0acdb178b8fb8e502814560e385a32116116aaa25fc13c36703fe6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlFormatter.ts:365 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:1902 \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":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d131aef88c631dba3b0e1b62d59d7a6c4192382f0031c944fd432c8039eadbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlServerRoutineSyntaxDiagnostics.ts:185 \u00B7 apps/desktop/src/lib/sql/sqlServerRoutineSyntaxDiagnostics.ts:196 \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":"apps/desktop/src/lib/sql/sqlServerRoutineSyntaxDiagnostics.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b846ec6266978996591196a15394d1aa2f07ee197458dd67550cb4828f9bf814"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:2980 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:2987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1f127138aafafbc3e6b1559509fa1f27328cbe20943989f1fec9f79f9a0680"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/lib/sqlserver/sqlServerHostPort.ts:25 \u00B7 apps/desktop/src/lib/sqlserver/sqlServerHostPort.ts:39 \u00B7 apps/desktop/src/lib/sqlserver/sqlServerHostPort.ts:51 \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":"apps/desktop/src/lib/sqlserver/sqlServerHostPort.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88b2e9270636bd45a2722d2c5b6b4a549ceea1fe017479c084f281c133459fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/table/oraclePackageSource.ts:164 \u00B7 apps/desktop/src/lib/table/oraclePackageSource.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":"apps/desktop/src/lib/table/oraclePackageSource.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4758d162608b25024152bb398ae97c1edffccb99c1c72c331bc0689810b065ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleTableRename.ts:328 \u00B7 apps/desktop/src/lib/table/oracleTableRename.ts:401 \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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1c6c4add386beb0caaa7e57d409e9270a1dcce41441a7c0b1885d51f68a656"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleTableRename.ts:923 \u00B7 apps/desktop/src/lib/table/oracleViewRename.ts:330 \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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7689aabd9200f1e67c0c594b4b918ba9708e08d35c801a5b510068b73a8b21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/table/tableStructureEditorState.ts:1530 \u00B7 apps/desktop/src/lib/table/tableStructureEditorState.ts:1701 \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":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f3263e5a4c329ebcc2717f02cccddc61494fd3aefac0c8ef06327c2e2fab3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/table/tableTree.ts:437 \u00B7 apps/desktop/src/lib/table/tableTree.ts:456 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc220ab610bbf0b7715df6a6dd10c816e81683cf29a1e1c1a005b7a862cef251"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/lib/tabs/tabPresentation.ts:575 \u00B7 apps/desktop/src/lib/tabs/tabPresentation.ts:624 \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":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99b75b56c9c3c6c1c2a078d66dc7ac9a59f985291a483cdd9e5e201a4bc8a70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/desktop/src/stores/connectionStore.ts:1898 \u00B7 apps/desktop/src/stores/connectionStore.ts:1904 \u00B7 apps/desktop/src/stores/connectionStore.ts:1910 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab6a0fed6862abd63cf41f6473ae53399bf54f6dc14cb2578307a82e653cf2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:3165 \u00B7 apps/desktop/src/stores/connectionStore.ts:3448 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4b3d0bf61d3483e8bac5e1b78782668113658792869c478dc812c0256c78e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): apps/desktop/src/stores/connectionStore.ts:4829 \u00B7 apps/desktop/src/stores/connectionStore.ts:4835 \u00B7 apps/desktop/src/stores/connectionStore.ts:4841 \u00B7 apps/desktop/src/stores/connectionStore.ts:4847 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4829}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21bb6225b8406c6de3a8750f26e808ae86b01a2b97ee400cd255ed5c920e345"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:6781 \u00B7 apps/desktop/src/stores/connectionStore.ts:6825 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6781}}}],"partialFingerprints":{"codehealthFindingId/v1":"24556629ba0db0fa74d2d7d8e07f8fc91c0233fa461f205dfa68de28489db656"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:7640 \u00B7 apps/desktop/src/stores/connectionStore.ts:7825 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7640}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1770a0bfe3e6b6ec0375725bd3197d4b536be3a5cc3126944d0b43b6218999e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:8121 \u00B7 apps/desktop/src/stores/connectionStore.ts:8140 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8121}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cbd1461d8f444c3110f295f9685ff0b647e04051277d5be8bf2f7f00b2a211"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:9013 \u00B7 apps/desktop/src/stores/connectionStore.ts:9035 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9013}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9c7a46657e02e5466a135733ba048fcebcfe1ec270785259ce593578f61cb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:10400 \u00B7 apps/desktop/src/stores/connectionStore.ts:10443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10400}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dad25147879a3dc22fc44a040e14db6cf5cfaec831fc51cfb44d8fe873fff2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/stores/queryStore.ts:2326 \u00B7 apps/desktop/src/stores/queryStore.ts:2341 \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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5550bc09d89aca66be5660b3a63ed3794e583875f0ba11a063911d1d37c7d478"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/stores/savedSqlStore.ts:161 \u00B7 apps/desktop/src/stores/transferTaskStore.ts:43 \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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b108808c40dea32005632a56366a269f0b6cddb70b0b034fac48aabfe985af3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/desktop/src/stores/settingsStore.ts:2316 \u00B7 apps/desktop/src/stores/settingsStore.ts:2477 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcab36735b069f9c0ea20a004d3ab9a5bd0baecce972ad806b45ff45087ec3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): deploy/plugin-stats-worker/migrate-archive.mjs:243 \u00B7 deploy/plugin-stats-worker/migrate-archive.mjs:285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/migrate-archive.mjs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebc9450bf946c4884f4e59d56510ae70d1b18ea5ff40b3c158b13eaa61e7434"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): apps/desktop/src/App.vue:4241 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:2053 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:7528 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":4241}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bc9617c56207d00f56684c51beef8effed3657844076b9c3df558707debe5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): apps/desktop/src/App.vue:4288 \u00B7 apps/desktop/src/App.vue:4315 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:1216 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":4288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a19b811568adc84234141352548a35ec5152bcc3cc6db757f1d05c0e1d9fef7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/admin/DamengUserAdmin.vue:141 \u00B7 apps/desktop/src/components/admin/DatabaseUserAdmin.vue:183 \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":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4dd3ec9aa3677fdfec91b63c7834b9a3c83b6c6de0b3478554f3390631cbcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): apps/desktop/src/components/admin/MySqlDashboard.vue:115 \u00B7 apps/desktop/src/components/admin/PostgresDashboard.vue:124 \u00B7 apps/desktop/src/components/nacos/NacosDashboard.vue:236 \u00B7 apps/desktop/src/components/transfer/DataTransferProgressDialog.vue:66 \u2014 the 4 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/MySqlDashboard.vue"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55b04ae9e1ce0a94e0fa49979e062f9f403e26c3c74b49dbd9b507f9ab57e6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/admin/NativeJobDamengEditor.vue:82 \u00B7 apps/desktop/src/components/admin/NativeJobDefinitionEditor.vue:260 \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":"apps/desktop/src/components/admin/NativeJobDamengEditor.vue"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac79711b5e25f29b68f1c026cfb7cd1f26eb13a44f5d3f78920ecad565c411f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/admin/XuguServerDashboard.vue:225 \u00B7 apps/desktop/src/components/admin/XuguServerDashboard.vue:250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguServerDashboard.vue"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4095689a9011a1b2171458a0eca583931eabc67b8161a5e59090bc68944cee6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue:124 \u00B7 apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue:130 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0b517c39b9eccedbb1e32cc1a7a897528432868dd75465ac2a1220890fbeaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/config/AgentOfflineExportDialog.vue:84 \u00B7 apps/desktop/src/components/connection/ConnectionDialog.vue:2552 \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":"apps/desktop/src/components/config/AgentOfflineExportDialog.vue"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"736bd479e2eeb5045aea66e13974dfc74fe5a711db640341c8c41f9da7a12de7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/config/DriverStoreDialog.vue:881 \u00B7 apps/desktop/src/lib/connection/driverRuntimePresentation.ts:3 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"da526cbc6e518a9d30b8eb0783cdd41ff92d36e7975b342e20bd76e6462c413a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/diagram/DiagramSyncDialog.vue:87 \u00B7 apps/desktop/src/components/diagram/DiagramSyncDialog.vue:92 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/DiagramSyncDialog.vue"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6e9224becd9b098f0a508c27dd83f9c44d855fc9df2a793d58bc6a4543ae40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/diff/DataCompareDialog.vue:479 \u00B7 apps/desktop/src/components/diff/SchemaDiffDialog.vue:684 \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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c5889fda2a6e8413136920cf15bd8a406405b50b6f671c700ee2ed9f22d493"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffConfigStep.vue:432 \u00B7 apps/desktop/src/composables/useSchemaDiffSession.ts:126 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc6599ef34d78a3cb864cc6ff6eea05f18cd7a8acb6501a851bbad69b3c4e30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffDialog.vue:1399 \u00B7 apps/desktop/src/components/diff/SchemaDiffDialog.vue:1408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6de37e74aa77a2bcf08725028cf4ca730fbb94917423bcef70d10ace244badb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/diff/SchemaDiffObjectTree.vue:136 \u00B7 apps/desktop/src/components/diff/SchemaDiffObjectTree.vue:142 \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":"apps/desktop/src/components/diff/SchemaDiffObjectTree.vue"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c4af80c0188707fc78fbb878c20ad1bc32b164aa9b12e103598ceb96bb7aaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 13 locations): apps/desktop/src/components/document/DocumentBrowser.vue:192 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:529 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:556 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:966 \u00B7 \u002B9 more site(s) not listed \u2014 the 13 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ba6011e6a35759133bc233fb18776ed2570c415c42d3748311643436425b14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9 locations): apps/desktop/src/components/editor/EditorSettingsDialog.vue:7117 \u00B7 apps/desktop/src/components/editor/EditorSettingsDialog.vue:7122 \u00B7 apps/desktop/src/components/grid/DataGridExtractorDialog.vue:66 \u00B7 apps/desktop/src/components/mq/MessageBrowser.vue:49 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 8 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3242a7d91eeb4f6067db5f7a8b801bfbb9e16ba4a5987075038a8758dc8b20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/components/editor/MultiDbExecuteDialog.vue:195 \u00B7 apps/desktop/src/composables/useMultiDbExecution.ts:69 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"758180f9327851c9025a6eb053f39f52a8be765f757010b432e2e6fcf731a697"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/editor/QueryHistory.vue:96 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:4809 \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":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3a8a11938c752551e9f225aa903f1f50d8f12a975e6436418cf99837cc5d61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts:254 \u00B7 apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts:270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7c44fbde6b50ed2dbb49de8cc709db0c26672fb91392c1de4120f6a30e19e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts:297 \u00B7 apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts:302 \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":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"925af1b5e26ad6814e94e231baa88df21c7ed719a50bd6b690bfd3a9da55fd29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/editor/useQueryEditorPointer.ts:274 \u00B7 apps/desktop/src/components/editor/useQueryEditorPointer.ts:343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorPointer.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb3973730bc441c9f557ed473dc8ebfc08f0f7629325f15fd5beac73e71c822"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdDashboard.vue:68 \u00B7 apps/desktop/src/components/etcd/EtcdDashboard.vue:73 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdDashboard.vue"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86cbc85e2d264a73f06efb074e3ff5c0c45979b97f47af729f74100d7c51523"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdDashboard.vue:147 \u00B7 apps/desktop/src/components/mq/rabbitmq/RabbitMqMonitoringPanel.vue:113 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdDashboard.vue"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50dcee30e741d88f67261d4fb429ea6f23673368b89a1ea02e2fc0601c2eb33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/etcd/EtcdKeyBrowser.vue:687 \u00B7 apps/desktop/src/components/settings/SettingsTransferPanel.vue:110 \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":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0b28ab730f23f60695c1e823e67eb6ee0254068fbc6aae291bfd6b37873b07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/explain/ExplainPlanDiagram.vue:84 \u00B7 apps/desktop/src/lib/export/explainPlanSvgExport.ts:53 \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":"apps/desktop/src/components/explain/ExplainPlanDiagram.vue"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee9402c893e8939ce8d0832964803f1bb81beb1488256c07a2505390ba05104"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/generate/params/RegionParams.vue:61 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:1116 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/RegionParams.vue"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b04fb924e16ec7b0bd59bd82d1f5e8ad491996116f692c403eb845a099301b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:9360 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:9456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9360}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d99b5cc473d0bf825a3969ae87bfdafd2a84cae4d307a817403c4e3cdbffb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:13397 \u00B7 apps/desktop/src/components/grid/DataGridConditionEditor.vue:366 \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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":13397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dc2f88813756d3b7b703207404a1a0b97c0d0614d353618d2d2310fce16032"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/grid/DataGrid.vue:13590 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:1846 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":13590}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5c5830916b5494f3b62dbb19f2068280fa939a4b52ba66c3850e25e59258df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): apps/desktop/src/components/grid/DataGrid.vue:14619 \u00B7 apps/desktop/src/components/grid/DataGrid.vue:14757 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:1802 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:1824 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14619}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fa06b305939c0340cfd45c2e4c3a3b98d93b33ee72cf628e93cf70fb8d3d65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/layout/AppTabBar.vue:63 \u00B7 apps/desktop/src/components/layout/SqlEditorWorkspace.vue:143 \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":"apps/desktop/src/components/layout/AppTabBar.vue"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d66b4a818f175f100c01a06b073e553c0e5949ff5a02fd67b8d628b8426bc3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): apps/desktop/src/components/layout/EditorGroup.vue:79 \u00B7 apps/desktop/src/components/layout/EditorGroup.vue:85 \u00B7 apps/desktop/src/components/layout/QueryEditorSurface.vue:30 \u2014 the 3 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":"apps/desktop/src/components/layout/EditorGroup.vue"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d947809d3066fe051bb72925c65391bd34114f2aa3fb8ed5c5040774a680d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/layout/EditorGroupTabBar.vue:1629 \u00B7 apps/desktop/src/components/layout/EditorGroupTabBar.vue:1640 \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":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"b131c1f6d3c588f0664190b78cb7f43038aac57dbb84c133a84f97e11e57f9f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/components/layout/SqlFilePanel.vue:916 \u00B7 apps/desktop/src/composables/useSqlFileFailureLog.ts:69 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"10612cf8f05dd656c09e38d964c67a355f5beaf1ad7b5d728b6c94773edda864"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/mq/MessageQueryPanel.vue:97 \u00B7 apps/desktop/src/lib/dataGrid/cellValueGeneration.ts:88 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MessageQueryPanel.vue"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b062e89237f40bee07bd2eee5bf7a482be0bd54da852baccc8241726b3f795"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/mq/MonitoringPanel.vue:91 \u00B7 apps/desktop/src/components/mq/MonitoringPanel.vue:101 \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":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"340eb34dbe577e41a709f0fbd80d220e2167dfae87d770352711a1c2365f4601"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/mq/MonitoringPanel.vue:273 \u00B7 apps/desktop/src/lib/mq/kafkaTopicStats.ts:14 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e24c526dafd8c21180dba7cb7815a5be0a2f0b26296ca407735e64d1a40239"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/mqtt/MqttAdminConsole.vue:75 \u00B7 apps/desktop/src/components/mqtt/MqttAdminConsole.vue:80 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5ae469f3fbd1cbc8b7ef51d43c0c13664109d3d5163a6151eafa9ade5ee001"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/objects/DatabaseBrowser.vue:138 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:955 \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":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"127f576d61e881c279d5ad64ec6c9e1b65da462ac17417aea083c45eee1e87af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:2692 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:2700 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2692}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a23bd08f42663cae8226f244c02ea21e8781197f63d50b1a3da2f9e87657c3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3129 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:3145 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:3157 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5040ca0351fe8097e5cb3812113f3ed8493841d1057ded35cee36a55e0a4b4df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:3858 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:3976 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3858}}}],"partialFingerprints":{"codehealthFindingId/v1":"167727bb59e1f1520837dcd3dcc81d1611761b47ea887727e354090d0f453ef2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:5381 \u00B7 apps/desktop/src/stores/queryStore.ts:3573 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc44b7e368c55160eed18eca6dc33475c53913fb7f9e2878d5c31698e4ad4ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:6215 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8863 \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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6215}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad228adf01c8f062e6498822dcbd99adffcbd822812d7e78cd4224df412dcb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/objects/ObjectBrowser.vue:6309 \u00B7 apps/desktop/src/components/objects/ObjectBrowser.vue:6350 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6309}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fd32a606e873911165bff3efec3d95b33c20984a4eee130061aa77e54e9517"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/components/objects/OracleRoutineRenamePreview.vue:5 \u00B7 apps/desktop/src/components/objects/OracleTableRenamePreview.vue:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 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":"apps/desktop/src/components/objects/OracleRoutineRenamePreview.vue"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"df84c1e5ae3d75277e975c5e00488b190e32d8f2137e375194cb1d2a7bb0b2aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/components/objects/OracleRoutineRenamePreview.vue:5 \u00B7 apps/desktop/src/components/objects/OracleViewRenamePreview.vue:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleRoutineRenamePreview.vue"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"178a6eac5235ce7429e25662e30aee52f4ed2d08201d478d8f30e08c08e760e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/components/plugins/PluginShortcutBar.vue:72 \u00B7 apps/desktop/src/components/plugins/PluginShortcutSettings.vue:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"apps/desktop/src/components/plugins/PluginShortcutBar.vue"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fa964283c46b9a67fae867a668e689e3c94a93ec7e048f6dd05bdeb9cc1912"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisGroupedKeyList.vue:110 \u00B7 apps/desktop/src/lib/redis/redisKeyGroupIndex.ts:236 \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":"apps/desktop/src/components/redis/RedisGroupedKeyList.vue"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dbdc92c918ddb6007c70e4cdf8e6ed08acf6d77dc3e713dd5eb0ecb0934d81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/redis/RedisValueViewer.vue:567 \u00B7 apps/desktop/src/components/redis/RedisValueViewer.vue:581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1732d9c75ffc0ebf4cf2779afdd50cbda49cae5dcd548012d199cbcfeb1d19c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/settings/McpCapabilitiesPanel.vue:209 \u00B7 apps/desktop/src/components/settings/McpCapabilityBrowser.vue:226 \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":"apps/desktop/src/components/settings/McpCapabilitiesPanel.vue"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1f597d41b22b11ea02ead7a7073ed8a476331486b5c11cad4125f8140b0be5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4355 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:4375 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cc86d4e0bc4b07dc8d3aef2538f28d603c04149d2a14e91d861c56fec5f825"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5348 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:5369 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e11f0ff0733e78383b09b01404f65afa68c537cabee1a59d5e29874a37826ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8315 \u00B7 apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue:8323 \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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":8315}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad889a2cfd0264177a402f4c6ba124c22f40a17cf98524e8917fff51fe4430f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue:95 \u00B7 apps/desktop/src/components/sidebar/VisibleSchemasDialog.vue:118 \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":"apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8102ad196aa624bb6badad74ec26d3f3ed3566771128f652447bf9f74409d62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/structure/StarRocksPartitionOptionsEditor.vue:12 \u00B7 apps/desktop/src/components/structure/StarRocksPhysicalOptionsEditor.vue:12 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksPartitionOptionsEditor.vue"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8f898cbf21a9937e68d2b3ceb25be81d3cc7b0ba35fda5060959ac6c8ec233"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:4315 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:4320 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:4325 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba34bb075fce24c33dab5e39df609b44baf1a5d83c3c546e4099b58843501a95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:5023 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:5086 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28921dce917da7893092e5ca37a6905aea072595ff08d97f8455f00093ec465"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:5912 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:5938 \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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":5912}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b883d7c1c4ca3a6d10f1af193d2447cc7bbdf70a07f384db3bd5a3148beaf3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6643 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:6764 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6643}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eea5992844852395c1620c017ecfb02006f4b63c58bb7603d15e35bf0f778e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/structure/TableStructureEditor.vue:6662 \u00B7 apps/desktop/src/components/structure/TableStructureEditor.vue:7084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6662}}}],"partialFingerprints":{"codehealthFindingId/v1":"648c9628ecab8fde0ba5aba29efcad405e6cbe6374bf31586edc13ad313a0ecb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/components/tabs/RecentClosedTabsDialog.vue:56 \u00B7 apps/desktop/src/composables/useDataGridSearch.ts:287 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"apps/desktop/src/components/tabs/RecentClosedTabsDialog.vue"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ee196e5481a0d13891a79a1068667a9a92e3468a8f44d669e32aba1e462809"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/components/ui/date-time-picker/DateTimePicker.vue:289 \u00B7 apps/desktop/src/components/ui/date-time-picker/DateTimePicker.vue:297 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/date-time-picker/DateTimePicker.vue"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d9363a4eca4089828b3acc7b239cc8fef5c29961799c6e12a35b5e48cf6746"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/composables/useDataCompareConfig.ts:79 \u00B7 apps/desktop/src/composables/useDataCompareConfig.ts:85 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataCompareConfig.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbcbe679c5e687a46d26215994ad996431ee135a00a2ddfd15c3dd6aa6ba5b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/composables/useDataCompareSession.ts:210 \u00B7 apps/desktop/src/composables/useDataCompareSession.ts:420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataCompareSession.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"42362f275c6cf0c1fdc3532b1d17e9fd570204afba53d08c1da04e884aef86bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridActions.ts:199 \u00B7 apps/desktop/src/composables/useDataGridActions.ts: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":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6cce691f46fb49a13b02801ee17a45c18660a8228060b335aca640cee3f054"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExtractor.ts:467 \u00B7 apps/desktop/src/composables/useDataGridExtractor.ts:476 \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":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3946af72af875cc6408cb5c4327bf29775104ae7f18e70eaf33bc07997d05c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridExtractor.ts:640 \u00B7 apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts:92 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"54527853bb9fb963ad7ae7452d1fc1455bc6b3f7cc7afe632b6acade96d48cde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/composables/useDataGridLargeValues.ts:397 \u00B7 apps/desktop/src/lib/dataGrid/legacyLargeValueExport.ts:144 \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":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74ff7c33a81355b4a09e132ace7ccc9e88e07c2da63b1d19b705d5fbdd7bdec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/composables/useExportTracker.ts:880 \u00B7 apps/desktop/src/composables/useExportTracker.ts:887 \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":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"265f8f11cb75c446ce0d3d2c42a6819be6687866dca6cab76a4efd77418cedb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/composables/useQuickOpen.ts:249 \u00B7 apps/desktop/src/composables/useQuickOpen.ts:273 \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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb3fcf5be2fd230560efc1d4c942b04d31f8dc1cb24d3e8f31eb055fb2aeb64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/ai/aiAttachments.ts:216 \u00B7 apps/desktop/src/lib/ai/aiAttachments.ts:222 \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":"apps/desktop/src/lib/ai/aiAttachments.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b225fde8abbe540f0bdf4cacc112467f8827a082e8ed1d57d09a3faf13c42624"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/lib/ai/aiAttachments.ts:243 \u00B7 apps/desktop/src/lib/dataGrid/binaryCellDownload.ts:467 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiAttachments.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"da191f015a188e5dea04bbef2d4227be19baea6c2475747feb9e7ca6da582048"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/ai/aiTypography.ts:29 \u00B7 apps/desktop/src/lib/redis/redisValuePreviewLimit.ts:6 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiTypography.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb901cd142a6698db4b4a7f0be178899e0edb38fdbba99f1e6a6bb192cb1056"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/lib/app/appBackgroundImage.ts:141 \u00B7 apps/desktop/src/lib/app/appTheme.ts:227 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"apps/desktop/src/lib/app/appBackgroundImage.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aeec69a2a9c2a47d550e6bb512d85f4df5587ac300e9ff9980337660fc72f54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/app/documentStoreProvider.ts:576 \u00B7 apps/desktop/src/lib/app/documentStoreProvider.ts:582 \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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bba574226ec69c7dc754aab6cf2ffba047ce23cdb7ebc2a61d3097c335e97f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): apps/desktop/src/lib/app/documentStoreSave.ts:12 \u00B7 apps/desktop/src/lib/app/documentStoreSave.ts:19 \u00B7 apps/desktop/src/lib/app/documentStoreSave.ts:26 \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":"apps/desktop/src/lib/app/documentStoreSave.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b838a0a68150362c0d9fee8856621d8422aa4d712a16df24cd2694551427a1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/app/openTabsPersistence.ts:161 \u00B7 apps/desktop/src/lib/app/openTabsPersistence.ts:170 \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":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf03ad55f1d1a2bdc405ca96afba513ab9c1c6c585f1648814f50f9bb2028c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:784 \u00B7 apps/desktop/src/lib/backend/http.ts:800 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b93719779238b44c289b728d360d14eab2e965b481491727981b61842e729bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/backend/http.ts:4557 \u00B7 apps/desktop/src/lib/backend/tauri.ts:4686 \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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4557}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c4b33ac7dd0b00937a5b2323fe86c5ab6e8547040a65fff9f06d73567328b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 13 locations): apps/desktop/src/lib/backend/http.ts:4587 \u00B7 apps/desktop/src/lib/backend/http.ts:4599 \u00B7 apps/desktop/src/lib/backend/http.ts:4635 \u00B7 apps/desktop/src/lib/backend/http.ts:4759 \u00B7 \u002B9 more site(s) not listed \u2014 the 13 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4587}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab74314cecc1aa673b009c24d5e537720e506ac6e4b88c72c16bd8dad9176a38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts:178 \u00B7 apps/desktop/src/lib/gridSnapshot/gridSnapshot.ts:120 \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":"apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"330a6471ddb5ef50ef2b0f271b4bc1a370a78b55bce39a10a1cf901d5cfdd68d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/connection/agentDriverInstallHint.ts:68 \u00B7 apps/desktop/src/lib/connection/agentDriverInstallHint.ts:75 \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":"apps/desktop/src/lib/connection/agentDriverInstallHint.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b415188106a2d77267409e32192c734a449237fc620fc656c5815424ea5607a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/connection/connectionUrlBuilder.ts:414 \u00B7 apps/desktop/src/lib/connection/connectionUrlBuilder.ts:429 \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":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"4120755aa134b1d1e3040fa6418dd869cb740d1b99909f9478c07e4889e0a9f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/connection/driverInstallProgressUi.ts:125 \u00B7 apps/desktop/src/lib/connection/driverRuntimePresentation.ts:3 \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":"apps/desktop/src/lib/connection/driverInstallProgressUi.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9177fb1f5d969a9814a947f4ac4bb7513f188aac5b32a4cb882c620c42fe256"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/connection/elasticsearchKibanaProxy.ts:17 \u00B7 apps/desktop/src/lib/consul/meshVisibility.ts:1 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/elasticsearchKibanaProxy.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4623d30c7c396820d3e536887626b54493ebf3d1d926060dc10a60c07634aa62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/columnFormatter.ts:317 \u00B7 apps/desktop/src/lib/dataGrid/columnFormatter.ts:335 \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":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cd005074287a27b849501c20738281fd92d060b8409b46847971ad78f04f89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/columnFormatter.ts:405 \u00B7 apps/desktop/src/lib/dataGrid/columnFormatter.ts:466 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6295d855723c0624c844554896875f10783be2903c4469de11bd894cb48484a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGenerate.ts:917 \u00B7 apps/desktop/src/lib/dataGrid/dataGenerate.ts:929 \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":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7566cd61c1b8f3dd9e8e11b5b0b301ca161ac9cb86a8165a72bd0264e04250"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridColumnHeaderInteraction.ts:81 \u00B7 apps/desktop/src/lib/dataGrid/dataGridColumnHeaderInteraction.ts:89 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnHeaderInteraction.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c5eff9dd9071c11c1b2a25ab26dfcb9767b56785f184069d96835d70afc640"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridColumnIndexIcon.ts:33 \u00B7 apps/desktop/src/lib/dataGrid/dataGridForeignKeyNavigation.ts:85 \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":"apps/desktop/src/lib/dataGrid/dataGridColumnIndexIcon.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d354bd5d41045524c4d339e49a2e22a75ee62045062e3b31b8c97e3fbf7df39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridTranspose.ts:379 \u00B7 apps/desktop/src/lib/dataGrid/dataGridTranspose.ts:403 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridTranspose.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6600b0d2e8e2cac39a99d281e6df6e751303fceaca922cb4128bd01b7437aef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/dataGridViewStateCache.ts:242 \u00B7 apps/desktop/src/lib/tabs/documentBrowserStateCache.ts:71 \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":"apps/desktop/src/lib/dataGrid/dataGridViewStateCache.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"277f13b23773bb39f17e32f016887606a492dda7a791894bb4c9d3fcfcd37064"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/dataGrid/spatialReferenceCatalog.ts:32 \u00B7 apps/desktop/src/lib/dataGrid/spatialReferenceCatalog.ts:44 \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":"apps/desktop/src/lib/dataGrid/spatialReferenceCatalog.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70cc5d83b9fb337bea6a6c4fc5d68f5aabfbd4441dc01b502dd3801112ab5f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/lib/database/databaseNamespaceCreation.ts:116 \u00B7 apps/desktop/src/lib/database/databaseNamespaceCreation.ts:125 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseNamespaceCreation.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"18798910f230b8bbcdab9ac24f5460a8565b3a0a0923486c5cd8dd0d384a1efe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/database/databaseUserAdmin.ts:225 \u00B7 apps/desktop/src/lib/database/databaseUserAdmin.ts:251 \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":"apps/desktop/src/lib/database/databaseUserAdmin.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa92558def5b38508ddd43cf629a1e142be8cf586b035f927d3c0fe3a23c026c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/database/dbAdminSql.ts:269 \u00B7 apps/desktop/src/lib/database/dbAdminSql.ts:326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3430a02642c08a51d6fd6bfb31f3f421d1ad7e2b7faa407fcb3d7b62e0abeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleConstraints.ts:323 \u00B7 apps/desktop/src/lib/database/oracleForeignKeys.ts:250 \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":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1793d7cdfbfc348ae44ce97c8b6b38ebe3e1fcb9c9950ed24b7721b80ad422"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleConstraints.ts:486 \u00B7 apps/desktop/src/lib/database/oracleConstraints.ts:574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cfab173099f38a94e799e00d0a2df0e86312e975da4407afca08cec9c933d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleSessionDiagnostics.ts:83 \u00B7 apps/desktop/src/lib/database/oracleSessionDiagnostics.ts:130 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionDiagnostics.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"244ca9cc2e22b44149efc046bd453dc5aaa82f37f977ba9a348215e31cdc7a1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/database/oracleSessionManagement.ts:188 \u00B7 apps/desktop/src/lib/database/oracleSessionManagement.ts:207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionManagement.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"182fb29cd1be45ac237af480461719bbb528da0a9f16789000afbd61aa8ffc37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/database/postgresProcessList.ts:228 \u00B7 apps/desktop/src/lib/database/postgresServerStatus.ts:213 \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":"apps/desktop/src/lib/database/postgresProcessList.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"83809c0c7da8ba700aa39628510412af3c6290992f483df194ed102db69960f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/database/productionSafety.ts:24 \u00B7 apps/desktop/src/lib/database/productionSafety.ts:29 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"da790f110d1cac92f68c94de7a394fe87b60d36ad472d01762de9379f5bcd6dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/database/xuguUserPermissions.ts:318 \u00B7 apps/desktop/src/lib/database/xuguUserPermissions.ts:341 \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":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e05a0171781280fd0f2deb85d20af2cf08001f0af6ec6c5246fb5d851e5435"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/diagram/draft-storage.ts:51 \u00B7 apps/desktop/src/lib/diagram/draft-storage.ts:105 \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":"apps/desktop/src/lib/diagram/draft-storage.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9528fc5200a4f3908bb597ac89279095a53574166a09ad31f97643e13a1cfb1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/desktop/src/lib/diagram/draft-storage.ts:199 \u00B7 apps/desktop/src/lib/diagram/vue-flow-adapter.ts:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"apps/desktop/src/lib/diagram/draft-storage.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd0ff5cb78b49fe5403403853884e775ae54448807a07338d9a1be3e620f45d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/diagram/draft-table.ts:116 \u00B7 apps/desktop/src/lib/diagram/draft-table.ts:149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/draft-table.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dc812dba8f6135e76b681ba13d570e444da46bb6135bae547a95d26856dfc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/editor/semanticSelectionRanges.ts:60 \u00B7 apps/desktop/src/lib/editor/semanticSelectionRanges.ts:145 \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":"apps/desktop/src/lib/editor/semanticSelectionRanges.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7812111103de6e416df0b27a9facab765b8feec4d9d45d2055c16a65c49b97d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/editor/sqlIntentionActions.ts:669 \u00B7 apps/desktop/src/lib/editor/sqlIntentionActions.ts:762 \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":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8e945b9c494ec852c78c0e0c8ea5c0c35e6b02eb1efee725ea347ef99b68d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts:92 \u00B7 apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts:97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff516264a43395393374015defc2c3d6beb20e8f65bf9d4c2b77c4db6ee9bb9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts:145 \u00B7 apps/desktop/src/lib/sql/semantic/model.ts:159 \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":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9c93c30b0a2cebc0139415b9a680d2f68714a6678e34d5aa58533f7133da36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts:446 \u00B7 apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts:474 \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":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"7172b5c3d1ca872ebc4c0101f4bb489ddec9472e1a8c2a44641e524ffb1cab59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts:618 \u00B7 apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts:624 \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":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e3220d018194b778d6e1e69751c75523e314abd2ff5e747c38217bb985948a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/graph/graphResult.ts:145 \u00B7 apps/desktop/src/lib/graph/nebulaGraph.ts:55 \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":"apps/desktop/src/lib/graph/graphResult.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80bbc1a29d4923a869af1fa6d627ec22ccf22f63635a7938e4af56d1e681f35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/history/historyTimeRange.ts:29 \u00B7 apps/desktop/src/lib/history/historyTimeRange.ts:35 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/history/historyTimeRange.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31652b38ffde09ec9626e3d1143daebac52adcf98bc9d7d1e4f642e32d155f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:366 \u00B7 apps/desktop/src/lib/soql/soqlCompletion.ts:170 \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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c448a02c4fef54382711873dee138b2d50029376536f3666c37a28f02b52614"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:589 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:598 \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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe225eb5ed38229ce7c6619bcb5575e8c35d53c25a424908cb8ab3776ccb817"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:2167 \u00B7 apps/desktop/src/lib/mongo/mongoCompletion.ts:2178 \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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4172cb45ea84adb5db11f48bba9421be3c4e5f2449f29c4cc5c7d4bc6e5f5dd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoCompletion.ts:2569 \u00B7 apps/desktop/src/lib/schema/schemaDiffTableFilter.ts:56 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2569}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca12f24f9e35affd5f89b0fb0ae77fded2a62cd74b712ec898dd12a327f366c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7 locations): apps/desktop/src/lib/mongo/mongoShellCommand.ts:618 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:691 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:720 \u00B7 apps/desktop/src/lib/mongo/mongoShellCommand.ts:774 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91230155a518176ffe05580b1cfe26c15bd4ccef0c2f1ff3376617f68c6968d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoSql.ts:204 \u00B7 apps/desktop/src/lib/mongo/mongoSql.ts:214 \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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3698e0d705c868283d2a9c4beac1e14498fefe38ea1783a8538057fc6194b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/mongo/mongoSql.ts:328 \u00B7 apps/desktop/src/lib/mongo/mongoSql.ts:334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fd5b3e72a575da5912f3c81ba0f71fa9e56d64eb02431601d2eb778586104f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/mqtt/mqttPayloadCodec.ts:124 \u00B7 apps/desktop/src/lib/redis/redisCommandPreview.ts:52 \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":"apps/desktop/src/lib/mqtt/mqttPayloadCodec.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ebcb9111650a4fff6e7d9d491bec1adf9b30dbe4dc1b512cddd5685d16074c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/nacos/nacosAdmin.ts:622 \u00B7 apps/desktop/src/lib/sql/insertValueHints.ts:810 \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":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc8b26777fd5725bb4dbbd96efd8e464f18b8f2891e6e1857ba9dfe82214516"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/nacos/nacosServiceManagement.ts:25 \u00B7 apps/desktop/src/lib/sidebar/mongoCollectionMutation.ts:274 \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":"apps/desktop/src/lib/nacos/nacosServiceManagement.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"137b4b45989cfc1e01a35ee8b1aead95274ab3b18b9291cf4e4b276720e46f04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/plugins/pluginHostBridge.ts:703 \u00B7 apps/desktop/src/lib/plugins/pluginHostBridge.ts:709 \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":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a85d9e081d1b93fb5ead58532a0edba9c20c0800c02cc9b93651c91b801622"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/plugins/pluginMarketplace.ts:138 \u00B7 apps/desktop/src/lib/plugins/pluginMarketplace.ts:147 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginMarketplace.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"af54c1d003a7641d6535b54db4ddff3b2d8bf22ab1d5d5767a0aef322ce0f2ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarLayout.ts:6 \u00B7 apps/desktop/src/lib/table/tableVGroup.ts:36 \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":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c801af0e49f91b9744eb2ea270835fbf544df24e1470a4a2e936ace74f4fe1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sidebar/sidebarTreeSelection.ts:48 \u00B7 apps/desktop/src/lib/table/objectBrowserSelection.ts:17 \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":"apps/desktop/src/lib/sidebar/sidebarTreeSelection.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e761436056f8ae710eafe88e57868af59e8d76ade5cbfd6974705c246359fb26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/solr/solrAdmin.ts:122 \u00B7 apps/desktop/src/lib/solr/solrAdmin.ts:424 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/solr/solrAdmin.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05853c4620837d349cdbe19f21b3f8e815ca083e6e16b663ef558577d22ecc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/insertValueHints.ts:67 \u00B7 apps/desktop/src/lib/table/tableSelectSql.ts:78 \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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"35777b64b4ea58b695650d5cb2f238243309ba1cc801e311c00d1f50af44f0a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/layout/rules.ts:10 \u00B7 apps/desktop/src/lib/sql/layout/rules.ts:16 \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":"apps/desktop/src/lib/sql/layout/rules.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0dd854eb428631c50dfc428c0f8cbd9b3be034b7fdbd6552b55aa97aad8a2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/completion.ts:34 \u00B7 apps/desktop/src/lib/sql/semantic/completion.ts:79 \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":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ba7deae7241af300bc5e6da7fc1a9c9fdb2e201b31c28216258ae04334d6d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/diagnostics.ts:273 \u00B7 apps/desktop/src/lib/sql/semantic/diagnostics.ts:584 \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":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c64859472dfa11622e34ac09fd4a69db6661b94b45cdb65aca34fe3940d83a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/semantic/tokens.ts:132 \u00B7 apps/desktop/src/lib/sql/semantic/tokens.ts:139 \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":"apps/desktop/src/lib/sql/semantic/tokens.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87c98aff7c71447fd631d740099b40cc66b8a7cef4680baee1eca115a5fad67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:2841 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:2887 \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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2841}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6d3bb58a9d0f55f7da8c55056026cb27dbd6a55963ac44c4781da9dc16aeab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:3247 \u00B7 apps/desktop/src/lib/table/tableSelectSql.ts:336 \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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"1185047f5aeb74024a6a2389ef00d31920eec1b983579d50f3b52692ee6063b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:4711 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:4780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4711}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb5b7dd4a747bf58d122e76681c74ead05666a15ff3fd8255b55d8b72a1fdfe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:4905 \u00B7 apps/desktop/src/lib/sql/sqlMetadataRefresh.ts:41 \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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4905}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfa1937556b2a2d7a99cfc5a833bab93c964c63a820cdb6e4cadfc89902e1b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlCompletion.ts:6528 \u00B7 apps/desktop/src/lib/sql/sqlCompletion.ts:6648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed634a1b803e9b5bdc5ee0bc191461a45c34e96e2b07f541452dd5b6954b6bc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlCompletionAnalysis.worker.ts:12 \u00B7 apps/desktop/src/lib/sql/sqlDiagnosticAnalysis.worker.ts:5 \u00B7 apps/desktop/src/lib/sql/sqlStatementAnalysis.worker.ts:5 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletionAnalysis.worker.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1ec27c8ad66f6557125e85968aa50cdab9f1b6d0551594213114ba6a5fab6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): apps/desktop/src/lib/sql/sqlFormatter.ts:327 \u00B7 apps/desktop/src/lib/sql/sqlFormatter.ts:633 \u00B7 apps/desktop/src/lib/sql/sqlFormatter.ts:1004 \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":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"9713de9b48a74470aadd7dc01b329da02a2041a689093c4b209f6207191b572e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlIdentifier.ts:728 \u00B7 apps/desktop/src/lib/sql/sqlIdentifier.ts:734 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlIdentifier.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a66a037a2a4e007e5a8dc01414cfaba83a5330394559b80367d88c7a5e345bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlParameters.ts:1162 \u00B7 apps/desktop/src/lib/sql/sqlParameters.ts:1740 \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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d36065a684920579ecd35c4860e3d2ace3fa9999f9a1e56764c7b9397085b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/sql/sqlStatementRanges.ts:3075 \u00B7 apps/desktop/src/lib/sql/sqlStatementRanges.ts:3097 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaf17e4790c38fceec0b8c3c4c63cd7a8b288cf74b2e3350c5b8dc997dd7050"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): apps/desktop/src/lib/table/oraclePackageSaveAs.ts:69 \u00B7 apps/desktop/src/lib/table/oracleRoutineRename.ts:93 \u00B7 apps/desktop/src/lib/table/oracleTableRename.ts:108 \u00B7 apps/desktop/src/lib/table/oracleViewRename.ts:69 \u2014 the 4 copies are spread across 4 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":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ab5250f74175f43a3f0cb632ae05c57e69bb63b553676fed36cb9ae2985cec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleRoutineRename.ts:149 \u00B7 apps/desktop/src/lib/table/oracleTableRename.ts:150 \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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"498820938f5f3d26fb4293e62fb5402cca947a4f27dae64c13d619f305214fae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleRoutineRename.ts:274 \u00B7 apps/desktop/src/lib/table/oracleTableRename.ts:553 \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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf801d57ea54ada3e869cca6e49823e470f29580c333f1855ec0bfa33403f24c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleTableRename.ts:129 \u00B7 apps/desktop/src/lib/table/oracleViewRename.ts:87 \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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"89769133ec0ced655c0e775b00b92f47d07a630562996b211530c36c9f1f1e6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/lib/table/oracleTableRename.ts:717 \u00B7 apps/desktop/src/lib/table/oracleTableRename.ts:729 \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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1ef735a16266c3799563d1b47fcfef78013887ffd0094e45312e05a037c1d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:3511 \u00B7 apps/desktop/src/stores/connectionStore.ts:3557 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc7ad5401315cdbdbeb9bdc444ad07e4de052fa50bb13e4c62eea97e1f753a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:4132 \u00B7 apps/desktop/src/stores/connectionStore.ts:4233 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4132}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ab5477ccd886d4b6e60f5160ce6daa31a0835b97ff71dd319337c9c3264ea6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:4969 \u00B7 apps/desktop/src/stores/connectionStore.ts:11422 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4969}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a0655a4be277de1702e2e0e6da581c64c8064fa3072ff10459eaf90f17c205"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:6444 \u00B7 apps/desktop/src/stores/connectionStore.ts:7299 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6444}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c38b26819caebed0ee49506d810448e0757d133a66b20b1e03d8c0f283babf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): apps/desktop/src/stores/connectionStore.ts:8662 \u00B7 apps/desktop/src/stores/connectionStore.ts:8727 \u00B7 apps/desktop/src/stores/connectionStore.ts:8771 \u00B7 apps/desktop/src/stores/connectionStore.ts:8816 \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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5383e433869349893e8aab7bc219f7ecd70a86a97fd64f8b369dd2aba2f6c07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/stores/connectionStore.ts:11758 \u00B7 apps/desktop/src/stores/connectionStore.ts:11763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11758}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c41c29d08617fad3147cc6a64430f9f8dd3ace68976df1c714dbddce9eb7f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/stores/settingsStore.ts:2184 \u00B7 apps/desktop/src/stores/settingsStore.ts:2202 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a4c14d43a20e801e7858ec4c6c2d4fc9cacb22c35838b66d2a46925b065649"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/stores/settingsStore.ts:2210 \u00B7 apps/desktop/src/stores/settingsStore.ts:2473 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6be0411855981e3620ab6c78725fd1964ed7a52425192435d0f86cab5a9642"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/stores/settingsStore.ts:2303 \u00B7 apps/desktop/src/stores/settingsStore.ts:2345 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"594bc9d7869ed92fc7f6dceb1775d2b3ddde752803f8e9df8b93d49f0a09467e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/stores/transferTaskStore.ts:265 \u00B7 apps/desktop/src/stores/transferTaskStore.ts:271 \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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8d8a6a4008b2992679c0c42d591236405cffc234057b54f78287c1885417cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/desktop/src/stores/transferTaskStore.ts:418 \u00B7 apps/desktop/src/stores/transferTaskStore.ts:445 \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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"509f032a8aea4da5ce8be3d289f57e3bb84acd8f6ad32b08bfcb368e0355e05b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/plugin-cli/scripts/stage-dev.mjs:5 \u00B7 packages/plugin-cli/scripts/stage-sdk.mjs:5 \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":"packages/plugin-cli/scripts/stage-dev.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be478edceba9f69154f013dc75a3f4d39e2b2328001578ef1cd2e0c2a6e00ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): scripts/check-mq-integration.mjs:46 \u00B7 scripts/check-mq-integration.mjs:55 \u00B7 scripts/check-mq-integration.mjs:64 \u2014 all 3 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":"scripts/check-mq-integration.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49aa8ece1f7eab8f6faa3eeebca1ec562470e7cff167664741e67c5ea2dc3ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/sync-connection-types.mjs:98 \u00B7 scripts/sync-connection-types.mjs:169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sync-connection-types.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ace4335ab75f91ba46f0057fba19563404e1f17e3572751a6e2a179c0546350"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/verify-cli-migration.mjs:87 \u00B7 scripts/verify-cli-migration.mjs:97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-cli-migration.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c734603ffc792c2d6bd164ede892ac1b1a591ae034e440f4a44a7e2bb97ee8a9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: apps/desktop/src/lib/diagram/elk-layout.ts:1 imports elkjs/lib/elk.bundled.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/elk-layout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f29ae69aff4b09baa7412b880dd65455df543352d58b06e1c781ec58427e44c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: apps/desktop/src/lib/sql/layout/internals.ts:60 imports sql-formatter/dist/esm/parser/createParser.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/internals.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b96abd50884f9170b9c4a33205bdefad426489c017c3e430091cfb81be1631c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: apps/desktop/src/lib/sql/layout/internals.ts:61 imports sql-formatter/dist/esm/dialect.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/internals.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c53cb54198510d4673c440113a089510e3f891ba3672afd4caffd639bf00c60"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: apps/desktop/src/lib/sql/layout/internals.ts:62 imports sql-formatter/dist/esm/allDialects.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/internals.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ac97dad184378a0c2d91fc1df8f2214137fb8c3635b08eeb4e0a420115bac4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: apps/desktop/src/lib/sql/layout/internals.ts:63 imports sql-formatter/dist/esm/formatter/ExpressionFormatter.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/internals.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a116cdbb89a0ffb75685739ab65831297833547d396ff154088155ff7490bf79"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: apps/desktop/src/lib/sql/layout/internals.ts:64 imports sql-formatter/dist/esm/formatter/InlineLayout.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/internals.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8eae438d71ee8f47a1fd5a45d10ef3824b754cb560eace76d203176543641f7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: apps/desktop/src/lib/sql/layout/internals.ts:65 imports sql-formatter/dist/esm/formatter/Params.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/internals.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"793706c7bc1eebacf6c109a9b564488c9b3ca0e71d6c84204b2d70ff0d8fae17"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: apps/desktop/src/lib/sql/layout/internals.ts:66 imports sql-formatter/dist/esm/formatter/Layout.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/internals.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"544b3ee83a41a294b05b040996ca349bbb5d017d38612895f68e3cbdcbf09237"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: apps/desktop/src/lib/sql/layout/internals.ts:67 imports sql-formatter/dist/esm/formatter/Indentation.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/internals.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dc578803f5a9c6ca6cdd4c6391012430fd7db4d793cd60861e3d931b57c3c9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/app-tests/mongoShellCommand.test.ts:43 reaches past another workspace package\u0027s public entry into its internals with a relative path (../mongo-shell/src/json.ts) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app-tests/mongoShellCommand.test.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0625f021a8c306e70d0cd750c00a4103a7aadba7f05d4a0d662850c48e6020"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeTabSql (cyclomatic 661, cognitive 870): executeTabSql has cyclomatic complexity 661 and cognitive complexity 870; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8415}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fa89cfdd3c42bd80c58387a91fd746a5c5468d4fc15a53456bc4c2ead28119"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyEditorSettingsPatch (cyclomatic 308, cognitive 329): applyEditorSettingsPatch has cyclomatic complexity 308 and cognitive complexity 329; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b16bccc6924056a269b3cf9dafe4253532699564f3f7a2100e9e8fb132032d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionConfigForSubmit (cyclomatic 289, cognitive 366): connectionConfigForSubmit has cyclomatic complexity 289 and cognitive complexity 366; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":5087}}}],"partialFingerprints":{"codehealthFindingId/v1":"129bb845ca4aec4215d86a012fb1ef17eaa43de62d3e978c34e2326be182802c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 241, cognitive 350): send has cyclomatic complexity 241 and cognitive complexity 350; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":4100}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb715166c53ff9c9ae8f393919632549e46cbce84a898d40e1c6c6be64f3122"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toggle (cyclomatic 221, cognitive 241): toggle has cyclomatic complexity 221 and cognitive complexity 241; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2caf6cfa987d46166f03cb3150864151c7e2bde1c81faece9b4a18623ead31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 184, cognitive 287): dispatch has cyclomatic complexity 184 and cognitive complexity 287; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9d4a800351d8da08ec1a53a0a15570b57ef385df1233ae10fda77f4a140df9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeEditorSettings (cyclomatic 181, cognitive 171): normalizeEditorSettings has cyclomatic complexity 181 and cognitive complexity 171; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c38bb8ef9f9220cb31fa5fe47b31326b06f21553c265b170a0aac1dd6dc196"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchCapturedTabResultForExport (cyclomatic 171, cognitive 242): fetchCapturedTabResultForExport has cyclomatic complexity 171 and cognitive complexity 242; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11358}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e106da6f48526b6ee20c78500ab68b8ac7d854531162caebaf04d0383401422"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildObjectSidebarMenu (cyclomatic 149, cognitive 227): buildObjectSidebarMenu has cyclomatic complexity 149 and cognitive complexity 227; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":8334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3889b890daff1eeda00562ce71f701c65948a7ff635337ed9ab8176261b0dc38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeydown (cyclomatic 136, cognitive 157): handleKeydown has cyclomatic complexity 136 and cognitive complexity 157; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":4831}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4da66960fea65cb15e85775dc7af9b1271744459ddb597880aa05d9946dc715"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onGridKeydown (cyclomatic 129, cognitive 133): onGridKeydown has cyclomatic complexity 129 and cognitive complexity 133; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":12005}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aa19f46c7224ff380caacc0a42225075cbd0d40b713d5f0e9b1fc8ffdd2011"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshSqlPreview (cyclomatic 126, cognitive 182): refreshSqlPreview has cyclomatic complexity 126 and cognitive complexity 182; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbb2e7adca6d3ae013e560b88c1159f16fe8ea382d5297c18a50ad176697cc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveChanges (cyclomatic 126, cognitive 150): saveChanges has cyclomatic complexity 126 and cognitive complexity 150; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4c1e4cde498caa16c467ec15ccf476348ab48b934f478ae1741c86996c51cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function performAsyncCompletionWithResult (cyclomatic 123, cognitive 152): performAsyncCompletionWithResult has cyclomatic complexity 123 and cognitive complexity 152; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a978f747665c36843d2d05373a419d9aa1dbb0d4df7c552314c9371079c06b4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleTypeManagement (cyclomatic 122, cognitive 203): prepareOracleTypeManagement has cyclomatic complexity 122 and cognitive complexity 203; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b0aaf91347c6d2ebd189372f11230aaedd51d3e9474b8668e9acae5ee39dfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openData (cyclomatic 116, cognitive 114): openData has cyclomatic complexity 116 and cognitive complexity 114; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/composables/useSidebarDataOpenRuntime.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3ed3cc4721585d4578bf41d2c9008176f6b7190219c898d1c3eda82631aa51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDefaultGeneratorParams (cyclomatic 109, cognitive 123): buildDefaultGeneratorParams has cyclomatic complexity 109 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"951da96568cababce1e89cca80ffcda390a64c52286b6bc98007dce382c7ad5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureTreeLoadedForTarget (cyclomatic 109, cognitive 116): ensureTreeLoadedForTarget has cyclomatic complexity 109 and cognitive complexity 116; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"2157c8929bf8717f13a033c6ab4f80bad9e532baf17d9e277883538f474df822"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getIconInfo (cyclomatic 109, cognitive 26): getIconInfo has cyclomatic complexity 109 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f548e59f61b02f1635cc7bbe81c18b5b82366cee004e5f0f74ae6864ed3c810e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 107, cognitive 150): (anonymous) has cyclomatic complexity 107 and cognitive complexity 150; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":3320}}}],"partialFingerprints":{"codehealthFindingId/v1":"799953a3d74e7969b905f52bab90d18406c5e12b7ca4283a698c3bd0dfcd9eba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTreeNodeChildren (cyclomatic 107, cognitive 83): loadTreeNodeChildren has cyclomatic complexity 107 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8971}}}],"partialFingerprints":{"codehealthFindingId/v1":"df709c3ffb6db2279f16de10799a1c1ca29f150c750c4cf57d7d50b2e2f1b957"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indentRoutineBlocks (cyclomatic 105, cognitive 104): indentRoutineBlocks has cyclomatic complexity 105 and cognitive complexity 104; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/lib/sql/routineBlockLayout.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68a8690976fda72c84bc50c2978d62b8eace8580c18add026ab15f9e55589c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 101, cognitive 97): build has cyclomatic complexity 101 and cognitive complexity 97; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"36605f677b09ef184860fbfb6372bb39cc7e1d4751fe1d999b8eb12032db49e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSqlCompletionContext (cyclomatic 101, cognitive 71): getSqlCompletionContext has cyclomatic complexity 101 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3053}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e89309630b376802fe7e2486b19e6c92ca447be8ee231c66de94fc6b235d58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadStructure (cyclomatic 98, cognitive 116): loadStructure has cyclomatic complexity 98 and cognitive complexity 116; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4249}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e2b367783a948cc678ab660acbff9e75ce65bfdad145a05eb4e4991d61a309"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitSqlStatementRanges (cyclomatic 97, cognitive 196): splitSqlStatementRanges has cyclomatic complexity 97 and cognitive complexity 196; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4889c773c29cb3c79286ec0445b63daaedd925610dc626e3e6fb228d334e38f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provideSqlCompletions (cyclomatic 96, cognitive 118): provideSqlCompletions has cyclomatic complexity 96 and cognitive complexity 118; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c997f2ccff09a026ee381f656e73322ffa8ff6f2deb132de3f87f74a0864e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function explainTabSql (cyclomatic 95, cognitive 188): explainTabSql has cyclomatic complexity 95 and cognitive complexity 188; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aba20fdef62b53249489242af63b4c2a574aa94c6c8cc88250911e17c20ce9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queryResultTransferTargetType (cyclomatic 95, cognitive 164): queryResultTransferTargetType has cyclomatic complexity 95 and cognitive complexity 164; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"930b4512f6225e649ddd6b1f21f6552c33163688d2796b0d86db2a9d23b25268"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOceanbasePrimaryKeySnapshot (cyclomatic 95, cognitive 94): readOceanbasePrimaryKeySnapshot has cyclomatic complexity 95 and cognitive complexity 94; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/lib/database/oceanbasePrimaryKey.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8164999e11862e9ee31b281bc4394eb2ad6dbd0e4431e3796693c3fb750846c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTreeNodeIconInfo (cyclomatic 95, cognitive 11): getTreeNodeIconInfo has cyclomatic complexity 95 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeIcon.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb2c47149c6603ce9b3cd1bf03574c92c89efd5c591f973e4d2a490743b2eb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleQuickOpenSelect (cyclomatic 92, cognitive 100): handleQuickOpenSelect has cyclomatic complexity 92 and cognitive complexity 100; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":4194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7759fbb56e7254bf9d5990412acbd5406a88a17b0927c1302bf3b900622b1cff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onReloadData (cyclomatic 90, cognitive 130): onReloadData has cyclomatic complexity 90 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3515408b970e8eb8fb976eec0b063453b49583be60445e5b3933b92d0e0f7721"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseColumn (cyclomatic 89, cognitive 171): parseColumn has cyclomatic complexity 89 and cognitive complexity 171; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"472c45384c116213580c24de779750992689839f9559b004fc919bf18aa04149"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOracleConstraintPlan (cyclomatic 88, cognitive 117): executeOracleConstraintPlan has cyclomatic complexity 88 and cognitive complexity 117; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fe8f7eed0f6b4f6b3a09f3c1fa80df248584080cd2f7de6f9a6d0432eaa417"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawCanvasDataGrid (cyclomatic 88, cognitive 115): drawCanvasDataGrid has cyclomatic complexity 88 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee843995c787724f45c2a56ae96927a7d80d6066d551d31ed98da31f4228e1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 86, cognitive 158): (anonymous) has cyclomatic complexity 86 and cognitive complexity 158; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3322141befcdef7ee7373493d70c8aa80bdbd3a61f0e4d0521a02e3f97c51f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transfer (cyclomatic 86, cognitive 112): transfer has cyclomatic complexity 86 and cognitive complexity 112; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f7173c1d919812af3c216cdded836d692e2fc598edce2cb8effe6fd4164b08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSchemaDiffSession (cyclomatic 86, cognitive 107): runSchemaDiffSession has cyclomatic complexity 86 and cognitive complexity 107; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSchemaDiffSession.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e621d068c61f1ffac9b59cdebf288d6fb79390bebe0fcff79b9626befb0223"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findSqlParameterOccurrences (cyclomatic 85, cognitive 127): findSqlParameterOccurrences has cyclomatic complexity 85 and cognitive complexity 127; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"676209b77e174a9819ae132b653d4a2baa8eb21aa26227436e814772431356ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFunctionDescriptions (cyclomatic 85, cognitive 84): getFunctionDescriptions has cyclomatic complexity 85 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4074f27070fb46bcb40cd8036c269b32264c46d4cb3e24d155927b2f32e8f1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSqlHoverTooltip (cyclomatic 82, cognitive 102): resolveSqlHoverTooltip has cyclomatic complexity 82 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea1fc9bd4359259f69f313018abd5c28c11df3a7a64c78d258601c079b4e95d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOceanbasePrimaryKeyPlan (cyclomatic 81, cognitive 135): executeOceanbasePrimaryKeyPlan has cyclomatic complexity 81 and cognitive complexity 135; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbasePrimaryKey.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0028caee767458e36bfa8818c03b3eb1c903395d39709c7736f8e95ad68232"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildNativeJobDefinitionEdit (cyclomatic 81, cognitive 117): buildNativeJobDefinitionEdit has cyclomatic complexity 81 and cognitive complexity 117; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b64e488ed81883a79bd3ee52f9beb1f6aefacaa334030f9a9994f21eb725544"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doExecute (cyclomatic 80, cognitive 94): doExecute has cyclomatic complexity 80 and cognitive complexity 94; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00c87730f7b4dc4b2f7e8ba57d05078112401638a02b676f088d90fe67f04b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmRenameObject (cyclomatic 80, cognitive 86): confirmRenameObject has cyclomatic complexity 80 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4611}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4abebac7e425dabc88b60d372b649588c823fcdd9a5e325c1eec1caf5550a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rewriteCreateTableName (cyclomatic 79, cognitive 186): rewriteCreateTableName has cyclomatic complexity 79 and cognitive complexity 186; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db40ece050b47986197da38f5d104cafaf7bdff89f69a494b0c35d70364f645"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyChanges (cyclomatic 79, cognitive 89): applyChanges has cyclomatic complexity 79 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":7483}}}],"partialFingerprints":{"codehealthFindingId/v1":"548132112579a2a64f49543cf4718865de62252c5c9e9f384532ddafd079f475"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoWriteCommand (cyclomatic 78, cognitive 114): parseMongoWriteCommand has cyclomatic complexity 78 and cognitive complexity 114; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bef797e42aa8df0f04abf9fa9f76c669e75e0de9b6f22b2bea8687daa474f5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateValue (cyclomatic 78, cognitive 102): generateValue has cyclomatic complexity 78 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6fa0e92ba31d22d449e210c55db83857e72c427ea6ca317be20624060b391b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawCell (cyclomatic 76, cognitive 77): drawCell has cyclomatic complexity 76 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3aef30faa8d833c4e1282e1e471018020878cc83b84e44fc3e006022280bdca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesTarget (cyclomatic 76, cognitive 58): matchesTarget has cyclomatic complexity 76 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed884962ad316b8af2f56ff8b0150f8fa20326b04a6e8e91c7fb2212603131c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeSqlSemantic (cyclomatic 75, cognitive 117): tokenizeSqlSemantic has cyclomatic complexity 75 and cognitive complexity 117; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/tokens.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34635326fdc44190f2049ddd1bb4022671eba7754de0f57d44a7fd9a12f529c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 75, cognitive 111): (anonymous) has cyclomatic complexity 75 and cognitive complexity 111; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/table/oracleTableRename.spec.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f655a507df8b1a135bf1a1abd6effa861cbdbcf7a2d5bd2842d86ca9ec7d29ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOracleForeignKeyPlan (cyclomatic 74, cognitive 116): executeOracleForeignKeyPlan has cyclomatic complexity 74 and cognitive complexity 116; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"926d98cd27b4cb058d7cfa0e892ef50784ddf32377c9b8669405e185190e0c52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openTableTarget (cyclomatic 74, cognitive 82): openTableTarget has cyclomatic complexity 74 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0187c91f35559c9be9f6eb81180007e772842037e95ea0ea1a7f9cbe2aeeab81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeTargetSql (cyclomatic 71, cognitive 106): executeTargetSql has cyclomatic complexity 71 and cognitive complexity 106; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"874aca345df05719ea4c2431d71b22529c791a8e2f73b8364dc2ba41fdf6e72b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabDisplayTitle (cyclomatic 71, cognitive 102): tabDisplayTitle has cyclomatic complexity 71 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7183f80debee39f10d9cf98fae2d50c8c99b4502606d425fcabe150b347aad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queryResultTransferSqlLiteral (cyclomatic 71, cognitive 81): queryResultTransferSqlLiteral has cyclomatic complexity 71 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f442bd00c2ea94e25e7adc37f57c441f5fbaf473ea01a547d879cf430d0837e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshSemanticDiagnostics (cyclomatic 70, cognitive 84): refreshSemanticDiagnostics has cyclomatic complexity 70 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6cff63d20d47a7a664c1111f1c131d4faa36ba740d2f8c0388bb8e38162ffd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDatabaseSidebarMenu (cyclomatic 67, cognitive 129): buildDatabaseSidebarMenu has cyclomatic complexity 67 and cognitive complexity 129; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":7825}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1723e91f51a4f256ace3cb31a01361ade4a9697e646a84d4c69eee47aef4cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getGraphCompletionContext (cyclomatic 67, cognitive 99): getGraphCompletionContext has cyclomatic complexity 67 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletion.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c461601fb6bf53bf49740aad2662b219d711199911af0f246b291756ce712f6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDescriptor (cyclomatic 67, cognitive 71): validateDescriptor has cyclomatic complexity 67 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sync-connection-types.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d728705bacd8bd76646145dc93226f2666559b812b400695e963b897f01f45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compressSqlText (cyclomatic 66, cognitive 137): compressSqlText has cyclomatic complexity 66 and cognitive complexity 137; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe6d7e76443c4154addcb00c5db29de516f831f48e9075d3d4946af491c593"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRecipe (cyclomatic 66, cognitive 87): validateRecipe has cyclomatic complexity 66 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/database-env.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c074d67d496bd83aea3e059a7e33fb43c7c79915de1b1ba1a18f4104c11527"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 66, cognitive 69): (anonymous) has cyclomatic complexity 66 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7633}}}],"partialFingerprints":{"codehealthFindingId/v1":"f704f8e0548743d863756916590489915971895b2659cdbc4d17753c003cdc18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRequest (cyclomatic 66, cognitive 65): buildRequest has cyclomatic complexity 66 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"733f29ff1e210aebfd8e17c44a6452db67f1187eb8034b765544615da93063a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSpecialJdbcUrl (cyclomatic 65, cognitive 89): buildSpecialJdbcUrl has cyclomatic complexity 65 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b98f3e3ef43707bb9e0270e9eb0f71bd4eeee4f5569bcb910f96d56025d673"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLocalSqlCompletionResult (cyclomatic 65, cognitive 80): buildLocalSqlCompletionResult has cyclomatic complexity 65 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a14afa6c66bc2e0894961abc383aea8ed2fd493799e6a51b73d0e1a80b29038"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseConnectionUrl (cyclomatic 65, cognitive 63): parseConnectionUrl has cyclomatic complexity 65 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0a0b75955f2f5987cfa2a50f9423f19e1bef0b4854b8c35fb2f890c811a6a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 65, cognitive 62): (anonymous) has cyclomatic complexity 65 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b494303d7aae71253bdde8fbfd7d2cb9db4734461b9c6ede6352272502dbe7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bridge (cyclomatic 65, cognitive 58): bridge has cyclomatic complexity 65 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9ca5213b0bf861ab863173b999503e9bcd591594c34adf87d7d5f09883ced5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOracleRoutineRename (cyclomatic 64, cognitive 116): executeOracleRoutineRename has cyclomatic complexity 64 and cognitive complexity 116; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"b922bc9fdbb324c74ce68fad409bbf317eff9e2d2cff3b9ff13f493056dbe679"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSettingsTransferFile (cyclomatic 64, cognitive 79): parseSettingsTransferFile has cyclomatic complexity 64 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b7ef8a1b5a6e42dbc227c511b5a2c6112712df6c0714c9b2e81f8216e956f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSpecialSidebarMenu (cyclomatic 63, cognitive 87): buildSpecialSidebarMenu has cyclomatic complexity 63 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":8048}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a7d1211575978d05898400238c6d0e5833d3dd76159146efdc6ad89d09e08f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 63, cognitive 64): (anonymous) has cyclomatic complexity 63 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8031}}}],"partialFingerprints":{"codehealthFindingId/v1":"393d20d280bea0d98684e295931ea5cf325681bc08c03d60d0517cbfcf6c06bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maskStringAndCommentSpans (cyclomatic 62, cognitive 123): maskStringAndCommentSpans has cyclomatic complexity 62 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d74cecf6e087d824d773d01866a5ab30f9e4812bddaeee6c5577fcff4b4113"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectMysqlRoutineVariables (cyclomatic 62, cognitive 108): collectMysqlRoutineVariables has cyclomatic complexity 62 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/mysqlRoutineVariables.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee809fd29ae95e1c6a3634824754c5ba9ac27bf32e7d0b344581bfd2bd60dc09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processDatabaseTreeNodes (cyclomatic 62, cognitive 84): processDatabaseTreeNodes has cyclomatic complexity 62 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca926d47d692cc93d1bfb1f0848eec5f5918297587b4b825e9ea311b8a6a15f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmRename (cyclomatic 62, cognitive 70): confirmRename has cyclomatic complexity 62 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e0212fe8d736cf4a0f4a07e01e223e4f9c22f42888b20a1f66aacb33ed59f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importDataTypeForDatabase (cyclomatic 62, cognitive 66): importDataTypeForDatabase has cyclomatic complexity 62 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableImport.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"026d77773bab99ecf7a782cd3021c09e1df42ef252c30a3cb9449733d99603ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function starRocksAlterOptionsFromDdl (cyclomatic 61, cognitive 90): starRocksAlterOptionsFromDdl has cyclomatic complexity 61 and cognitive complexity 90; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksAlterOptions.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb58ba2ba6c2c5661eda2629b331e2bb57f06488d113af5fbf0b16154c2ea45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 61, cognitive 88): load has cyclomatic complexity 61 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8ea742cccc8d6b0380549389ae9217edc99daad687a6598e67d4e191ea9661"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hydrateVisibleLargeValuePreviews (cyclomatic 61, cognitive 65): hydrateVisibleLargeValuePreviews has cyclomatic complexity 61 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"242126f6a5e677a655ca5ece331efc73852ac6d68ebb4c4cc828ccb714174a46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMongoCompletionItemsFromContext (cyclomatic 61, cognitive 26): buildMongoCompletionItemsFromContext has cyclomatic complexity 61 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"7879c3be8e80b50c468115914d98554ceeaea430c20af5b693090903875042d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 60, cognitive 98): (anonymous) has cyclomatic complexity 60 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/__tests__/OracleInvalidObjectsDialog.spec.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"793dded8a4e679a31824dfcd6b07f041f807dcb19dacf68faacb61cf5bcd5e3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invalidateCompletionCache (cyclomatic 60, cognitive 79): invalidateCompletionCache has cyclomatic complexity 60 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4817}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc468ad789cc2a30208fc930d73517ed08a12510544abfbc927b73ec2a76516"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOracleTableRename (cyclomatic 59, cognitive 104): executeOracleTableRename has cyclomatic complexity 59 and cognitive complexity 104; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63d8bb214a576d25f01956e359c1c3bdbd3f9e7112cfdcc87cca531ef78ec4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshRenameObjectPreviewSql (cyclomatic 59, cognitive 76): refreshRenameObjectPreviewSql has cyclomatic complexity 59 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4301}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd5790991c1722805d77fe7c59a475f03e3e60eb42ea19bb3dadb2a03349f91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileSingle (cyclomatic 58, cognitive 81): compileSingle has cyclomatic complexity 58 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"13584eae8a77c39ed28f9ab8268553221ce06b7e866fa1bc8fcc70b8e49ad6f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPaginate (cyclomatic 58, cognitive 77): onPaginate has cyclomatic complexity 58 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"ababb4c66951e86917906e1bbf343ab4831c05a326d0475eb2f88b09dbcb36c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeDataGridExtractorOptions (cyclomatic 58, cognitive 48): normalizeDataGridExtractorOptions has cyclomatic complexity 58 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef22d5b4c2d3bb9c6f37efbeb1aad4bb0ee18c8a7fc781ddf322280eefe5b5a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertToSchemaDiffObjects (cyclomatic 57, cognitive 88): convertToSchemaDiffObjects has cyclomatic complexity 57 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"144a05196f8fe7de1845ea08ad21f16f9416dbf2b0df2f8ad18641a806966baf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnoseMongoCommand (cyclomatic 57, cognitive 78): diagnoseMongoCommand has cyclomatic complexity 57 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f67e649d5d7e2456f2fab1e4eff23572626e188e43364ff2a239c2fa80d3c3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadList (cyclomatic 57, cognitive 66): loadList has cyclomatic complexity 57 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fad05b40e79c58add49ae590fab04f0c678a0ea7e0e5c87707a21b6b94218fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportLocalSnapshot (cyclomatic 57, cognitive 52): exportLocalSnapshot has cyclomatic complexity 57 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a17fd3ee8fa6d64b1625fc04b80c03b35591ad7c86f681f4bfb3488fae3956e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleTableRename (cyclomatic 56, cognitive 102): prepareOracleTableRename has cyclomatic complexity 56 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"880b8958dffcde7dd2b3d5fe3d0bfe5a1496635330913d7186ca2fe8faccb56e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreDraft (cyclomatic 56, cognitive 62): restoreDraft has cyclomatic complexity 56 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3062}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22d4eec108cd72aaae234d5ec658e160df8929bc73fbb57abf11c31110af70e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishSnapshot (cyclomatic 56, cognitive 54): publishSnapshot has cyclomatic complexity 56 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b0cba0945c41ad770a603a83513a298cc3eeecea74a1d8c5b405ac7458cb83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 55, cognitive 100): apply has cyclomatic complexity 55 and cognitive complexity 100; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"46099c858cdcf6306ef0ca93b90de6302b6602c728f577b462164c67c7e7f203"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 55, cognitive 90): (anonymous) has cyclomatic complexity 55 and cognitive complexity 90; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2da21b01f26db38b8dc5c528e9a0e8beb58ebd6d6301375e38fef2b2223599"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOracleTypeManagement (cyclomatic 55, cognitive 84): executeOracleTypeManagement has cyclomatic complexity 55 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a729d1e25fa41eb4a204d00b8df933698099298b1e952a3ebd43018ddb9f7c0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSelectList (cyclomatic 55, cognitive 64): extractSelectList has cyclomatic complexity 55 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4438}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad9ea995aee76c58ed1271fec3242bcc4cee092899ddda3289d828011f3a1b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRedisKeySnapshotCooperatively (cyclomatic 54, cognitive 106): buildRedisKeySnapshotCooperatively has cyclomatic complexity 54 and cognitive complexity 106; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyTree.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d87ed94c265be7157d74edd25f3d33247eacb324847ca0cd034eceff1b6e31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelSoftStatementLineStarts (cyclomatic 54, cognitive 101): topLevelSoftStatementLineStarts has cyclomatic complexity 54 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"60528d25b6ba3ce82b51e392222d607ac470c3e5a507c648a7d9f70f7f55ab46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildConnectionSidebarMenu (cyclomatic 54, cognitive 98): buildConnectionSidebarMenu has cyclomatic complexity 54 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":7575}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21fa503690e563f64ce4a6f2bc505d86e279b69e0eff3d0c0bc33757401913e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rewriteOraclePackageSource (cyclomatic 54, cognitive 91): rewriteOraclePackageSource has cyclomatic complexity 54 and cognitive complexity 91; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSource.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5432c0799e1e6418b4b5f6e638bcbbb56e3fd0333af5de17ff28874c15b6cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildAiContext (cyclomatic 54, cognitive 83): buildAiContext has cyclomatic complexity 54 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"f961871a71ee74fac1d28a03547a51943bb1592cdb2865311f6eba77345bca70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleTriggerPlan (cyclomatic 54, cognitive 77): prepareOracleTriggerPlan has cyclomatic complexity 54 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"313ecb023137bd0f1cce29c4e5e1ea44a416da9b0927a5ff49ba38e4cec86909"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowsText (cyclomatic 54, cognitive 73): rowsText has cyclomatic complexity 54 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13b0ce6b0082aecbff5f496aa764808a87e8621f2bcb10f6e68f437b414a68c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOracleRoutineDeployment (cyclomatic 54, cognitive 73): validateOracleRoutineDeployment has cyclomatic complexity 54 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ee22d25e3d3c7f03b05c7f0ec424a3cc2b8dd3832c034ce1826cde06e94eba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 54, cognitive 68): (anonymous) has cyclomatic complexity 54 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/table/oracleRoutineRename.spec.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9782b716e22f61f7df3031b9f4f59298f7ae3598eecd44675143edba7335e8c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleTriggerStructurePlan (cyclomatic 54, cognitive 64): prepareOracleTriggerStructurePlan has cyclomatic complexity 54 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerStructurePlan.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6a198a9412bb7df7f1833fc6fd5c76ab49f223e42919a484a030cf73694116"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activeTabSidebarTarget (cyclomatic 54, cognitive 62): activeTabSidebarTarget has cyclomatic complexity 54 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d0e38c49cf975672fdb5244078880e3d02f90fed3be7c67be4c4cb7ffb6215"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onEvent (cyclomatic 53, cognitive 87): onEvent has cyclomatic complexity 53 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":4609}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ada735a8baa980211f83430e9c8b4d2e8191e5647ee7e69b71d3b61c8cd4f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadQueryResultTransferSourceDdl (cyclomatic 53, cognitive 70): loadQueryResultTransferSourceDdl has cyclomatic complexity 53 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferSource.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ecbb36519caa3b55ffe95a72f1aa35d2d559239020d06739358b40b7b98a2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 53, cognitive 67): (anonymous) has cyclomatic complexity 53 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade7bfe0e5dcab702b92c76282c471550c11e58f5011feed0c4dcc606ab26c7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 53, cognitive 53): (anonymous) has cyclomatic complexity 53 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7824}}}],"partialFingerprints":{"codehealthFindingId/v1":"470a23052043859dd8c66ed1e46a6ea7a3256b7594f17b329a0d72694c7f370e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 52, cognitive 117): (anonymous) has cyclomatic complexity 52 and cognitive complexity 117; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5c768b39bfc8d87fbe06281659684d42db8ed1152d24384b91bac9e5c01f30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanMongoCallArguments (cyclomatic 52, cognitive 97): scanMongoCallArguments has cyclomatic complexity 52 and cognitive complexity 97; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"405ab6f21861576123fedbb57e1c6687d258fde7f484533d06dfa746c07db2b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preparePastedRows (cyclomatic 52, cognitive 70): preparePastedRows has cyclomatic complexity 52 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a05706fc7e885cb2065fedf1fc0a447ddb765cdb1dfc15093dcd0d00ca383a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 52, cognitive 64): load has cyclomatic complexity 52 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ca7b60de6d405dcd9dce23f9be7f0daa10e01e7f2fe7a1e2f9f23ec4206afb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 52, cognitive 61): execute has cyclomatic complexity 52 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"04565e2780130d42465cff6b634f7b925e154c3fc13e76710b8b43c25673da81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onWindowKeydown (cyclomatic 51, cognitive 81): onWindowKeydown has cyclomatic complexity 51 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2b09a4e79ad738fd8800385c6732d39a159aa90fef10cea28f676f38e00d54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOracleForeignKeyPlan (cyclomatic 51, cognitive 80): applyOracleForeignKeyPlan has cyclomatic complexity 51 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6658}}}],"partialFingerprints":{"codehealthFindingId/v1":"b334ef7b8c068712a0c9a421bec82f4b52abe1cd988a0275b0042993ece03ff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformCellValue (cyclomatic 51, cognitive 65): transformCellValue has cyclomatic complexity 51 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellValueTransform.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"94520425b75660d074d1f71d22b195c2ea736b852211bdc34d46525f6fbd8bfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitStatementRangeAtSoftStarts (cyclomatic 51, cognitive 65): splitStatementRangeAtSoftStarts has cyclomatic complexity 51 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d222c14f0b4f22f2d73e4ce075d53ebb79ade3210e59db5e32bc504536b709"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 51, cognitive 59): (anonymous) has cyclomatic complexity 51 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfaf4c55ce62ef8c8e204fa1614f8bcbdd9d35c03f9a4fee299eb77c4dd1e8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareEditableQueryExecution (cyclomatic 51, cognitive 51): prepareEditableQueryExecution has cyclomatic complexity 51 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7739}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44000598ac428405b0a2212e480e9f9df33bff599aaedffac09b4009d4711f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 51, cognitive 49): (anonymous) has cyclomatic complexity 51 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":15244}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f959abd6610938cb9f6eb70dad73d9093d1ab723632d45ae6fbd6262cadc41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportFullTableDataViaBackend (cyclomatic 51, cognitive 43): exportFullTableDataViaBackend has cyclomatic complexity 51 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece7fea5efb728e1a8f5c15cdbfaba33c23227723d5da586c86187b7a94c5aae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function graphCompletionScope (cyclomatic 50, cognitive 95): graphCompletionScope has cyclomatic complexity 50 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletionScope.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4917cc02cd591521853231b7f794a431ca11d1add0d4524cfdbc23c906addd8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutDoltCommitGraph (cyclomatic 50, cognitive 82): layoutDoltCommitGraph has cyclomatic complexity 50 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dolt/doltVersionControl.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e1dba3ae55cdf0d958629df2dcab77974480647695e3bab32b1466f4d88e03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startExecution (cyclomatic 50, cognitive 67): startExecution has cyclomatic complexity 50 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fedcd6d839ef459389fc45b57e26aaa2db5b7e7552921f47ace84579895d08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createDataGridColumnContextMenuItems (cyclomatic 50, cognitive 64): createDataGridColumnContextMenuItems has cyclomatic complexity 50 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"719a9afdd529c61de2a7e0456a3145a443ffb6422374c26cf080e19362ea6075"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qualifiedTableName (cyclomatic 50, cognitive 64): qualifiedTableName has cyclomatic complexity 50 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fda768ebb80b14d0d3b55fecda4d692713aaa4ef4d21a0364a9ab04ed385ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSource (cyclomatic 50, cognitive 58): loadSource has cyclomatic complexity 50 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectSourceDialog.vue"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7011e802399c8bc78750089bf547c05de11bd82ba0a8639561902bc02ca6f6d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oraclePlSqlBlockEnd (cyclomatic 49, cognitive 91): oraclePlSqlBlockEnd has cyclomatic complexity 49 and cognitive complexity 91; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bd2c31bd4a733cf6c66cd27b3683a142f720d23b6282e5b3ffc7e169e11edd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSimpleObjectTreeNodes (cyclomatic 49, cognitive 85): buildSimpleObjectTreeNodes has cyclomatic complexity 49 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f95c8a5573f01aef5669a0119dc4635893fd0777eca58d8d4ec3c7bb2b07b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshRenamePreviewSql (cyclomatic 49, cognitive 61): refreshRenamePreviewSql has cyclomatic complexity 49 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2943}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d4d2da4bb53fb384bb8dd344250d732b6cdd5a270eef15cadb02a1721cdf03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qualifiedNameForSidebarNode (cyclomatic 49, cognitive 54): qualifiedNameForSidebarNode has cyclomatic complexity 49 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTableNameCopy.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a936bd077bbcf6825d8f7d9ed4f7f57479c0cd0ad278db0489954281078e332f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSourcePanel (cyclomatic 49, cognitive 51): loadSourcePanel has cyclomatic complexity 49 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"11721e9f109dee4cb1b4d0bae4817d4f8046c3b95304c194b16f8852207670ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileTriggerStructure (cyclomatic 49, cognitive 48): reconcileTriggerStructure has cyclomatic complexity 49 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":7283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a35b02f9db83646038f4a0e59cb4d67b39351852ac99620710056855168a5ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 48, cognitive 51): load has cyclomatic complexity 48 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"0930ce0fcade5b0f5d1c76654fca314294447847f80f6d138780bece7ed535b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOracleForeignKeyReferenceSnapshot (cyclomatic 48, cognitive 42): readOracleForeignKeyReferenceSnapshot has cyclomatic complexity 48 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b882b782f653275792ddeebee7f593b19fe8a5337def7b6fd46bcc70dc67b46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmPasteTableImpl (cyclomatic 47, cognitive 85): confirmPasteTableImpl has cyclomatic complexity 47 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":6276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71b722b3e65be08331637fc11494585bdbf79725c9d96801d708173bae1fba4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatMongoShellText (cyclomatic 47, cognitive 82): formatMongoShellText has cyclomatic complexity 47 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoFormatter.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf579012d89de8dd18d7b1652f93261985be3fd37947567c897d7b82a49b56b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlAliasHighlightGroups (cyclomatic 47, cognitive 81): sqlAliasHighlightGroups has cyclomatic complexity 47 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/aliasHighlights.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9c18152a45f50fd38f0585fd38eda7491dd0dc69b4d9e60abc9edfe4c19dff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constrainMysqlGenerateColumns (cyclomatic 47, cognitive 72): constrainMysqlGenerateColumns has cyclomatic complexity 47 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/mysqlGeneratePartitions.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a081d2ce9b39d6674e641168957258256cfbf9f7170cb44682c5be43383c9831"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scheduleCompletionMetadataRefresh (cyclomatic 47, cognitive 69): scheduleCompletionMetadataRefresh has cyclomatic complexity 47 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b53e5c864c850ca62afe56b4d9cfadf2f7650c49c91f27f1546edfe9f56431"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSqlDatabaseLinkStarts (cyclomatic 47, cognitive 65): collectSqlDatabaseLinkStarts has cyclomatic complexity 47 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDatabaseLinks.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bc212c7b40bafa78663100c5c753a3a0e12bdc212b125dae027b3d46a41d66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPluginConnectionConfig (cyclomatic 47, cognitive 57): buildPluginConnectionConfig has cyclomatic complexity 47 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd75e25f2b983b7aae189bf07b3788a5dfb0a556055a87b03add11a85cc7f8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 47, cognitive 44): (anonymous) has cyclomatic complexity 47 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5cf7be092fd7ca4247947ba7df275be284009b49317a3d017edd91986a9564"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTriggerToggleSql (cyclomatic 47, cognitive 43): buildTriggerToggleSql has cyclomatic complexity 47 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/triggerToggleSql.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe2627a167978ae0b60ceff960cc231fa5d25612afd30bcbe1b625fb6414dd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function injectColumnRenameSql (cyclomatic 46, cognitive 94): injectColumnRenameSql has cyclomatic complexity 46 and cognitive complexity 94; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"36947c75a5f208a015d5a6b59e31cc1eaa2d0b60d2d2fae82239aa41bc2c8c43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 46, cognitive 80): tokenize has cyclomatic complexity 46 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b604a2bd81e20050037b394355ff2ae1b9d869d1fd36c3045d7cca48c174e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmBatchDrop (cyclomatic 46, cognitive 74): confirmBatchDrop has cyclomatic complexity 46 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4877}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34bbf30bc3bede2aed6c2305b27ff5af78e301e21673c8466972ce9703c96f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSqlLexicalContext (cyclomatic 46, cognitive 69): getSqlLexicalContext has cyclomatic complexity 46 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b3bd194f8852f5730397b770fbc88c03204cc22cb4d4ef477ee123189153ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyProfile (cyclomatic 46, cognitive 64): applyProfile has cyclomatic complexity 46 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":3003}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d1b39c8860459fc6aac10e18f3d64ec6bfd4a375fb7d3fd9659257fa946db2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mongoTopLevelCommandLineStarts (cyclomatic 46, cognitive 63): mongoTopLevelCommandLineStarts has cyclomatic complexity 46 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60a5ee4cafdff0ea33757e47f034cd1506ff7ccc3ac09478a7a3e18142eb048"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadAllObjectGroupChildren (cyclomatic 46, cognitive 58): loadAllObjectGroupChildren has cyclomatic complexity 46 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8362}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0660b1431cb8c20b4e704e8ec001337afd3da99d58022493304f3fadbfe8eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changeCopySourceScope (cyclomatic 46, cognitive 57): changeCopySourceScope has cyclomatic complexity 46 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4793}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8baad66fdbf66acf8ceb04c239c92e4a7dd26df69e93afb9a329f877428108e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildObjectGroupSidebarMenu (cyclomatic 46, cognitive 55): buildObjectGroupSidebarMenu has cyclomatic complexity 46 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":8868}}}],"partialFingerprints":{"codehealthFindingId/v1":"34413471c8fd62ea3bcf9c15a247531a64720619b91946e4ea7adee06a5ce943"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveEditableSourceMetadataTarget (cyclomatic 46, cognitive 38): resolveEditableSourceMetadataTarget has cyclomatic complexity 46 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22983c59abde7e0f01b7937d535e640dca345d48d786259dcadfef1e15a77d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelWordsInRange (cyclomatic 45, cognitive 98): topLevelWordsInRange has cyclomatic complexity 45 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ee7e8918b4c50c54638b379340ed0ec8aa0e3ee9e79924779067c981bfd42e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gridSave (cyclomatic 45, cognitive 75): gridSave has cyclomatic complexity 45 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"7170ddc473e9f3ec6d06a1225a95a983e96453614c8253d53e15181345423555"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readValueEnd (cyclomatic 45, cognitive 61): readValueEnd has cyclomatic complexity 45 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4c4b66a684ff9cbc61ceae1aa85de8d4abd193c26e86baaf2751a0cdaff717"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quoteRedisBytes (cyclomatic 45, cognitive 54): quoteRedisBytes has cyclomatic complexity 45 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6396bedf37e4547287f1ab39b777ceded35d5f9a726a5860c785a0056534ba1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acceptOraclePackageTransferApproval (cyclomatic 45, cognitive 20): acceptOraclePackageTransferApproval has cyclomatic complexity 45 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":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeec339b719c8847a0a08d1907cbb898803bee05680732765c2cf1b1840c8e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function previewDocumentChanges (cyclomatic 44, cognitive 108): previewDocumentChanges has cyclomatic complexity 44 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"6337fad481672fc66dcb8eb6b7bddb52b9433a687885a1858ac8d92581f9076e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 44, cognitive 71): (anonymous) has cyclomatic complexity 44 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0d4ca5f80da1136975bba2305463ee17f35b23dd9ad4ff8edcee63e9bea5f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSidebarMenuLayout (cyclomatic 44, cognitive 60): buildSidebarMenuLayout has cyclomatic complexity 44 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarMenuLayout.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"18af1db380448bbcd2141f02ba4bf58f75dbc1108e122d99a9f22c36fe6bc0a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOracleIndexPlan (cyclomatic 44, cognitive 58): applyOracleIndexPlan has cyclomatic complexity 44 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba8c47f0cff90831c679b7a4e3a88e794ad23f0159625eef3a5de982fc9b443"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canCopyWithExtractor (cyclomatic 44, cognitive 50): canCopyWithExtractor has cyclomatic complexity 44 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c50cf108bc0bbe63afd9d471f9feb326e7de68559fba1ceb98c7b4e140b50ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCursorIntent (cyclomatic 44, cognitive 48): buildCursorIntent has cyclomatic complexity 44 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c23c2d2f99bca6c3963459d04c2acc6e59098bdcc1e98f6b5c1e0866c426c09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshDataTabInternal (cyclomatic 44, cognitive 44): refreshDataTabInternal has cyclomatic complexity 44 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5930}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c7217e419dffd687660364fc6a71cce100c5429f6e583a9d50790c37ffa7cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportMemoryDataFile (cyclomatic 44, cognitive 40): exportMemoryDataFile has cyclomatic complexity 44 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"196ec4b5153de37fd87807ab0aaea4fb6109a64b015fd8294a4353ac8319811e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDocumentFilterCondition (cyclomatic 44, cognitive 40): buildDocumentFilterCondition has cyclomatic complexity 44 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a9349242de5fbf8a6337e189c1123b58fd1ff8638ce913b50b571c3eea06d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyStageOptions (cyclomatic 43, cognitive 91): classifyStageOptions has cyclomatic complexity 43 and cognitive complexity 91; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7d288ceda6f10edb07ca5693213fdb7404d9ae8f9cb61d215411aaa0a55177"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOceanbaseTableClone (cyclomatic 43, cognitive 54): buildOceanbaseTableClone has cyclomatic complexity 43 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseTableClone.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9cacb2642289f5da46fb5cdafb5859d5aba9fc17fa429c6436079657a5f89d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOracleConstraintSnapshot (cyclomatic 43, cognitive 41): readOracleConstraintSnapshot has cyclomatic complexity 43 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b333ab5ca3426a20ec8e27ae6c6ce141365dea97005cdc92b4f37930b4e885"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreOracleTypeManagementDraft (cyclomatic 43, cognitive 33): restoreOracleTypeManagementDraft has cyclomatic complexity 43 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 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":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bd737bf4c1ab19f61d3d69cf572b5a03abb58379dea09c8f6c2ae06ade0238"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createRedisKey (cyclomatic 42, cognitive 75): createRedisKey has cyclomatic complexity 42 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":2969}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbce91f31308382707b3fafe7d73590abd5521987c321506aacb760c152c1af7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmPasteTableImpl (cyclomatic 42, cognitive 71): confirmPasteTableImpl has cyclomatic complexity 42 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4882}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d8ef27b703666704a6bc4f360d5c4a0c762281985f1b5fd5207324b85cf79a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyExistingPrimaryKey (cyclomatic 42, cognitive 60): applyExistingPrimaryKey has cyclomatic complexity 42 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6527}}}],"partialFingerprints":{"codehealthFindingId/v1":"724bd1ec5343719d4f946383e5a8287f67f005333ddf71dbe7ce338e0a0e6d6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitEdit (cyclomatic 42, cognitive 59): commitEdit has cyclomatic complexity 42 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb6d0fc54ab7566935cfa4c8ea73662ddb7bdebfde71c42fbdde9897579edcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compositeInputComplete (cyclomatic 42, cognitive 57): compositeInputComplete has cyclomatic complexity 42 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/plDebugComposite.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5a53836e898070f3b785022c7f1c6a7ac9cd859b0664f16af5abe32e2995e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 42, cognitive 55): (anonymous) has cyclomatic complexity 42 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14195}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa878d2bff4d1ecdae8c5793d366d68ad3141dbd2301454a232a53df4c2a410a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOracleConstraintPlan (cyclomatic 42, cognitive 55): applyOracleConstraintPlan has cyclomatic complexity 42 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6780}}}],"partialFingerprints":{"codehealthFindingId/v1":"89938a0d6aebfaaf8a3da641f18b227e813ba5de70f29e95f2b6487a5fba4501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentLineBlockEnd (cyclomatic 42, cognitive 51): currentLineBlockEnd has cyclomatic complexity 42 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b481db441d329fff9887387f2dcc6a44539b7595fd3e6a77b2d563238cc151"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileSelect (cyclomatic 42, cognitive 48): compileSelect has cyclomatic complexity 42 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5237f1ab71f4d3e034b1dded4a2b850d054461c2668e94e7e4c453a1c3cd963"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportQueryResultViaBackend (cyclomatic 42, cognitive 40): exportQueryResultViaBackend has cyclomatic complexity 42 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa89c2d76039a6d824c25500a1216eca6a90b674ee4784289ec56c6f29a114a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kafkaConnectionDraft (cyclomatic 42, cognitive 39): kafkaConnectionDraft has cyclomatic complexity 42 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a6b2acdb37dea79993b87d8a2ca41397f41b95ab1986fa54a139477c3da673"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printRuleElement (cyclomatic 41, cognitive 94): printRuleElement has cyclomatic complexity 41 and cognitive complexity 94; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21fde93c82694bf9cf912fd28bb7c99d7ef22e32e8285225fd36c5a59d6a6bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 41, cognitive 60): start has cyclomatic complexity 41 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c21597d6fab7776354415b5e6006a1bbd306ab98b7607c2825129d0f3e5289b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeColumnFormatter (cyclomatic 41, cognitive 53): normalizeColumnFormatter has cyclomatic complexity 41 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec87c2864e629c6d3b23554147ea68b2f7ddddf7128bbd3fd63c0406a525d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildComparisonValueItems (cyclomatic 41, cognitive 42): buildComparisonValueItems has cyclomatic complexity 41 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5780}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a07410638645a44d05a41cb22a13ba232dc8202d268a804257cf0d51df8366"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDataGridPaintTheme (cyclomatic 41, cognitive 40): resolveDataGridPaintTheme has cyclomatic complexity 41 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/dataGrid/dataGridPaintTheme.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3596a1ab453c276f77ec800734a8def9aace88fa109324b3b127db027ec25c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeConnection (cyclomatic 41, cognitive 39): normalizeConnection has cyclomatic complexity 41 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"0652bcbda78157cb5fa9a9f032eca1cb600e6a537386cc29479af4d996788d4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 41, cognitive 35): (anonymous) has cyclomatic complexity 41 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5341}}}],"partialFingerprints":{"codehealthFindingId/v1":"272a16d84b161f828817bd61cb40db3f6ff7a0ec207df0f0801fa6ca4480a1da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onTargetObserved (cyclomatic 41, cognitive 25): onTargetObserved has cyclomatic complexity 41 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8457820ac3de8ad64955d5828548e9e52d2ca1a3a7c9fb11feaffd7659aa4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildQualifierActions (cyclomatic 40, cognitive 74): buildQualifierActions has cyclomatic complexity 40 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c29abd93578239c235409329bb0ec0b5d48b24a8c36efb2feed50bc5be559e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchAll (cyclomatic 40, cognitive 64): fetchAll has cyclomatic complexity 40 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"13127da0c4731a33e0e5fbdf95b4b3749de962e2d54442a2b524ef577a2e13b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportTableData (cyclomatic 40, cognitive 58): exportTableData has cyclomatic complexity 40 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf11b60ac822d78b1d2c79fa971dc7b769e6a94e87bcb208c2a75de2f18ee8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 40, cognitive 58): (anonymous) has cyclomatic complexity 40 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"76798d1fcde2a9e9746aa78e78970b2d4a15556071cb9eae16e857ec3dfa99ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJdbcUrl (cyclomatic 40, cognitive 55): parseJdbcUrl has cyclomatic complexity 40 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75c1584e96699a9897f7f453931b5f76e27213af8f4cd685bed48404aeaeae0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellConstructorToExtendedJson (cyclomatic 40, cognitive 45): shellConstructorToExtendedJson has cyclomatic complexity 40 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"941832bd358fd6b8e65ed575c91576f0f73cc5709ceae3815534e53d6fdb0774"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterSidebarTreeWithMatcher (cyclomatic 40, cognitive 44): filterSidebarTreeWithMatcher has cyclomatic complexity 40 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"810d7e44942492b3ef5e3669fc4b512276decc8b829c90d85a0dbdb4c2c7eef4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlCompletionContextFromSemantic (cyclomatic 40, cognitive 28): sqlCompletionContextFromSemantic has cyclomatic complexity 40 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab91239699c5e933347400d8834e2f71b327c613ff851e8464a966db230cba1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trimRangeEndBeforeNextBoundary (cyclomatic 39, cognitive 83): trimRangeEndBeforeNextBoundary has cyclomatic complexity 39 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c5fff8b127e47157429dda788b983fdbe2c9637a88415cc3ed06e4deafab71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyCellValueToItem (cyclomatic 39, cognitive 71): applyCellValueToItem has cyclomatic complexity 39 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b20d14cfce9ccdac9a9048c9fb65c8512fa3042d7ec423bc10b6c2d143b362a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectDdlStatementNameTargets (cyclomatic 39, cognitive 66): collectDdlStatementNameTargets has cyclomatic complexity 39 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2feb7cecb07a3faec36cd05eb123636fa5bda3e37a27f7a631646bba65fbac3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEscape (cyclomatic 39, cognitive 62): parseEscape has cyclomatic complexity 39 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dbbd718bde0c51c79416ee65d0073bd875ce7b8a81e3bbc9cda84d3b49cc37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSqlUnknownObjectSpans (cyclomatic 39, cognitive 57): loadSqlUnknownObjectSpans has cyclomatic complexity 39 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fac1ef93337bf73556fcb596a22d3c83d5ee83adeaeac813c42a5f127c638f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function xuguGrantSql (cyclomatic 39, cognitive 43): xuguGrantSql has cyclomatic complexity 39 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb5473e421db0aceb8dab8fa7ab17a096b59d352b16ca4402b2da36a61d6f4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadJobs (cyclomatic 39, cognitive 40): loadJobs has cyclomatic complexity 39 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef14ce320449bdd2a4cd927ee91050f93064e30fd3f2c6a6d01d5ba753a11534"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function xuguRevokeSql (cyclomatic 39, cognitive 40): xuguRevokeSql has cyclomatic complexity 39 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a1b7eb8ac90b10be495de746a0eefab4ae1f258d1092593b751065cf3d3fc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectProjectionStarts (cyclomatic 39, cognitive 40): selectProjectionStarts has cyclomatic complexity 39 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9b20fcb327d4f296f42e45e2f26acd6fb090eb9cf0524695e88c29c402b253"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendQueryResultSegment (cyclomatic 39, cognitive 37): appendQueryResultSegment has cyclomatic complexity 39 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16f10147d950cc78e511b26cea13d8317f1fb15d54fe4fc52548feafeb40f3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTableColumnDefinitions (cyclomatic 38, cognitive 66): parseTableColumnDefinitions has cyclomatic complexity 38 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4808cf4b0740a7c1c680e41180d7647b31f8d3ad7d60200a799d8e5f9a0059"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startFullRead (cyclomatic 38, cognitive 58): startFullRead has cyclomatic complexity 38 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c862b175bf8c8abf80cc4efba617687f00cc42a562e517d0787785f5105de3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDuplicateTableStructurePlan (cyclomatic 38, cognitive 44): buildDuplicateTableStructurePlan has cyclomatic complexity 38 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7f90885de117176dff9af46da2c0709fb12be039aa10e91db09d919943c9e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPendingSql (cyclomatic 38, cognitive 37): applyPendingSql has cyclomatic complexity 38 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19b33881cc9d9ab8bafc190220e6892aab1813e01841a3f53ec7bb6a2b6a7c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onDocumentQueryKeydown (cyclomatic 38, cognitive 32): onDocumentQueryKeydown has cyclomatic complexity 38 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7c703ebb753ec960859ac91540565ccfb8b0ca7fd4bec21ab6338a7faad651"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findGeneratorKey (cyclomatic 38, cognitive 31): findGeneratorKey has cyclomatic complexity 38 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"daecb66d96ef2df0cd93a6a1027a7b19ec4e607cad3106ad8528be8634a95d02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateDataTransferTask (cyclomatic 38, cognitive 28): updateDataTransferTask has cyclomatic complexity 38 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da28973c54b963e60c543fc9a84029640ec6f26da95a6002ae612c341373218"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDb2ExplainText (cyclomatic 37, cognitive 61): parseDb2ExplainText has cyclomatic complexity 37 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/db2ExplainPlan.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ccdc1c642d2a182c976ef86bdb265b2f3714d61d6ee26c9f7462f1f9fb7aab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function protectDuckDbPrefixAliasSeparators (cyclomatic 37, cognitive 61): protectDuckDbPrefixAliasSeparators has cyclomatic complexity 37 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb866792ab871a70b556836073eacef7448001ca55b4789c77807026e1b32de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyStep (cyclomatic 37, cognitive 52): verifyStep has cyclomatic complexity 37 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6b7647e75e94a122c4f072090cd8dfe2ded2d051eb0c2b1c50d1fdab50a06e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkUpdates (cyclomatic 37, cognitive 49): checkUpdates has cyclomatic complexity 37 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ad78352cf7ae5622616bf22910344044a1132854e7f42f4dfdaa139e223dbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stepLexState (cyclomatic 37, cognitive 43): stepLexState has cyclomatic complexity 37 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d069acc35f574a5d9e7f7b6d6b61aa85f0009b278673cbefdf3648e470787ee2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locateTabInSidebarTarget (cyclomatic 37, cognitive 38): locateTabInSidebarTarget has cyclomatic complexity 37 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d685db9c1f185d88a9d03c37cd67ab6fde495da7e3bc1bc6e4abeabd7c2060"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 32): (anonymous) has cyclomatic complexity 37 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5173}}}],"partialFingerprints":{"codehealthFindingId/v1":"173bf41908bc30e49463d503af877d4a320d04fab074b6e03c3c13f3cc51e97e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitTopLevelStatements (cyclomatic 36, cognitive 77): splitTopLevelStatements has cyclomatic complexity 36 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"85338aac07211a7b241babbefd96ba4cca4d0d9e0c1e45eae37335cefb60a7d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function temporalColumnTypesFromDdl (cyclomatic 36, cognitive 56): temporalColumnTypesFromDdl has cyclomatic complexity 36 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"022e1462053f8606261acbeca4343d14087a02fb7853aea7a33228f7aac42a00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadConfigIntoForm (cyclomatic 36, cognitive 53): loadConfigIntoForm has cyclomatic complexity 36 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe80459415a4151a94966f9991a3589c77bc32c74342e454c5a9eb6743b87c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOracleForeignKeyCreatePlan (cyclomatic 36, cognitive 51): applyOracleForeignKeyCreatePlan has cyclomatic complexity 36 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":7081}}}],"partialFingerprints":{"codehealthFindingId/v1":"706e634d4bbe41e81bada45cd6712df85043227c863ff29712d3a15676e0bef9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLineBarSpec (cyclomatic 36, cognitive 50): parseLineBarSpec has cyclomatic complexity 36 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/richContent/aiChartSpec.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5f3c66ad7180a80c7c38d70c471dd423650575cd72bfe5735e9500021089a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildQueryMetadataPatch (cyclomatic 36, cognitive 50): buildQueryMetadataPatch has cyclomatic complexity 36 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7971}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e36d4b111bcba2f88bab672ba70d8ae933cb2227ed08ef83efc6d7430c9b14b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onStructureEditorKeydown (cyclomatic 36, cognitive 43): onStructureEditorKeydown has cyclomatic complexity 36 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":7754}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ddbda53dab8c90a0b0834c595abe615a6e41b243720c420fbf8f11e1777d3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportResults (cyclomatic 36, cognitive 37): exportResults has cyclomatic complexity 36 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e28c1f75e0350b94d0a798aefc5eabc96bf6253ec31f385d14a6799a7e014f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseConnection (cyclomatic 36, cognitive 36): parseConnection has cyclomatic complexity 36 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8514ebd48723b265111df5a7b6d938ef23b7735fc0e642826eb59c18be514ced"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createDbxCodeMirrorSqlDialect (cyclomatic 36, cognitive 35): createDbxCodeMirrorSqlDialect has cyclomatic complexity 36 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorSqlDialect.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b10223eb894d9c410d25ca6047e8647744574d1c6040b82f6698d77bcd89dc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function persistTypeManagementDraft (cyclomatic 36, cognitive 11): persistTypeManagementDraft has cyclomatic complexity 36 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3068}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db69ab2d988714575ea7dce5b160aaec560f2481799bf6e0514a9b54e7b1d7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshTreeNode (cyclomatic 35, cognitive 59): refreshTreeNode has cyclomatic complexity 35 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9091}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f25fc1497bf64990967282c24217f88e308c58cc0dee1f5558a293407f2642b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateCondition (cyclomatic 35, cognitive 52): evaluateCondition has cyclomatic complexity 35 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81b877c9b12f173d601b4f6dbbb59c7a578d25c9e5d511ef4346fd121befca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExtraToColumnExtra (cyclomatic 35, cognitive 50): parseExtraToColumnExtra has cyclomatic complexity 35 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b38a4263b5ff74dff4f0f69a2a22010212fed63588c045ec55ac7307c9f013"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnDataTypeForEditor (cyclomatic 35, cognitive 44): columnDataTypeForEditor has cyclomatic complexity 35 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3726a91427c9faa5decdcc6f403bc41e80a1c626d5afa8704f036c05a99707"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTrailingIdentifierContext (cyclomatic 35, cognitive 43): parseTrailingIdentifierContext has cyclomatic complexity 35 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d399c81692037c8b3456e5d0743a556ebaf4faa00a00c2198ab7921b63424209"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 42): (anonymous) has cyclomatic complexity 35 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/table/oraclePackageSaveAs.spec.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e7eb9be885db693c298361d77760ed82ab33d5781931f0ad41e046575230de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getMongoCompletionContext (cyclomatic 35, cognitive 37): getMongoCompletionContext has cyclomatic complexity 35 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1fca0fde4fb91661fc682ce7db4d33fb785f4737c0ef68c337b5d3c1596d81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function needsSpace (cyclomatic 35, cognitive 36): needsSpace has cyclomatic complexity 35 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"717fcf256bd7a021b9bd4ec99ac7efb00e69ca310d205c365e770c863018a979"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadObjectPage (cyclomatic 35, cognitive 35): loadObjectPage has cyclomatic complexity 35 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5726}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef9ce04026df08f6389edd549de2fd3dd3a73d3870166333ab1255ccf3277c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 35, cognitive 34): dispatch has cyclomatic complexity 35 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 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f4bf37b28e244e0049bca5aaa1cdef379c182ecff433f7fb4fe96a80b178df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeAlignedSqlWhitespace (cyclomatic 34, cognitive 74): normalizeAlignedSqlWhitespace has cyclomatic complexity 34 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"13dc18b7f7cbe8cec4ca314945dab5217ef81ecd53e40cd258d2ea19beb3b608"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mysqlRoutineTokens (cyclomatic 34, cognitive 66): mysqlRoutineTokens has cyclomatic complexity 34 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9790e148daac982e4be54d3842494884321ff943b2bb78aed228515b012c454c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeCypher (cyclomatic 34, cognitive 63): tokenizeCypher has cyclomatic complexity 34 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f004cfe7f54b253448dd6b0d9d5d68c8734cc892f1f8b1ac192f8b626c9983"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectComplexTypeFieldSeparatorsInDeclaration (cyclomatic 34, cognitive 57): collectComplexTypeFieldSeparatorsInDeclaration has cyclomatic complexity 34 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f56f5b4083d03a024b31e24bcef26dc67d9b12c751ef97140f7ae9c77fafa1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleViewRename (cyclomatic 34, cognitive 48): prepareOracleViewRename has cyclomatic complexity 34 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleViewRename.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7503c830502ce5cb4b7fd6341967a3b81f3a5a2d22d395b69121bbe63f55fdb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 46): (anonymous) has cyclomatic complexity 34 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba2a016d16e1458ea2d46ba0b5362b07cf0f7afbc9c70dd9ddb9b8a3f32b873"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 45): (anonymous) has cyclomatic complexity 34 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/__tests__/ProcessListPanel.spec.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"db118166bd82fa0b56f3e5ecd2f23cf1d0cc8f01a842271b5e01b97a97eb430b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectStarExpansionTargetForView (cyclomatic 34, cognitive 33): selectStarExpansionTargetForView has cyclomatic complexity 34 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 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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e65ef664e40b912d0eb14cfca26cd5a1536b4db73d7ce01c63d88e0b0924b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function singularTableName (cyclomatic 34, cognitive 33): singularTableName has cyclomatic complexity 34 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 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6709}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78c491c1493ddcf66106b599fbdbcf25e37827420a57f064b1aaf24359c8fd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabTooltipLines (cyclomatic 34, cognitive 33): tabTooltipLines has cyclomatic complexity 34 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 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":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"082f661c06aaa83e601dfe84e12903f644ad0f9a020a9aaf093c9985cb269fae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentGlobalNavigationEntry (cyclomatic 34, cognitive 30): currentGlobalNavigationEntry has cyclomatic complexity 34 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 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":"apps/desktop/src/App.vue"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"400f64d7cb656a7dd235dc1a4ede85b2edbc25a525634d07cd5249a201a66abb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyBeforeDrop (cyclomatic 34, cognitive 30): verifyBeforeDrop has cyclomatic complexity 34 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 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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19623f1abe95fc505072edcf4bbc4328d5f0e4454ae42e75fac2cedf7098893"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oracleConstraintDefinitionFromInfo (cyclomatic 34, cognitive 29): oracleConstraintDefinitionFromInfo has cyclomatic complexity 34 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"02449072cc5b36d9b72d21216bd706209da551992afcbb931dbf3e330973406d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constraintRecoveryCandidate (cyclomatic 34, cognitive 21): constraintRecoveryCandidate has cyclomatic complexity 34 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d723ca27b3834ba0d695de339abfb0b44a0096f2a33ea9a5051c02d15ba76f83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readbackMatches (cyclomatic 34, cognitive 19): readbackMatches has cyclomatic complexity 34 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50b2dafbd250f0aff2050b420f3d2283df91da3c08d09a27b4775572cd51977"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExplainLikePrefixAt (cyclomatic 33, cognitive 56): parseExplainLikePrefixAt has cyclomatic complexity 33 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9231efc733e43d5fceba321fe44b629ae2b59bda386efb5a93507b0c212e458"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOracleViewRename (cyclomatic 33, cognitive 52): executeOracleViewRename has cyclomatic complexity 33 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleViewRename.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6259b8e90481f1fce011eec45a73f6c3f5ef84a28ee8c8a78d55949c7bf185"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newQuery (cyclomatic 33, cognitive 51): newQuery has cyclomatic complexity 33 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dbdad174ee1c96fc67f37b3732e1be86f86f20bb2e93c645384cb7117000b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 50): (anonymous) has cyclomatic complexity 33 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/plDebugStore.recovery.spec.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f3bc64c8939453f4685c92e83a1114a20fbf718b2eb38d4ae1466246067356"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeDataGridCondition (cyclomatic 33, cognitive 49): tokenizeDataGridCondition has cyclomatic complexity 33 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridConditionHighlight.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"617e26119e40dee79a59b10fa6ef5f542e28a3b7d89e0744849cb5a641ff26fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlTargetSafetyText (cyclomatic 33, cognitive 49): sqlTargetSafetyText has cyclomatic complexity 33 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b356ac65d8a11f47072d7cd4e4f702f7786dec2a98c3a586db4ec503ad37e5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlSafetyText (cyclomatic 33, cognitive 49): sqlSafetyText has cyclomatic complexity 33 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba5cfcdfbb577f6f1706b40cf12b85dafc46fe6d99e66ecf61ed51f897e9f1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePostgresRegclassPrefix (cyclomatic 33, cognitive 48): parsePostgresRegclassPrefix has cyclomatic complexity 33 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"99411a81f2a6a033bf6896e79dcf92fcd64db6c234b9e143ebaa0c5b7f525d30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureConnected (cyclomatic 33, cognitive 48): ensureConnected has cyclomatic complexity 33 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5992}}}],"partialFingerprints":{"codehealthFindingId/v1":"30433d3c3862e1e3609069136cd11245c9d9cbe38db6c22650e88ab19a1b0f6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeBatchItem (cyclomatic 33, cognitive 44): executeBatchItem has cyclomatic complexity 33 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39bf7f9d1b4a17af5cb77fb3b0ec5c7b571f5414102b3edd3b1e5aad8219e85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshContext (cyclomatic 33, cognitive 42): refreshContext has cyclomatic complexity 33 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e92479d6a74ded2e4b97e370614d3a2114c9176b168ea577f6d24e214b9423"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function performMeasure (cyclomatic 33, cognitive 41): performMeasure has cyclomatic complexity 33 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5712077638893ed21e21b3a164b8356cddedab7d1ed280cb0f69d94ac001af4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connection (cyclomatic 33, cognitive 41): connection has cyclomatic complexity 33 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/anotherRedisImport.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d50cb10eb1a6e513333f02012147d9e4921e77dc5e754e1934e966ac7ec564"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connect (cyclomatic 33, cognitive 39): connect has cyclomatic complexity 33 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5556}}}],"partialFingerprints":{"codehealthFindingId/v1":"e763f3d3c9a93b5bde525e5f4565a0385ee78ee47bc432600df64bafabc3245b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPublicOperation (cyclomatic 33, cognitive 36): runPublicOperation has cyclomatic complexity 33 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf490eb5908d2ec4eb43296fd03a5522cfacf66755168356a0de47cef0b980e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseConnectionDeepLinkUpdate (cyclomatic 33, cognitive 35): parseConnectionDeepLinkUpdate has cyclomatic complexity 33 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0511977aad6b95d82616382d97f125afad39904730445327f838daaf7f968870"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setValue (cyclomatic 33, cognitive 34): setValue has cyclomatic complexity 33 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec5ffed2bfbef6f4aaac004bce4727ea989990e0c09279f866d04fe099ea855"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function duplicateTab (cyclomatic 33, cognitive 33): duplicateTab has cyclomatic complexity 33 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5c43bf9194618a2b0a3f89ab1865677fc230fb1c879f74640605273b8b8229"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabIconClass (cyclomatic 33, cognitive 32): tabIconClass has cyclomatic complexity 33 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a1837c35018de29688c33069b3126976caee2a2d033f3202156845bda9c751"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 33, cognitive 31): update has cyclomatic complexity 33 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/admin/NativeJobDefinitionEditor.vue"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"386223a0a2a13f83b157ce5ccbad1b6a20af62f17c2b343180f4231bc33e8be6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOracleForeignKeyMetadata (cyclomatic 33, cognitive 28): readOracleForeignKeyMetadata has cyclomatic complexity 33 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49ac93b7c4d18b8415db76563a519c8958efe7e50570889aec00c3bd1bb7a27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertNoUnapprovedChange (cyclomatic 33, cognitive 27): assertNoUnapprovedChange has cyclomatic complexity 33 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fac49ea532e1f99e4792e1b74961a822d5426313ce6c0f50ad2dde615683e15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectInnermostObjectKeys (cyclomatic 32, cognitive 61): collectInnermostObjectKeys has cyclomatic complexity 32 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e0b380a0aedf5ad59f869d9358d852c9d81f9098676191bcf9f6b72fd1ea9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJdbcProperties (cyclomatic 32, cognitive 59): parseJdbcProperties has cyclomatic complexity 32 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/jdbcProperties.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8f4d4894fe46d90b6653af44f64ff56f7b09b87bf5c451bddca3953cb50c53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectDuckDbStructFieldSeparators (cyclomatic 32, cognitive 54): collectDuckDbStructFieldSeparators has cyclomatic complexity 32 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"051740dddda4ac637611fe4df7cd9f46120a6161825d3cbe84f8bba710e137ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOraclePackageSaveAs (cyclomatic 32, cognitive 52): prepareOraclePackageSaveAs has cyclomatic complexity 32 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ac24f36d376d9060213e28f22b477c1a21010d2e3160aa30ce73fcc26573ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onSort (cyclomatic 32, cognitive 44): onSort has cyclomatic complexity 32 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec056f46f745a70950594f24d6f5ae176e86284bf4e80b93b8e0f49ba028ba6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOracleCachedPlan (cyclomatic 32, cognitive 44): parseOracleCachedPlan has cyclomatic complexity 32 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionDiagnostics.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"808003049109fff97df3238f6846200da7b3ff8507939f38b990ba0d570b2f88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRecord (cyclomatic 32, cognitive 40): validateRecord has cyclomatic complexity 32 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/connections.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cb6da7d847f9554542db09ff6e0f420930e4f9b7c1da1e7909735f04014ab7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 39): (anonymous) has cyclomatic complexity 32 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":13044}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b242f64e102580e26f307c1ec49ee3408db373d1722f02aebaa50faa7c493e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirm (cyclomatic 32, cognitive 38): confirm has cyclomatic complexity 32 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDatabaseTableEmpty.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"894b170b57c152975bff7e114a9605c1bad13936e57d03a406d5dab8443496f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startBatchImport (cyclomatic 32, cognitive 36): startBatchImport has cyclomatic complexity 32 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ece990089c03b58f63d378f441dfd863dd4c13014becaee0028242390786b88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshSavedRows (cyclomatic 32, cognitive 34): refreshSavedRows has cyclomatic complexity 32 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a7bd43305c821db6a8f95cca6984c5f2c256e5c2a45503729649aa48bf31fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTreeKeydown (cyclomatic 32, cognitive 34): handleTreeKeydown has cyclomatic complexity 32 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":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bfd507ecbb3819bf733fa51a94cc67a49b78d63349c7275fcc70ee816ab643"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resultToExport (cyclomatic 32, cognitive 34): resultToExport has cyclomatic complexity 32 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a662ab88728ac054b554fc90c6246081028b0f23bdbcbc6af0682128c3a25e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseInsertClause (cyclomatic 32, cognitive 33): parseInsertClause has cyclomatic complexity 32 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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c03c03bb3757c0d201ebe25d1a4ed6539a725951f3735884303eeb57393d9fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTriggerAction (cyclomatic 32, cognitive 31): runTriggerAction has cyclomatic complexity 32 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/objects/ObjectSourceDialog.vue"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac396ccf1aa4fb73f994dd4c594ffc68445b2ff9adab0e1ea62a10a086b10c71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localeFromLanguageTag (cyclomatic 32, cognitive 30): localeFromLanguageTag has cyclomatic complexity 32 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 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":"apps/desktop/src/i18n/index.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0456d61e43026a302df7acb979cb4619e023c318c634a3885da0e8f69fb2f92b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function includeOraclePackageCompanion (cyclomatic 32, cognitive 30): includeOraclePackageCompanion has cyclomatic complexity 32 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 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":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a25828f143d7bea5d5fa90ceed1072cb6e4922b802ede05c5d4958f2cf847e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 25): (anonymous) has cyclomatic complexity 32 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a90500155b4b99b0d71bcf29085d407017a026648363aa4b308b98a619bd84c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBackendError (cyclomatic 32, cognitive 24): isBackendError has cyclomatic complexity 32 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 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":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f76eca66235bca5a67694a49f9ce542204f542114f78b27d5d330f5613737d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripSqlCommentsAndStringLiterals (cyclomatic 31, cognitive 69): stripSqlCommentsAndStringLiterals has cyclomatic complexity 31 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2a9c047135ad159b8a03db4a553374c7edf5b382008af927ca1ca8f4d6a848"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 65): (anonymous) has cyclomatic complexity 31 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdcb22a6e1aef09a9e0a7ca904b1208aa18669bf2375459159773327d3febcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOracleIndexPlan (cyclomatic 31, cognitive 61): executeOracleIndexPlan has cyclomatic complexity 31 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fb60b79436de399799443664887cd77bf3f7536d7205b96ad255044b38707d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isProvenReadOnlyCypher (cyclomatic 31, cognitive 58): isProvenReadOnlyCypher has cyclomatic complexity 31 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherReadOnly.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e61204030b506fe2195363d89ace3876e730f8b7f1967edb45e114a29bdfc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeSelectionIdentifiers (cyclomatic 31, cognitive 50): tokenizeSelectionIdentifiers has cyclomatic complexity 31 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a3900808c37cab5451d848056e66c6a6d5167c389e599f61e93cfeba0c50b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeSidebarRegexIndexScopes (cyclomatic 31, cognitive 47): mergeSidebarRegexIndexScopes has cyclomatic complexity 31 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"241137bf5c0b0756c9d51717c7396fbd3cd7d6c7cdd454f4f121454953b79d31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderInline (cyclomatic 31, cognitive 45): renderInline has cyclomatic complexity 31 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/primitives.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"df31bf026af39488c330acd356dcc6ce4437f4f0470f114c3be7393d59dc1315"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareBatchSources (cyclomatic 31, cognitive 44): prepareBatchSources has cyclomatic complexity 31 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"e855fab930af1e3406020984e873b40af1429b41c867b615e40aa57df4a1338f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getGraphFunctionSignatureHelp (cyclomatic 31, cognitive 42): getGraphFunctionSignatureHelp has cyclomatic complexity 31 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphSignatureHelp.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e273aad36be92f28842c47662861d5c752ef63ae3a949ee8984f08b72475d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSelectAssignmentVariables (cyclomatic 31, cognitive 42): collectSelectAssignmentVariables has cyclomatic complexity 31 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae1b5e5f9f78864ef58f5f9ae18459126a93afdb695d9c8b37fea25fcd32fc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyInitialStructureTarget (cyclomatic 31, cognitive 40): applyInitialStructureTarget has cyclomatic complexity 31 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8006}}}],"partialFingerprints":{"codehealthFindingId/v1":"258ca73f5fe27b9b540fc1a9de695bac8a2e80cf39f6b68c4c02db91d125ddd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitMongoSemicolonSeparatedSegments (cyclomatic 31, cognitive 40): splitMongoSemicolonSeparatedSegments has cyclomatic complexity 31 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"13195c8a01011298e0625482d98e3c1d100e0acbdd9d1424f762b7eecc3e8600"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDependentDeclaration (cyclomatic 31, cognitive 40): validateDependentDeclaration has cyclomatic complexity 31 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74c4aeeb7082d406d2b70be72fb4b1b728efd036ca3b647a4a6213c7a831511"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 40): (anonymous) has cyclomatic complexity 31 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ec754ca4e13edfbb30fb344379510050a3e296a25bc499efdc67820f60ffc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 39): (anonymous) has cyclomatic complexity 31 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/DebugParamsDialog.vue"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea940eb762a748a6d40aaf01de742fe331cd6a2197c55bf09a7df530284e256"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSqlServerGoSeparatorLine (cyclomatic 31, cognitive 39): isSqlServerGoSeparatorLine has cyclomatic complexity 31 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6c55e7e46945b2b1e43b32ef78c22005720b2feae4f9d2881be9b8f8b1f559"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dataGridExecutedQueryConditions (cyclomatic 31, cognitive 38): dataGridExecutedQueryConditions has cyclomatic complexity 31 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridExecutedQuery.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c520b0bfab14cb3ff31ed15343f09e4e542d264fd84f64927d584a936a8a6c6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 37): (anonymous) has cyclomatic complexity 31 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleTypeManagementDialog.vue"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b0789456f0c70cd3e59aa6bca2e5df250b723b5ed14f19d0b2011bfbb59f5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 37): (anonymous) has cyclomatic complexity 31 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41f1bfcab51bff77ea16a645e5d50758a2a07f1be769b7ae766edc63b70f234"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySecondaryMetadata (cyclomatic 31, cognitive 36): applySecondaryMetadata has cyclomatic complexity 31 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4409}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0618e7d4528f910247991ee85fc1dbff10f9beb3e7e812bb1ff88460e380d38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeTab (cyclomatic 31, cognitive 36): closeTab has cyclomatic complexity 31 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d445ad152cef090a4a84a90afb9b580001b6839f3c934985ad836c18ef2614"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executePreparedOraclePackageSaveAs (cyclomatic 31, cognitive 35): executePreparedOraclePackageSaveAs has cyclomatic complexity 31 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cc7cfb8477b5dd204988122b504a2a830f574491fdc5ef5c462dcaad880bb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildColumnItems (cyclomatic 31, cognitive 33): buildColumnItems has cyclomatic complexity 31 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6141}}}],"partialFingerprints":{"codehealthFindingId/v1":"df72344e334d6ad61e8ab06a6aa2b74625be88d1b3991e4cfc01f1ceab20d5cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startImport (cyclomatic 31, cognitive 30): startImport has cyclomatic complexity 31 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 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":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae91cb807d65e64822ac0891c84de0361f41a65aa1e132d6ce0749682bef44b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadFormatterForeignKeyColumns (cyclomatic 31, cognitive 29): loadFormatterForeignKeyColumns has cyclomatic complexity 31 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24eb849231f90d1636f628361bd6ee58f4a8d2047f2d1351991c0af43bf4a96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readValue (cyclomatic 31, cognitive 25): readValue has cyclomatic complexity 31 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/mq/thriftBinary.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ef9ff4fb2448490ec085cf885c179d8aada8202bb4e007545724ed9547d2ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildModePromptLines (cyclomatic 30, cognitive 67): buildModePromptLines has cyclomatic complexity 30 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"960510795765d59ef46fa2515c9c0e2b2c821275ea6d2c99a736762c46edcf01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleSelectObject (cyclomatic 30, cognitive 55): handleSelectObject has cyclomatic complexity 30 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e169fbbb187f92ef2672fb6023c1b72cb10e57817b1c31766b05bc643f773bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLayers (cyclomatic 30, cognitive 55): buildLayers has cyclomatic complexity 30 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/databaseTableEmpty.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e64af4c5097b9fad65ecd79f778f836391c84f11bfbf241eb6ef755cd461e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshGroupSubtree (cyclomatic 30, cognitive 45): refreshGroupSubtree has cyclomatic complexity 30 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"8750ecce7c50999d6d2f29ae84e0e82d519d7b3c01f47c71f3e5c0b26e098e16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectOceanbaseSessionDiagnostics (cyclomatic 30, cognitive 40): collectOceanbaseSessionDiagnostics has cyclomatic complexity 30 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdb353e167d0a6bda681ea1efacfc5d412bd6419da6e827bd0d7426129cd7c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectExpressionSection (cyclomatic 30, cognitive 39): collectExpressionSection has cyclomatic complexity 30 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cb3e8c7534084656926437c86f9cf4678ec07286fa8d07c476e18cea721ca1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractReferencedTables (cyclomatic 30, cognitive 36): extractReferencedTables has cyclomatic complexity 30 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba160814abc3f26b020f0372fd0e6011a6809ff5fbede1f9a142706de730129"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmTerminate (cyclomatic 30, cognitive 35): confirmTerminate has cyclomatic complexity 30 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"f079dfcde82af22c8ed1ae98651aac032f8d4ca6238e22a2400864d99c56c17c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySchemaDiffSession (cyclomatic 30, cognitive 35): applySchemaDiffSession has cyclomatic complexity 30 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"916db00153e1e292f893b8c1d9d3c622594e8840b380b5736836fca01873398b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveResultMetadataForBatch (cyclomatic 30, cognitive 35): resolveResultMetadataForBatch has cyclomatic complexity 30 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10954}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa69ffccd1c9f3574f5d58051e01869569ab5974a81e68e9e6a42e84af5e2bbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOracleForeignKeySourceChanges (cyclomatic 30, cognitive 34): validateOracleForeignKeySourceChanges has cyclomatic complexity 30 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":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acbd1adf85aba52f601bb7089b88a3df48afedc4a4e4de9c8c42aeae016decc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPlan (cyclomatic 30, cognitive 33): readPlan has cyclomatic complexity 30 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":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"087ed1ab85bd5ebb558588e7d32bd077802e5514bd8250da83ddcc464f593eb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectMatchesCompletionContext (cyclomatic 30, cognitive 33): objectMatchesCompletionContext has cyclomatic complexity 30 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82a2cc14c85f955d32cf78fe28a656d32ab2487322c2b8f7c9605530cc904e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleForeignKeyPlan (cyclomatic 30, cognitive 32): prepareOracleForeignKeyPlan has cyclomatic complexity 30 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"9581004c0086445e9c9cedf27500be13a9057418140f1a2fb4191dbe09d0e901"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentStatementFrameRect (cyclomatic 30, cognitive 32): currentStatementFrameRect has cyclomatic complexity 30 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorCurrentStatementFrameLayer.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b7bd64ce8de7db2492c2ac69776fe1e25b5cef1f30b85c70cf54cd4305a39d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dataGridRowStyle (cyclomatic 30, cognitive 29): dataGridRowStyle has cyclomatic complexity 30 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8664}}}],"partialFingerprints":{"codehealthFindingId/v1":"51883fe2bebbad369f112f470d9b640af2dd84d48d200e8bfc262a3572261833"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listCompletionColumns (cyclomatic 30, cognitive 26): listCompletionColumns has cyclomatic complexity 30 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94f020ed5adc34005ec053e2f8f807c8f629159fe64813c70d48590d56c620e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildConnection (cyclomatic 30, cognitive 22): buildConnection has cyclomatic complexity 30 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/dbeaverImport.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae29b288252faf77e959f33f9dbc2233c759c91a60fd75207b4549e14b0939c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureResultLegacyValuesForExport (cyclomatic 30, cognitive 17): captureResultLegacyValuesForExport has cyclomatic complexity 30 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10858}}}],"partialFingerprints":{"codehealthFindingId/v1":"44866fcb98e2a0eb43c79a9ceaac6e4f56b817245c740ed9cdbd529c492e32ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quoteTableIdentifier (cyclomatic 30, cognitive 15): quoteTableIdentifier has cyclomatic complexity 30 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":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d3fa122f604da3c862b2acb1eaed997777e0af34d4d60447b6d3445e56e94c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasPendingStructureChanges (cyclomatic 30, cognitive 12): hasPendingStructureChanges has cyclomatic complexity 30 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0aa915e8275503779625644525ec14756e11cd0ae71ecedb8ea0f4a186d5868"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGrantAuthorizationPlan (cyclomatic 29, cognitive 66): buildGrantAuthorizationPlan has cyclomatic complexity 29 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdf86816dca61bdbaadd8a9e8a99960987ce9c500dbc7888a7b73a95edb7300"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePostgresArrayText (cyclomatic 29, cognitive 56): parsePostgresArrayText has cyclomatic complexity 29 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"283565520956d32e6926350040055fdc2535725cf75dee8bd4c603400162f448"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipBalancedParens (cyclomatic 29, cognitive 54): skipBalancedParens has cyclomatic complexity 29 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c5b52d1acc64675f24f6bbb64038fc12ae59a6129574c1c37622a1dcae038e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 44): (anonymous) has cyclomatic complexity 29 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"efafd4ce564485f145d6e15843f6c60d1ef30478281842b26c78ac89733e39d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectTriggerPseudoRecordFieldStarts (cyclomatic 29, cognitive 44): collectTriggerPseudoRecordFieldStarts has cyclomatic complexity 29 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8f183ebbc63b44ecd65874fead79b5624611a5c51016f4cf8d82c3044a9e1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openObjectBrowser (cyclomatic 29, cognitive 38): openObjectBrowser has cyclomatic complexity 29 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3913}}}],"partialFingerprints":{"codehealthFindingId/v1":"32aafffe41ea355947a7adaf145a36c21ea064e30ad3d60625f97a439d3fcc92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTarget (cyclomatic 29, cognitive 36): validateTarget has cyclomatic complexity 29 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useMultiDbTargetSelection.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c01ee54672a97cb461f02e37c2fbe92519a5b593433f13de5caa7397067eb40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyLoadedObjectSource (cyclomatic 29, cognitive 36): applyLoadedObjectSource has cyclomatic complexity 29 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3648}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34a8bbc8856955ade5936bfb7c1027ac49618ca5285c829b759f76ed8a3db57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDetails (cyclomatic 29, cognitive 35): loadDetails has cyclomatic complexity 29 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0323f19cd300ddb890bf4cd0ab99f387cd0517cd2192ba6a90dff0c989df292"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routineDefinitionKind (cyclomatic 29, cognitive 30): routineDefinitionKind has cyclomatic complexity 29 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineDefinitionSave.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8b14eb0769045ff37c7ad6161b75f7341835f5e45096ce2f6960e45d1c8361"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revalidateCachedStructureMetadata (cyclomatic 29, cognitive 29): revalidateCachedStructureMetadata has cyclomatic complexity 29 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4565}}}],"partialFingerprints":{"codehealthFindingId/v1":"86064d6bdbe2a5a24faa9e30095274ecf5a84102fba0edc4dc86eaa57d4af785"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeTask (cyclomatic 29, cognitive 27): normalizeTask has cyclomatic complexity 29 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b5f7da1603a41128a0d8fccf5ed89980e7865a57d60997a5e03c70769f77a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resetMqFields (cyclomatic 29, cognitive 26): resetMqFields has cyclomatic complexity 29 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"966d71dfeb3bd4f4a7f9608819916860ff53e400732ddfc5248da96e901af648"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshDataTabTableMeta (cyclomatic 29, cognitive 21): refreshDataTabTableMeta has cyclomatic complexity 29 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a0dcaeccae33c7df43181f5bc2c46f5e28b5a5988ddfb0ada45883ace7af70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyEditorAppearance (cyclomatic 29, cognitive 13): applyEditorAppearance has cyclomatic complexity 29 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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b616b36991f662defd16deeb5e420588ba1eb3944ec4b2f1d2bfe4bc6c4ea7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokens (cyclomatic 28, cognitive 60): tokens has cyclomatic complexity 28 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSource.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e2c623007d9ad417ce00ec12725d987f7e25014cc89955c014ecd1c3160617"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readTableReferenceToken (cyclomatic 28, cognitive 58): readTableReferenceToken has cyclomatic complexity 28 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"312d87f7430a3bbc6de79c779b2ed0afc16f7bbd2fd1c3290291783dccd4b4e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSqlServerRoutineParameters (cyclomatic 28, cognitive 46): collectSqlServerRoutineParameters has cyclomatic complexity 28 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b893ecffd17b0f1ad74da68e4a92a3f260f2496155015db4c9f096ade3cca748"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activeSingleQuotedLiteralStart (cyclomatic 28, cognitive 45): activeSingleQuotedLiteralStart has cyclomatic complexity 28 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4ff1a590357079a251445bf93a01a21ff05ced7b24975794ab5abc782caeca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSimpleSupplementalObjectChildren (cyclomatic 28, cognitive 45): loadSimpleSupplementalObjectChildren has cyclomatic complexity 28 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3476}}}],"partialFingerprints":{"codehealthFindingId/v1":"65056ec22a06ac69a5a017f69cdfe32d7452749a579c5db3a46978270435643c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateKvValue (cyclomatic 28, cognitive 44): validateKvValue has cyclomatic complexity 28 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/kvValueFormat.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"638cfedda35ee473e186034635cc7ad015e66e8a6461c3379dc50acd281207b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanSelectListContext (cyclomatic 28, cognitive 44): scanSelectListContext has cyclomatic complexity 28 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"620c271c7b4326ed463ed691c2ea01746bf228a055bafd9e198ba71bc960172a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSqlServerLocalVariables (cyclomatic 28, cognitive 43): collectSqlServerLocalVariables has cyclomatic complexity 28 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67f5f97907e95ebebdbde6138d9b61f597a40c2ef1a9f53226c88df821d1fbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectJsonBody (cyclomatic 28, cognitive 42): inspectJsonBody has cyclomatic complexity 28 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c061cdad034ad5ccc0350c97d70d0e5a2413e6f5cc064b2e8440d30d7f93f162"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGroupedObjectTreeNodes (cyclomatic 28, cognitive 40): buildGroupedObjectTreeNodes has cyclomatic complexity 28 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"d561050260377de63392ef81d06b68e68dc72b644e2551459f76d696cb6c230a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executePreparedTriggerPlan (cyclomatic 28, cognitive 39): executePreparedTriggerPlan has cyclomatic complexity 28 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"9065f5589a4b8c0c39375bf4ac8046c4b0bed742d862051d5ca2edb0387f1159"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startBatchCompile (cyclomatic 28, cognitive 37): startBatchCompile has cyclomatic complexity 28 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08b463287222f511309ada9b749fc5ef565512116664c4655b5e15b7f9176dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lastPage (cyclomatic 28, cognitive 36): lastPage has cyclomatic complexity 28 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":4534}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0b3c4f1c2a8f0a73e7df0362390654b1e269221ee9fe5b234f15036da61da1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statementRangeAtCursor (cyclomatic 28, cognitive 34): statementRangeAtCursor has cyclomatic complexity 28 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5f1a996d5bd5435d0773707a2146740e42892586a12a8aa0e92e6856985ad5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeNacosEndpoint (cyclomatic 28, cognitive 33): normalizeNacosEndpoint has cyclomatic complexity 28 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":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0327a3e3d532ed1083f6b1e5dc3965c4bed95ad9816d819095eeb97637c33d36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoFilterValueAs (cyclomatic 28, cognitive 32): parseMongoFilterValueAs has cyclomatic complexity 28 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85180760c098a38fe35f8c9bc406f73feef5d664f4c5ef46298b4a21bd756f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripOracleStorageAttributes (cyclomatic 28, cognitive 32): stripOracleStorageAttributes has cyclomatic complexity 28 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ce5ff95058125d28c5abcad95a1d54c4db9476f11160328444e00878913210"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildNacosAdminConfig (cyclomatic 28, cognitive 31): buildNacosAdminConfig has cyclomatic complexity 28 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2524fbf276915206c84edcac6fed281aceac7aa290f386c36cbc8e849a47408"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveObjectSourceTab (cyclomatic 28, cognitive 31): saveObjectSourceTab has cyclomatic complexity 28 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectSourceTabSave.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b882feaf2bd726f9ad10fd06043edaecbd62da52ff6570d8995c4f51020aa1e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeOriginal (cyclomatic 28, cognitive 30): closeOriginal has cyclomatic complexity 28 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"c043a52a042f37f8a7671e24930bdd7a128ce32c00e145d2cf713315b8df0598"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openDatabaseObjectDependencies (cyclomatic 28, cognitive 29): openDatabaseObjectDependencies has cyclomatic complexity 28 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3daae00158aade0c98fe4e4a47b81eec40111fc7022682268acdc2695cccfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resetFromCatalog (cyclomatic 28, cognitive 27): resetFromCatalog has cyclomatic complexity 28 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f51e15e00dd8e14fd95873115fba836ef870a630540c5b8d40ce6ec1f33a1d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onDoubleClick (cyclomatic 28, cognitive 27): onDoubleClick has cyclomatic complexity 28 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"3216d418efa556e08df0a3a494d5e697b47fc28140f331918cff2d9437ec0ee4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acceptSqlServerCompletionOnSpace (cyclomatic 28, cognitive 26): acceptSqlServerCompletionOnSpace has cyclomatic complexity 28 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1134c72eda5ff7657eee3ca6d0a807d9b4c905d921ae7d266d6ff79335187b42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function urlParamsRequireTls (cyclomatic 28, cognitive 26): urlParamsRequireTls has cyclomatic complexity 28 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd8080f7ac695f94aa293a45f49cf9b6401034758b607bbe03e1ac88dd8c676"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findMatchingParen (cyclomatic 28, cognitive 26): findMatchingParen has cyclomatic complexity 28 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4527}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fa5696678f1956f58d43b78ad52b945a6443b70b176ac37499848d0f3624b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSuggestions (cyclomatic 28, cognitive 25): loadSuggestions has cyclomatic complexity 28 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e46f9bad14abc109d19b41e2560fb3cb7787771fdee99232be5bb94efd00d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitTopLevel (cyclomatic 28, cognitive 24): splitTopLevel has cyclomatic complexity 28 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 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4802}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5ff1ec33aa1f304e61ed5ec75cf5a3ff1008e88f673d6aef11fbf6a0520cd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 24): (anonymous) has cyclomatic complexity 28 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 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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2682}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c8497e44ffd104777e8d01cf027f10db9d5e7ad54b5a6200f865392c2d3b67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onObjectBrowserKeydown (cyclomatic 28, cognitive 23): onObjectBrowserKeydown has cyclomatic complexity 28 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4830}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a0c0a25622cafd02bd490a9c76fe062992a67eaae96de92774e55d4bc5f417"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPublic (cyclomatic 28, cognitive 18): readPublic has cyclomatic complexity 28 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 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"9305cfe05dbed0b5ede8435718bc688fa67093957a23cd20e6fea413a48843a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function batchResultInsertRequest (cyclomatic 28, cognitive 17): batchResultInsertRequest has cyclomatic complexity 28 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":"apps/desktop/src/lib/query/queryResultBatchInsert.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"70aee496e46a6bba3c33c2c1ee44d031e7b9005f653657bd4b07746ef3ac05b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 14): (anonymous) has cyclomatic complexity 28 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"44df5567dbdfed2cffc676e322dbf247b099e4f0568a82f092133eb8fefefc8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 63): (anonymous) has cyclomatic complexity 27 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10381}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a96c2510389ab8ccd0427d8c8167017c8ec9b6812b3650a11bc165e975ef1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBracketedGroup (cyclomatic 27, cognitive 53): readBracketedGroup has cyclomatic complexity 27 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"31089357fd51072ccc83f6491257b41e1fe117a443e3444dd50d5ed36dbe742e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCreateUserAuthorizationPlan (cyclomatic 27, cognitive 52): buildCreateUserAuthorizationPlan has cyclomatic complexity 27 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5ed5fb677cbdeb02619e6dd51b9ab418d8951d255b936f75a1809a126e323a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oraclePlSqlTokens (cyclomatic 27, cognitive 50): oraclePlSqlTokens has cyclomatic complexity 27 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5a29a19ec5b370b0cd51197e2f0a3555b7665f9bd3c233cfd0956adff8a3fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHtml (cyclomatic 27, cognitive 49): validateHtml has cyclomatic complexity 27 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosConfigValidation.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d905caa6ba2c3788e307e6dbfb3c52182579feee7a87754fcee7f21529953e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGeometryMapFeatureCollection (cyclomatic 27, cognitive 48): buildGeometryMapFeatureCollection has cyclomatic complexity 27 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryMapPreview.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea758b9933685af600718600ae0c7aa9fead7d8560b829a76bfdb847921cf7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanCteDefinitions (cyclomatic 27, cognitive 48): scanCteDefinitions has cyclomatic complexity 27 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4667}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad042804a5516035ae88af4f0a1a60c09f025a96577a52d8ba6dfd45659314e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 45): (anonymous) has cyclomatic complexity 27 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd88ec31c8bdc0bd950af9883e4d8138b23a0b90b10beaee3178f36f6386469"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSqlRanges (cyclomatic 27, cognitive 44): collectSqlRanges has cyclomatic complexity 27 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3190ffb0b42a63eaddf7e330f3f10374d33364321992a0ca9abb432e2d22f69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function treeNodeRowDoubleClickAction (cyclomatic 27, cognitive 42): treeNodeRowDoubleClickAction has cyclomatic complexity 27 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86a4f97211aa071172a7b65d5a108195013631516d1a7cfea2034eb31ebe315"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPromptKeydown (cyclomatic 27, cognitive 40): onPromptKeydown has cyclomatic complexity 27 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":3697}}}],"partialFingerprints":{"codehealthFindingId/v1":"779c4bcbb892d1325852974a350f1f088a83371814d8398b6f3c0d347b884578"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyTriggerStructure (cyclomatic 27, cognitive 39): applyTriggerStructure has cyclomatic complexity 27 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":7368}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb16bb89bcecd377d2ed2905f6d17f8a0160268146b44be8c7ad2da309a746e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTrailingIdentifierPart (cyclomatic 27, cognitive 37): parseTrailingIdentifierPart has cyclomatic complexity 27 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dc6c2cc6b41435cddeeb44546d40acec326e5429ed1b2e0e817eaf9563f26e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOracleForeignKeyDdl (cyclomatic 27, cognitive 35): parseOracleForeignKeyDdl has cyclomatic complexity 27 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfef5abdead5b410d6ddcbc49e147acd85196e0edb62d37ab94dc1269d25a3ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isReusableTreeSnapshot (cyclomatic 27, cognitive 35): isReusableTreeSnapshot has cyclomatic complexity 27 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3757}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0b19f468586f3d8f999dd3b591456def1d51e8fab3f3646207e89f350a251b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function progressValue (cyclomatic 27, cognitive 33): progressValue has cyclomatic complexity 27 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":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b08d41dcefeeeb6f4db0b88585d23243faca43ea3506885bf4d7f21c6c4317"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMongoShellLiteral (cyclomatic 27, cognitive 32): renderMongoShellLiteral has cyclomatic complexity 27 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"534cde53f3132ba120b865a5c58c0969f0a60a2bb403428c7c20f1eafb317fa8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlSemanticTableNameSpans (cyclomatic 27, cognitive 32): sqlSemanticTableNameSpans has cyclomatic complexity 27 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3bc3b9e82ae72bd326d7631773e7e08c143cb1ef7766f5fca7193749e9de64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statementExecutionMarkers (cyclomatic 27, cognitive 32): statementExecutionMarkers has cyclomatic complexity 27 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"935ac19c193b67803f1c7f23fa4243ad573aff14e03c11640597b8c1a2e1405d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchLegacyLargeValueRequestChunk (cyclomatic 27, cognitive 31): fetchLegacyLargeValueRequestChunk has cyclomatic complexity 27 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/legacyLargeValueExport.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ca6413f0c72dd4d7cf98ae1b9cb9be17001cabc2637ba9cca18ce11582c8bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotElementToPng (cyclomatic 27, cognitive 30): snapshotElementToPng has cyclomatic complexity 27 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":"apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"16681ee905a9c74986877e0d0b4882a0a192d6cbd1a7d3a0769c08c871fd6768"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDataGridTypeVisualKind (cyclomatic 27, cognitive 30): resolveDataGridTypeVisualKind has cyclomatic complexity 27 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":"apps/desktop/src/lib/dataGrid/dataGridColumnType.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0182d268dfa194b0a408582c2e86c5745a69764b027ae6ffd6cb5b8e741623"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizedDraftValue (cyclomatic 27, cognitive 30): normalizedDraftValue has cyclomatic complexity 27 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":"apps/desktop/src/lib/settings/editorSettingsDraft.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb01098131d088ba1daf52e6678cf93c63ef7a22fd6c97f7941f13496d75faf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 28): (anonymous) has cyclomatic complexity 27 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":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d634a94e3a51f55247ba6426133c67d4d105e3d6b54b85f3cb6fe8f011558c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startDesktopExport (cyclomatic 27, cognitive 27): startDesktopExport has cyclomatic complexity 27 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb5a66e24a2af8f3b875dbc0649a6a8eaf61a6fc310a688d982a062b066fa7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleIndexPlan (cyclomatic 27, cognitive 26): prepareOracleIndexPlan has cyclomatic complexity 27 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d469eec1a10c5e9a1051c2665f1ab81c17c9750c76634315f5d5311c691e302"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openDirectNavigationNode (cyclomatic 27, cognitive 25): openDirectNavigationNode has cyclomatic complexity 27 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"020d2ccccb76bdec355a59dac7726511b15ee1a6a0110b1d98ecac9156185a15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOracleTriggerSourceAction (cyclomatic 27, cognitive 21): runOracleTriggerSourceAction has cyclomatic complexity 27 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ba13690dfae666b99616334acc5baca123da8d5cfbfe9f0661a5fdb1e8e989"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOriginal (cyclomatic 27, cognitive 20): readOriginal has cyclomatic complexity 27 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":"apps/desktop/src/components/debug/PlDebugCompilePanel.vue"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a778c5ba57d02c1a658c2d7233903cbaba0ce84330887d997a0afba2415e9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jdbcRoutineParameterType (cyclomatic 27, cognitive 20): jdbcRoutineParameterType has cyclomatic complexity 27 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":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0b65f98a63107f75f71de698befa2fe987b9dcb4446826bf6b150beada5864"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateBulkWriteOperations (cyclomatic 26, cognitive 50): validateBulkWriteOperations has cyclomatic complexity 26 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b167e4d98a47624d357f3e6e0761700f7d33bdcaff845e89b642551e52ce646"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectNativeSqlServerParameters (cyclomatic 26, cognitive 45): collectNativeSqlServerParameters has cyclomatic complexity 26 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ceec3a84e1b14646bc61f437f5372f8d3db688ac92edb37922a778b240461a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripOceanBaseOracleStorageOptions (cyclomatic 26, cognitive 43): stripOceanBaseOracleStorageOptions has cyclomatic complexity 26 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfae867e121886320730cb33bd7d15cf418e8d0bf66f83cc63effd98b39f7dd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleRoutineRename (cyclomatic 26, cognitive 39): prepareOracleRoutineRename has cyclomatic complexity 26 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af22f324c964e0ed9626a7d75e4a96b92cb948df858b728076ea2b4b2c2b651"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLargeValueCells (cyclomatic 26, cognitive 37): resolveLargeValueCells has cyclomatic complexity 26 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3dbafd6aaa9d2e0c43212701dd550e91477f0d04e746fb17fbb51f1485dcc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportDataLegacyForTarget (cyclomatic 26, cognitive 37): exportDataLegacyForTarget has cyclomatic complexity 26 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6789003bd1ad077c48b67bdccfa59d72f587e6bd6c91bf0ca06a4f50d06762f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startAllDatabasesExport (cyclomatic 26, cognitive 35): startAllDatabasesExport has cyclomatic complexity 26 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f5afdfece7f7a302a6959c5ab11ceccbd1e7d2b4c8abc1861a62da046772d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeBackendErrorAtDepth (cyclomatic 26, cognitive 33): normalizeBackendErrorAtDepth has cyclomatic complexity 26 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":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d45e97a0360d65ed0bbbabc2ab46c02345514f70c4251f62ffa6675b6a1f295"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shortcutKeyLabel (cyclomatic 26, cognitive 32): shortcutKeyLabel has cyclomatic complexity 26 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/shortcutDisplay.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"778d13d7d15f8389150cccb6d9447340fd7ced3a99e84fee568c88a58652aa57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createTab (cyclomatic 26, cognitive 32): createTab has cyclomatic complexity 26 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74870d4e919b58a03e87d709e0110189e691d978130a83813eb24e8b8ce4a12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnPlaceholderValue (cyclomatic 26, cognitive 30): columnPlaceholderValue has cyclomatic complexity 26 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":"apps/desktop/src/lib/table/tableSqlTemplates.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec60e6e1d41ed159e26b924364a2ac2f22cd8713b60855c1bb3b8436b347617e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveInfluxDbV1DeleteTarget (cyclomatic 26, cognitive 29): resolveInfluxDbV1DeleteTarget has cyclomatic complexity 26 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/influxdb/influxDbV1Delete.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f95f3418a1bf5c7dec8ed072796fdf4448f29dddbfbb46b1e4fda1fde3dd6af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requireAiRecommendationUpdate (cyclomatic 26, cognitive 29): requireAiRecommendationUpdate has cyclomatic complexity 26 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4121fa972ef3361094807103eaa46c97c4f3bc5a727a1b366fe121f667bdb904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onCanvasMouseMove (cyclomatic 26, cognitive 28): onCanvasMouseMove has cyclomatic complexity 26 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9131}}}],"partialFingerprints":{"codehealthFindingId/v1":"532b6e1e7fba8bef7ae21e589f51d84a31b00989769df02e052b7da8f5bc45a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onCommandInputKeydown (cyclomatic 26, cognitive 28): onCommandInputKeydown has cyclomatic complexity 26 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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":3746}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdcc70282f6807c1c324d11f9b076dc04e40ecca0f4fa57f347d1fe6e73c31a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 28): (anonymous) has cyclomatic complexity 26 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"51131789b8b5c6cc7f20235ec228bf19408ce60afdc5398a4b228f9b2f7833aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 27): (anonymous) has cyclomatic complexity 26 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"523e56a51a0c37fc758f896b3fc712c709b3f46392ad6c65f1657d5c5003bb77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAudit (cyclomatic 26, cognitive 27): readAudit has cyclomatic complexity 26 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0e01fc0adb96eedf032e7cef06ef92e5cc52f00091d5c4e082432f4a16c9f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatSqlText (cyclomatic 26, cognitive 27): formatSqlText has cyclomatic complexity 26 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de47c396890832f5eb9b76768f9f70fab29e7da673b3228a0050121532a6cc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseConnectionDeepLink (cyclomatic 26, cognitive 26): parseConnectionDeepLink has cyclomatic complexity 26 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"6658bff9668adf07436d9715eb0b484a7716c00c4e65435e0aed251fa0938c53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveHistorySqlRestoreTarget (cyclomatic 26, cognitive 26): resolveHistorySqlRestoreTarget has cyclomatic complexity 26 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/history/historyRestoreTarget.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e93e7fefa46565446cbb9f73e8828d3af23c94504abc696d56133e34867b1cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveKey (cyclomatic 26, cognitive 25): saveKey has cyclomatic complexity 26 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da3af5767ebdb5229931eea9387bb9e102af0c3e15203593cce85eb00d603dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeJobDefinitionForEdit (cyclomatic 26, cognitive 25): nativeJobDefinitionForEdit has cyclomatic complexity 26 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f8109fad70339db7f359cc8d42a5b24a0335835a341cfad995c4fe711f8e69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeEditableQueryEditability (cyclomatic 26, cognitive 25): analyzeEditableQueryEditability has cyclomatic complexity 26 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2deaab80324de6fadb4678b5891022d250f3a0b133cba1e1f3331fd41bddcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 26, cognitive 23): main has cyclomatic complexity 26 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/database-env.mjs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b75e56fab4b33a7768f6eda280fc127719e0e8082abcd5a021c3f1c2e2ec03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isDataTypeLengthDisabled (cyclomatic 26, cognitive 20): isDataTypeLengthDisabled has cyclomatic complexity 26 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":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a62b6136cb0cfcee350f0ce50024e66ebe20002a4e2e30440709ca2a9e2102"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyCursorInCall (cyclomatic 26, cognitive 19): classifyCursorInCall has cyclomatic complexity 26 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0994f10057abff3deed319e6d5d9caa59ad3944285a1c3af740641cde065650a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeCursorOffsetPage (cyclomatic 25, cognitive 45): executeCursorOffsetPage has cyclomatic complexity 25 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/query/queryCursorOffsetPagination.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfee2fdbaf4b36812bf1503dc5cdc47280eb082b2823201c7991ba27b729672b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractActiveDatabase (cyclomatic 25, cognitive 43): extractActiveDatabase has cyclomatic complexity 25 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc2edfb126e0b2115e17d15f3b1b2b3de1044a834a4b15a9507acaa3916b422"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRowSourcesAtDepth (cyclomatic 25, cognitive 43): parseRowSourcesAtDepth has cyclomatic complexity 25 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55e027ac38f70d792779acf2ad399f685a7574d8f37ba308bdadd5c4ed1cf77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDamengExplainText (cyclomatic 25, cognitive 42): parseDamengExplainText has cyclomatic complexity 25 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"169162045e12a573d0f88ccf730e98068cae9e45e1bbbedf4dac16cc33b4b080"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 25, cognitive 38): start has cyclomatic complexity 25 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fb01d74840701b527915ccce3f93df9fbccb0c03e1ef4f57116ad1c21295a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanSqlServerControlFlow (cyclomatic 25, cognitive 38): scanSqlServerControlFlow has cyclomatic complexity 25 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79a4f9d3ce2b300cef13e14814db8f145f18ca47f89012c7b27d2e9212abb60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cteBodyProjectionShape (cyclomatic 25, cognitive 37): cteBodyProjectionShape has cyclomatic complexity 25 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5135562a549d9face255bf9ab2d7d34c70ad66c93303f631f6261e03b82b91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function containsTopLevelAggregate (cyclomatic 25, cognitive 37): containsTopLevelAggregate has cyclomatic complexity 25 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2c97b02181ef0c2c024978cd394bd4197e6dac54232d2ce07fdc409381242a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishTransaction (cyclomatic 25, cognitive 35): finishTransaction has cyclomatic complexity 25 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdb0848f9573ff27a4a901f48e3919ffe60a152c0ee5d1f69cbe50b211fb5d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyMethodOptions (cyclomatic 25, cognitive 34): classifyMethodOptions has cyclomatic complexity 25 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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd670bf83a50d5b3e764436f87925c620ccb825b7172fefad447d96e7c4f024"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 33): (anonymous) has cyclomatic complexity 25 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":"apps/desktop/src/lib/plugins/pluginAiCompletion.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03e0c02ec1be09a8501f5164ade81678162fadce521f43bd3a0435deab994df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 32): (anonymous) has cyclomatic complexity 25 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b18afce70569d67d0992e6ae3e494d5361c2481db234ce1d55fb96601aeaf04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maskSqlLiteralsAndComments (cyclomatic 25, cognitive 32): maskSqlLiteralsAndComments has cyclomatic complexity 25 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aa503b8d01a0600bd35708c6fcc9bead1c32f0059bcdcceaaa9d59e48baf0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractorCellValue (cyclomatic 25, cognitive 31): extractorCellValue has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"864128d9675860560d28b968183620dd86eb4ce728a9ead28e40444597bcdb5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onStructureEditorSaved (cyclomatic 25, cognitive 31): onStructureEditorSaved has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"16658cd6fa9a40941c97bfe04b71644cdfcbd381d99cfec4e3d735723ac09c8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function coerceDataGridCellValue (cyclomatic 25, cognitive 31): coerceDataGridCellValue has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"262e34af0c6df8e1c724dbce4a81cf2bf2b0f8e31f1248077da5b8674dbbb0a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyFilter (cyclomatic 25, cognitive 31): classifyFilter has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"782673ceb8b09bcbe833517d50375899827f4bfee1945ab73514764b7fa31b5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSqlXmlKeywordPositions (cyclomatic 25, cognitive 31): collectSqlXmlKeywordPositions has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDatabaseLinks.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3db77a97ad2dfbcffc605cf2cffd3dfead16e057abc4374cf21811869bc181d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshOracleRoutineDeployment (cyclomatic 25, cognitive 29): refreshOracleRoutineDeployment has cyclomatic complexity 25 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"9894efe40a1a58cb191e3e0e88b73f65e2d80b5e84808b2e2fde2c3e62d8a9f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatCurrentSql (cyclomatic 25, cognitive 28): formatCurrentSql has cyclomatic complexity 25 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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be3e1b3e64ff49d390314f8a28b0fb0a39306be23afb785383cf9b0c9f38f76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportTableData (cyclomatic 25, cognitive 27): exportTableData has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4242}}}],"partialFingerprints":{"codehealthFindingId/v1":"5723a56e6eee8ef9abc65ee481ee2e94acaf66b1debdd0c402dcefa9bb916df7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTableReferencePayload (cyclomatic 25, cognitive 27): parseTableReferencePayload has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorTableDrop.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e757971844829b1bda733b4b47245d82b4165ffc162e86032f48a238d61a4e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifySetTokens (cyclomatic 25, cognitive 27): classifySetTokens has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3096b00f105f9cd32cf4799dd7e3789ef81cd75cf6e57d07be1d37e7325ae26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 25, cognitive 25): load has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1effde1c96e90a29587bd5c8073d64fa5c819b47e7ce59b57c50856314d09a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function focusSearch (cyclomatic 25, cognitive 25): focusSearch has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdd0a15be3df90dbaff2ab999b8345906c75037b2befe498d837793e677882e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadFormatterDraft (cyclomatic 25, cognitive 25): loadFormatterDraft has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db8d6116b355cdade9904c14445a227ceb8b567b789cae27d93806c2fbe0d06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useDataGridEditor (cyclomatic 25, cognitive 25): useDataGridEditor has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf95e238e78187d8cf54181efb8994d8e5ab29e5b484080a60bb658fb5b8beb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 24): (anonymous) has cyclomatic complexity 25 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 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":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3c499ec2f96572f39bc8c2602cc584386fb105068c996d64ef16a522cf5b74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 24): (anonymous) has cyclomatic complexity 25 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 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9615}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a8d0868c38b97446ed74400346b3a830c6e2913981a4ebd9db7acb2dfb575d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreQueryNavigationEntry (cyclomatic 25, cognitive 23): restoreQueryNavigationEntry has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":4511}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0416d0ba937f554a460905151f45b8d96d13ee839ad6a948cb7f0799537b58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOracleTypeDataInsert (cyclomatic 25, cognitive 23): executeOracleTypeDataInsert has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeDataMapping.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d4fc8a1cd9c79599612ba60213fbe4111a5941f39ed046455e00918c037c24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDataGridExtractorOptions (cyclomatic 25, cognitive 22): validateDataGridExtractorOptions has cyclomatic complexity 25 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"230a42ffe01845a773057a4a7a4d52274ae1e7fbb54a5b4b9880a0fecaf71d16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMongoQueryInputBrackets (cyclomatic 25, cognitive 22): handleMongoQueryInputBrackets has cyclomatic complexity 25 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoQueryInputBrackets.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43ea718d0832cfdcbca3fdc4b20fda124eda73bb794db94111bf602d536044c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function policyFormsFromEffectivePolicies (cyclomatic 25, cognitive 22): policyFormsFromEffectivePolicies has cyclomatic complexity 25 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/mqPolicyForms.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebb0b5f8b44674cd7005345d6040a38db06dafb7409a6cd2b043b98b0b619c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createMockHost (cyclomatic 25, cognitive 22): createMockHost has cyclomatic complexity 25 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f947e3a3b41461af65f4783ac410fa2590752f62951d4f566fb787663fb276cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sidebarTreeDisplayLabel (cyclomatic 25, cognitive 21): sidebarTreeDisplayLabel has cyclomatic complexity 25 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTreeLabel.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9000346e9e942e28c6df11b113a73e0b9043d7357b940bf296623f768185aca1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleConstraintPlan (cyclomatic 25, cognitive 18): prepareOracleConstraintPlan has cyclomatic complexity 25 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 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":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a5e256f94e2e9575f2ccce4c8e05aac9e9ee219b0cbb103678e3ba389d1c22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revalidateObjectSourceTab (cyclomatic 25, cognitive 17): revalidateObjectSourceTab has cyclomatic complexity 25 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32cb5804916ae03f666a282e675ab26829773bfe0c3b3cd216d8546d0407937"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stepSatisfied (cyclomatic 25, cognitive 14): stepSatisfied has cyclomatic complexity 25 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6bcbfe8824cdbd0477cf5fee7dd5f18af3185586d3e8a7c6b0cc7be2ea0b01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 10): (anonymous) has cyclomatic complexity 25 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":"apps/desktop/src/lib/sql/layout/rules.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7fc67f2a7e3fbdb795aa76f46dca803eecb0f586539693db0450fe15292c08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadMessages (cyclomatic 24, cognitive 51): loadMessages has cyclomatic complexity 24 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MessageBrowser.vue"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6e7d92fbdce93a188b92dec05a36a2106e6dc5d886b2c76e3a527ad2031fdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCteSources (cyclomatic 24, cognitive 47): parseCteSources has cyclomatic complexity 24 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"578f508d94ce2bf05420430d0f0578c50e2dd1091863104ee28cf759c354b35b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchMcpCapabilities (cyclomatic 24, cognitive 45): searchMcpCapabilities has cyclomatic complexity 24 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mcp/mcpCapabilitySearch.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f5bf72b4662b1c6239efb381d31a0333d752ab81daa76ed015a62d531da9a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceReferences (cyclomatic 24, cognitive 45): replaceReferences has cyclomatic complexity 24 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf94633babfd224781fc8f41f057bfb91972d7d0c546732e8fd999f2dacdb3d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripSchemaFromSql (cyclomatic 24, cognitive 42): stripSchemaFromSql has cyclomatic complexity 24 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffDdlNormalize.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"217d2b69d2626fa71e115b7daf8fbd7e64c3971b2bf569bdb554eb08b01f4bff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listCompletionObjectsForContext (cyclomatic 24, cognitive 40): listCompletionObjectsForContext has cyclomatic complexity 24 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"380127c0b5e0d304caf52e8cef4eefdab2195138b89c0c575aade9cedce0facd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesShortcut (cyclomatic 24, cognitive 36): matchesShortcut has cyclomatic complexity 24 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8618ab3a65442b765bffc895712ff180680dce88409e6408e5d5c761bb36e47b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function myersDiff (cyclomatic 24, cognitive 35): myersDiff has cyclomatic complexity 24 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68ebffeeb850d6e059e53fee099fc906a2d70f8d0df3e7406e7a4c32391ff16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 33): (anonymous) has cyclomatic complexity 24 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":"apps/desktop/src/lib/__tests__/table/oracleTypeManagement.spec.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e6809334912beaf9201bbdea2bafa85aef93b40685d5ce4b0a8d87a46091c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmExactBatchTriggerDrop (cyclomatic 24, cognitive 32): confirmExactBatchTriggerDrop has cyclomatic complexity 24 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5053}}}],"partialFingerprints":{"codehealthFindingId/v1":"6163a809247c5ef8d4d0a039d091bdceafd079d261a964eed91db397b7e5c514"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSqlErrorOffset (cyclomatic 24, cognitive 31): resolveSqlErrorOffset has cyclomatic complexity 24 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/errorPosition.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbfab05352ca8a40755fd4f710f70fc9952bbcf801c14569b8a46250bb64fd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTableGroups (cyclomatic 24, cognitive 30): loadTableGroups has cyclomatic complexity 24 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8514}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a38c8d10e28cf36c83a1e4de5d37a1eedcb2e8cb633bab0d187b676306d162"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadDetailBinaryValue (cyclomatic 24, cognitive 29): downloadDetailBinaryValue has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":12325}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a4c654d777ff78b2d1b470da71673c0ca1530a1609c82e58b0c30bc5d5cf26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSystemPrompt (cyclomatic 24, cognitive 29): buildSystemPrompt has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e141578182da3defdc70c090381d6adf2cf5731a66b216369fded7d62bd0f3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAvailableMqTabs (cyclomatic 24, cognitive 29): resolveAvailableMqTabs has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/mqConsoleDefaults.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"56328cea6b811f2681a8df461fd9b0a96f8891bcc5aacfe856af8a4f8115b502"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadObjectGroupFirstPage (cyclomatic 24, cognitive 29): loadObjectGroupFirstPage has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7768}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aee7c8b8fe0a79f58145fadfb91d2271a99c306108c91d3242ead12d0f4e48b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTableMenuItems (cyclomatic 24, cognitive 28): getTableMenuItems has cyclomatic complexity 24 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7451764721c131faf8b4af4a06550de74683b32a205e1296b7669fb864b2923b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatStarRocksDdlForDisplay (cyclomatic 24, cognitive 28): formatStarRocksDdlForDisplay has cyclomatic complexity 24 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/starrocksDdlDisplay.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3085195fec2c3f0597da1874ee32f8def40d67ab80e5dc0d3f6db251cb2d463"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 27): (anonymous) has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4660}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1649490251cf111f2d0c443caa3901fb8650c301db2b15653c749085aa4812b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 27): (anonymous) has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6998}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6610aadede5048a7ea887c2bdfb5bdc9ee1dae5d221812e5dd0e54b20191418"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadKeys (cyclomatic 24, cognitive 27): loadKeys has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bd57a09ee75d961a350ea2d73c1536c239b10702768168d80d2ea55ea3fbc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveSource (cyclomatic 24, cognitive 27): saveSource has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectSourceDialog.vue"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"058436e8e657fd23a4a24c66b952b2e763c50b4240cae12b4184a37d75235e09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 24, cognitive 27): start has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/transferStrategy.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"330cc9ad2efe7bf004323328cea0732643c4591b22411da566057f9206125669"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSqlServerHostPort (cyclomatic 24, cognitive 27): parseSqlServerHostPort has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sqlserver/sqlServerHostPort.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b088a863aec5cf06331daad829278efc212bdcdc9546970666b3c160dfcab732"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canEditCellItem (cyclomatic 24, cognitive 26): canEditCellItem has cyclomatic complexity 24 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":5164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64efa5bf284d2b1f819adfa2e686271a8b14c60c6cdcc68db525a17fa4da096"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeydown (cyclomatic 24, cognitive 26): onKeydown has cyclomatic complexity 24 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0b0a4d1b944bfa838c01a3703b431dd2f6cb94f9c11a35ac8fa65acef558c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hydrateRestoredDraftFromDatabase (cyclomatic 24, cognitive 26): hydrateRestoredDraftFromDatabase has cyclomatic complexity 24 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3499e37406d8795c684a57bad34386dd4e4ab7ce90fa8c763aef940d4a0c3d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function focusSearchInAuxiliarySurface (cyclomatic 24, cognitive 25): focusSearchInAuxiliarySurface has cyclomatic complexity 24 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":4709}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f064730c6042c91a6df56bc8c7b1776addfc9c1d549fc8524ee9d6d9c7cdb43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importDirectoryIntoLibrary (cyclomatic 24, cognitive 25): importDirectoryIntoLibrary has cyclomatic complexity 24 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"13644e810d592e16ccdb4dcb9c09a0fad356e2e423d434f2fe4ffb9755a8f86e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resetMqttFields (cyclomatic 24, cognitive 24): resetMqttFields 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd19853687790cbfb3471136338be2db22809e3d176d8813f7bb3317d3295bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmPackageSaveAs (cyclomatic 24, cognitive 23): confirmPackageSaveAs has cyclomatic complexity 24 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c3c5ae8afd14e61c6704d3586a887ed1dc75bb6212ee3c82407847fea209d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resetNacosFields (cyclomatic 24, cognitive 22): resetNacosFields has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"679e4984e379dd9365628fff551b83031f45f874767128f23990737f5ac0a8d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncUserFacingSql (cyclomatic 24, cognitive 22): syncUserFacingSql has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d361f95112c20d89c29a238bc648463c30f789921ed348013fa58a8ed42f00a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPagedSimpleTableChildren (cyclomatic 24, cognitive 22): loadPagedSimpleTableChildren has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1435a19a9aa6b019f0782b9ff725a0e9edec24eeee40f10064916f4bf7e7195"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionUrlCopyFormats (cyclomatic 24, cognitive 21): connectionUrlCopyFormats has cyclomatic complexity 24 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8216eab2d2b9441c9e297d27e84bfe5071a64c004f0e1102252f25b969da39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consulAgentWriteBlockedReason (cyclomatic 24, cognitive 21): consulAgentWriteBlockedReason has cyclomatic complexity 24 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/consul/agentTarget.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d967b287b851dd7477665760a11aab6eb1da9eada295d7d453a67b4ea5f89e25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 21): (anonymous) has cyclomatic complexity 24 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11860}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b051287be71b889bf64b3cc4b51708cb46a572ad48009419a4f8b1e6f87e21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSourceTriggerAction (cyclomatic 24, cognitive 20): runSourceTriggerAction 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5375}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1359ae30193ba47256b18d13941deb759e3f81a2df23a59eff16d7d23e3993"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 18): (anonymous) has cyclomatic complexity 24 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 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":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f768b5d10eb0c2e3b7e4558be72ab23385498ad670d9aec70369bcc9c1ee307"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isMysqlRoutineHeader (cyclomatic 24, cognitive 18): isMysqlRoutineHeader has cyclomatic complexity 24 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 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f2e464dd9978fd62c6ef94f6802bc23ba58d6d0aa5facfa3c3369067b64c1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 17): (anonymous) has cyclomatic complexity 24 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":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"f138425f0d119d03a4fa97d43ebeff94decd776fe9254196398a3cc7b8ce15f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function supportsObjectRename (cyclomatic 24, cognitive 17): supportsObjectRename has cyclomatic complexity 24 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":"apps/desktop/src/lib/table/objectRenameSql.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e7623bbb7f2850f6213bb81ad622ed49aac35d3a7b35cd9909ece4ea925dc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyStatusEvent (cyclomatic 24, cognitive 14): applyStatusEvent has cyclomatic complexity 24 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiGenerationStatus.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e187ddbadf01b169c54f0d10e61a18a158fd6d8cb5220a4bd687a95d0d3e766d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oracleTriggerErrorEditorOffset (cyclomatic 24, cognitive 14): oracleTriggerErrorEditorOffset has cyclomatic complexity 24 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectSourceLoad.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3464efdf09890f5ade396dbcbe44c5c189559bccc9756f0f577225ce53ef1d37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resetConsulFields (cyclomatic 24, cognitive 12): resetConsulFields has cyclomatic complexity 24 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"084b8e5b35c091ebbe4572f6b57e4d4a2ef39d97bbb8d71278b7c5ab3dfe3995"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rewriteUnsafeIntegerTokens (cyclomatic 23, cognitive 60): rewriteUnsafeIntegerTokens has cyclomatic complexity 23 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b2b14157f3b30f3f46baa70971c490f39190592fe1433a78d6ac3a8a407d97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeXuguRoutineDefinition (cyclomatic 23, cognitive 46): tokenizeXuguRoutineDefinition has cyclomatic complexity 23 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"560b7a4c649899eae06dd22076c8a2496fb1aaf3f41c6ac072281402a66ce83c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentSqlLikeLineBlockSpan (cyclomatic 23, cognitive 42): currentSqlLikeLineBlockSpan has cyclomatic complexity 23 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd8122225c811f8eb20961b8d8ba0970f400082e643a23ad75cd72ce0289ef5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sortRedisTreeLevelCooperatively (cyclomatic 23, cognitive 41): sortRedisTreeLevelCooperatively has cyclomatic complexity 23 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyTree.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b34b943347bbde39451e3acdc4d2f4afc4857688d0228cc369af439217f2e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlCteVisibilities (cyclomatic 23, cognitive 41): sqlCteVisibilities has cyclomatic complexity 23 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f8fffb1a16a2922b2a51f77c285436be4a62fdb5840ece52f43fcd45109779"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 23, cognitive 40): start has cyclomatic complexity 23 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"865ebb844f787bf3139efde22030dcd408825dd85107e0d11d8c23681e40c0bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDecorations (cyclomatic 23, cognitive 37): buildDecorations has cyclomatic complexity 23 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8d276e5d6dcddc2bf275b5cb098e0284c0856fdb1334d81429c54b0db87b59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSqlSemanticDiagnostics (cyclomatic 23, cognitive 36): buildSqlSemanticDiagnostics has cyclomatic complexity 23 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d3d579d283cff9a7a50d9303279a1ae045653672c51c182803e5098c40ffa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 35): (anonymous) has cyclomatic complexity 23 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbc474302c9b7f561ee96bb89c2c0156aca12c75c4e0856b2b27476d3b29b74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreTabSwitchViewSnapshot (cyclomatic 23, cognitive 34): restoreTabSwitchViewSnapshot has cyclomatic complexity 23 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":7161}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe7ff83de7c85cb58f4d20bde207ce5d98cea79a164610c4549d34ccd1b52ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareConnectionConfigImport (cyclomatic 23, cognitive 34): prepareConnectionConfigImport has cyclomatic complexity 23 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":"apps/desktop/src/lib/connection/connectionConfigTransfer.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39bd7ef8d3ac85e809420f1cd84fb0b94d1dd595bc2993dd13db6d72304ce0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareDataGridClipboard (cyclomatic 23, cognitive 34): prepareDataGridClipboard has cyclomatic complexity 23 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":"apps/desktop/src/lib/dataGrid/dataGridClipboard.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"164129eeaa8de44af7543f301df02f0e36c9e73108e59342a53eff2a89cf7d10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function format (cyclomatic 23, cognitive 34): format has cyclomatic complexity 23 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":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7bca66ffe102ecd3c4741ae31db46a10be5b45ca7856c4b5d0cd9fb71c375c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadLazyRoot (cyclomatic 23, cognitive 33): loadLazyRoot has cyclomatic complexity 23 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":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"299a195cdce43936540794e934ead62c00ff76c264bef3213d410f9be06fe7bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAtom (cyclomatic 23, cognitive 33): parseAtom has cyclomatic complexity 23 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":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0709d6e1048af06c9d4c93e18b6dd9b69256ccf9c8db536c283318ba1759fb21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchSidebarLabelWithRegex (cyclomatic 23, cognitive 32): matchSidebarLabelWithRegex has cyclomatic complexity 23 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearch.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca32f3df7217cc5ff311947a73da75fca25b907461394f5906db5c89c3d8121d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onFinished (cyclomatic 23, cognitive 31): onFinished has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"380b3ff0a50a2691bb40220ebf3dda4765df7a61cccfe43791de7e519ae1044c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchQuickOpenText (cyclomatic 23, cognitive 31): matchQuickOpenText has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda820fda42e0397290ea1d355d9746c77a73f7c7a8dd2777af1de2487682269"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSolrQuery (cyclomatic 23, cognitive 31): buildSolrQuery has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/solr/solrAdmin.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed70f6037db1850be926d4a0448577eef715c4dcd614d6353b5bc693d7e73109"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDataCompareConfig (cyclomatic 23, cognitive 30): applyDataCompareConfig has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f8cdec4a879f11b9c3e63d3ae85f95d7a23796b5bc74d9352831a38b778062"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadedColumnType (cyclomatic 23, cognitive 30): loadedColumnType has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7cdd34d5eba30c22c375dcfc19a67be37e92728a0e80cdf0a2a4a7a77f8a5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchSidebarObjects (cyclomatic 23, cognitive 30): searchSidebarObjects has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c45ae1fc8534fd52b27ea24f0ed38722061f5f967c9dcabc953fe1a9ac3a80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadUsers (cyclomatic 23, cognitive 29): loadUsers has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ae6cd2fca114e3fe5577ff98911ab27c24208d8f326c22f30f75bc48101f62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveDoc (cyclomatic 23, cognitive 29): saveDoc has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa9f6b3af2f77b3051a4c83f13e2f2462142c168f654a0e77b75099406b5bc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeBrowserTriggerDrops (cyclomatic 23, cognitive 29): executeBrowserTriggerDrops has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3715}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd79fbd47d59c23991266e3792385d8643fa2c5d424574ab41e5d584a81784f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 23, cognitive 28): main has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00fbfc02ed054a152ebf7f0b84c86364ac7f70dcae5d4a5636f5d0bf70cb37f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 28): (anonymous) has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/__tests__/TableStructureEditor.oceanbasePrimaryKey.spec.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"41546c69677852f10b635fdc6d4a0a6f8ccceaa17eb1c8d73d6a5da82272459c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resultRunSourceLabel (cyclomatic 23, cognitive 28): resultRunSourceLabel has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca414b1297b6865d745cae94d0cc6f12aaa32a01695a01162eb8d5cd110fc2e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 28): (anonymous) has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/browser-bridge.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4fad76139872d96a840d772e64629db911c3ba00a6b379fb1c676b28806b87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function translateFieldFilterToElasticsearchQuery (cyclomatic 23, cognitive 27): translateFieldFilterToElasticsearchQuery has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb61ba3b51364ce3437362f8b4e2c0d7b88a72e6b8879af6cc2115b4c47d1fb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 27): (anonymous) has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9eb615246b60433aae4b9657d22507df57621ff2390acd72cc0cf10c12c37e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTableDiagramSvg (cyclomatic 23, cognitive 27): buildTableDiagramSvg has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/diagramSvgExport.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c6a90ea2f42db7399db050b825ddec6de328283b9c2004745eb068eb693ae0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function synchronizeOracleRoutineSelection (cyclomatic 23, cognitive 26): synchronizeOracleRoutineSelection has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fff9bf38d416cc222759c3bf551c66026e63b6f2c4220bfeb924e15e713f036"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 23, cognitive 25): start has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DamengDumpDialog.vue"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1793af5b4f8505319bf2d61773ccdbff4952f0f7084b5220608e94d3b17dc425"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmDrop (cyclomatic 23, cognitive 25): confirmDrop has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3251}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6d495424b3e86a8bada071f402aac1b8235c913228bfd1a393243b9e73df84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fillGroupSubtree (cyclomatic 23, cognitive 25): fillGroupSubtree has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3599f9c9ab3de859a75f7fa3500c245713e1b18ef1e5163f36215b3e699056"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 25): (anonymous) has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/database/oceanbasePrimaryKey.spec.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3fab7c22daa79f7254ac50290612a8fb3dc4a95ffe12e256c28d867f2573c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gen (cyclomatic 23, cognitive 25): gen has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ce84d211616ebea3437ecf4ee29214fbf529de4f0dab7f532ae28930fa17b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeydown (cyclomatic 23, cognitive 24): handleKeydown has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcd39bd6680ed88fc4c91bda181e2db888f6d2d4170842f21f5a86a1048087f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureDataGridSelection (cyclomatic 23, cognitive 24): captureDataGridSelection has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSelectionPersistence.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab80e6a732461442fddcaa47625fa3e6df5cb6b8508feb7774c3da3751b15bab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editOraclePackageOptions (cyclomatic 23, cognitive 24): editOraclePackageOptions has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a37ca3b71d873f79cdc6e4c97335a65ff20a31a7fe6b69981fa1d44184c5a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshData (cyclomatic 23, cognitive 23): refreshData has cyclomatic complexity 23 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":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"220f4fcf341ad70898ae57717ad9620ded0266b00050d73d3bcc1e37f3acafa0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 23): (anonymous) has cyclomatic complexity 23 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":"apps/desktop/src/lib/app/appAppearance.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb895d8202a02a157b850399107ff40503b8734c5ade3cc2fb2ede191da1e4ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePredicate (cyclomatic 23, cognitive 23): parsePredicate has cyclomatic complexity 23 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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef3dddc7f711ab64d4e0c89fcac5d8a75121cb5a89716f74a634de612dc36dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateFilesExecutionTarget (cyclomatic 23, cognitive 23): updateFilesExecutionTarget has cyclomatic complexity 23 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de6fdd00dbb13183f6715ed47face11064169fc995fedffa7d141fcbe088e8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refresh (cyclomatic 23, cognitive 22): refresh has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksAlterStatus.vue"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4606164f859338efc4000b2b508aba439337e346fcf71c4b234ff533a6d736ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeByRulesUnchecked (cyclomatic 23, cognitive 22): routeByRulesUnchecked has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiIntentRouter.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94ed6e60674785468c5b26ca1f622ceaa1262728a5626cd10ba9bdc9582ecac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeSelectStructureForDisplay (cyclomatic 23, cognitive 22): analyzeSelectStructureForDisplay has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b314257c76aed6a5a61bf5adc39e31c443b240f77e455fd1b2bf1d3824e138a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabModeLabel (cyclomatic 23, cognitive 22): tabModeLabel has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34efaf20b92430cef8bc29491630999a74ebdbb8206e6c6721a1da2c2dbe7dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeVariable (cyclomatic 23, cognitive 22): decodeVariable has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58cf804b1878ea3960f9e5af4394881fcca1a1c7f2ef02684bbdcdab4a9f753"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlServerDescriptionParameters (cyclomatic 23, cognitive 21): sqlServerDescriptionParameters has cyclomatic complexity 23 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e57e77c884c5f15991b63aa8ca56bacbb4512aa2648271c0fb60d17770e0ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 21): (anonymous) has cyclomatic complexity 23 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"682872af2e145d4ee680ab3c348de94d0b214179d10fbe5ad1c57a8df3a458e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildConsulExternalConfig (cyclomatic 23, cognitive 20): buildConsulExternalConfig has cyclomatic complexity 23 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cb3fbb35c40e0be12108a9b2460fbef37d713945533f4ae9ca883a7174ec43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 20): (anonymous) has cyclomatic complexity 23 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eb4ffcea75d06bfe9c83744d77c9b0e3e17d1cc86c6a1b1be40180790e8618"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOnlyReconcile (cyclomatic 23, cognitive 20): readOnlyReconcile has cyclomatic complexity 23 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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df5ee54c33600253312ed52252b56de2f6305425a75f234c8ad43a37f564d72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferAiProviderFromConfig (cyclomatic 23, cognitive 18): inferAiProviderFromConfig has cyclomatic complexity 23 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 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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"01107c3b141339c45837f564691d52276589085e704c015cefc40390934e4d4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildHiddenPrimaryKeyPreparation (cyclomatic 23, cognitive 16): buildHiddenPrimaryKeyPreparation has cyclomatic complexity 23 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7695}}}],"partialFingerprints":{"codehealthFindingId/v1":"b849a2479a174867c21fb836e726db55fd9ca41f134e1e17249bf1f002d83531"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshOracleIndexMetadata (cyclomatic 23, cognitive 13): refreshOracleIndexMetadata has cyclomatic complexity 23 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":7027}}}],"partialFingerprints":{"codehealthFindingId/v1":"4037626c09b26b3c459d4c0492dfa34d73666da019be8cc4ae4e327b86406e4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPostgresQuestionMarkOperator (cyclomatic 23, cognitive 11): isPostgresQuestionMarkOperator has cyclomatic complexity 23 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb9f52a0256c2a7cbd1ec3318b40f51236d2626c2ab76306e29de61b7f7a2f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invalidateMetadataCachesForNode (cyclomatic 23, cognitive 9): invalidateMetadataCachesForNode has cyclomatic complexity 23 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cabf1c90f5a9fde056571ec9e25064d053060b4722af7837023a2492bc51ae2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseXmlDocument (cyclomatic 22, cognitive 44): parseXmlDocument has cyclomatic complexity 22 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/xmlFormat.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2118f37e41cfdd0edba2ada463c0a080cae0d023aefc30952d94eb1d75dc02c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseClass (cyclomatic 22, cognitive 41): parseClass has cyclomatic complexity 22 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"17317dc046a5d9b2de2ff8efc471b3326110bc082867e9a571ec569240c93e45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchScanPage (cyclomatic 22, cognitive 36): fetchScanPage has cyclomatic complexity 22 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"6418a9a3e65822dd04e32b1baa9baee42b113d290eb4f2e37b067ec59a62e4d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 35): (anonymous) has cyclomatic complexity 22 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2357a39c3d513c7d2e8d8140d5f9ed04022837291810076cd2fb5a40c5196b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 33): (anonymous) has cyclomatic complexity 22 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":"apps/desktop/src/lib/database/__tests__/oracleIndexes.spec.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f99c3d8c67b7d96402a122cd495b189850bcc61833190b12b2feacba9034e4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeMatchScore (cyclomatic 22, cognitive 33): computeMatchScore has cyclomatic complexity 22 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7095}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a19ac914f6b455f9faef39ace5b96698333b103940ebb5ea1deeaddcf5b2ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annotateQueryResultSources (cyclomatic 22, cognitive 32): annotateQueryResultSources has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"17312e6988b0301a1093e3d67d7c0d51b54639b64c4e1704179f25438d4f830b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshTriggerActionFeedback (cyclomatic 22, cognitive 31): refreshTriggerActionFeedback has cyclomatic complexity 22 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3506}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c0fa7450c5e56d29fb2eb048e7238493b0126a0dc6d1fda1f2f0691a8641ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeGroups (cyclomatic 22, cognitive 30): normalizeGroups has cyclomatic complexity 22 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dc67cf6417501f3a997f85516fcfff27dac4bc0e90c1bf31fcba1d8502f64d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canDropColumnAt (cyclomatic 22, cognitive 29): canDropColumnAt has cyclomatic complexity 22 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":5124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c44fe4d17ef342b279a0b702076039d99d7efcfe5667ca00395166e48388c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openConnectionQuery (cyclomatic 22, cognitive 28): openConnectionQuery has cyclomatic complexity 22 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":"apps/desktop/src/App.vue"},"region":{"startLine":3517}}}],"partialFingerprints":{"codehealthFindingId/v1":"5123c5051aed976d5c5d2efd42d62b267fd60c14c080ebf352cc0cf562a67e00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBrowserTriggerAction (cyclomatic 22, cognitive 28): runBrowserTriggerAction has cyclomatic complexity 22 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5483}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc556fc8711c7fd9f6a2a7acc9906aef8d5cac2964a5d9ea715574ceadd7608"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startExport (cyclomatic 22, cognitive 27): startExport has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b10a2281b2508655ca6eeba39fb3f7cd81194fa6c0b8ee0839bdfe65351ebc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveMemberEdit (cyclomatic 22, cognitive 27): saveMemberEdit has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae63c8fb77a1dbf2b886defaee020026a77f41a8cfdc270e987dd4867f1a3a0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 27): (anonymous) has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oceanbaseSessionDiagnostics.spec.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03f13443b69d779b0545e1931c7702557b8afad092a14511297a70b6ed98b51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveConfig (cyclomatic 22, cognitive 26): saveConfig has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c84b3bd1dea35d0458bf4af71f4e66d3b4198fce27eeed0e0c81361fc2228b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmBatchDropTables (cyclomatic 22, cognitive 25): confirmBatchDropTables has cyclomatic complexity 22 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3838}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8a21d3d421bf01cb25b6b438e9020224cf59392e2f4b6ecbf19e42bda7d24c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveSource (cyclomatic 22, cognitive 25): saveSource has cyclomatic complexity 22 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c95108a8dc6c53c969896b3ccb5d23b4b4cea6d7d9320caefdd2c2853b0918e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function performInstall (cyclomatic 22, cognitive 25): performInstall has cyclomatic complexity 22 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"634a051a459eb843b57475ca4d2f3e36dfb87d7d7a72a888860d55ca86c01b42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oracleStorageClauseEnd (cyclomatic 22, cognitive 25): oracleStorageClauseEnd has cyclomatic complexity 22 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f1ccae636d0d5cb262338212f6b83f608c0ca0122d8ccf88c409f8fa5cf255"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleInstallBeacon (cyclomatic 22, cognitive 25): handleInstallBeacon has cyclomatic complexity 22 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"00da8f4f21cf95d58363a92891e37c5dc6b9d046667d5f6c868ae0d74628da5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPrincipals (cyclomatic 22, cognitive 24): loadPrincipals has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4c5f320c5c8d380fce3eb729f6483753c82e9840173c60f9d4fc24297f97ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provideGraphCompletions (cyclomatic 22, cognitive 24): provideGraphCompletions has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d25d50d5a3165516cac8e2320cacb072b8e270ede85be8e2ab58ae6495ae38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatCell (cyclomatic 22, cognitive 24): formatCell has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8540}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9d4ba9b169d63e806dc22c8adfd63f9c9714432a0d0145246c6b620b9b5677"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRowClickAction (cyclomatic 22, cognitive 24): runRowClickAction has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75eb7bc81fe6d4501d5a83f75fad817ba908e569f14c909ffa01901c81b0533"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreDataGridSelection (cyclomatic 22, cognitive 24): restoreDataGridSelection has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSelectionPersistence.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4793b3bff4e9cc81100d41bd025cbb3afece547d2ef099c9d823d9c0f92aa68d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoDocumentInputValue (cyclomatic 22, cognitive 24): parseMongoDocumentInputValue has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5533bc8e33750494f4eae2dff4de937605963d553abae3449b52df8c8aa5391"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDeployTxResult (cyclomatic 22, cognitive 24): buildDeployTxResult has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/deployTxResult.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85f902e27098258463a3da4f2b70267c52c69b85e5aff0955c58c51cd25ebc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function treeNodeRowAction (cyclomatic 22, cognitive 24): treeNodeRowAction has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b692cd77ebaf4505f9c47197d419142f5744b74550d05dc68504c46c14be25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 24): (anonymous) has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"a716e64f7070ec080011dce04177e96b351a01ef42842c87958bc0eb85cf0c00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provideMongoCompletions (cyclomatic 22, cognitive 23): provideMongoCompletions has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09ce623c25ddf37ffe1d1ff5bafbe2d8a20cc3b57a524e234b3ca623cab2af8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 23): (anonymous) has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":10245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dff5c7ab0a377001ae1fadabae5ef4f03e962e55529102df319af6974e47d93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateInsertStatements (cyclomatic 22, cognitive 23): generateInsertStatements has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bc7c7afb9dd9c43eed1d341b67594ee17d87dc90f569b4cf0484585e38ea36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 23): (anonymous) has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e010f522de1525376027830d43c658b445693159df76a7ac3a08da766defdbdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cancelTask (cyclomatic 22, cognitive 23): cancelTask has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"61808dc19a8d9bbb1724a45de423f2f2938a2a30e466f75532f47edecacf4610"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureSample (cyclomatic 22, cognitive 23): captureSample has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"251e59a06e7e535518613a89f10ab62a2e5e5b76e5ed3e6199fe4dc6b27029af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeValue (cyclomatic 22, cognitive 23): sanitizeValue has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabUiState.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe7bcaa58131eb2fff29cb27101726a880cda8ea70682d83ab8f3018f419f9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectActiveTabSidebarNode (cyclomatic 22, cognitive 22): selectActiveTabSidebarNode has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd5d9cb419dbe1ff2b5fcf943c72800964a8458287bed12fdd448c0598f3753"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 21): (anonymous) has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ec0cad536615c931a2a5287e66d3ad53ef9382b99daafbb503c53be6ec6c40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentAiEditConfig (cyclomatic 22, cognitive 21): currentAiEditConfig has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42ebb5ef899270d05843c25ede8b970313d5d759b6b6af8e6131078cdbd7c19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openObjectSourceDialog (cyclomatic 22, cognitive 21): openObjectSourceDialog has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9d6200e7ca3ea6d77176e3930abeb42b8d730d7460178eeb02c1eaf532de6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareUniqueTargetIndex (cyclomatic 22, cognitive 21): prepareUniqueTargetIndex has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"9012c8fc7c8ba4b20c1bb3b8a35c02f6d8a1c39c078151f8d240ddeaeca8b59a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function disconnect (cyclomatic 22, cognitive 21): disconnect has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5809}}}],"partialFingerprints":{"codehealthFindingId/v1":"595d593f6dc62f4b0c97a2222760b56214386187ac82ed51dd2b3960b9150c14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshPreview (cyclomatic 22, cognitive 20): refreshPreview has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/StarRocksLayoutCopyDialog.vue"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"140a2d65a41e4243e97733f7b8a99c40948a39013d30d22b1b5ac533aea5cc0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 20): (anonymous) has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2853}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e63dca503ad8b3d4fad15e593812a878d335c9c6f395fba129b0ad968c6239"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eventToShortcut (cyclomatic 22, cognitive 20): eventToShortcut has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f58bb72f3b8bdb92aa549d5984af677d0583d73c789f609bdee39a0327b8a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadAllRowsAndGoToLast (cyclomatic 22, cognitive 19): loadAllRowsAndGoToLast has cyclomatic complexity 22 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":4349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4719f9eb69edfa1233dade9fd9ff1b8a3353cca1c2390d9c1df9efa57f7136b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 19): (anonymous) has cyclomatic complexity 22 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4cc9f2c653c4995bd50390f8ff059f863aa45bc895c9e94a79d773f156a886"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPagedObjectGroupChildren (cyclomatic 22, cognitive 19): loadPagedObjectGroupChildren has cyclomatic complexity 22 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"643dee6dbfa2b7249f09b066bebabc4cb22b566f4516796350218b5f3dcb3dc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function orderSidebarTreeChildrenForParent (cyclomatic 22, cognitive 18): orderSidebarTreeChildrenForParent has cyclomatic complexity 22 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 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":"apps/desktop/src/lib/sidebar/sidebarNodeOrdering.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bedfb52aee329b035c9475a4ac6115e1c41dbc6a6f27038e4f406b49e3eb3b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOracleForeignKeySourceSnapshot (cyclomatic 22, cognitive 16): readOracleForeignKeySourceSnapshot has cyclomatic complexity 22 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf2aca688c97f2f625999a9b070d869207d6664798164bfc6e5a91ad2fafcc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesModifierOnlyShortcut (cyclomatic 22, cognitive 12): matchesModifierOnlyShortcut has cyclomatic complexity 22 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4376cc24b62b1772c7676e2d1ebaf696326eea88408df36c850cc5c25f2aa6cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 44): (anonymous) has cyclomatic complexity 21 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9562}}}],"partialFingerprints":{"codehealthFindingId/v1":"519efa8b15ba90780f8975d90d3a66dc580be8a2e34e187b3e2631915c281d61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectionHasEditableCells (cyclomatic 21, cognitive 39): selectionHasEditableCells has cyclomatic complexity 21 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11088}}}],"partialFingerprints":{"codehealthFindingId/v1":"affdac6115ce362315b602d8170e4e65bb4b9d5dbc3b1c28fefe3129aedfa483"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectScopeVariables (cyclomatic 21, cognitive 39): collectScopeVariables has cyclomatic complexity 21 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dc12152b722bdd560243b87c65be438ec7a89650f4dcada0537f061ae0d3e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refresh (cyclomatic 21, cognitive 38): refresh has cyclomatic complexity 21 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSessionDiagnostics.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5514fa513fa952ab091b979ab0dad4b9a9a4737c1a79d924e216a505b716e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseConnectionParameters (cyclomatic 21, cognitive 35): parseConnectionParameters has cyclomatic complexity 21 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionParameterDocument.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37083ae4b27038d79d3785663a0aefeb2ae6f20f25d71b624cd8c8083fa6ebe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redisDeleteKeysPreview (cyclomatic 21, cognitive 35): redisDeleteKeysPreview has cyclomatic complexity 21 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fa34bcfb52f278077f4c9e13ea2cf9be3aee3de8130bd204626fdc24fde2b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMqAdminConfig (cyclomatic 21, cognitive 33): buildMqAdminConfig has cyclomatic complexity 21 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ab9b4dbbb288688fb7bb7480c52a9b9d76772d8059b3b6299525d307b3d680"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandKeySpecs (cyclomatic 21, cognitive 33): commandKeySpecs has cyclomatic complexity 21 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":"apps/desktop/src/lib/redis/redisCommandDocs.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b4ff6ce2c24d293448542f2534df52c12fb0a1d84e782ef50821d294f231b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 32): (anonymous) has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/__tests__/BreakpointsPanel.public.spec.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"18949f444d84635a7c5535e948e91f1b449faa1e1502bd0e6d6370abb3443a1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseColumnLine (cyclomatic 21, cognitive 32): parseColumnLine has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"58280a55f1c1618f974e5e7b7bc961e6a7bcd59631cc90c36a4996820c5678b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasUnclosedMongoDelimiters (cyclomatic 21, cognitive 32): hasUnclosedMongoDelimiters has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"64242582302c6f9d1d6683b066cd5e743d03db640e173eef26ccb5ba631e1325"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function identifierMatchScore (cyclomatic 21, cognitive 31): identifierMatchScore has cyclomatic complexity 21 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/identifierSearch.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e80f20f27e270402274a4114707e715f25b3f2b42b76667f59afcc679316996"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeMysqlRoutineSql (cyclomatic 21, cognitive 31): tokenizeMysqlRoutineSql has cyclomatic complexity 21 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a35ec2bcb939347cb7c5bd18f3abbd445b61c2f7b816352bacba7345e5fec85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelSqlTokens (cyclomatic 21, cognitive 31): topLevelSqlTokens has cyclomatic complexity 21 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlServerQueryWrapping.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"86799d26de038cc2f40e18a0d3488b3a4a42ba1e3c8118b3615a7666a3027902"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readStringLiteral (cyclomatic 21, cognitive 31): readStringLiteral has cyclomatic complexity 21 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlSourcePaste.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a721e96fe4caa8b369375d67fe7e727e310a30da9c7539186528ab81a2eacb18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchTableDataForExport (cyclomatic 21, cognitive 31): fetchTableDataForExport has cyclomatic complexity 21 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableDataExport.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba21d334476bc4db78a4d2f2f2f3796a7576174954646e8b793ce0ce95cbfdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeOracleIndexDraftsAfterRefresh (cyclomatic 21, cognitive 30): mergeOracleIndexDraftsAfterRefresh has cyclomatic complexity 21 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":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c1e6a4449800a138a9a11f0234eb1a3482a0b85e773bf4d530bb863b5a0b9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fieldItems (cyclomatic 21, cognitive 30): fieldItems has cyclomatic complexity 21 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":"apps/desktop/src/lib/soql/soqlCompletion.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45c76355837b8e9281f1382b50e1521cf229fb9a66d1131ff3b08dd037ec11b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onSearchKeydown (cyclomatic 21, cognitive 29): onSearchKeydown has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3d790dd3ed8dcec28b67ef218beb6cd82c2d8231c918361a7a33969d2898ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDamengPlanLine (cyclomatic 21, cognitive 29): parseDamengPlanLine has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bf8dd286ac29d19ea7ca59bfc0b4f76b445c3bcc8db71b96e11f2185509b6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLargeValueSnapshot (cyclomatic 21, cognitive 28): readLargeValueSnapshot has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/largeValueSnapshot.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dfc617029c9f9d5c3a1f4ccd4739ae3a1b2516b232d4d2ed412f75a329ed71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDiagram (cyclomatic 21, cognitive 27): loadDiagram has cyclomatic complexity 21 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26032c68327f0f7bc2e39ba30e77e5ac57749b691d206deccadcfacb439bc27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 27): (anonymous) has cyclomatic complexity 21 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/__tests__/TableStructureEditor.oracleConstraints.spec.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd5915bb51dab8645bb87763bc84dc5f68f2decc3f0d4370a43b4cc69f8409c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeConditionalUpdate (cyclomatic 21, cognitive 27): executeConditionalUpdate has cyclomatic complexity 21 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1d89cca00b8b24413362665419f18ee5007186f5924672a0ddd81ae10538f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 21, cognitive 26): save has cyclomatic complexity 21 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugResultValue.vue"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5134d7cf5aa1abc92184064c0a7c38dc6556150fcb50dfb14da9ba1a5c5630c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureColumnsForTable (cyclomatic 21, cognitive 25): ensureColumnsForTable has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e931b3694037b5a7c4065c99f1a1520364655d2de01b86e571db68484d92ddb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeJavaSerializedValue (cyclomatic 21, cognitive 25): normalizeJavaSerializedValue has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/codec/javaSerialized.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"336939679c7f5de4f0f9f3435154df35311f512c365a30681097eb78a1a222c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyBinding (cyclomatic 21, cognitive 24): verifyBinding has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a3103b20c79e641c7e6e9522125b408487fb98d9cbc0fc4aa0a077784582cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareSiblingItems (cyclomatic 21, cognitive 24): compareSiblingItems has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlTreeRows.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8f589589c7810eb32d48739b8f6da1d5449dff5621f6e7f9fb0ed240d9fea1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyDisplayPathForTreeNode (cyclomatic 21, cognitive 24): copyDisplayPathForTreeNode has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40f920791544051a733c002aafdece2126aea91d51dac71ecc6eaa365c24540"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readMongoRegexLiteral (cyclomatic 21, cognitive 24): readMongoRegexLiteral has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99f378a9f8cc3bbf399d46bdc44bb1c64c8cecdff89caae41464d1254f2ee5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadLineage (cyclomatic 21, cognitive 23): loadLineage has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/lineage/FieldLineageDialog.vue"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f01734589d58449ef3d74eafdf3e49b8f8937a7c5e7f63ad30f6424969850c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startSearch (cyclomatic 21, cognitive 23): startSearch has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1a246ac4863c9da66a3d15b54f9da206359c6f424e0b8aa5beedcdf2563b6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isUnloadedTypeFilterContainer (cyclomatic 21, cognitive 23): isUnloadedTypeFilterContainer has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1b23195d3740f9bee32492c33e47f5c1d73d05163fa09b9f746959f78a5dea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryReadQuotedSubstitutionPlaceholder (cyclomatic 21, cognitive 23): tryReadQuotedSubstitutionPlaceholder has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce48a9e22a58e1c32a90a910e035c9d9a6b7b8b1c981c7e5e5585f28d98b4b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendProposalReply (cyclomatic 21, cognitive 22): sendProposalReply has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"852e2e1eb8773e9d046181ed7c065c6a62a80d3d91262baef9eea83fa8eea1dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectConversation (cyclomatic 21, cognitive 22): selectConversation has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":5890}}}],"partialFingerprints":{"codehealthFindingId/v1":"921b5a0974d5379ab1147132d708a9ca15df53b3937c12f60bc2d47e68a1200c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDangerOperation (cyclomatic 21, cognitive 22): runDangerOperation has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTableMutationRuntime.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b62c7e3183ea124fddd255eeb548f9759e770b74b604b9e2e0eb5f6e1dbe937"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSubstitutionParameterOccurrence (cyclomatic 21, cognitive 22): readSubstitutionParameterOccurrence has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9720095d2a6bd5a6f19bd87855bc082ceac58a576be21b3b9befa330139cda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTables (cyclomatic 21, cognitive 22): loadTables has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7588}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ec0323d82b8eb817ebb492f5f351853ae429594f59ddc026c00dda8d6f4b37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatNumber (cyclomatic 21, cognitive 21): formatNumber has cyclomatic complexity 21 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":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bf7c6c139b9791ee36de69ae66373c47cc6794c591e994bc2ce3121d0bc953"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 21): (anonymous) has cyclomatic complexity 21 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":"apps/desktop/src/lib/sidebar/sidebarGlobalSearchIndex.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"350a86142c5b979acf6509935f1f51cf0a331acf05b7469bf5f75ddeba26a9bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 21): (anonymous) has cyclomatic complexity 21 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7526}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb6de996a4495a69718b92d9c9a23ed8235080aa5d0152c98cd66d457a2519c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmCancel (cyclomatic 21, cognitive 20): confirmCancel has cyclomatic complexity 21 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":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4b3246a8bc0ec03e374acf766b2772e47990dcd716aba0e13d84285d27a9c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 20): (anonymous) has cyclomatic complexity 21 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":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc27dabc1de4709147e946cfdb10dc1f095f2810d70931edf2dc41c012025ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSavedDatabaseExportOptions (cyclomatic 21, cognitive 20): loadSavedDatabaseExportOptions has cyclomatic complexity 21 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":"apps/desktop/src/lib/export/databaseExportOptions.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"709e7657727d97ad658aa631a372cd5e123659042f090b4157dd20df3b948adb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectLayoutAnomalies (cyclomatic 21, cognitive 20): detectLayoutAnomalies has cyclomatic complexity 21 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":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c5f9d2e9ed9ddb3c5aa87da9706357935e2f423799e8a8257bc4bd998d8a03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function starRocksDefaultPresets (cyclomatic 21, cognitive 20): starRocksDefaultPresets has cyclomatic complexity 21 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":"apps/desktop/src/lib/table/columnDefaultPresets.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dad217aa6bc273e6e8895e7cfc04a16f3d13e2ce3144c66703c868122b077e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitServiceEditor (cyclomatic 21, cognitive 19): submitServiceEditor has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c98190b1ed6e4cc5f2299751c3d65453267bc13585812e20c6b45134717d9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mongodbAuthFailureHint (cyclomatic 21, cognitive 19): mongodbAuthFailureHint has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoConnectionOptions.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e62c0da2630cfcee090f390851711e5269aebf65e47049c9b0e3ef45080159"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldAutoOpenSqlCompletion (cyclomatic 21, cognitive 19): shouldAutoOpenSqlCompletion has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3816b484f367f4e6ff761dd7a96eabeae23167b376c9f517116c8e845d73de9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeAiConfig (cyclomatic 21, cognitive 19): normalizeAiConfig has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3e1326e95a8304b1059f15f13cf5710e42e48201df65c004aeec6f79954b6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileExactTrigger (cyclomatic 21, cognitive 18): compileExactTrigger has cyclomatic complexity 21 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 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":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a0740eb66504649e3070110887a7e08a2071990bbbe8cc32019a2169c84868"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 18): (anonymous) has cyclomatic complexity 21 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 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":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"737322de65f3b6cea6427acb4fb9172372d06a4ddf1d7b640c8d0669da187c0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmPackageSaveAs (cyclomatic 21, cognitive 18): confirmPackageSaveAs has cyclomatic complexity 21 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 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4552}}}],"partialFingerprints":{"codehealthFindingId/v1":"585be3f195adc37215b92fac8a04e48f31f7d3dd2ed84f7be5c179d9eb92fa92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeDatabaseBackupSchedule (cyclomatic 21, cognitive 18): normalizeDatabaseBackupSchedule has cyclomatic complexity 21 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 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":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"657486ea8e204877b8df1b5effe6e134b365204ae715c8cc270bc65fa6cdadea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeMcpGlobalPolicy (cyclomatic 21, cognitive 18): normalizeMcpGlobalPolicy has cyclomatic complexity 21 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 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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3c4bba622068efeb8991605b20d803eb95b95469667cafa6125e0af50a4487"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reloadConnectionDatabaseChildren (cyclomatic 21, cognitive 17): reloadConnectionDatabaseChildren has cyclomatic complexity 21 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5417}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a5e76835a0559a2b10db59ccc4e06eabe36b66262679615e30fafc175f5e1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchPage (cyclomatic 21, cognitive 17): fetchPage has cyclomatic complexity 21 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9732}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ba91f7dbc5e32e5c4fb02e1335b74e26758ab8da59eb1a8849de6e5566db9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectConfig (cyclomatic 21, cognitive 16): selectConfig has cyclomatic complexity 21 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fe0d383b405d4f8c0d1676ef4fab6a2de2743adf3f7917909d09f6fdae51f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePackageSaveAsDrafts (cyclomatic 21, cognitive 16): validatePackageSaveAsDrafts has cyclomatic complexity 21 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45394d8751b118c86d323a9569b3494d31fbf542157641b4bdbeebabb09c336"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 15): (anonymous) has cyclomatic complexity 21 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9447}}}],"partialFingerprints":{"codehealthFindingId/v1":"b487656677a983b4c6f0224378110f8696a9062919316708be81c0b429fa46fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function samePhysicalTrigger (cyclomatic 21, cognitive 15): samePhysicalTrigger has cyclomatic complexity 21 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":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc14b5a2b0d4f16da07da1c804f455a563b90f886f54ea25c16c5154364ef07d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeydown (cyclomatic 21, cognitive 15): handleKeydown has cyclomatic complexity 21 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":"apps/desktop/src/lib/editor/modifierDoubleTapShortcut.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f3120b1b7556a102fa263c1ca1fccd2f861e2399c3335842dd8e18c69850b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unescapeLiteralContent (cyclomatic 21, cognitive 15): unescapeLiteralContent has cyclomatic complexity 21 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":"apps/desktop/src/lib/sql/sqlSourcePaste.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84d45f3883f8a356873f709e0a0c543d3ef7f3adf985dafb8fe117eb0576dc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sidebarMenuActionGroup (cyclomatic 21, cognitive 14): sidebarMenuActionGroup has cyclomatic complexity 21 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarMenuLayout.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"40280390c9a2ebe3f0c00096d7d1ca6c36d3073fdb99cb67d5ef5bc1f99d32e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeyup (cyclomatic 21, cognitive 12): handleKeyup has cyclomatic complexity 21 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/modifierDoubleTapShortcut.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cdd177d79f8a153d9b1eb00e46af1bb77e891eb8b3002948cceb3972b1272f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initDdlEditor (cyclomatic 21, cognitive 11): initDdlEditor has cyclomatic complexity 21 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aa5ac567945dc25890ce2d1d852df1c0f3cb7a5c48667d23b145d369c3ba4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesPendingTransferInput (cyclomatic 21, cognitive 11): matchesPendingTransferInput has cyclomatic complexity 21 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc71bb129479d4a313dd62f2f82f26a54e98096890e04192f77c9ee3032271e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeColumnHighlightMatchKeys (cyclomatic 20, cognitive 49): computeColumnHighlightMatchKeys has cyclomatic complexity 20 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc7296c1082c9f8bdbf2b9e8b4f114567f9b96c2279c1989cdb573f1e90f803"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 20, cognitive 48): project has cyclomatic complexity 20 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyGroupIndex.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"320cf1dcf14bea6a0d78585988418b46713d44a645fc56cb0a5e37c65a462980"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maskSqlForStructureScan (cyclomatic 20, cognitive 42): maskSqlForStructureScan has cyclomatic complexity 20 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0f40e7bb63d6ba734d8f84560302ee17910704df9398ebeee31507b30c8088"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshNodes (cyclomatic 20, cognitive 41): refreshNodes has cyclomatic complexity 20 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff544eb2a7996be58ddb74cf545bbc1b7f692072a405d822d651849d7c64e1d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postgresDatabaseAuthorizationSteps (cyclomatic 20, cognitive 39): postgresDatabaseAuthorizationSteps has cyclomatic complexity 20 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"732e42d12edc9a20f1009617f0eb92e8b1bf46c84ff00db390db7063b66bf54c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawGroups (cyclomatic 20, cognitive 37): drawGroups has cyclomatic complexity 20 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb84ca0c729233f8104924f9273cde05746875789ceae2864abe2a8764a463f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fillSelectionWithValue (cyclomatic 20, cognitive 36): fillSelectionWithValue has cyclomatic complexity 20 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11042}}}],"partialFingerprints":{"codehealthFindingId/v1":"f946ef7650244fc9973b9d8a4a7c0bab058a14d6c1c36adde7ae42627c757a56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 20, cognitive 36): restore has cyclomatic complexity 20 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18c4beb545cf77d13bba3f6daac2ca137fd0b60beff7b10a1912e3fddcc7caa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 35): (anonymous) has cyclomatic complexity 20 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useComponentUpdates.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71f22fd06e9473a86321686da84d81571afd29a681ed3ac13ee6a90bbddd67e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeRedisLine (cyclomatic 20, cognitive 35): tokenizeRedisLine has cyclomatic complexity 20 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandTokenizer.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56fd97d67facbea610c730a2cd85393a0ba9015ed4b972f5c0cc396ee463a3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 20, cognitive 35): run has cyclomatic complexity 20 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/tableCopyTaskStore.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"860b46c154662492ae5785402cb8472913547cc29f7203365f34d309f72522ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseXuguExplainText (cyclomatic 20, cognitive 33): parseXuguExplainText has cyclomatic complexity 20 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":"apps/desktop/src/lib/diagram/xuguExplainPlan.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b0661ea867a61f8ae0e40183b91138651182176ab877ae2953bf51a2c8167e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripSqlComments (cyclomatic 20, cognitive 33): stripSqlComments has cyclomatic complexity 20 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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"523dd98d1e6311320c2ba7c68473cdb58cf88720672716e8beb0c4f8b6222385"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildExtractorContextItems (cyclomatic 20, cognitive 32): buildExtractorContextItems has cyclomatic complexity 20 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":15014}}}],"partialFingerprints":{"codehealthFindingId/v1":"316897283eca9fd9737e11f83d782919dc5bd572f9b793cd177fc5315a278ca1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mongoCommentAwareBodyEnd (cyclomatic 20, cognitive 32): mongoCommentAwareBodyEnd has cyclomatic complexity 20 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0d3560098b04775e2f7de1d889942e5fe4425e6fcc65143e860090ae694685"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findTopLevelKeyword (cyclomatic 20, cognitive 32): findTopLevelKeyword has cyclomatic complexity 20 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8525648bf6a964e0f07926afc43d8b4140c0d5e5f9c96ec35fa3d9971f8161"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectDeclarations (cyclomatic 20, cognitive 32): collectDeclarations has cyclomatic complexity 20 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96c650443621458bd709257ae80f2689cbd7b35271936ea2e2fc57629d55b21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeydown (cyclomatic 20, cognitive 31): handleKeydown has cyclomatic complexity 20 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/searchable-select/SearchableSelect.vue"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4578bce0dc91deda6cd37609cb1c3e0950b52bf9dfd5a13a9e12311e55e49818"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOracleExplainText (cyclomatic 20, cognitive 31): parseOracleExplainText has cyclomatic complexity 20 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eecf12f7223f56ef5c74ae43fdfb34ec518fb6ddf14e274b4684a6870326034"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBatchQualifyActions (cyclomatic 20, cognitive 31): buildBatchQualifyActions has cyclomatic complexity 20 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef3d759019b675c3df5410a3b387b779318076d50df387962ee734bb5e10058"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadRoutineList (cyclomatic 20, cognitive 29): loadRoutineList has cyclomatic complexity 20 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e855ca068e35f0ee17c3dba3165c50a4059267a0580f0559d9aef0c383b31a03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 29): (anonymous) has cyclomatic complexity 20 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"157382988f15c78c4859b3541885c737998e12a8ae780f1b91780cf813a7758a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOceanbaseCachedPlan (cyclomatic 20, cognitive 29): parseOceanbaseCachedPlan has cyclomatic complexity 20 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ea5d9ddacde3644890473808af02b6b683b715359145932c7614a87be96696"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestDatabaseTables (cyclomatic 20, cognitive 26): requestDatabaseTables has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDatabaseTableEmpty.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eafc3ab960fec2beeed221187d332fb4cafed696eeb44cc77f622c725f540e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 20, cognitive 26): onmessage has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/ui/App.vue"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef26f324869cb33b5c5e2f9c52e0b4be5827a194377450861bdddbba6d6a117"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyBatchColumnSelection (cyclomatic 20, cognitive 25): applyBatchColumnSelection has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"194d417efa72519bccd156f31466f9cfad1f25da3d120909627899953b8bf0a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadStructurePreview (cyclomatic 20, cognitive 25): loadStructurePreview has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d228501db2e540752ddc22ef3f392abf0bed14903afef845e613fe2d13b58b06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function damengChildChanges (cyclomatic 20, cognitive 25): damengChildChanges has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5421485fdf31d79d18e513a61c9ef5f3addbc0dcdf0fda96a3fcf5080c88af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changeActiveConnection (cyclomatic 20, cognitive 24): changeActiveConnection has cyclomatic complexity 20 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":"apps/desktop/src/App.vue"},"region":{"startLine":3754}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2770e7200ee68fee1f6890a800b26cbcc8d5fadc48346c9450415a8910b815"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTables (cyclomatic 20, cognitive 24): loadTables has cyclomatic complexity 20 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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64771b47dd4cf0fd2c10fb4dc3dc9b9bf21958743713d764f4da7d068d92946"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareDataGridValues (cyclomatic 20, cognitive 24): compareDataGridValues has cyclomatic complexity 20 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":"apps/desktop/src/lib/dataGrid/dataGridSort.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0530bd487b8c218e37b9c1d47e5ffb1423c53ce0ac95e07720f8a8b001068c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function databaseAuthorizationsFromTableGrants (cyclomatic 20, cognitive 24): databaseAuthorizationsFromTableGrants has cyclomatic complexity 20 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":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c38b57732f1ccc35137f0b2ed9600add54184440ee20af842aee6877b6590d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleForeignKeyCreatePlan (cyclomatic 20, cognitive 24): prepareOracleForeignKeyCreatePlan has cyclomatic complexity 20 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":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6d2fba1d6cc24937ddba3f73f1541177d43a7f472b1717dac7c7fad7e83d41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateConnectionDatabaseInfo (cyclomatic 20, cognitive 24): updateConnectionDatabaseInfo has cyclomatic complexity 20 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5065}}}],"partialFingerprints":{"codehealthFindingId/v1":"1458b5d0a24ab1044bc9de93ba5fc7afd3afe56bff560067a32a5ed018124877"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRestoredOpenTabs (cyclomatic 20, cognitive 24): applyRestoredOpenTabs has cyclomatic complexity 20 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2806}}}],"partialFingerprints":{"codehealthFindingId/v1":"57427fea4b975fea221829ecbaa667b7c46f42544a397ac09f2eb974271fffba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSelectedMember (cyclomatic 20, cognitive 23): resolveSelectedMember has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fa379caf78d8e8e1ba19892ae97ec20cae52c80252559f595e6d2edafda04d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openObjectBrowser (cyclomatic 20, cognitive 23): openObjectBrowser has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcab1330b7d400b987ab300664f2cd5d3d63cf3a394dcfed2d094aaa4493fc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 23): (anonymous) has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"344bdf3b9382ffb6f44f9fdecc146f9620ca6ec9bcd32cb7572551aaefa6bcb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agentDriverInstallKey (cyclomatic 20, cognitive 23): agentDriverInstallKey has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/agentDriverInstallHint.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34002ec40a35b1415b24d02c40f377e28332a28144306217126e1c3bbe16ec3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 23): (anonymous) has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleConstraints.spec.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f3629810229a361cff2a3f4d83845e84af18701074192165ac7b6d89297a04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 23): (anonymous) has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b909fcddfd047b714cd5a820f8dce6b5f891cf2f3391cdef2cbe98e2a18ec73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOracleForeignKeyReference (cyclomatic 20, cognitive 23): validateOracleForeignKeyReference has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"5904c4e59baae608ea84533aae8b36b3a9829cb9cc7c302569b45a5f0a9ec4c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyJsonSchema (cyclomatic 20, cognitive 23): classifyJsonSchema has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce664a0dfdea4ae4345a12de9bb7875c1e1c7c92013bb6f4957fa6b7313c7b73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function comparisonToFilter (cyclomatic 20, cognitive 23): comparisonToFilter has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfbfbec0dfcbcb4917ff330751ed56cae2c94f01234d935b585bb027ec0c596"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseXuguRoutineParameter (cyclomatic 20, cognitive 23): parseXuguRoutineParameter has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c449ebbaabd092f79cf9854111caaeeff1f42a5205daa14744aabe8a634fff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 22): (anonymous) has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c40267e6850c7af4d8cf3ebbfe7dda0f76c31d414f9a09dca89cc59c9a8020f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportSubmenu (cyclomatic 20, cognitive 22): exportSubmenu has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":15113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d650f709333a40dd49e4043cc4a1cc22e34d257f3f92e6382ddb7e8a47813009"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 22): (anonymous) has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceffed2fb426b96c1e79fa677465ea6afbd4ba7b7262785d844a721f73436392"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 22): (anonymous) has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellValueGeneration.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c106d943f57a46a4d26f42853798f5c013a1d27838e2cc3e3aecee8fe1ae9ee7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoFindCommand (cyclomatic 20, cognitive 22): parseMongoFindCommand has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aa2418e20793396830a2909c6c114b7b559f62be111d5a011dafa29803c149"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTableSourceAt (cyclomatic 20, cognitive 22): parseTableSourceAt has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b8ccc2f385034c7303754481f9b1342e1980b7776a9c1e83b6c51f18d492e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportMergedRows (cyclomatic 20, cognitive 21): exportMergedRows has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiSourceMergeView.vue"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd258ecd34a28eb53a7eb037dc999b7969f818757fb9d3af9416b643f17df5c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareSaveBaseline (cyclomatic 20, cognitive 21): prepareSaveBaseline has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ee961a9a660186cf7942e22da77cd0341a371bb904863fb5ceadba26c7208b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function areCellValuesEqual (cyclomatic 20, cognitive 21): areCellValuesEqual has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnVisibility.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"697e835ecc2784ddc6c5abfd30c99c86aae8c34a038414be907642a580bd4767"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oraclePrivilegeSql (cyclomatic 20, cognitive 21): oraclePrivilegeSql has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleUserAdmin.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ee354728ec95ea7b6e5ff74748b09f8f0737440f1a1816d3015be6ab1d2b1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleResetCursor (cyclomatic 20, cognitive 20): handleResetCursor has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2681ae4a84c1aad23866fc79c58518c8a2e43cb905c3ea393eb46f0b0b5ead"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendScanResult (cyclomatic 20, cognitive 20): appendScanResult has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0659f7c0e9047ec8e5540a68f7ed723085ceaae323410d5c1da78babc68e3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportMemoryResultSheetsXlsx (cyclomatic 20, cognitive 20): exportMemoryResultSheetsXlsx has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f72d504899ba8df7c0a5e08e64e0a2c8537dd5b2b6df0e09468aaf6f24e134c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesResultClientFilter (cyclomatic 20, cognitive 20): matchesResultClientFilter has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/gridClientFilter.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dfc3b0074ed734f04cf9a834f4a6faca311eb4cb18c8cd0605cd7cbf9047d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeFragments (cyclomatic 20, cognitive 20): mergeFragments has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"95206bbce1ff9ea7913237a827d583e762c8232aa314c066070cff1f5b7975ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSqlShortcutActionItem (cyclomatic 20, cognitive 20): isSqlShortcutActionItem has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"356213b13b43ef782cae6227231bbb05e66b5c7b408e6c3da13576ab3c9cf918"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 19): (anonymous) has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/NativeJobDefinitionEditor.vue"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"caec683f1dde8e82f8826d3ebf63f35e7d79780e427bfb60477efb14f9f8a62c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function viewFrameSource (cyclomatic 20, cognitive 18): viewFrameSource has cyclomatic complexity 20 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 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":"apps/desktop/src/components/debug/StackTracePanel.vue"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5db043004efd4a7e4a0943d3312021af851fb5c1560dd35da6d49bda4da5e96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitBranchOperation (cyclomatic 20, cognitive 18): submitBranchOperation has cyclomatic complexity 20 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 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":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83c08b91338227a1deac1a74ed764ba7a90ec18c63a4584405346f2606cd234"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchDdl (cyclomatic 20, cognitive 18): fetchDdl has cyclomatic complexity 20 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 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceccc3c994bb8d6694b981285fd0e2f4c053a39f5fdfc3215c072d1a20bf7e67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyWithExtractor (cyclomatic 20, cognitive 18): copyWithExtractor has cyclomatic complexity 20 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 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":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bf12f0ecb33daaf9067e18194e35fdb0f0f151501f9af63c9fc20f6c78d55e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDefaultLengthForType (cyclomatic 20, cognitive 18): getDefaultLengthForType has cyclomatic complexity 20 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 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":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"262383f48b5443c652d84e65893587e91a093bc647a462bc25c6b2c06f12f044"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listCompletionAssistantObjects (cyclomatic 20, cognitive 18): listCompletionAssistantObjects has cyclomatic complexity 20 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 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9722}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd27dd9b10750a8de73cf863af6c1e5079f28143f42881bd09833184a78e144"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeInDebuggee (cyclomatic 20, cognitive 18): executeInDebuggee has cyclomatic complexity 20 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 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4880e629b565e234e9e30ed0b194282a6c36b408b0231c80ef3d5ce535a907"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadObjectSourceIntoTab (cyclomatic 20, cognitive 18): loadObjectSourceIntoTab has cyclomatic complexity 20 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 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3600}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca2ca4b3cf7148a6379f200633cbca04289c79088d6f99e182c17d45f9a7028"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 17): (anonymous) has cyclomatic complexity 20 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":"apps/desktop/src/components/redis/RedisGroupedKeyList.vue"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5d78a6e26bd3c6307e520010a11b2bfc52a06e6bb1d51753be1e35bd60db28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 17): (anonymous) has cyclomatic complexity 20 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e25bdb67bf630e05e13459f0a5f156170ca6157dce3993ef9d73093f805773"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldTriggerSqlCompletionForPosition (cyclomatic 20, cognitive 16): shouldTriggerSqlCompletionForPosition has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4376e1128a0bbeab25858067bc15518416509de6bd36f086134eb70dba4b303c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateTriggerDefinition (cyclomatic 20, cognitive 16): generateTriggerDefinition has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectSourceDialog.vue"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"592dcae96e1475b65b770a5d7321222f08ea94296b6a9f983f56e995da93df40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createPluginAiConversation (cyclomatic 20, cognitive 16): createPluginAiConversation has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiPluginConversation.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5885b1dbe40fa7823a87b90a397ddab0a4f1b1fec992914cfa44ff44bfdf0766"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rebaseNativeJobDamengDraft (cyclomatic 20, cognitive 16): rebaseNativeJobDamengDraft has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"5762404cc03c6c1165806eb2d6ed3460b4ee67826513b13810167c8ba26f14c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 16): (anonymous) has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionManagement.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f147b5fb9ecae1d66509f8fb0af8d31c84d8007ef19e71732cc0f8a3c457e11c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAnotherRedisImport (cyclomatic 20, cognitive 16): parseAnotherRedisImport has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/anotherRedisImport.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7ea4dc86c7a8236602f16f5a09ed00d4dbcd889706fcd9a2a80759c52ca1d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEntry (cyclomatic 20, cognitive 16): parseEntry has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/dynamicContextMenu.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"905f1602020e63b366c92515a4ff372ffeb7ff9a1506f3cb9901a8fa5c3f74bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function targetFromContext (cyclomatic 20, cognitive 16): targetFromContext has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/newQueryContext.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7254ea2cc5d71cc9f8790e9283f582845f9a254732832ff10022ab2d916b1f0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPagedTableGroupChildren (cyclomatic 20, cognitive 16): loadPagedTableGroupChildren has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa5523754a266a202a89c3c3f929eebdc55199aba32a3dd07746b1ec93719d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 15): (anonymous) 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2461ce1587c1eef1bbc7b05de650268b2a5e5bbdf0310f9f2c8fae1c101c310e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearPersistedPendingChangesForSave (cyclomatic 20, cognitive 15): clearPersistedPendingChangesForSave 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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"696ff139f9d210735247bc86464dd5819f6ba075511288165d4232f7030d643e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listCompletionObjects (cyclomatic 20, cognitive 15): listCompletionObjects 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10515}}}],"partialFingerprints":{"codehealthFindingId/v1":"97491ca8a7296264599dd06a3ccc2c8ec033d6bc737cc65d7e0ef58fd28f8e8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validStep (cyclomatic 20, cognitive 14): validStep has cyclomatic complexity 20 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0769bb9c3fa8e37e4a7a964a3d7659823370a42f39572632e637ab425cff059"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mysqlTlsModeFromParams (cyclomatic 20, cognitive 12): mysqlTlsModeFromParams has cyclomatic complexity 20 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":5815}}}],"partialFingerprints":{"codehealthFindingId/v1":"3108757e82ba8ca3dabcc3f98496b08874e0ac74109078e16415fa127559a10e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveQueryDisplayMetadata (cyclomatic 20, cognitive 12): resolveQueryDisplayMetadata has cyclomatic complexity 20 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7867}}}],"partialFingerprints":{"codehealthFindingId/v1":"453c11bc431785957358fcf92dc0fa628fb279fe6fff18952e65f7c340fcf545"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLocalTableSearchParent (cyclomatic 19, cognitive 40): resolveLocalTableSearchParent has cyclomatic complexity 19 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTableSearchControl.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ce13f27b399b7e9bb8aa671bc56e5c1243293764669c61b663c2301313ebb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 19, cognitive 39): run has cyclomatic complexity 19 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56bb765a4c10957a840aa4d7da7c68437543e65c4955155c2ec83a0674dc1f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareLegacyGroupingView (cyclomatic 19, cognitive 36): prepareLegacyGroupingView has cyclomatic complexity 19 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":3912}}}],"partialFingerprints":{"codehealthFindingId/v1":"132ed013771daa10cbd2fcf16336a501443d440d47b2d48426b3f9840e760633"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remoteSearchContexts (cyclomatic 19, cognitive 35): remoteSearchContexts has cyclomatic complexity 19 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"a261dd4a6258c91b60ba0f81166292a4698c48922233a7b2405c3cb674633932"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unwrapOuterParentheses (cyclomatic 19, cognitive 35): unwrapOuterParentheses has cyclomatic complexity 19 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"493801775a61844da37fd0d42b7a80484f3eb93f20d0f9c9dc9c4a52ace11a6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectOracleSessionDiagnostics (cyclomatic 19, cognitive 35): collectOracleSessionDiagnostics has cyclomatic complexity 19 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionDiagnostics.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7494c7ca54f906b3efb0cd45095c24e11ce31aa9035920180f1833c6cb4cd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeXuguAuthority (cyclomatic 19, cognitive 34): decodeXuguAuthority has cyclomatic complexity 19 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":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86953e1162c2b5fc464869445270eaeeba3cfcc72664d85c4560f7342c2c0c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codeMirrorBaseDialect (cyclomatic 19, cognitive 33): codeMirrorBaseDialect has cyclomatic complexity 19 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":"apps/desktop/src/lib/editor/codemirrorSqlDialect.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdace4e1a961ba885a5bc2838e061f051e5476d43798df5e6e2efec707dab37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectNeo4jNodeResult (cyclomatic 19, cognitive 33): projectNeo4jNodeResult has cyclomatic complexity 19 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":"apps/desktop/src/lib/neo4j/neo4jNodeResult.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c2479ca0b8f01507bd8d27e34cc604687fbb6b92529cef566f9978b654fd19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scan (cyclomatic 19, cognitive 32): scan has cyclomatic complexity 19 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCollectionSearchController.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3343a060d081a51402e48dab7f8d5513811746a26ea0950a06b12a592dfab862"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractUserName (cyclomatic 19, cognitive 31): extractUserName has cyclomatic complexity 19 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b709f77999c633ac01faf33689fad2ee9319bf132e4afebc2a986e960291c10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 31): (anonymous) has cyclomatic complexity 19 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3119fb384c20d677bc8925e7ff1f4c5c4cb80c838835aca8c248ff8d81120c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeBlockFoldRanges (cyclomatic 19, cognitive 30): computeBlockFoldRanges has cyclomatic complexity 19 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":"apps/desktop/src/lib/editor/codemirrorSqlBlockFolding.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3e2afdbcc59a6906be7055685f12e6d12d8b23e4bf835fe00965769aefe4b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function coalesceXuguPackageObjects (cyclomatic 19, cognitive 30): coalesceXuguPackageObjects has cyclomatic complexity 19 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":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b44d4d55b3f620e87cb38592b252f4b3da4a6103a49a5ac0c0a1e4669452b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executableStartAfterLeadingComments (cyclomatic 19, cognitive 27): executableStartAfterLeadingComments has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/executableStatementRangeCache.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75866a197432420df413b42c974dc72c54c06d5be6022017305231ec8614505"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDdlViewerTab (cyclomatic 19, cognitive 27): loadDdlViewerTab has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3730}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55e3b662cc011b712b546d86973fdd5112e19e12323aa8f8d801b5166843fc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadObjects (cyclomatic 19, cognitive 26): loadObjects has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5630}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a09e215e244915d9b52c7512587263438cd407d1c02f7aef195b2583540ef9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 19, cognitive 26): walk has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/__tests__/settingsSearchCoverage.spec.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68de2bf8019b491867f2cbe0ea701cc1dc452c7295b2d0003f5edd247f9e35e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compressCypherText (cyclomatic 19, cognitive 26): compressCypherText has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"0131a99114e5fa8a59d173066e3b9557868ced109facfd2a82621f9ccabe88f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseConnectionsImport (cyclomatic 19, cognitive 26): parseConnectionsImport has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11750}}}],"partialFingerprints":{"codehealthFindingId/v1":"474e592f6385cc0969c26b64abfa2b753c5e14c72ccb012a642f0a5d5430eaf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paginate (cyclomatic 19, cognitive 25): paginate has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6079881a672e62d7ba2505fdffad81185ff43c9c9022ed036dce085d59379313"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateChange (cyclomatic 19, cognitive 25): validateChange has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b47fc8d8a3f1f8773c7c87ff6b8375807cfd0c9bcf8453b99bcf3e337e33db7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSetStatementVariables (cyclomatic 19, cognitive 25): collectSetStatementVariables has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa55426ea1e615674bc5707bb526d93747429a4334a0a8f1e2ed99959ac1d92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectExecNamedArgumentStarts (cyclomatic 19, cognitive 25): collectExecNamedArgumentStarts has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"7146dbebbd807b1aace5e2606c3ba20c22d7597d2e182afc14896a7fb7c3ade9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyUpdate (cyclomatic 19, cognitive 24): classifyUpdate has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7baa8a38ff8e11b8650a26c65a7327ec031c7bf0f4973b8a56f2b4c37401a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyAutoLayout (cyclomatic 19, cognitive 23): applyAutoLayout has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"83288bccfe7991e3d155bb16ffe2d119b45c7cda66409302eb816dc7ac6458a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyProfileData (cyclomatic 19, cognitive 23): applyProfileData has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"b477e86af6048a36f6b861b3c41d8f679ad477dc3f1fb97e84b10d340e044d4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPersistentDataGridColumnWidthState (cyclomatic 19, cognitive 23): loadPersistentDataGridColumnWidthState has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d085f5fbf562fe4ea0d72b1a6dc9aeeb98543468940a5352cf86fe9faa0a1521"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyFinalSnapshots (cyclomatic 19, cognitive 23): verifyFinalSnapshots has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a76e3ffe2b1837b6d92f8b49accec436199e948150234920b6d9f9f60e9e2e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyConnectionUrlToForm (cyclomatic 19, cognitive 22): applyConnectionUrlToForm has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4871}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12bc57a8f35f72072c6f2d18291f501551cb953d4f8970c745c248169e681cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDdlDatabaseQualifier (cyclomatic 19, cognitive 22): applyDdlDatabaseQualifier has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c7f89f3a85ba1249c91b4b7a5614703e779a4b3bf0b927230f1f21dde744ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitQualifiedNameRawParts (cyclomatic 19, cognitive 22): splitQualifiedNameRawParts has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4858}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1078b5a1959c5175882042ba9e238f79e3c9e1d5bd4a6da3e5b1d0c57d85722"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshKnownLeaseKeys (cyclomatic 19, cognitive 21): refreshKnownLeaseKeys has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ac9c0dedd1ef58a98b6d2440c4c51c073b1410dd6788d3303b15aa9edd5dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestTransferConfirmation (cyclomatic 19, cognitive 21): requestTransferConfirmation has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34974e96f9c4f3c6a71593b1b06c3c646a21955d9e343b11c459581c020692b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setChildren (cyclomatic 19, cognitive 21): setChildren has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7f2870a3c5d3f1ce6a522b1606a47d6130c141aa881b3339fd29e1f329edd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 21): (anonymous) has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7194}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc33f0eb2e4b615a5efcc9233b7351d742803391be2c70932845108b2eec8490"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPendingSql (cyclomatic 19, cognitive 20): applyPendingSql has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f27517972d42b53fd7d6a86d204e08e55b0893242c490369c34a16a5b323ead"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPluginConnectionPrefill (cyclomatic 19, cognitive 20): applyPluginConnectionPrefill has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c01cf96935afac85c356f75b42a32c6592ea449b006ff4e3dc99869abaa5bcf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 19, cognitive 20): initialize has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"835542296ae76afedb74a46933cbb89f5e03b72b3e849b5d24d4e930fdc6e64e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aiEnterEditMode (cyclomatic 19, cognitive 20): aiEnterEditMode has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7426}}}],"partialFingerprints":{"codehealthFindingId/v1":"431814e013a6f8b7507382770fa2ccffee8755728dd115b3ec5d151c168837d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldStartSqlCompletionAfterInput (cyclomatic 19, cognitive 20): shouldStartSqlCompletionAfterInput has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6a8de9cf8a243d9d783f101337639d5f5fd1f883da74d70bb69df8cc23743f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureViewSelection (cyclomatic 19, cognitive 20): captureViewSelection has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":7041}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7b0cb3e92dd10f78f5b94333f8fce723d62d37249b8d98d393b0904d62a1c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onHostFileDrop (cyclomatic 19, cognitive 20): onHostFileDrop has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa0463ee1b9fe70344f6441ce81ee331f00130cbeb7376c5d8d719a76964fa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chooseNamespace (cyclomatic 19, cognitive 20): chooseNamespace has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e657eaba2890c0c7a85a62dbb00a234478e32c916dcfdffa78a862d199fc48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requirePluginClipboardImage (cyclomatic 19, cognitive 20): requirePluginClipboardImage has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginClipboardImage.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"191fb060c5bbe2636bf6d4847c005e351593057f0c141d48f0d85bef634f44c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeResultSession (cyclomatic 19, cognitive 20): closeResultSession has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05b480e05b8fcda51674cc02e7b6c44957b6bab1a0fd61cce011867ddc0c77e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statusIcon (cyclomatic 19, cognitive 19): statusIcon has cyclomatic complexity 19 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":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69ea5e9066cfee006868f6c2258c5757611da01f5f0a8f1fd613aa7e8c1048e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncCurrentConnectionPassword (cyclomatic 19, cognitive 19): syncCurrentConnectionPassword has cyclomatic complexity 19 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":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb9f3fd589ab8048c3810c67445ae9b77bbe8be53735a55e2f068006267acb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchTable (cyclomatic 19, cognitive 19): searchTable has cyclomatic complexity 19 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":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"308b62e23f04f808e843dc8011b928206018b786f04e8b711a95bb7b1f581a37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completionColumnsKey (cyclomatic 19, cognitive 19): completionColumnsKey has cyclomatic complexity 19 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b3e76d29f21765e284a4ff7371e56eb71aa6532e512e53302c7a1554374e00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setRightSidebarPanelOpen (cyclomatic 19, cognitive 18): setRightSidebarPanelOpen has cyclomatic complexity 19 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 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":"apps/desktop/src/App.vue"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd0f5bbf46b0f2a0fd138e79a5fb15962e9f0cc6d0ddc8d5f76136cfb3e9011"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calculateTotalRowCount (cyclomatic 19, cognitive 18): calculateTotalRowCount has cyclomatic complexity 19 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 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":4626}}}],"partialFingerprints":{"codehealthFindingId/v1":"026a8dc520bf824c0456dec8bde3d6030671c282212fc5f447a00b0a110fdc64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadRuntimeClients (cyclomatic 19, cognitive 18): loadRuntimeClients has cyclomatic complexity 19 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 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":"apps/desktop/src/components/mq/ProducerConsumerPanel.vue"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"edff6a05492340c299e4469234dee0168689e065044d6704c0316b89c4d8c178"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeConfig (cyclomatic 19, cognitive 18): sanitizeConfig has cyclomatic complexity 19 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 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":"apps/desktop/src/composables/useDataCompareConfig.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c894bc6cc0826be4467581ede893a88de2c44c61fe1713fad9c3d83e457248a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeImportFileText (cyclomatic 19, cognitive 18): decodeImportFileText has cyclomatic complexity 19 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 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":"apps/desktop/src/lib/common/decodeText.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef71d3fdf7f7f5630361c4aa951d1422b66dc8786ea5aac9cdd7e82678656efa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFloatingWindowRequest (cyclomatic 19, cognitive 18): parseFloatingWindowRequest has cyclomatic complexity 19 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 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":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bda578d99d7f3451d45b08dc291ee9b24bbd71f3e4eb366adb73e737a3a583"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postInit (cyclomatic 19, cognitive 18): postInit has cyclomatic complexity 19 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 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":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cf9457835470b7d0661734347c4fecec6cefcfe125ec513b0ccc34d3609a68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redisDeleteGroupPreview (cyclomatic 19, cognitive 18): redisDeleteGroupPreview has cyclomatic complexity 19 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 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":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8fc11f7e0e7e17157752ec0ef90337d86dad9d75fa62b184c58c8e596d44e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTableVGroupScopeFromNode (cyclomatic 19, cognitive 18): resolveTableVGroupScopeFromNode has cyclomatic complexity 19 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 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":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"06781d81903614429efc694802c8f5e269d3c34fc40765cf509c7fdcacb1d85d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreCachedResultPayload (cyclomatic 19, cognitive 18): restoreCachedResultPayload has cyclomatic complexity 19 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 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc7adb56175d5df2fd61fad8f8c6fdbb110e666080e0f60c1eb7b6edd43429a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function previewCreateUser (cyclomatic 19, cognitive 17): previewCreateUser has cyclomatic complexity 19 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":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca35a26af6a5093e24bcfcdc88c997163502054b049d0f31d1fb05e61b7b54a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 19, cognitive 17): save has cyclomatic complexity 19 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":"apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb201f99cd10d7ff82fced12ce8bd513050a99bef4f6432751e5b66bfc690d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJoin (cyclomatic 19, cognitive 17): parseJoin has cyclomatic complexity 19 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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0ab2a4f3ecdd556957456eaa21c77b12575b8e921479d6ba58affddd0a472f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findCreateTableBody (cyclomatic 19, cognitive 17): findCreateTableBody has cyclomatic complexity 19 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":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"147167bf19c7bf1968b7ee156e75b01cfbe77bdb9524b3b653415f5bcd6a3781"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sortTabResultLocally (cyclomatic 19, cognitive 17): sortTabResultLocally has cyclomatic complexity 19 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0ea18701d530d9b4abd5815f3e91cc4aba305d7766d5403fa2131665d6bac9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 19, cognitive 17): visit has cyclomatic complexity 19 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":"plugins/sdk/dev-host/diagnostics.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bb6bd2d7c2dd83329a374094ef864ae65d2168b81e1cf0bce1018a4ef8d374"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 16): (anonymous) has cyclomatic complexity 19 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4b5ecb640af4271b50fd408ce3b703196cd2d4daf536449f0f2ae091e462b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 16): (anonymous) has cyclomatic complexity 19 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fc1a05d5955ff452020baf695694f60116f78a9e441f4b8225de15a87f4bff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeForeignKeyDisplayFilter (cyclomatic 19, cognitive 15): normalizeForeignKeyDisplayFilter has cyclomatic complexity 19 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":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18c4c3db18ac94f12d4532512cbc27de790840c4a144e6764e9bd22cc0210cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildConnection (cyclomatic 19, cognitive 15): buildConnection has cyclomatic complexity 19 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":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb10012fb24d066822f0482f5faf4e55be6457d7054d3df4d3cc2a3a33ddb83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateConnection (cyclomatic 19, cognitive 15): updateConnection has cyclomatic complexity 19 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4986}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bc4bf623ec8d9bf6fa1a0a62b4f729d8a574d316708e1c93adc8f07c8e2962"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stageCellReplacements (cyclomatic 19, cognitive 14): stageCellReplacements has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8102d1904ff92e03837507f36f6a7f6d538992d189fda9f19052bc241ff813"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSqlCompletionTableLookupTarget (cyclomatic 19, cognitive 14): resolveSqlCompletionTableLookupTarget has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletionLookupTarget.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5420000e3a8062dd6988f876cbe433ceb3d219b5668ec4d86ddc73126fc40ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pasteClipboardAsNewRows (cyclomatic 19, cognitive 13): pasteClipboardAsNewRows has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":10730}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a33093e73cf169b270bc72bbdf8f7a63659c113be019a862bd51d592dad29d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savePendingSnapshot (cyclomatic 19, cognitive 13): savePendingSnapshot has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"160bf71a768a49b767c61db91ffcf0ded9d39da7a6e0237fbf8e0e220d001dc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function databendUrlOptions (cyclomatic 19, cognitive 13): databendUrlOptions has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f77ff59ba2ee611729960d90a71785326401d3aadb5896a7dd0812f81fc21d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isTypeDataMappingDraft (cyclomatic 19, cognitive 13): isTypeDataMappingDraft has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeDataMapping.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca7084d085ed1682b7896624e91c8fd47ab98802533273353a53836914d7569"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 12): (anonymous) has cyclomatic complexity 19 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8c351cc40c307200a6d4afcf83630749998b5e3d915845f13735f167bcbd29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keydown (cyclomatic 19, cognitive 11): keydown has cyclomatic complexity 19 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/vimImeGuard.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09dcd4a74db8cfdde1f2c1ae717508e46aeb0fa013fecdb485f349814801560"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sameTransferDraft (cyclomatic 19, cognitive 10): sameTransferDraft has cyclomatic complexity 19 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":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dfafab50e70dd7f179d493338eb38ba75d37bf15a0637df5bbb6d1ed7985e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function suggestDataTypeForGenerator (cyclomatic 19, cognitive 9): suggestDataTypeForGenerator has cyclomatic complexity 19 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":"apps/desktop/src/lib/table/tableImport.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c5bf955d87d2969b0c6f72254dcb9009bfa07d65f83871f7883ba272abd599"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findMatchingXmlTagClose (cyclomatic 18, cognitive 36): findMatchingXmlTagClose has cyclomatic complexity 18 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcaaa7fbb637025ed7c7122b1b9057882f8e877bab3016152f6715c55d2030c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshBatchDropPreviewSql (cyclomatic 18, cognitive 32): refreshBatchDropPreviewSql has cyclomatic complexity 18 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3922}}}],"partialFingerprints":{"codehealthFindingId/v1":"299f83af1d413cf944d2e6ae955366b9490d20054643a821922af52b92561658"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteSelectedConfigs (cyclomatic 18, cognitive 29): deleteSelectedConfigs has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"335a26ea05f3b469f330c7d60d027cb2e0518741ab66d6481a1e1fc15f5b4302"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGraphCompletionItems (cyclomatic 18, cognitive 29): buildGraphCompletionItems has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphCompletion.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d09cb069499a3ccd1400a54b8ee4ac888a7ea4aca0fda290486a4416dcfc14a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatLeadingCommas (cyclomatic 18, cognitive 29): formatLeadingCommas has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dd98194a180d71f17873561fe0d0bb70ac3b02a19901136e14e134daa5b9e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isWrappedByOuterParens (cyclomatic 18, cognitive 29): isWrappedByOuterParens has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a88b7a34bee413ff8e3c5393cd2cea4358dd297a320f9c095497fae459ed49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runQuery (cyclomatic 18, cognitive 28): runQuery has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MessageQueryPanel.vue"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d44452f6a707d88f0261e4c38ab1eec5a842b9b9ce5bf06e8ac38a6acbeaf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseXmlAttributes (cyclomatic 18, cognitive 27): parseXmlAttributes has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"25da0c8c5e0ad72c714d46b62e9589bed7f6a5de6de72c6678daf431ff99561f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sapHanaScriptBlockIsComplete (cyclomatic 18, cognitive 27): sapHanaScriptBlockIsComplete has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"faee93e40815142e45aaeefcaa92f7387b02f798eaaf2a0c619b96f12f6ecfd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSqlVariableSyntaxOverrides (cyclomatic 18, cognitive 27): normalizeSqlVariableSyntaxOverrides has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariableSyntax.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"858ccca7b7627bad33b11dae2d8fcc030cbd639ed4779bd01ea86f62d32f4892"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operand (cyclomatic 18, cognitive 27): operand has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"281f0bb0ecd2e4b764f1132abdb27ff87a0f3ae69d45460bb30270876c73b7c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setLeaf (cyclomatic 18, cognitive 26): setLeaf has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugCompositeEditor.vue"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5242f2430c6f12ddbeb3364da69fcb78a041a92e82c7fd0e5d382e02b12a1916"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveDataGridColumnWidthState (cyclomatic 18, cognitive 26): saveDataGridColumnWidthState has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b0ededc82f919626058019a08125398e5c1e59619ad13cc87c6c7bc4394895"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDamengTree (cyclomatic 18, cognitive 26): buildDamengTree has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"929c96e1be4aec891dc438a42c9de133759c6116b4128b20cac83d0ddcd1a11b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectDeclareStatementVariables (cyclomatic 18, cognitive 25): collectDeclareStatementVariables has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3ea8b860ba21e4d76334575fe09f37883802d4b3910ce242700c02682b705d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectRoutineDefinitionVariables (cyclomatic 18, cognitive 25): collectRoutineDefinitionVariables has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b714ae9cff918fcf8cedd0606d08bbec3b043362edafe818ad4dfd88d7bff4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clauseSpans (cyclomatic 18, cognitive 24): clauseSpans has cyclomatic complexity 18 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":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f0bb9dacfc88fb4e8eb0c9e14687aaddbd17c558d17328e3e759d48e12a941"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitRoutineSignatureParameters (cyclomatic 18, cognitive 24): splitRoutineSignatureParameters has cyclomatic complexity 18 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5379}}}],"partialFingerprints":{"codehealthFindingId/v1":"957ff06fe6176921f465f99cb9993fc22598cce5910167859d188cb8a8d5f2f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishTransaction (cyclomatic 18, cognitive 23): finishTransaction has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8cdf14c7637f2fa5b7ec5ae4ec19748bf2cc1155fedcc392b22a5bf08ca639"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openInvalidObjectSource (cyclomatic 18, cognitive 23): openInvalidObjectSource has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa75a720da7d81b80320346fd530bf82386e6ccc16f9e4a595f064ec1ba16e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runStructureSearch (cyclomatic 18, cognitive 23): runStructureSearch has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb087ff491ed2202d6fad4f8fbe03ebbc4a8708bd25b9a980c0065af0ba5eb20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDataGenerateSession (cyclomatic 18, cognitive 23): runDataGenerateSession has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGenerateSession.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb47a87c93602b91a32e93eb1f711719815c3cf24f3e96840e6dfd055d7c637c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activateEntry (cyclomatic 18, cognitive 22): activateEntry has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginFileManager.vue"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2382b0df433d0031edb167e51168778388267494e81d961af53ae717fcb0058d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setMemberValueFormat (cyclomatic 18, cognitive 22): setMemberValueFormat has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5ff15fe6e9137899dab78875d886a1da3ca728dc79c04b4a5a041afe76c07e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function candidateBinding (cyclomatic 18, cognitive 22): candidateBinding has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5147bd8b420e2db4d18065d8034c7445ecad7c24d7c85bfd1b008c873197c92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 22): (anonymous) has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerStructurePlan.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dd35c258982d6c9f79cbdd2117cbad10143a40774775177a7cd777ce8d21d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function binaryLiteral (cyclomatic 18, cognitive 21): binaryLiteral has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e2525deb0d843d3626667400bb57e4669f8c7f76633b414776f3217c84589e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeydown (cyclomatic 18, cognitive 21): handleKeydown has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7dd802b7c99cf4f95f88d0c944767e45d448e370167212797de9070bdf7015"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDeleteRows (cyclomatic 18, cognitive 21): applyDeleteRows has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaaa2217d7b236b65e273e44ae9a42aaa732961b62d6980b24519b7103585ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connection (cyclomatic 18, cognitive 21): connection has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/redisDesktopManagerImport.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1879412114823c54edc044df9e18a7e091435534c9d0e0d73b4c57ac9a948a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 21): (anonymous) has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1576bf6e387c3103bec4a46dd6d337c8f5456cc9d28e6c3407affeb9404d2a2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitTopLevel (cyclomatic 18, cognitive 21): splitTopLevel has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df86e0705a5f3be246517d1309f18c5161e49742c09d5df513e0bcb87c7961d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportExactTriggerResult (cyclomatic 18, cognitive 20): reportExactTriggerResult has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea270a760607eaa81d485b2134b50e5ae2de8c18eaa24c91692233a9e3a2150a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIoTDBTimestampEditorValue (cyclomatic 18, cognitive 20): parseIoTDBTimestampEditorValue has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b66a0fb05d8847e6dffa555f9169054abec61a963e0fc42d55fa9aca0e5e22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSqlObjectNavigationIdentity (cyclomatic 18, cognitive 20): resolveSqlObjectNavigationIdentity has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b217f4822796acbd4a1f2502c957c6cb11dcffc501c187e15fe8afacca403b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitPgPartitionBoundValues (cyclomatic 18, cognitive 20): splitPgPartitionBoundValues has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/pgPartitionPresentation.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd9979e69feb214a30e7dcdf97f42f7b1592f2654d1146933457019a8b15723"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSqlShortcuts (cyclomatic 18, cognitive 20): normalizeSqlShortcuts has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"394c16a4e24568c8b9555977386385651c114088ab846e61c57d025b2a501811"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMessage (cyclomatic 18, cognitive 20): onMessage has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/ui/App.vue"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"982776402ff1023c96c992a715dde8f77a209713faf02954bc1185cf41ab4e89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateDropTarget (cyclomatic 18, cognitive 19): updateDropTarget has cyclomatic complexity 18 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":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"982dcd675c9bcf94cec4db922f6900ddf25827ef745c8b2e9e7ecc836373038c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 19): (anonymous) has cyclomatic complexity 18 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":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8532bcc717c2f19c97aa56011469c2cdd265ed74844cb7b2770d242a74890481"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateDropTarget (cyclomatic 18, cognitive 19): updateDropTarget has cyclomatic complexity 18 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":"apps/desktop/src/components/transfer/TransferTaskTree.vue"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e12ca8eb0e0d05eed35c6b5920d4b6dc29d5f3370951ee18e60ef775e5fc3e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acceptOracleRoutineDeploymentOperation (cyclomatic 18, cognitive 19): acceptOracleRoutineDeploymentOperation has cyclomatic complexity 18 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":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0f9cc80c76abf04b45d0361f90c1d4146b0e9097ec72ab5b8eb5ac6b4c254b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlServerParameterDeclarationType (cyclomatic 18, cognitive 19): sqlServerParameterDeclarationType has cyclomatic complexity 18 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":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"b850717dd4f826a36c172482945af71fcb9d5416fef9f717210666616bf0cf9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableImportProgressPercent (cyclomatic 18, cognitive 19): tableImportProgressPercent has cyclomatic complexity 18 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":"apps/desktop/src/lib/table/tableImport.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdd2094a2b617f4f1b6cc6c703a4c7f3324043443703193afa17228a61c2ce2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pasteTargetForLibraryContext (cyclomatic 18, cognitive 18): pasteTargetForLibraryContext has cyclomatic complexity 18 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":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"848f8753b4e9cd3f561e33e8586c38a1dd471e771d884eddb45ff085efed53bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncCurrentConnectionPassword (cyclomatic 18, cognitive 18): syncCurrentConnectionPassword has cyclomatic complexity 18 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":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a964d082163205579f0a060369e7c62b8e904a0bd08a31a0221d8fd3d0dd0af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toggleTriggerState (cyclomatic 18, cognitive 18): toggleTriggerState has cyclomatic complexity 18 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3445}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b1d6b7fb415f65604277b23be80623c1d5bfc2c5590f21743195cd2b8c1016"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesShortcutKey (cyclomatic 18, cognitive 18): matchesShortcutKey has cyclomatic complexity 18 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":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"683afb295c1eb7d63570771163b6566cb3fc7bcd3584a5411bd18bc48a7c593e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSelectAllColumnItems (cyclomatic 18, cognitive 18): buildSelectAllColumnItems has cyclomatic complexity 18 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5667}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6b8aa85e794bafeda6124a93aaa795d9a0bd86da55279302788ab80a8402e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 18, cognitive 18): read has cyclomatic complexity 18 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10893}}}],"partialFingerprints":{"codehealthFindingId/v1":"11532425f436da5af250bcb152b2217f31bb79e3d2fea2eb41d50f1e4473ce12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importedDesktopKeysTouchDraft (cyclomatic 18, cognitive 17): importedDesktopKeysTouchDraft 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":4369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f707f4256068259e1c1136367dc390ce69b85a0f1416180d6215eaec468da8ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteConfig (cyclomatic 18, cognitive 17): deleteConfig 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":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9c60c27825a75a45f9eaa1b4add683375ebff6638764f8ac8b4452e888db1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) 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":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fdfd616f472dd181192441a125986b2097ba5ab69420c09f73554c66ce124a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) 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":"apps/desktop/src/components/structure/__tests__/TableStructureEditor.createModeSavedName.spec.ts"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03c8303cca1be44b87d1e767e83dd3574273a48f8547e19c08b51bcea2a3e4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeMongoWriteRisk (cyclomatic 18, cognitive 17): describeMongoWriteRisk 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":"apps/desktop/src/lib/mongo/mongoSyntaxDiagnostics.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"16603b4cdf99191de8ea03be32afe84371731d64d98f7ab4e182758a1dfe607c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeImplicitHtmlTags (cyclomatic 18, cognitive 17): closeImplicitHtmlTags 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":"apps/desktop/src/lib/nacos/nacosConfigValidation.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"39498bd74ccdcb5bee0a389bb665ce1fed705397afc375796185118882fd8060"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gaussdbMTypeDisplayName (cyclomatic 18, cognitive 17): gaussdbMTypeDisplayName 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":"apps/desktop/src/lib/table/postgresDataTypeHelp.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e59839b7d1d55367031d05645d6d131c64fff7ebf38a41e111bb54a89108af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function continueWith (cyclomatic 18, cognitive 17): continueWith 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c896562183f943ab12b3fa916cffb94b78e35dc0ef91bb3dfec04f54da39d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 18, cognitive 16): load has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/CustomTypeInfoPanel.vue"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d2bdcbd9e085f0cca3ae6e84bf5096b81997df26f19b910fbd0bcb757a9f12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 16): (anonymous) has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca6f05061ff0539c0fe588ae207b07cd743f6d415b1c587e34b1b1a933160d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 18, cognitive 16): prepare has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNativeJobExecution.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0513ee6b89cf4ba311bef9085dbb1212603de938fa60a1e6e2dcd6d1a3628240"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeDatabaseBackupRun (cyclomatic 18, cognitive 16): normalizeDatabaseBackupRun has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef768bcc763ba2b6f67c5c94dd9ad76b6dae06282aea1206eef102db6d90c74a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionObjectTreeNodeSchema (cyclomatic 18, cognitive 16): connectionObjectTreeNodeSchema has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/jdbcDialect.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade6f1213011dc82406c3063b17bdbee272e858609ece19fb4bbe15e566c2ee6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectKvValueFormat (cyclomatic 18, cognitive 16): detectKvValueFormat has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/kvValueFormat.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b5849ef1cd8adc2510f7bce037bd8d00b698e260c8eba3833e76f6913e54e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openSavedSql (cyclomatic 18, cognitive 16): openSavedSql has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6737}}}],"partialFingerprints":{"codehealthFindingId/v1":"039d609b7e8e5a6d896cddfa5069fa65e0c608dd904d2544cebe941b0eec0b59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 15): (anonymous) has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditorContextMenu.vue"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d74bbcc1d15b649a08c41420f43a18b87787df06244c3533b2f7da992d727a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreViewport (cyclomatic 18, cognitive 15): restoreViewport has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb94325b669d4956bcbdb8f09a84adc535dfbbbb7dad59e29159a41facd06d1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCopyInsertOmittedColumn (cyclomatic 18, cognitive 15): isCopyInsertOmittedColumn has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":3165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64284a06ce754d3d052381de050803ab3d3c9d94f6bf556d62318a96a12b621"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCurrentTableGrants (cyclomatic 18, cognitive 14): loadCurrentTableGrants has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b93eb4a67dde1608c01d3073fbf5f52e0d41493f63de203320aa70092d7de7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOrderBySearch (cyclomatic 18, cognitive 14): applyOrderBySearch has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8400}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fc90fa23eb1edbc41fda10dd663eacda5ba3d13bc81b13e7938a79d6c5be3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 14): (anonymous) has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"607c6629e1cbcba5c62a29ae5cf3223cda5a49a7da94a2fced0b44f53403f14b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canDropTreeNode (cyclomatic 18, cognitive 13): canDropTreeNode has cyclomatic complexity 18 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3717}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd0555e32ef63d63578f4b055fce8985db91a1b9e1267fe91903f3f201895e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canReuseTabForHistoryRestore (cyclomatic 18, cognitive 13): canReuseTabForHistoryRestore has cyclomatic complexity 18 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":"apps/desktop/src/lib/history/historyRestoreTarget.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"164cc18dcd3adf65f99cea7306036b77319228ec448fd8750cc42d0d72812a26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 18, cognitive 13): start has cyclomatic complexity 18 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b217e477e692c71ddc56a351b5d18bd76bac9c261878abc21190dd0d64494aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePackageSaveAsDrafts (cyclomatic 18, cognitive 12): validatePackageSaveAsDrafts has cyclomatic complexity 18 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"16de2fb8bf4ab2b553aff672ef26c113ce8df6f441d804a1502d9e071a69dbf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stringContentRange (cyclomatic 18, cognitive 12): stringContentRange has cyclomatic complexity 18 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a7e6ed1a9247b76a05a8248070b817c1c866eccbdff1f47e02eca88763404c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectExactOracleTriggerSource (cyclomatic 18, cognitive 12): inspectExactOracleTriggerSource has cyclomatic complexity 18 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectSourceLoad.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3c1f59ace3ff62a388c6badb2548d59bb99ac1a8485900d954bb0e4ee252e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expressionTokens (cyclomatic 17, cognitive 39): expressionTokens has cyclomatic complexity 17 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f0f20e53183f532b3255828f2f0181f9acb37698c2942d3b39746ce08b8fcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function leadingUnquotedSqlKeywords (cyclomatic 17, cognitive 36): leadingUnquotedSqlKeywords has cyclomatic complexity 17 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0733500a10d783ac5d267c9b34a707b0b6d15d8a8ccf8a9ca666c7f780645c91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJsonSource (cyclomatic 17, cognitive 33): decodeJsonSource has cyclomatic complexity 17 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":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fc53fecad5ed5f55822d9a6585be6e4bacdb349269cf79c0835e80e725e5cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maskTriggerCommentsAndStrings (cyclomatic 17, cognitive 31): maskTriggerCommentsAndStrings has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd65207717e89e3f19ac49a16eb7c2066aa900fd2e7dc9e77527c821f3921e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function escapedTextLiteral (cyclomatic 17, cognitive 30): escapedTextLiteral has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81f7397c0d5f67956ef66bb1c8608c762eb0ca899ed17d756d7de01c9562df3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeMyBatisXmlComparisonEntities (cyclomatic 17, cognitive 29): decodeMyBatisXmlComparisonEntities has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9993c2cd130f375a29521e421ab35ca06bf86f50951273407238fcefb3d25b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function persistConnectionDeletion (cyclomatic 17, cognitive 29): persistConnectionDeletion has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10901}}}],"partialFingerprints":{"codehealthFindingId/v1":"b764dd6316175df76187620d80aaaa54802cfbf250b849a5352f096ee466240e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareParsedUpdateVersions (cyclomatic 17, cognitive 28): compareParsedUpdateVersions has cyclomatic complexity 17 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":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f741fe16094d25e6b69d96073665ce4eec5e4b15772f757310495d5485d8e359"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatLooseJsonText (cyclomatic 17, cognitive 28): formatLooseJsonText has cyclomatic complexity 17 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":"apps/desktop/src/lib/common/looseJsonFormat.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"584b192d5c8963a68354a8ae635c4125a39c5425258e45900abda915e1bb59bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandArguments (cyclomatic 17, cognitive 28): commandArguments has cyclomatic complexity 17 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":"apps/desktop/src/lib/redis/redisCommandDocs.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b81b5a102bcd625c61b267b6b6f96888c32ce59f47ccb7976ed71db79c09b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 28): (anonymous) has cyclomatic complexity 17 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":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77bee004128835196cd5f9e925094d53586b9c845b696c0a8f26a15841e1c92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlErrorDecorationRange (cyclomatic 17, cognitive 28): sqlErrorDecorationRange has cyclomatic complexity 17 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":"apps/desktop/src/lib/sql/sqlDiagnostics.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d913d5c1664e1a1b080e65f0d4ef60676dcff7ba1fa287e8415cb3302611a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 27): (anonymous) has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/__tests__/PlDebugPanel.refresh.spec.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfedef9111e7cb859c57f1cd8ab6304e62c2453171288c04862653951df5176c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 17, cognitive 27): execute has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f539a352d8aab2afffbaa05ad3646eba370470e90ec1e454ae64f981393e06d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveEditorTheme (cyclomatic 17, cognitive 27): resolveEditorTheme has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/editorThemes.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1468538cd9221d0ae94dd0c362633690408dde7ca23a9806aca81d03611585b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 26): (anonymous) has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/__tests__/ObjectBrowser.oracleTriggerActions.spec.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b955b8b6ebc28e1badab0d3e404f9d2bca837b6695c299e42080d4498c3c645"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractHierarchicalLayoutResult (cyclomatic 17, cognitive 26): extractHierarchicalLayoutResult has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/elk-layout.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8f499f969bf0ca87579e1a0d60497307adc7843ee236d0d977998d9f445d95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 26): (anonymous) has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dolt/doltVersionControl.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5743fe5958d2102c32e54216f0027130789c621e78df20e3bf019536ef65e6a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 17, cognitive 25): load has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguServerDashboard.vue"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa67e4e8d5fa77658aa40a1738ae0d45ad6f9fd71fbe69cc92d0524eed5680a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSchemas (cyclomatic 17, cognitive 25): loadSchemas has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"37602e56de4ab9be66d4bc30b5763ac02736e4782060aabdd0375f053287d366"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAllOracleInvalidObjects (cyclomatic 17, cognitive 25): readAllOracleInvalidObjects has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleInvalidObjects.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7623977a9dfd8b8c3fe61d560fdf6317264cf4b8a6ea0cc639284020252a243"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trailingIdentifier (cyclomatic 17, cognitive 25): trailingIdentifier has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9a096bd65ac160ee72821208dac3969ac7bc2af772cc8f8ae4dfb35b2eb714"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completionColumnPrefixCandidates (cyclomatic 17, cognitive 25): completionColumnPrefixCandidates has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6077}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cfc177858447a49ee98e23be18e759ad782cfffb6e0e2b473264e542f2e50d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sortTablesByFkDependency (cyclomatic 17, cognitive 25): sortTablesByFkDependency has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableDependencySort.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4048260fbb7f5876d5611a61394bd78bfa8f094b8f7bb70a945c259933e02c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setBreakpointEnabled (cyclomatic 17, cognitive 25): setBreakpointEnabled has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c6a82a03b007c9d56a970100221133ba48a9e8deff4800ee0830a6625604c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 24): (anonymous) has cyclomatic complexity 17 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":"apps/desktop/src/lib/database/__tests__/oracleSessionDiagnostics.spec.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed5157040c9815d67387864eb6f3f981761b6b108341d4fcd63896b8cf5bc98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printStatement (cyclomatic 17, cognitive 24): printStatement has cyclomatic complexity 17 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":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c607d8cb1d98229e82dada443e11bc99685520cfe5ca3c9c26a7d1c52420db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyMetadataBatch (cyclomatic 17, cognitive 23): applyMetadataBatch has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca8f93c917b6d2f4a345c9f6c900e6b0c75b7a6a81e02181c0f211aa239ca30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadObjects (cyclomatic 17, cognitive 23): loadObjects has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99c13f41aa0ee218f639ec599a5bb0a32bf318d160160148ff4f29194197973"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 23): (anonymous) has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/table/oracleViewRename.spec.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e578c7885466ff1f78bce28e8484a6ed24ce0c306de0dc79b09e1429e22b1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNumberToken (cyclomatic 17, cognitive 23): readNumberToken has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"758e5be2b47a4cf0b671f46fb60efc62597a41709ae2f741bdf9eb95c97db44c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pluginConnectionFormValues (cyclomatic 17, cognitive 23): pluginConnectionFormValues has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5281e46e382abfc67c0efab6d0b6b41c662cf15c336a00f69e83f4e8421074bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sidebarTreeArrowAction (cyclomatic 17, cognitive 23): sidebarTreeArrowAction has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTreeArrowNavigation.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc47b0a91b2490ff8addff5a48fc86654d5b9b53afa1443c77ea6fd23198d71a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findCteColumnResolution (cyclomatic 17, cognitive 23): findCteColumnResolution has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/cteNavigation.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe628d4cdb208cd63c789247927ec0b353b681fc784d32020a195f94ade9fcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildStarRocksLayoutCopyDdl (cyclomatic 17, cognitive 23): buildStarRocksLayoutCopyDdl has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksLayoutCopy.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"984fa607b2b18029c33375068225b02bec9fe51493786498201be6fa78545094"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 23): (anonymous) has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app-tests/queryStore.test.ts"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"2863c1f45799614e533213b3ccaf4f895607a5f4aec6fa5a59b9def825505d71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 17, cognitive 22): execute has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoDatabaseDumpDialog.vue"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8747aafd5478f265fdd24f9f6b87a398fc6abe25da1bd033a453c6499ac41e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultRequestText (cyclomatic 17, cognitive 22): defaultRequestText has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/vector/VectorBrowser.vue"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aadc7eb4b9289bf5cd2ed8dc27181562e7be90e8ddd6fa546d18f79bb9820d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapEntries (cyclomatic 17, cognitive 22): mapEntries has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandDocs.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a0228cc08375991a10440bab6dead850d4d5bdb0ab089dd4c8b6fb78ffc5b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildXuguTypeMemberNodes (cyclomatic 17, cognitive 22): buildXuguTypeMemberNodes has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/xuguTypeMembers.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a2e140e7485f3e29a961b500fbd6ebf9df4e6fe0cbf6bc3135c75e1090addd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSelectColumns (cyclomatic 17, cognitive 22): parseSelectColumns has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"85190a0456d0926feeb36be71c3849bf2cae6cad811b4dad220aa3d8da1bbfdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trailingGapIsWhitespaceOrComment (cyclomatic 17, cognitive 22): trailingGapIsWhitespaceOrComment has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/statementDelimiter.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee01557ddf32a75bb8c823277e4a1fb09eccb2086b76eabb8d27cfe69455888"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cancelTabExecution (cyclomatic 17, cognitive 22): cancelTabExecution has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10770}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f1e499bcf20591ed8c44d235f4072d9a3e35d1aff6e5314851d151c842f614"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeydown (cyclomatic 17, cognitive 21): handleKeydown has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/shared/RocketMqTopicSelect.vue"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9672bbee6aed3928cbcdac49bcb358e037b5fae1272c956e2577e44499898f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureOceanbaseDiagnosticTarget (cyclomatic 17, cognitive 21): captureOceanbaseDiagnosticTarget has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c9fefff2084fe73006ca05e061aee5ba626a8ea4243ebf3bd1f61bafc23062"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requirePluginDataQueryRequest (cyclomatic 17, cognitive 21): requirePluginDataQueryRequest has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a0a4a6faddd07dcabb5e080252cfd7bcc2385c485c1cedfb1f2e43e8a2ddff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildJoinConditionItemsForPair (cyclomatic 17, cognitive 21): buildJoinConditionItemsForPair has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6518}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ea3a1029727c6a733ab2f4794b5b73d96f9f1468f30826540c48dbd2d804d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function xuguFunctionReturnType (cyclomatic 17, cognitive 21): xuguFunctionReturnType has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7427f4288017da3e81608d1184e1a554eed5d35969c30fcc2f1f777c8dfe80f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 21): (anonymous) has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a5efa361c7b62527487ed471eff692e9755973ae6d02712a40f724802d30ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 21): (anonymous) has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10582}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf0ee22faa9685f2a44ec9cfb7b909f15ca28984761f87b232d8a81c89ad678"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localizeManifest (cyclomatic 17, cognitive 21): localizeManifest has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/ui/i18n.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84f5e737496491ba0430cffa339ce002e35b4b8a92386f5014190cbff548fdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractToolResultContent (cyclomatic 17, cognitive 20): extractToolResultContent has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"734e76671025953a3dffc83829ce3bcc307acb81e8efcfa76b4faa157247e363"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openStructureEditor (cyclomatic 17, cognitive 20): openStructureEditor has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeToolRuntime.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5195fd23cfdbe3ee079a879d10eca5c15da491f99783ce53d5a66f0db3b9fbfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generatePhone (cyclomatic 17, cognitive 20): generatePhone has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c054a0334cebdd627015ccb3092287bb5925cd707fe138c061d98485c21269"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executableStatementRangeAtCursor (cyclomatic 17, cognitive 20): executableStatementRangeAtCursor has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/executableStatementRangeCache.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"125f1b5dd21c822ffe3fc90781c43ae07f19ef2ed7945a066f75029af07ea440"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 17, cognitive 19): save has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":7127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4448a70bf1a70f4fd6d441ab59751352d5ed56b41cdbafd9d0e52a99dcf5b1db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detailsRows (cyclomatic 17, cognitive 19): detailsRows has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26f8e754f9d9829ef96963712086f8f2de5bb2a1d520ec1cd60a06e355b5c18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nodeContextMenuItems (cyclomatic 17, cognitive 19): nodeContextMenuItems has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"60154fb43a7d4b51705ae46470f58ba229d0948a4c1ef76d71fd7f42c7819891"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleConstraints.spec.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5511328a4826712319ebfdd4379c3fa7ffebe4004b6bce069c79acdf43a178fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureOracleDiagnosticTarget (cyclomatic 17, cognitive 19): captureOracleDiagnosticTarget has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionDiagnostics.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ed5758f90b782d62b17bad317a05aeeb337fcf69c0651dd7392a2c273178a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJdbcUrl (cyclomatic 17, cognitive 19): parseJdbcUrl has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/dbeaverImport.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e6979f03c3306332c550c0d1c8e858cd338a21a6fce97edda6daa7e252e61c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildAnomalyDigest (cyclomatic 17, cognitive 19): buildAnomalyDigest has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e2af9a2cef0ec4e6f15703442dc32a46a9a2bf49db0557f92e052a00e95fe5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTableVGroupDropTarget (cyclomatic 17, cognitive 19): resolveTableVGroupDropTarget has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTableVGroupDrag.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7709ee026a87e7269abf1662008d28cf30913a7d08ff5f135d4e983fa41a732"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editable (cyclomatic 17, cognitive 18): editable 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":"apps/desktop/src/components/admin/NativeJobDefinitionEditor.vue"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83bc9339f6a4f8f6be10b7c1e00aa755d37844b7208319d78e3a533e05727cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPrefixSuggestionKeydown (cyclomatic 17, cognitive 18): onPrefixSuggestionKeydown 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":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"526727fddfeb3d1bd876768b37353f30f437cbcd86fd288c2dbcd1d2b7449008"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 17, cognitive 18): save 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":"apps/desktop/src/components/graph/GraphResultView.vue"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"640fe49e436f7cd4858f87137e06543aefd1926f1432feab7ff10bb275cc9aeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderLayer (cyclomatic 17, cognitive 18): renderLayer 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":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"234ccd3bd659fe63716821afd4a677e5497e79a283ef4c3e0877cf6519dd54ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typeLabel (cyclomatic 17, cognitive 18): typeLabel 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd4a38214f3acdbca008111b0b650d684563dcd79804755d040aa77c054b148"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getObjectBrowserActionMenuItems (cyclomatic 17, cognitive 18): getObjectBrowserActionMenuItems 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6467}}}],"partialFingerprints":{"codehealthFindingId/v1":"564fcda9f410600fae6e71e17a3faaa2c1832bbb56b370ed380b7c6880ddf541"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadWorkbench (cyclomatic 17, cognitive 18): loadWorkbench 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":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"48303976ec6f3eb010e89aba499c39ca2a82d3aca6c6e47c1cce36eff5f99370"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentConfig (cyclomatic 17, cognitive 18): currentConfig 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":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb4d9e9e994a299383c8ce774824c697d7a6ab3278981baf7e22528db3f92c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function performLoad (cyclomatic 17, cognitive 18): performLoad 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":"apps/desktop/src/composables/useDataGridDistinctValueLoader.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d973027546c56f5fe10bd7993d216643bfe7810293aac45dc424bb19cae3da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cellXml (cyclomatic 17, cognitive 18): cellXml 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":"apps/desktop/src/lib/export/xlsxExport.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f47fd9a52ad8cf3af7519588ee88c5ddad4600a9f587620f5b2451f3492140"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isTableListContinuation (cyclomatic 17, cognitive 18): isTableListContinuation 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":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa255f6cfecda97605e1543f4a833a73318395f399b0963fb49ba9897716cb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCachedMetadataListPage (cyclomatic 17, cognitive 18): loadCachedMetadataListPage 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"055bbd4c5a0d118e4082a5388e8466ba42fbfe9bbb32d6c299c1e827b0379008"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 18): (anonymous) has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6054}}}],"partialFingerprints":{"codehealthFindingId/v1":"285014a2b18c02bfa4f0b7a6baeb51427f1ca6031f81628948c26e43a1af33a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adoptDetachedTab (cyclomatic 17, cognitive 18): adoptDetachedTab 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"939743e25c0c29b211196c91b8a325b87f695b4c9df4d5341a881139beac187e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onCanvasScroll (cyclomatic 17, cognitive 17): onCanvasScroll has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9037}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed994e5fe9b6a545ace7a748c979ba33185fca12e1061f3d375cb710fc5d607f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryExecute (cyclomatic 17, cognitive 17): tryExecute has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e4dd6d7b03b5398b8b487a15177ac446902bb9dc926c7a43dec5e30472e38c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchDatabaseSearchColumns (cyclomatic 17, cognitive 17): fetchDatabaseSearchColumns has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseSearchColumns.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbb79b3dd45e09dd0de3dcccc12dd6fa8236c1f5b226144133ad5906b574e6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unwrapVueProxies (cyclomatic 17, cognitive 17): unwrapVueProxies has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginData.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cee9a70f1d0c547ec2a858c963a67dc99478874f1c173a2a93999ff2e1ac549"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMongoCreateIndexRequest (cyclomatic 17, cognitive 17): buildMongoCreateIndexRequest has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/mongoCollectionMutation.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02414650dc03ac1a9a52b3c2132798cbb199e0b350be11d68b55b24836f72c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendSelectProjections (cyclomatic 17, cognitive 17): appendSelectProjections has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/editableQueryHiddenKeys.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a0c705e62fec4f2d0d8faebe66062b85d1289289a386ded26cd5aeb3d40688"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCompositeHeuristicJoinConditionItems (cyclomatic 17, cognitive 17): buildCompositeHeuristicJoinConditionItems has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6611}}}],"partialFingerprints":{"codehealthFindingId/v1":"9798cc564794a495946f6c60def34a6cd89e86546ba8b05003a8133446215385"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 17): (anonymous) has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sync-connection-types.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25f4365abb7c1dfe27344de44ce55727f79f8a391f207ff25833730ad2b9ac2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyConnectionDraftToForm (cyclomatic 17, cognitive 16): applyConnectionDraftToForm has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6641}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d2c3fbe32b89bf3a76a6282c0cf4f755ae97617066e1494844c3bab01bcb8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSelectedKey (cyclomatic 17, cognitive 16): loadSelectedKey has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4a3d1be69b25abc992d86275a63b9a347d35a4b3a544604663ca42302e3145"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncCurrentSave (cyclomatic 17, cognitive 16): syncCurrentSave has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe835c339af4fa90a454cb51fdd9341748bab9d553aad1761e077fa5fc1d8b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function standardUrlQuery (cyclomatic 17, cognitive 16): standardUrlQuery has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee465903ec3c8c2b4ae2a3fa58e58097293d4c536cc14a8bedaabb897c6c093"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1139a74519eb0284034a2d3023db3d9538ed7246f56ebc69d8669d556b410c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSidebarObjectKind (cyclomatic 17, cognitive 16): normalizeSidebarObjectKind has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseObjectCapabilities.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d964d8e7ba96e2aa1964e4bdcd617c88cbe107d0f830d2ba56b6c3af0eac57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureSidebarLayoutSample (cyclomatic 17, cognitive 16): captureSidebarLayoutSample has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"6598961c05f2107713ddd125b9165b2ce0ff95094eafc8239fbbeb81f3bbf213"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPersistedTreeChildren (cyclomatic 17, cognitive 16): loadPersistedTreeChildren has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3622}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aacd618319193997f59c4f1cbd23a1206692ff4e22d00a7ab9826269a2f349"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8838}}}],"partialFingerprints":{"codehealthFindingId/v1":"facf2adebc2e180d36acbb3b0a75da2aac011de062777b2ede95c17c0e190567"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8078bef84929eaf6ed89ecb0d7b94381f59bf9af41153a27a327dd104c11e4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveInheritance (cyclomatic 17, cognitive 16): resolveInheritance has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11023}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc0e42f1a1a3067a32d43b646599da5b8fa4c7518dd7f3230ee2b28164a6a88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadMissingTableVGroupMembers (cyclomatic 17, cognitive 16): loadMissingTableVGroupMembers has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b6d6e8b7057dd2dc0d47bba34278d8f976f3cc4920c24277ff0c3c7ce32d30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeDesktopSettings (cyclomatic 17, cognitive 16): normalizeDesktopSettings has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43c75f34311d8636b8502e82113b21e8922f3f9fdc2f4dec65abb3590f71e83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeToolbarItems (cyclomatic 17, cognitive 16): normalizeToolbarItems has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abd7162f9dd24fbe8f309f10d4b1d7575a00a4dde18ae793c670c1c07cd2880"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncBackgroundTask (cyclomatic 17, cognitive 16): syncBackgroundTask has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/tableCopyTaskStore.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"258212dc46855cfb2665f93343d2250c561f15a2644b6c0ae0545523ab1e77d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showLocks (cyclomatic 17, cognitive 15): showLocks has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"55908065f1d2e114385a1b4edddaaf132b5f0e891584597548f60a087bf5c182"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completionCacheKey (cyclomatic 17, cognitive 15): completionCacheKey has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1d24f9a39868c97a280ab8e79b14b3e38b7755510d33b49807b1f1f815d435"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestExecuteFromView (cyclomatic 17, cognitive 15): requestExecuteFromView has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorExecution.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be8a80644fccf8d86f977378eba15ee8631caf293659d97a649e62788eddf9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onEditorMouseDown (cyclomatic 17, cognitive 15): onEditorMouseDown has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ef67866386f48bff515f46563d0fbc604ac49bc124b396e1c827c86b234036"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structureChangeOptions (cyclomatic 17, cognitive 15): structureChangeOptions has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3442}}}],"partialFingerprints":{"codehealthFindingId/v1":"322729b78b51703bc66036b001434e4726aafe069f8903ebb773d0b8930d1353"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function binaryCellDisplayText (cyclomatic 17, cognitive 15): binaryCellDisplayText has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/binaryCellDownload.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3f68769dff61e27f89c7d7d0abfda23d262ee06f18f1670e3ef60641fce276"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expectedCreatedIndex (cyclomatic 17, cognitive 15): expectedCreatedIndex has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"598dc58f90415bc31f29583bb2b428ffed627450843d32e6515c4046ae8f5a15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 15): (anonymous) has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cfed3ad44d218ad4317d8d8e580f0ddee27de3bc54eb6671171c272bdff5ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitNode (cyclomatic 17, cognitive 15): visitNode has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/semanticSelectionRanges.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fd481d3b7c0eb04f1cc1fda71308ad8fee0a2694510b96a0422c0fe35329b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNextEditorToolbarTier (cyclomatic 17, cognitive 15): resolveNextEditorToolbarTier has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/editorToolbarLayout.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecb6eae63f30ba93f882c56d16373fd3c2f6e0c3075e48af070141edd4856d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 17, cognitive 15): execute has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4996c19f3c43d80ae4760aadc6790457d9da11dc63fb4480779b29b70cb3b22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearQueryResults (cyclomatic 17, cognitive 15): clearQueryResults has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"940377e9c08720b3f7b9930aad5e79f196166e55f8e7ecfaaf8fa8fce3dfa89e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSqlSnippets (cyclomatic 17, cognitive 15): normalizeSqlSnippets has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9db9d0c77152bedfb2a7df429dabd05deff52ab65e7b33e6cae14e07383b94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 14): (anonymous) has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2e46b63060c4393abdbc55b6295bef5cac694aef14090f2f3a50f36366cdca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverDetachedTabsToMain (cyclomatic 17, cognitive 14): recoverDetachedTabsToMain has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5834b7a55bb171cc5edf716749e394b01b899b69effbc2bb7c7bd8cb9f85ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeSql (cyclomatic 17, cognitive 12): executeSql has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb80ccc0e433a42e97776e6e6f290c580ea03235176fd8abae4e97fc5e2e682"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitInstanceRegistration (cyclomatic 17, cognitive 12): submitInstanceRegistration has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2596}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea294c4cab54b282831f58075ea322371e1e1d0489f9d9f326c65827c0061256"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 12): (anonymous) has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/__tests__/OracleInvalidObjectsDialog.spec.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e3050beff46e63c08271c51ceb29e31e90cbc91a074a57dcaeb2d612f039de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 12): (anonymous) has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4490}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d046c11af04aeb0454dc1769f5f6e307cb2800f3d5ded31ba0b1798864e4a08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validRfc3339Timestamp (cyclomatic 17, cognitive 12): validRfc3339Timestamp has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/influxdb/influxDbV1Delete.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c6e80d2b4aeaa2d3ff479fc7bd0be8e1bda0cc69627a728bc8001c42872e0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTableFunctionSource (cyclomatic 17, cognitive 12): parseTableFunctionSource has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb70d6ce0538ce8c232011b6954d9360dbb849de8a890763af75b0a02c565ef1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStandaloneSelectWildcard (cyclomatic 17, cognitive 12): isStandaloneSelectWildcard has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f6e766b5e47e2a0c813dae0c1104c8f7fd7f444d4ddc4196dac48bb720445f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareSqlCompletionReplacement (cyclomatic 17, cognitive 12): prepareSqlCompletionReplacement has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f35a8c38c2df11154af3e7190130c8c2eb68030b9d3085f7fadaef9f2cf6f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routineParametersQuery (cyclomatic 17, cognitive 12): routineParametersQuery has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a870918faaa3147907c6dce81b9a27eba936458bab2f1965d71cd879f3bc489"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateFileExecutionTarget (cyclomatic 17, cognitive 12): updateFileExecutionTarget has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"e436b18e30a9e9cdf1737e2db36bc72337d817ed648b87819adf8219874fda9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function performDrop (cyclomatic 17, cognitive 11): performDrop has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c223d394a292027241632b49d3f5c27619274bc23e0b264aecef250d31a2e3f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 11): (anonymous) has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3086}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a256a4117790ecbfa7d831f43e34a00a9228e1337f8d4d3d9ca2b8fd74bc45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 11): (anonymous) has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":7854}}}],"partialFingerprints":{"codehealthFindingId/v1":"3245629cab1403b4f68d135cd6db18073014e6ddab141210a5f1ea5208b19292"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function performDrop (cyclomatic 17, cognitive 11): performDrop has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/TransferTaskTree.vue"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8cfad568b15b08bc3b2e30634f123a2bf52bd28438a7c1890f78752e027f96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateByType (cyclomatic 17, cognitive 11): generateByType has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3feb41b65f2e7a768f357756738d9e19c1d6f13fa34d55a374c5c6011ea5f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizePluginShortcutSettings (cyclomatic 17, cognitive 11): normalizePluginShortcutSettings has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginShortcuts.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7893343ff5d8c10c931e93fb0acdf3b181d0c8da3d41cbe6f97c3b08f95cc19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildElasticsearchRuleQuery (cyclomatic 17, cognitive 10): buildElasticsearchRuleQuery has cyclomatic complexity 17 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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d097d487750d798f3c2063315fa6b2fa48ce0e969e908abaa2d247fc81d4f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function elasticsearchJsonResponseForResult (cyclomatic 17, cognitive 10): elasticsearchJsonResponseForResult has cyclomatic complexity 17 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":"apps/desktop/src/lib/elasticsearch/elasticsearchJsonResponse.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"454af128f9ee95a2eae1b2d71a503422471b42120fa392ccdeeec00981a035fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 9): (anonymous) has cyclomatic complexity 17 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":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37acdea42fc6074bc4408c87748715a5b37c552202b82a9999c779581dafdaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adoptDiscoveredSession (cyclomatic 17, cognitive 9): adoptDiscoveredSession has cyclomatic complexity 17 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"52df268a62d50c3c7522c7a76b0341aa40376f33f41a8f92a0d653a4d8658828"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 9): (anonymous) has cyclomatic complexity 17 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c6ddde9dca95e758fa16a19e8a1122d294e9793b4b0bfb2638e85244c489be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCombinatorSequences (cyclomatic 16, cognitive 60): buildCombinatorSequences has cyclomatic complexity 16 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/clickhouse/aggregateCombinators.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed14dc8738e82b993c7b9abf4a593c4d6d2fc3cf491ed7162c6f8c33c701da6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markers (cyclomatic 16, cognitive 40): markers has cyclomatic complexity 16 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorTrimmedSelectionLayer.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"334be24e14a9865ecf68284eea4c50cd69ae3333dc0ffa2caf98d1af3d30291a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 36): (anonymous) has cyclomatic complexity 16 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10541}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71b3be3b81f71616d4f18b6539555056f3635deca7acb7cadedc86b3333e730"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 16, cognitive 33): update has cyclomatic complexity 16 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":"apps/desktop/src/composables/useScheduledDatabaseBackups.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cebb1bafc2f4a9f38281c7e6109b8276b5a1959da3055dcfc49af620b1f13f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitTopLevelAnd (cyclomatic 16, cognitive 33): splitTopLevelAnd has cyclomatic complexity 16 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":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccc93d295b41d122c94db69c455ab1e5e60495e437a4c38fdec1cdf2128930f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flattenElasticsearchMappingFields (cyclomatic 16, cognitive 33): flattenElasticsearchMappingFields has cyclomatic complexity 16 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":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bd881772ccaa16c46a03e8267868ac1b2948e7e4994e9b557318bdb4b5c953"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripPlSqlComments (cyclomatic 16, cognitive 32): stripPlSqlComments has cyclomatic complexity 16 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/plDebugAnonymousBlock.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"833957269ef22013f6d03d9d762c8470ca5e732b5e9670ab9d1bc52333f3006f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function argumentTokenItems (cyclomatic 16, cognitive 31): argumentTokenItems has cyclomatic complexity 16 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14043a48f63303661aa78e7f6e9d6b05b9b881c2eeada8a5e5a0d7fbe42f79a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileRedisGroupGlob (cyclomatic 16, cognitive 31): compileRedisGroupGlob has cyclomatic complexity 16 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyGrouping.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c483bb9ccb88ba13fa8062ab3fe1fcbc21f12632357da096a5982e23c40ad667"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDataCompareSession (cyclomatic 16, cognitive 29): runDataCompareSession has cyclomatic complexity 16 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataCompareSession.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1154883e2be4f4fb792727c07429f835bda3fd4abdaf5b337bcd5a176223b89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function firstRedisArgvUpper (cyclomatic 16, cognitive 28): firstRedisArgvUpper has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandTable.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd933953f31b49b52e63f6c4c47ccfe4daac909ada9cdd38ceafd8fd96e68bb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function advanceMysqlRoutineBlockCompleteness (cyclomatic 16, cognitive 28): advanceMysqlRoutineBlockCompleteness has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70901512e29b23b2d6731728268ba4ae4045394216608746a6b63c758b3a6bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamInsertTable (cyclomatic 16, cognitive 27): streamInsertTable has cyclomatic complexity 16 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGenerateSession.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5746c5254043aa10ff4b79d7f28b0f56586d902527f2b7b11d465e0dbc64b990"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function referencedDatabases (cyclomatic 16, cognitive 27): referencedDatabases has cyclomatic complexity 16 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"de60154dfb904223610b94de5273cbc27b6bc119a74fa8efe7aadb3381035ca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmSaveSqlToLibrary (cyclomatic 16, cognitive 26): confirmSaveSqlToLibrary has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3007}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e45ffebb268517cbca1e8cfe9fd8510f4b18f40146c45f7a9a25a70ae59662f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectComplexTypeFieldSeparators (cyclomatic 16, cognitive 26): collectComplexTypeFieldSeparators has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"271b77579d4fcd961e37eb28885434bc2bcc2fc5c400709f7515c2b780f1d9eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isMongoRegexValuePosition (cyclomatic 16, cognitive 26): isMongoRegexValuePosition has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0626af96390dff4e93db1b7952f196defc17de9aef892b1186abd3a8f31806a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 25): (anonymous) has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"9410ddae781090ba28d5c6c357548c60f7d11ada0959cd297617b34d520c31dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refresh (cyclomatic 16, cognitive 25): refresh has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a1c389b96f3a24983ea987be1c9ebcc51758be49dfaecdd5eda1d3659576bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanTableRange (cyclomatic 16, cognitive 25): scanTableRange has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa6160bfe7cb537e6c4a1c17ea425551429a142ba13b1ee73c2390492c5fdc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasTopLevelSemicolon (cyclomatic 16, cognitive 25): hasTopLevelSemicolon has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb7b3921a292fdd52f7b4b3dbc50c9f46fe19201ced639c4cba62ac7a148424"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function continueExecute (cyclomatic 16, cognitive 24): continueExecute has cyclomatic complexity 16 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":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a16e9d8dd60412100a9bcbb2fe4a05f806dceca683d2a3f47eace1171e810d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOracleForeignKeyCreatePlan (cyclomatic 16, cognitive 24): executeOracleForeignKeyCreatePlan has cyclomatic complexity 16 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":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"443495b3cb9b9509ef97cc2aa78f6a47fabfd61dbe4aba1386d5ce9bb71f10f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reformatHoverDdl (cyclomatic 16, cognitive 24): reformatHoverDdl has cyclomatic complexity 16 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":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a22ddb13e54a82b6658d10bc2ad0f9f7578e4046b8a1e0bdafa1fa5f8c1cf78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function comparePrerelease (cyclomatic 16, cognitive 24): comparePrerelease has cyclomatic complexity 16 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":"apps/desktop/src/lib/plugins/pluginMarketplace.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d356e5d2cc96d9cc413d75ea8b6da87549ab9b015f046dc9157c8b225fd881"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterNodes (cyclomatic 16, cognitive 24): filterNodes has cyclomatic complexity 16 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":"apps/desktop/src/lib/sidebar/sidebarUserAdminVisibility.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b56822df0b4b9529fba09abca3d4154ea5b3c172cbe9f556181e10dd8caf4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeSqlServerControlFlowBatches (cyclomatic 16, cognitive 24): mergeSqlServerControlFlowBatches has cyclomatic complexity 16 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c367c68e395def2b6ea540f49dee734476774baf6c8b81d2352b301aabf6917"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function previewActionTargetSelection (cyclomatic 16, cognitive 23): previewActionTargetSelection has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":7658}}}],"partialFingerprints":{"codehealthFindingId/v1":"4800b5a743ad7e510c8fa6c262e27151b4bb2d5cb3b8c981196ec93f1af7c39f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextSqlWordToken (cyclomatic 16, cognitive 23): nextSqlWordToken has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"27919775ae567481dcb4ac3cbe56906bff54a338b3c5dbf9f50f631068823a2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 22): (anonymous) has cyclomatic complexity 16 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":"apps/desktop/src/App.vue"},"region":{"startLine":5404}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a547b0b3bb94ced43f2c20ec230d72daa46318a9d6db14e6c266a593582410c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 22): (anonymous) has cyclomatic complexity 16 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":"apps/desktop/src/components/debug/__tests__/VariablesPanel.context.spec.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"226e22a1bb9ff847b2fd373d6f8cca3e873301eb010405ec67b2006236e6c9b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 22): (anonymous) has cyclomatic complexity 16 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":6341}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a356ebe503fe96af99c4eb5979abeefe27f4d2114b25e829d436e3ec716240"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyColumnSort (cyclomatic 16, cognitive 22): applyColumnSort has cyclomatic complexity 16 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7534cb084920d1fad01bc0d8901f561f3e6e104ba25df3f903dd1611cdd5f04e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 22): (anonymous) has cyclomatic complexity 16 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":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb60543d969551d984931435ae3b6bb3889b51dfd09e19a1ca690f7c1f0964f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function standardUrlScheme (cyclomatic 16, cognitive 22): standardUrlScheme has cyclomatic complexity 16 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":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdc42056d565b14f25869e61c6b870d63d4180ce0b18d46a25a235990a37198"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipMongoStringOrComment (cyclomatic 16, cognitive 22): skipMongoStringOrComment has cyclomatic complexity 16 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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb8e7456ddf429f348659d01e4a8689304ab0414f43fc3581807a0d9aeb1096"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeTabGroupCustomizations (cyclomatic 16, cognitive 22): normalizeTabGroupCustomizations has cyclomatic complexity 16 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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0d8f13f8f2d139982ee58ab5577ee9506ad128dddb1c009aff9e209d4661d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 21): (anonymous) has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugCompositeEditor.vue"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"386e41f918ea8aa4ccaef45411c6314341d344c5220af73d7702c28a138ddeef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function putOptions (cyclomatic 16, cognitive 21): putOptions has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6151e484e4e13e4033a98ed41bc9ecbcf6d47b5ed3fe969bc869a20470d0bf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTabPointerMove (cyclomatic 16, cognitive 21): handleTabPointerMove has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dc0329d2c7d4f541020d4e3f7da1ec8709e84052e71bf9b3df9270c2fb3fc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyBatch (cyclomatic 16, cognitive 21): applyBatch has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9446aabf75ff73d7ce0d578da1071795b1f58d056846eafcb8636ecec1cdb8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openFloatingWindow (cyclomatic 16, cognitive 21): openFloatingWindow has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a37a5af7baa49e480afbf301f31fed3f80d4d6ea876619e70104ecc0738dbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatCypherText (cyclomatic 16, cognitive 21): formatCypherText has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cea14225588635ab4d977bae1197890b948173759808701635b22e6f302f95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initOpenTabs (cyclomatic 16, cognitive 21): initOpenTabs has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2904}}}],"partialFingerprints":{"codehealthFindingId/v1":"3342554968e5af3025a0ade109f254f3d6e65dbddd106e4a2de772ed1a45c770"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishRollbackTransaction (cyclomatic 16, cognitive 20): finishRollbackTransaction has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc2e5132a7b121c672eb16645565563b289cca1a0cd326c270ff76eefc64a6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportData (cyclomatic 16, cognitive 20): exportData has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"b704f0059f9d10319890624bdeb50cb82c479ff26243c875ce53c94217dc4ff3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapStructureSearchRows (cyclomatic 16, cognitive 20): mapStructureSearchRows has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseStructureSearch.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d07c3e27f2c56be028da8f55d50341920773f7b828044ba024effb22957ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOracleCompileSql (cyclomatic 16, cognitive 20): buildOracleCompileSql has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleInvalidObjects.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acf00a46099da62ff2be4aa63cc70ca92fbf2c6e24dd01b8bf4413a55712172"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlObjectNavigationTargetFromIdentity (cyclomatic 16, cognitive 20): sqlObjectNavigationTargetFromIdentity has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ec2e2c1f19e0595d81ec3a9d53ce703785be3b80f2db19f58b4691c4e1f595"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSidebarTableSearchIndex (cyclomatic 16, cognitive 20): buildSidebarTableSearchIndex has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4236}}}],"partialFingerprints":{"codehealthFindingId/v1":"86531652b45a0b9d1009f4152645bdee6a86b99ea0bd5d75571184cc6aaf8175"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scrollCaretIntoView (cyclomatic 16, cognitive 19): scrollCaretIntoView has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridConditionEditor.vue"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f907691c029bcf3afd84f38d860fbc9da59860fcd41e98ae3a6be6d34c59e3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPreviews (cyclomatic 16, cognitive 19): loadPreviews has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8ecdbc8f603318ce4b106e5b12e9176ce78468c7fb7ea2f1605e435c8b5992"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncSubmenu (cyclomatic 16, cognitive 19): syncSubmenu has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/CustomContextMenu.vue"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d52a6f104d9d6339f62e7b1d08482d0f31366c4b529b159fdc01b96b0267d0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreCellValue (cyclomatic 16, cognitive 19): restoreCellValue has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ccea70029bdc4a51bebc61c26f844a360c1cc0a1a4726c0aa57aa6ad81bd4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 19): (anonymous) has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"291b042cbcf5299955be286e0f9f3aba09c455321dea4da44d081fde0a5adcc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSourceAdjacentGap (cyclomatic 16, cognitive 19): isSourceAdjacentGap has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2837}}}],"partialFingerprints":{"codehealthFindingId/v1":"378e3101ee660b8ccca3fcd94b074c41d10adf8d05c08be9eb2ade02beed4e2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 19): (anonymous) has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app-tests/dataGridColumnFilter.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6159fe269acec9807df9d193ca520cddc888615063f4ffa1cdcc178e1f5dd40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectOptions (cyclomatic 16, cognitive 18): collectOptions has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/__tests__/MongoImportDialog.spec.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9c20319c0fd9a7fbaf15652caadc18883de9107ee8993e678db5acf0a66d3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openExternalContext (cyclomatic 16, cognitive 18): openExternalContext has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6618}}}],"partialFingerprints":{"codehealthFindingId/v1":"66746e69c0c3ed7b6f76c7a28117d7015affd0ae20c8f86e12f766ab89bf0a54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateMatchInfo (cyclomatic 16, cognitive 18): updateMatchInfo has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSearchPanel.vue"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c891037add9ad36d6d2ee3d77dacb5b50c1ba91e9e3abe95115b23a36548956b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 18): (anonymous) has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosConfigDiffPane.vue"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9e0225c693eef2c868cec9f51f6fd7de07250b3b1f20b83c6dfcd269266d1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmDropDatabase (cyclomatic 16, cognitive 18): confirmDropDatabase has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":6066}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0136a3d2e50c66b70f80b2160b3bb7aa9a376187c5ba20c2f51b9fd5e5a056"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 18): (anonymous) has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/__tests__/TableStructureEditor.oracleForeignKey.spec.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd361c1c25873c50018f0a1c3d73ae2db71fa4d68a27135aa7d15762138fa805"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refresh (cyclomatic 16, cognitive 18): refresh has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useObjectDependencies.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"311e600d59e7913d48ed25410532f6af559095e236112c40f997e69c04fb2354"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNumericSortValue (cyclomatic 16, cognitive 18): parseNumericSortValue has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSort.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe37242ae17e5377f3fbcc114763f132c6d5aa91ae60029f0a02ba2c3f510a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 16, cognitive 18): tokenize has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd72a51805bb42ea763cd42a130ab5519939f43757508842c2d167d37ec9522"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreNativeJobDefinitionDraft (cyclomatic 16, cognitive 18): restoreNativeJobDefinitionDraft has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8305787ac50fee5b9229cf28c427aaffb3ef47c7dc6525df9db921ada62b84d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function specialIndexColumnIssue (cyclomatic 16, cognitive 18): specialIndexColumnIssue has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbe99a776a70c079e153ac2390919db97d27417c4b8b90701792dbc056e0444"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectDefaultMember (cyclomatic 16, cognitive 17): selectDefaultMember has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"351981b4a875df2b5c0b0a4102c93a6aac47bb148729872571a1f72712732311"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7774c46dcf14d086070b2e697e5fb9928c92f0c89f6764340d9f8e1595cd075"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectDependencyTarget (cyclomatic 16, cognitive 17): objectDependencyTarget has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/objectDependencyDetails.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d0624999a2d77788aead2486c226d9d093540c9c9818ef779c045fd751135a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOracleCanonicalType (cyclomatic 16, cognitive 17): parseOracleCanonicalType has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bd372b59b0642c99011031833831f77db9ebfcaa373c9413a6fc3df61081fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mongoTypedNumberInputValue (cyclomatic 16, cognitive 17): mongoTypedNumberInputValue has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f8a21157c46c4dc5bccd7606ae71437d38cd02671d35cfbe00d471ee06e6ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doubleClickRowAction (cyclomatic 16, cognitive 17): doubleClickRowAction has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRowAction.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8525f10f13ff2bd77f6baae4cd77659beefb46a5f98337c16f15829d605ac2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 16, cognitive 17): search has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/historyStore.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd6790c79e108eb0041cce9cc7d19f7cd0dd6fe6bbf884a31fcc72d9f5193f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startTrace (cyclomatic 16, cognitive 17): startTrace has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf34f56036128af87bd8d3d543a36ffd40a75eae20d07d4bbc6d4fe8f2c37f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyBatchSqlProgress (cyclomatic 16, cognitive 17): applyBatchSqlProgress has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd96f3ac3da4e153d1572857e7744f9593e203db83bf596d78ca1416731d631"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAndCopyBundle (cyclomatic 16, cognitive 16): validateAndCopyBundle has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/build_offline_jdbc_payload.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da21c84d48a1c690293e2f1c39bc15293186d07ee59e8f771f12e6a21c53fd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTargetColumns (cyclomatic 16, cognitive 16): loadTargetColumns has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"423064d194b8503848e72bfb46522c69a1c5916d719d9d5f8a620568109f8833"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preview (cyclomatic 16, cognitive 16): preview has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b0a3b953b6b2d4c6c8d7614382d7e4b87483bbe223b24e01501a15e5518db1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceValueMatches (cyclomatic 16, cognitive 16): replaceValueMatches has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d0aaf34113833ef1b6494526a824f62f32f114509587b102bae08d0ce9a722"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadStreamPendingPage (cyclomatic 16, cognitive 16): loadStreamPendingPage has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb000baa687388666146573f0f5e32ee1c48135165d7c2fcd777b044e0345ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function translateStructuredBackendError (cyclomatic 16, cognitive 16): translateStructuredBackendError has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/i18n/backend-errors.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"99aa4408b0ef49d5f6bfeee075ca2ad28423efa119893034a9f997a8cd76464c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildStandardUrl (cyclomatic 16, cognitive 16): buildStandardUrl has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d9e280d8a3ecc62d156de18b54137f5d20514bfd1b04c12a92a82de4cbf01c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleConstraints.spec.ts"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e63186708a6f99f1ce43ef9f6cd79050779d910013b8f41c879257bea28659e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildNativeJobDefinitionCreate (cyclomatic 16, cognitive 16): buildNativeJobDefinitionCreate has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b0df3b551d57f9b7e606b61855f8d22d2eabfe8ddd34f0ab5f9ba57e5f78fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function accepts (cyclomatic 16, cognitive 16): accepts has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/editorZoom.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec950953c912a3fa593d04b589d84fb8862bf14f6339399baaf0fbb596bd66d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseKeyForEvent (cyclomatic 16, cognitive 16): baseKeyForEvent has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c58d315bb91bcbfc28bd69b7782388df83b26ed37a9335fbd37d792f947c52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferProfile (cyclomatic 16, cognitive 16): inferProfile has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"af511bb417f5156ddafa630d0cfa497c8ef5b8662cdecf79a65b6bb3692be5b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotValue (cyclomatic 16, cognitive 16): snapshotValue has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginData.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be9d4197faeea2454c10d5f8a32a64388b4b44862c1edb538081273e405d8f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlSemanticSelectStarIsOnlyProjection (cyclomatic 16, cognitive 16): sqlSemanticSelectStarIsOnlyProjection has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"78687aa67dc695e7e2df650e5f1cab3e6610515b66b64e59910adf02818f5e0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSshTunnel (cyclomatic 16, cognitive 15): normalizeSshTunnel 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ee723a88d90594529a736a263ac8e00995c0baac2f5862d912e29d03a91a57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultDatabaseForProfile (cyclomatic 16, cognitive 15): defaultDatabaseForProfile 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":3654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59c418b4877b7fbdeaf2f9b39bf84597f3bf422923602777efdb3145d9b1c9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) 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":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa397fc0ac4d1d6f0cf2f5b259ace41428224ec6ae549394f0ebf8cdc67b971f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmCreateSchema (cyclomatic 16, cognitive 15): confirmCreateSchema 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":6117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d2fc5b4e501637e3681dd3cbeebe0f258455e36f804c400f9fff787608c721"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createHarness (cyclomatic 16, cognitive 15): createHarness 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":"apps/desktop/src/lib/__tests__/editor/queryEditorCompletionKeymap.spec.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56648776d84c792355e2cff81306685eeadd06547a9551bbdd120c2144d7f7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBasePromptLines (cyclomatic 16, cognitive 15): buildBasePromptLines 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":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4501e1fe16502d1b8370be9214ff179df384103eed5d04aac91fdf335dfcc511"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upsertAgentStep (cyclomatic 16, cognitive 15): upsertAgentStep 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":"apps/desktop/src/lib/ai/aiAgentStepPresentation.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"03edc1689dbb47439f066172ff9a66d98558b31b2381254346415dd6cd124166"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJdbcSqlServerUrl (cyclomatic 16, cognitive 15): parseJdbcSqlServerUrl 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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccdd94d388165c2b855063235ff62d802be36d6a52813adb44cc53e468031ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function navigationEntryKey (cyclomatic 16, cognitive 15): navigationEntryKey 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":"apps/desktop/src/lib/navigation/navigationEntry.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"70129ee82ed6957d058518641e66e82b2d646aeff2b908d4006c1a4647d7eecf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatRedisBlobDetail (cyclomatic 16, cognitive 15): formatRedisBlobDetail 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":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b9657b8d6be60f6e643c1b969586914f9c52f4ce08ad34423de2d41990ee10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDorisLateralView (cyclomatic 16, cognitive 15): parseDorisLateralView 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":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"a906c7dc0fc369813d053ffe2e7984823b799b034483829ca8b3f013796a8102"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startsWithFirebirdRoutineBlock (cyclomatic 16, cognitive 15): startsWithFirebirdRoutineBlock 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f4dd2ba98e4edfff15113d3267cdf7da1e107447be8419137825398b5148c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isAutoGeneratedColumn (cyclomatic 16, cognitive 15): isAutoGeneratedColumn 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":"apps/desktop/src/lib/table/tableSqlTemplates.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe4c0e1e0d67d0a8403c2744182175fa9cc340cb1d6b0e13c50a85a321e109c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultNewColumnDataType (cyclomatic 16, cognitive 15): defaultNewColumnDataType 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":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2012b1b51f631314aa98ddef3006326ddb8b1e1a1861cd1f23ead0c11810fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simpleObjectNodeType (cyclomatic 16, cognitive 15): simpleObjectNodeType 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":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"7512c43bb4603c9474ad40d480cc9647874524dff1ade49a933544a015781f6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":6526}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14ff87e23b7b8204bebbb4bfbfc836d7cae48b6e957582ddcec3b34e6d981b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completionMetadataTarget (cyclomatic 16, cognitive 14): completionMetadataTarget has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb98b2358ab6d57f29d920eca9992522c5a3e1a0467e62804437fd62e9e4b28b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridConditionEditor.vue"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b26b7693f518bf57c0b4dd3e79d9568133cd4285a9b89d5ebc1adfd2af8494"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveGraphProperty (cyclomatic 16, cognitive 14): saveGraphProperty has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"f599c45aafce3a4ae07b4cf22326eb2d42b0e3a7b7fcbf3e725439192252472c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveSubscription (cyclomatic 16, cognitive 14): saveSubscription has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c909bebee7d8bf9ffc8bb545986552e8c7e7256640ee240c5e170a4a28cb73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function temporalFractionalPrecision (cyclomatic 16, cognitive 14): temporalFractionalPrecision has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"409266e06332cd5066e1f6f1952e035c0ff647284855f5f30e31d409cd6810cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureSqlInsertExportData (cyclomatic 16, cognitive 14): captureSqlInsertExportData has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed80dc5226af9e694ca84f67f4ef857100d028b628a019e543267714fdbc369"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJdbcHiveUrl (cyclomatic 16, cognitive 14): parseJdbcHiveUrl has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f57e6e7b159929c40878cb528eea6f2f14c28223f228c625eb0cf447595428"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOracleLockDetailsSql (cyclomatic 16, cognitive 14): buildOracleLockDetailsSql has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionManagement.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18692731b737ffe0c3436ff50fc2499c488270abc4657aba903c63b01bddbb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/plDebugComposite.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b782dda75908291bfbcb65963002a89217fab3085306310f461a1c942c9dde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeTableDiagramCanvas (cyclomatic 16, cognitive 14): computeTableDiagramCanvas has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/diagramSvgExport.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7d9dcf0929c49895ccc61e6e60fe673c736a5fda3794fc70e4bfa1ee9c13a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyCreatedPackage (cyclomatic 16, cognitive 14): verifyCreatedPackage has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16c040634956b20bc34bca1966c7bc6168245c490e54b532ac45198e3050a77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleColumnSearchKeydown (cyclomatic 16, cognitive 13): handleColumnSearchKeydown has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridFilterBuilder.vue"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b9aef5d412d0f5c0e38856e0e3c748c8532d7458f7cafc5bbb79d7fd98c0c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 13): (anonymous) has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"588bed51ada27aa152ef18567d35ef5d5368785f3c5931571f08abc76773168e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editOracleForeignKey (cyclomatic 16, cognitive 13): editOracleForeignKey has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d044666dae55ed84e4c0870b83820c45de60993d6d4f55beff9fcf2396d6e4e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 13): (anonymous) has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb25589800a62f76c9e472ad519314b9ce2cf9bc614edb242682f82dc8e1205"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasCompleteLocalDataGridResult (cyclomatic 16, cognitive 13): hasCompleteLocalDataGridResult has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridPagination.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ea6924ad434bb17d2e3ae396221b6d63a9c8327761cfe87560bf4ab5688371"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyBulkWriteOperations (cyclomatic 16, cognitive 13): classifyBulkWriteOperations has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"9402aaf3eb137060596e125273170662b8b695fb246817e928a2febe50bc6635"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mongoShellWrapperDisplayText (cyclomatic 16, cognitive 13): mongoShellWrapperDisplayText has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"341eeaa15f0067180ef9a9df90491ba6e66003fb9de3191f526c71221a6b9d52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildNacosInstanceConfirm (cyclomatic 16, cognitive 13): buildNacosInstanceConfirm has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4070f3482720b4b00b738e4a8dfb5b3634c7a60c28e0bd70e0504b21d014ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 13): (anonymous) has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75b30b55c5fd243caa002e44aada827372afe83960f9a791ae43e39c1bffe2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildStarRocksDialectOptions (cyclomatic 16, cognitive 13): buildStarRocksDialectOptions has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksPhysicalOptions.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a222d29f9945dbc1095cae31c25cc312ab79bfb6b50719f7c9165be2fe65c61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function regenerateFocusedDeploySql (cyclomatic 16, cognitive 12): regenerateFocusedDeploySql has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9150fc759cd6dd098a441d83c809817ab618532d815bb7a8988830b7ae8b0de3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insertStructurePeekValue (cyclomatic 16, cognitive 12): insertStructurePeekValue has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd2d0c18cc71088a4615a45c08b4c830a4f11be1ec926f51408cda5e0a17e7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autoGenerateRequiredColumns (cyclomatic 16, cognitive 12): autoGenerateRequiredColumns has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac39eaef8aaee4b03e9e1f6dfc9921051e7a4afb1869e7fdfe16196b8b64cab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 12): (anonymous) has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdafd7b0f8258d77d301d43e7911b220c8770c4abcd1c7ea59dae9b767be2c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openNewQueryInFolder (cyclomatic 16, cognitive 12): openNewQueryInFolder has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"07779fcf3fbd00d09690e6d151e2e7a055d90f3ebe8daef8217de8fa4a0e4c5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draftChanged (cyclomatic 16, cognitive 12): draftChanged has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c72df3f4e4a7ffde4a6e5b2d7ce3b037af824d5a12ef31604a6a51c3437086"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sshLayersForConfig (cyclomatic 16, cognitive 11): sshLayersForConfig has cyclomatic complexity 16 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"2add457af1108301f3b711d6e9a9fa56d7465f7ac3f241bbd7a2bdbd1d1406c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onRowTab (cyclomatic 16, cognitive 11): onRowTab has cyclomatic complexity 16 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8dab8a503ffd678c2eadf470a3e4a253279705b2aaa00cfccb3636a4083765"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structureColumnClipboardValue (cyclomatic 16, cognitive 10): structureColumnClipboardValue has cyclomatic complexity 16 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"167f4152a48fc25b3c01e81af63ed908a4221d68376286535cc0bb69fed13725"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildConnectionUrlCopy (cyclomatic 16, cognitive 10): buildConnectionUrlCopy has cyclomatic complexity 16 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":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e4719b3250c4c7792bd468dced5533289825582c0f7ad96ad376b9d1756364"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairRestoredDataTabTableIdentity (cyclomatic 16, cognitive 10): repairRestoredDataTabTableIdentity has cyclomatic complexity 16 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":"apps/desktop/src/lib/table/tableDataTabMeta.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b43dcf17a1eaa62c65889b003387857ad417facf0d6bb448a15132da1e1e36f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 9): (anonymous) has cyclomatic complexity 16 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":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8e7e4865e1f1aa3be5d22edb384eb563d65df814c8899624df8dce314b574f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultMilvusValue (cyclomatic 16, cognitive 9): defaultMilvusValue has cyclomatic complexity 16 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":"apps/desktop/src/components/vector/VectorBrowser.vue"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc0a57ed2ad5739452a650a4d3c801253b00b6bfb5b66b0eccc08fbc539bbe3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aiSqlActionFeedback (cyclomatic 16, cognitive 9): aiSqlActionFeedback has cyclomatic complexity 16 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":"apps/desktop/src/lib/ai/aiSqlActionFeedback.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"604d3e85a9d76e76cccbb0d7777aeca77b5ef730f9e656c9dd593f8a5d80f864"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveFetchAllViewportAnchor (cyclomatic 15, cognitive 32): resolveFetchAllViewportAnchor has cyclomatic complexity 15 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac9807a1aec99afa6a16d67af751ff8bdb9c40980d1f8010fc7ae2ea5bc8a83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncTabTitleNumbers (cyclomatic 15, cognitive 32): syncTabTitleNumbers has cyclomatic complexity 15 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aa47b85815d0a0afd98adfccd8d9c8894225aef48d13596ba0d83eaecd7881"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeSqlDiagnosticReferences (cyclomatic 15, cognitive 31): analyzeSqlDiagnosticReferences has cyclomatic complexity 15 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDiagnosticKeywordRecovery.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"22023461863035d6277a4faf08b67387ae7cc4771a8a8131d1bd2312355ea0cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 15, cognitive 29): initialize has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18bc228c2a6a9fff961cfafdea4355919e0884321ddbbdd5ea5d511632055db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSqlServerBatchScanState (cyclomatic 15, cognitive 29): updateSqlServerBatchScanState has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d805ba9667c26291a76db4970869197b93ad02de5c407d459478d92b4e9f273"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routineBodyCandidateLine (cyclomatic 15, cognitive 28): routineBodyCandidateLine has cyclomatic complexity 15 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":"apps/desktop/src/lib/debug/oracleRoutineEntryLine.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26e401b3eb1fe11fc39bacabb68385c058947e8549979de1b52998406e957c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMongoCopyDocumentFromOriginal (cyclomatic 15, cognitive 28): buildMongoCopyDocumentFromOriginal has cyclomatic complexity 15 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":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb53523a1001151f555dff81ed99f8384b7410bce17aa2dca81ba0e38e51ecb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildForeignKeyRelatedTableItems (cyclomatic 15, cognitive 28): buildForeignKeyRelatedTableItems has cyclomatic complexity 15 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6e1bc8688f1591ac81f3df9cb3269a9098df988746392b715efcfce59758e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 26): (anonymous) has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useFileDrop.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1847dc4f437247e69936049f67297ca6d0003154b693dbdade43d3e3cb5cfa69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDocumentStructureSearch (cyclomatic 15, cognitive 26): runDocumentStructureSearch has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseStructureSearch.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6ec65d240a463d7fa8d108fd6fa341c0c96ef40fe77db05d2ae662845d9286"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildNativeJobEdit (cyclomatic 15, cognitive 26): buildNativeJobEdit has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc14623a690d7f8dcd120e5d4ba35fbcbc468f89c4b41a0f6fb651a6325309f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripXuguSqlComments (cyclomatic 15, cognitive 26): stripXuguSqlComments has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06554139acc6f894e01bb1b7dca7034586b42e84d605bd6811c4e274ce09781"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onSearchKeydown (cyclomatic 15, cognitive 25): onSearchKeydown has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":3616}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf266514d2196592e4f760973bedb10a2c35a05cb425d15311e7000cf25d6f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 25): (anonymous) has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"db556389a6807e0c509837ec91313795b030814442f10bfdd919160afe61b10d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeSqlServerSyntax (cyclomatic 15, cognitive 25): tokenizeSqlServerSyntax has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlServerRoutineSyntaxDiagnostics.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4662cad91eb1485a5cf531a1c28f0d259f405e0598c4e198164779b410e5a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnSuggestions (cyclomatic 15, cognitive 23): columnSuggestions has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b169fff332fdfb5d46d28742fd05ac7137de8606cafec0709e168bc8c8782f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/__tests__/PlDebugPanel.restart.spec.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33871097aa41dac6ec0519eeaf235cbae15dc47491a3181417ea79a23a6f748"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visibleTriggerRect (cyclomatic 15, cognitive 22): visibleTriggerRect has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/floatingViewportPosition.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"803a04ab2ebf4a5f260afc028f92d6434f4012f36cb1b568a6efbbc8074e92b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLivePendingColumns (cyclomatic 15, cognitive 22): validateLivePendingColumns has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/draft-table.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd30870565d331bd3b6ed50b464615e2778103bb0e6866aa065692f1ebe79ca5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCursorMethodDot (cyclomatic 15, cognitive 22): matchCursorMethodDot has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c9f1fb3d1046ed57da74e004c5094af0cc97b3a152e385b49725808d682b27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17ebf5848ef14864e1c745ddc48914e140b8c12604912414110f0b227040dd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 15, cognitive 22): visit has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/settings/__tests__/settingsSearchCoverage.spec.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0180a644cfa5baa4b885c6974c8294d4a3f411428f9eaa1f7b0bec0cbf75f052"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFunctionSnippetItems (cyclomatic 15, cognitive 22): buildFunctionSnippetItems has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6841}}}],"partialFingerprints":{"codehealthFindingId/v1":"294cfcb0fa6ac4d486ee9d878dec44ee2c46b986861f6f66e88299dfe0431395"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBatchTableDrop (cyclomatic 15, cognitive 22): runBatchTableDrop has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/batchTableDrop.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0459ee00f927269b7ad05e9e7d6f235ca8fbae944e7626dd3d56a95650afacf4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findMatchingParen (cyclomatic 15, cognitive 22): findMatchingParen has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"57169abc271303e8aefed0754920bb694d0624819b2502f47aca259c663ae537"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 21): (anonymous) has cyclomatic complexity 15 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":"apps/desktop/src/components/debug/__tests__/PlDebugLaunchDialog.public.spec.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da0c59fe584d41008483d34c2effbe51397c6e10e0711f7e7a7005a12cca3bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestStartTransfer (cyclomatic 15, cognitive 21): requestStartTransfer has cyclomatic complexity 15 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":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ba4a7fa2ed4d3a18cd477c2403047d8921f3847604f5d56df3224d868ddd08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileSchemaDiffTableMappings (cyclomatic 15, cognitive 21): reconcileSchemaDiffTableMappings has cyclomatic complexity 15 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":"apps/desktop/src/lib/schema/schemaDiffTableMapping.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecd095ad001ba37e4495a1b22c3dae39518b7bec882bd571ce318225179bd4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revealSearchMatch (cyclomatic 15, cognitive 20): revealSearchMatch has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/JsonTree.vue"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"597118198583b95b92a12d1e363ade7c93ef4110573a4e58bb7bc34054b374a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestPreviewChanges (cyclomatic 15, cognitive 20): requestPreviewChanges has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"58373fe5c75e2634fe33a59c6926bc1203808fae4960609f74e36a2b13f65d70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function forgetDroppedColumnQueryState (cyclomatic 15, cognitive 20): forgetDroppedColumnQueryState has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":5818}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e913c5b80d75b86435d385cd237f3a78f7b9da5869cfe8c1b28870d210f3df8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchDetailEntry (cyclomatic 15, cognitive 20): launchDetailEntry has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b04f65b8f5023da6a811b3200c08a65ba50d9e4d7d58c7c734fe865c491f944"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findActiveOverlappingTransfer (cyclomatic 15, cognitive 20): findActiveOverlappingTransfer has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e0bca742bd9c92cbba8132e6391623345f839c5395b7d3fb1c9a5957da3c6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeTableInfosIntoObjects (cyclomatic 15, cognitive 20): mergeTableInfosIntoObjects has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7a90c229f86a77aaf4d0ce62c450ff2e4f3d6b4a1b509fa3f0497f4552e62b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeConnectionGroups (cyclomatic 15, cognitive 20): removeConnectionGroups has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11380}}}],"partialFingerprints":{"codehealthFindingId/v1":"951e72e4dcaabc5a0cd90a2322f4d4e855c3ddb8b2fd5bcd23891683581268db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insideInValueList (cyclomatic 15, cognitive 19): insideInValueList has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fcb2f24df4ce2b8e6cd9e62aade23f11d61ecba51bbd0dde924666c1b3bc21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileExcludePatterns (cyclomatic 15, cognitive 19): compileExcludePatterns has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffTableFilter.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3f219a1777e24caca47c2577876975df0e619684ebf107a38eacf2a7c7332a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildAliasItems (cyclomatic 15, cognitive 19): buildAliasItems has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ee62fab88a34cfef457094c807f23157c0b569925b5fb78cfaf2666bf7c3b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadAiConfigurationState (cyclomatic 15, cognitive 19): loadAiConfigurationState has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"6deb4af6b5735d43e978545ccacc9f5a6c6dd53b87bf3d5365b20bae5ff82af1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizePackageDrafts (cyclomatic 15, cognitive 19): normalizePackageDrafts has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"397c1d2781aae0a01c77401467dd70232512d380863ae683f3eeeb8149bfe1e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pasteClipboardAsSqlInCondition (cyclomatic 15, cognitive 18): pasteClipboardAsSqlInCondition has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorTextActions.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dcc1151db392db8da832129936aee091c8c2b5393f5b9089cd192a20d0efb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveVisibleDatabaseSaveAction (cyclomatic 15, cognitive 18): resolveVisibleDatabaseSaveAction has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/visibleDatabasesDialogState.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec801f790d434fd09f61590930d582fc844762f04f82404351b7f3bd85d64ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function partitionDialogBound (cyclomatic 15, cognitive 18): partitionDialogBound has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"297a7cd843f2903352190fde782c663ba4aaf81bd96469c04c06bd2740d8693c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultSuggestions (cyclomatic 15, cognitive 18): defaultSuggestions has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf0813af7923635655242d0a290ca8717687b3fc5e6c86f56452884b9db13fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMongoExtractorUpdate (cyclomatic 15, cognitive 18): buildMongoExtractorUpdate has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d7420442bd062e36ca30deb66d75d299e03d3589705b0705513d61de905229"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preparePreviewSaveBaseline (cyclomatic 15, cognitive 18): preparePreviewSaveBaseline has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d34cff5ba458783d0891540068745c14241a54f1894a04209e43d598aaaad6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finish (cyclomatic 15, cognitive 18): finish has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"e975176e5853cf7e1f780bbac18dda4b53bc08aa7019384226f34a671f18d22d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePieSpec (cyclomatic 15, cognitive 18): parsePieSpec has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/richContent/aiChartSpec.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51ce4e5b93518e198b88bb84fca4566973c030b4620ab810d05be73d7b8e5ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatGeneratedValue (cyclomatic 15, cognitive 18): formatGeneratedValue has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb27d45a0e45a70ee5a758f2f7fa09803b8a228f66d3d43d9352ede60820367"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executePluginCommand (cyclomatic 15, cognitive 18): executePluginCommand has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginCommandRegistry.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd81bcbf60fb2f83720b966fb702b2d088d90706c41a767dbca717c06a379ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keySpecMatchesArgument (cyclomatic 15, cognitive 18): keySpecMatchesArgument has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"71acb1f24db1a3f069bf6df372793a6057780150f652dad80c846810fe05bbbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statementNavigationTarget (cyclomatic 15, cognitive 18): statementNavigationTarget has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/statementNavigation.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60f60d2d79022ac3431547386b54e94167c151a9f8f7d3b883476370b4e58c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearLoadedChildrenCache (cyclomatic 15, cognitive 18): clearLoadedChildrenCache has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4559}}}],"partialFingerprints":{"codehealthFindingId/v1":"253b16d60391a0835a72fc31d613f926175bfdd5b20e30f969a98ca6df9f3da8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveTabForCloseAll (cyclomatic 15, cognitive 17): saveTabForCloseAll has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeabf0a16483d4c9f19bfa91b6b1b3b68acf3cf592b4ec547425abcf2d9f1c87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function previewGrant (cyclomatic 15, cognitive 17): previewGrant has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f1ec976cbc731c56bafb963250a9119133b9b4d35b62c163639aa54572291a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function previewRevoke (cyclomatic 15, cognitive 17): previewRevoke has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c97a970ac4fdc29438da7ffa1921c2f1e113e95590927fb6f4b1cd67777d48d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runExactTriggerNodeAction (cyclomatic 15, cognitive 17): runExactTriggerNodeAction has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3587}}}],"partialFingerprints":{"codehealthFindingId/v1":"df45359e41637d9e2aae79fc720849348e65181296640bcfeee3a5835b557530"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 15, cognitive 17): run has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee68ab8069df409f024d45a025d6a1d96171ea341752a3efc93eb2d765401c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settlePendingSave (cyclomatic 15, cognitive 17): settlePendingSave has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d11f278f140aa5babaf4223de36ea68dfd7f4be4f47afab7e554a914c34226a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildElasticsearchExternalConfig (cyclomatic 15, cognitive 17): buildElasticsearchExternalConfig has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/elasticsearchKibanaProxy.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c500e9f6e5d8e806c972fb9c552ff2328452a6c0f29cc82445d784c57a70c893"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleConstraints.spec.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"855dd1ed60e6636be6e02906bc1865c305a1bdfe9190fe569a2fc2783a038953"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleConstraints.spec.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a51c2413b4385c5838c6aa7e7b708fb08cda7e5979a9049f9a52a774d3c6cb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapWithinStatement (cyclomatic 15, cognitive 17): mapWithinStatement has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorFormatSelection.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0825b0f961455cfc085699abcf7abc676282dbfc9ed735744e9252dbfa0c8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectCompletionContextKind (cyclomatic 15, cognitive 17): detectCompletionContextKind has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e924a274b4dea6e2eb59a1811ff21a5713795ee24b02cb0b5823fc97c90e1a3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/queryStore.multiStatementError.spec.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac9cb07c25aa8914164c4a31f067db04fdc85131ce695a1b3e468186ce68ac4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshConnectionDatabaseModesOnce (cyclomatic 15, cognitive 17): refreshConnectionDatabaseModesOnce has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d75c404782cd20e0fafee239d18b9a187a8c8ea337226e45d9f74bd660815c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function textMatchScore (cyclomatic 15, cognitive 17): textMatchScore has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9812}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22601b1534bffc219df5ca9d177180588e5354087c553e2c17bd9536c8e8afa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reopenClosedTab (cyclomatic 15, cognitive 17): reopenClosedTab has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5747}}}],"partialFingerprints":{"codehealthFindingId/v1":"8542936619341ec3579cbb12e3f3d75a4cb60d99065b232c979294be2bd2c87d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPluginConnectionAction (cyclomatic 15, cognitive 16): runPluginConnectionAction 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4808}}}],"partialFingerprints":{"codehealthFindingId/v1":"c364b7c08358b76578cb69ece2cbfe6727bc2130c4f222b3d29e3fd840de9553"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchDbVersion (cyclomatic 15, cognitive 16): fetchDbVersion 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":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"02999a26bf59d558b3cc3f60950f4ed47b0b38fd41c2e6cbfe0b53d4f3f4e8bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTableDiff (cyclomatic 15, cognitive 16): loadTableDiff 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":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8194679d7e1f49e0065b535d0c1b466f4f4cce25d0fd06074369e27d177216"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDialogData (cyclomatic 15, cognitive 16): loadDialogData 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":"apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c104eb92ca29fa1a1992e8ac23bfc685afc2e2b83e35d34e327ba4929c5554"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchAllObjectRowsForCopy (cyclomatic 15, cognitive 16): fetchAllObjectRowsForCopy 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4641}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7df8c5fafc6b18a082d225a8a9062dd72cd59b41f48827ee316cadf8d7f5b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmDuplicateStructureImpl (cyclomatic 15, cognitive 16): confirmDuplicateStructureImpl 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":6213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9375bf4b2718a0add7bbee5024e232427290dad6f7b7a1862e9e1dcb39eba310"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildKeyvalueDsn (cyclomatic 15, cognitive 16): buildKeyvalueDsn 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":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7964439fa5230815573d42c70ed6b9511fd4e260b918b54ae6f98117ef759a6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnFormatterKeys (cyclomatic 15, cognitive 16): columnFormatterKeys 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":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cfe6ad1e88f6c01ec499efcbd31f2a40b74dbcb10eed111ffa7551e77c1c6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rebaseNativeJobDefinitionCreation (cyclomatic 15, cognitive 16): rebaseNativeJobDefinitionCreation 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":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e315099ce32ba3cbeaa58eb1cb696a2cd7d75e9eaf36cd21e1cb78580187c5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopKeyboard (cyclomatic 15, cognitive 16): stopKeyboard 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":"apps/desktop/src/lib/editor/sqlHoverSearch.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bed87c5a616e81d1e92392c32107155e982074f10718e6b48e828b7e1ac6804"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 16): (anonymous) 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":"apps/desktop/src/lib/sidebar/sidebarRemoteSearch.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c75178dda740f35e847746b9ca3096a3a86ce061d14a27650bc5f4665826d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabMatchesDroppedTableObject (cyclomatic 15, cognitive 16): tabMatchesDroppedTableObject 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":5893}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a447d063d832ab8978355fb9e5c90776f5c97d153845f0cac7bbf7b0fe33b37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function api (cyclomatic 15, cognitive 16): api 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":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e170cdf11b5329842beb4aa84871472ed5ca60a50b53085a620fc2fc1edb9f7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addToAi (cyclomatic 15, cognitive 15): addToAi has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd21c7c7570fd4ed6f2f80830fe7ba5451b24c099588192ca3ff91f0d6cc421"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadGrants (cyclomatic 15, cognitive 15): loadGrants has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6707ed97d83ace47599500a4146c7bcb9ecb322ff178a6d6bbd96f97247fd94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyResponsiveControlMeasurement (cyclomatic 15, cognitive 15): applyResponsiveControlMeasurement has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6371}}}],"partialFingerprints":{"codehealthFindingId/v1":"95356922b97d9b81d278ec2ed47cb3f4257d8f67c8e6e02c9b11927c10179fa4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadConfig (cyclomatic 15, cognitive 15): loadConfig has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d2bc2c63691441f5bd6f004ce64e1426512d0d9378660dd1a9d5bac8d7e6d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDdl (cyclomatic 15, cognitive 15): loadDdl has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dcc84b728ab4d1b4c0f140e07d93efb1b70ab686e3bf46d784e880ae63eadd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 15, cognitive 15): load has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/MySqlEventEditor.vue"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c4866b3c63898a8bf754f1cc6dd2d8b05be66526ba25aa7fdc0cc0e6527964"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchTableDdl (cyclomatic 15, cognitive 15): fetchTableDdl has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b74607114c78c98dd875c9a00855c5e955e7082dded3c766080fe1fa9a3224"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterLabel (cyclomatic 15, cognitive 15): filterLabel has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":6032}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c239961201e35c441661a1e18f9a82f6bfc92478418bfe6b17dfdf0e8e6c5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSearch.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"286051a1721a87fb37ce4070191b7df15711850e7e6772484cb9d489ee27e657"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverInlineLanguageFences (cyclomatic 15, cognitive 15): recoverInlineLanguageFences has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiMessageRender.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a93ef48d655746f83d382d4a629e8fadae5ec9e5e7f7f8f09c4a0e00178af7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionParameterDocument.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db6f65eac320caa725d6bf3da9f22e94e990ddd716650574dc53d16bb28a98f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCapturedLegacyLargeValueCells (cyclomatic 15, cognitive 15): resolveCapturedLegacyLargeValueCells has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/legacyLargeValueExport.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abbd838fc57170d1a3bbe5593519730050706d78366871a023e7ac4fa0261b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"3916ff437b9338cdcc1861a7723509c95637866117b1515937b9973e66f7683b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executableStatementRangeCacheForDoc (cyclomatic 15, cognitive 15): executableStatementRangeCacheForDoc has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/executableStatementRangeCache.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f0eaee8aa68be69d719d5a549bfbb641d683654ae4ce07a425df1810c54a20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyTokens (cyclomatic 15, cognitive 15): classifyTokens has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5599673eed45901ff0cb9b89bff2f3e0e509458d13ca66895a06efd5fcfd2fb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mysqlDataTypeWarningKeys (cyclomatic 15, cognitive 15): mysqlDataTypeWarningKeys has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/mysqlDataTypeHelp.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"853484aa6c7ff959675314ead43019078f5f7b1d70cb7d4c1015d00894504679"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countObjectBrowserRowsByFilter (cyclomatic 15, cognitive 15): countObjectBrowserRowsByFilter has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb18feb753756cae77214c508e773a3a279122f8bded17775849f187b5face8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshVariables (cyclomatic 15, cognitive 15): refreshVariables has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c29901c08079a5d3bb83fcee3bd2804d47f486d76b477b18f0a528ec8300d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportComponentUpdateResult (cyclomatic 15, cognitive 14): reportComponentUpdateResult has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaabb19d51d918e2c7a6e9a640d3158c3d2e3c3e749f1a277e67e07b5ab8f490"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTables (cyclomatic 15, cognitive 14): loadTables has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd8d007121bc22e2cccf458b7b3c62f51c411100d910d6848476fabad8d321c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function previewConditionalBulkEditMatchCount (cyclomatic 15, cognitive 14): previewConditionalBulkEditMatchCount has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2873c8f7b08274255cde1bf3c9cbf25f793bc322cdc6156d929500febb53626"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadServices (cyclomatic 15, cognitive 14): loadServices has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a48dc32fdd403345bf3d84e579f395e228d4efa1b3eb5d00de51c7839c35cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bcf7a9704cf2efbff7bc50b8819476c9f53744add8987ca63596523243550d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createBridge (cyclomatic 15, cognitive 14): createBridge has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"5669f90b1be57baab0899849d71df335d0da6553eef12f2d6b3f46356946e304"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmDropObject (cyclomatic 15, cognitive 14): confirmDropObject has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4827}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecd922a50ff7f238c9d97cf8c36a121f87b22d9b75fddb1d1ad1fe434d57e83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 15, cognitive 14): create has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useCellDetailEditor.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa122c3b7ced2b9423aaecbec739ccfde91440128712004d35c2172ffe88bedf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeydown (cyclomatic 15, cognitive 14): onKeydown has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSearch.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2775e1fc54254b2a7c6cd08799c19bf6443d068ef538b079b049f0372ae3e86f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c2ccfbf716b0957a3c987a184f63fa9d1693b37d237ba162dd23daa8e82c33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2c3625637fc5906734de699fcf492de9de9843c42dee8150fc9847e5a7563e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildJdbcUrl (cyclomatic 15, cognitive 14): buildJdbcUrl has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3c28011f338238f49fcdf7d69fe0a1c8d53acec4ccd2034d05de164817c4bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseH2JdbcUrl (cyclomatic 15, cognitive 14): parseH2JdbcUrl has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/h2Connection.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4d60d9fdae2cd9b481e3168ca7a69c5982681c521aaa6a6a677a8737bbe48e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getElasticsearchCompletionContext (cyclomatic 15, cognitive 14): getElasticsearchCompletionContext has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fdf8c130c26d50e77cdbd17a197d3ebb4447cac404f369d8ed8d19ca2498a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function graphPropertyFromUpdateResult (cyclomatic 15, cognitive 14): graphPropertyFromUpdateResult has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphResult.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6cfd525d2122556968fad787f55e0f2f8156801099e9f2893c75182f9ee6e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderGridSnapshotHtml (cyclomatic 15, cognitive 14): renderGridSnapshotHtml has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/gridSnapshot/gridSnapshot.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e12c0d748bd294a81d0eef390a7a1eefc9931499f2f7870ddb314b5ca7aa715"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildHistoryAiAnalysisPrompt (cyclomatic 15, cognitive 14): buildHistoryAiAnalysisPrompt has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/history/historyAiAnalysis.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a68ce2efe324741ae7b546492c9ca77b5efc47a83e4747e424017592258fc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishAiRecommendations (cyclomatic 15, cognitive 14): publishAiRecommendations has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffec1006c190fc94c7f9074767436d7cece4ca2701b8c5a91ebdb417116eb0db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preferredKeywordsForCompletion (cyclomatic 15, cognitive 14): preferredKeywordsForCompletion has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3872}}}],"partialFingerprints":{"codehealthFindingId/v1":"6524dece880764d3c9253b57b0ac6fdceb0d12cd33b1bb19545902a55f403aa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSqlFormatterParamTypes (cyclomatic 15, cognitive 14): isSqlFormatterParamTypes has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatterConfig.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a14e7d46784b4c8dcadc4401934db72964e060dff7ef268bcc1fa4807fdb417"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requireVerifiedOracleRoutine (cyclomatic 15, cognitive 14): requireVerifiedOracleRoutine has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineWrite.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2319a44ba25d5f8089dffc43ebef71ceeb57a2c522f43a0eb45bef462f148740"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadXuguTypeMembers (cyclomatic 15, cognitive 14): loadXuguTypeMembers has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9502}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a3901bc529b5ac1c77f81ca5e13b119e94a9bd2af132525e69eaf008bfab5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareDetachedTab (cyclomatic 15, cognitive 14): prepareDetachedTab has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4055e97e41865164c8c7c10c9135a026c55a60391654efbc254e7551a684b076"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMcpConnectionExecutionModeChange (cyclomatic 15, cognitive 13): onMcpConnectionExecutionModeChange has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":4962}}}],"partialFingerprints":{"codehealthFindingId/v1":"91388f40f7807419ae5344794a144b3a8a0e7d067e7eac1dd2091570d54a6e1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadServiceDetail (cyclomatic 15, cognitive 13): loadServiceDetail has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd5ce4f218e5ba24c47ff280826991a6c009ab38e0fc2cca6a55e22aac587d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savePreview (cyclomatic 15, cognitive 13): savePreview has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/quick-open/QuickOpenFilePreview.vue"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"531ec2fbabe11b9ac3c7be9fc3eac58e57fc5cf9ba5a7ef1dad92e65c4732ba7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectChange (cyclomatic 15, cognitive 13): detectChange has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExternalSqlFileChanges.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92b86541dabf1c9fb4a906ea64f4fb1c70bfa9f486caa907920bb4eec1c687a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendConnectionErrorHints (cyclomatic 15, cognitive 13): appendConnectionErrorHints has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionErrorHints.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb3501168e9f2a07e22f83498da39b5b55ee28bf647f45384540246b2d5a170"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeConsulSession (cyclomatic 15, cognitive 13): normalizeConsulSession has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/consul/sessionModel.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fd4a62638b8220a3406062576012c707876776b97d06a37ce04ae7ef1140e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlExecutionTargetCapabilities (cyclomatic 15, cognitive 13): sqlExecutionTargetCapabilities has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/sqlExecutionTargetCapabilities.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc01296ed5bf4c86f5aa15803a43236311bb2c7b747cea30c529f347ca9bfbae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSqlServerRelOp (cyclomatic 15, cognitive 13): parseSqlServerRelOp has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfaea8323c04ecacaba15dd6f84d8452c0af611acb5c93b3d9713c456586430"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function park (cyclomatic 15, cognitive 13): park has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorNativeSelection.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e69c3268e84deddd9f0986116fe4035a935bc72d8b0be71458484972156699"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableReferenceInsertText (cyclomatic 15, cognitive 13): tableReferenceInsertText has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorTableDrop.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"079fee2fe4b5e4b9d23797d231133ceaa955858a3c0148fa2b52d387cd95c8a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldAutoOpenMongoCompletion (cyclomatic 15, cognitive 13): shouldAutoOpenMongoCompletion has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"256dae14655127b4f55243185f16b5033df2cd8eabd1ecc46caeda5cf95d2ceb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mongoPureFieldPredicate (cyclomatic 15, cognitive 13): mongoPureFieldPredicate has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"929e46fee16d8fd398106fc7928c3593fafd5396a3d0342f0fd09b847af9abdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 13): (anonymous) has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a994ca3ddb413c2df5c2f1caba15002c73a683ebfb4d84b77b76bfd5613a9869"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readMyBatisForeachAt (cyclomatic 15, cognitive 13): readMyBatisForeachAt has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c08beb6c6eb0735014010fc04f86abcdc6b1a3061d138bd746abd373f78058"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStructureMetadataTabSupported (cyclomatic 15, cognitive 13): isStructureMetadataTabSupported has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableMetadataCapabilities.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b267e02486f7c115c9760c3853b87dcfa756d4717224624d5a66b23fb1f11f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 13): (anonymous) has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"0530f11ed33685c008aaa46a8f72193e942a40ea3abc539558ebc060775d11a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatMeilisearchTaskDuration (cyclomatic 15, cognitive 13): formatMeilisearchTaskDuration has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/meilisearchManagement.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ab3c05b73071863c909de782ca7609b700b86bc2387c853a17bd21e4f952a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compositeComplete (cyclomatic 15, cognitive 12): compositeComplete has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/DebugParamsDialog.vue"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaebee13b276dea91486ed374bf39b0e58b115101fc84981b0d508570bbcfdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshSelectedMetadata (cyclomatic 15, cognitive 12): refreshSelectedMetadata has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"733ee7dbfe309aa4e223e1a1b44289390159b694cb5bf2e00b1f95de668b5478"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 12): (anonymous) has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d3a77d1ea891c59f4d1756f017580f5edec6aeddf58ed729c8a4f1e876ec58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTableSchemaQualification (cyclomatic 15, cognitive 12): resolveTableSchemaQualification has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5050}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2b53f44cdc7a3c7fdd206f776f05da0d6778591f037c14fb1cca24d2c14d12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertCurrentSqlKeywordCase (cyclomatic 15, cognitive 11): convertCurrentSqlKeywordCase has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5a077cdc05a7e3a1d7b8753ba249dd8b515acb0a68d2c80c9f8561324c9c57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeTablePartitionStatus (cyclomatic 15, cognitive 11): probeTablePartitionStatus has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":13826}}}],"partialFingerprints":{"codehealthFindingId/v1":"999467dc9c45fa8589a018e5e30b8c4ab36ecceaffda043fc3f6a5f8eaad7f2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 11): (anonymous) has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":7903}}}],"partialFingerprints":{"codehealthFindingId/v1":"224af5a3a4d9de6f4c0616ca5a67231179e5035e885d39eef7a206b78362acc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseConstraintLine (cyclomatic 15, cognitive 11): parseConstraintLine has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7f698b361cf901b6d35693d5cf86f9596b25f75bb21f6cc36d00c50e51bd3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatValue (cyclomatic 15, cognitive 11): formatValue has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoScriptRecorder.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5872870cac4a6d8119716e783854f68d5e4f064ef7fc71e46fd1f65fa8fdfdf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 11): (anonymous) has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7033}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d51006496c552bfe3b79eb126ead12ce6115a790566644f7bc8655d66157b62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 10): (anonymous) has cyclomatic complexity 15 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":"apps/desktop/src/components/debug/BreakpointsPanel.vue"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b109e8a31fed6db14be50c042563d8f1522a8e6eab2b3ae67ee043952ac17055"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compile (cyclomatic 15, cognitive 10): compile has cyclomatic complexity 15 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":"apps/desktop/src/components/debug/PlDebugCompilePanel.vue"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"925fcbbb11bfdaa39e154f2d06963bb0cd55519db79ea1e15c4ddd6c8a183831"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFloatingPosition (cyclomatic 15, cognitive 10): parseFloatingPosition has cyclomatic complexity 15 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":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e49bd8c8050a15ceeb1528353d0c3b89890c7675710553d7e609b3e6d12139"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revealMountedTarget (cyclomatic 15, cognitive 9): revealMountedTarget has cyclomatic complexity 15 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":4113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee9b842a8ae0e5206081d899d038137b44313c01aec6bff6b18058fe8aa57a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mountConfigEditor (cyclomatic 15, cognitive 9): mountConfigEditor has cyclomatic complexity 15 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":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ba512113a272f8f20f95ecf707c049eb206c3b4d7bd8375740141471f0ec43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 40): (anonymous) has cyclomatic complexity 14 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/windows-installer.test.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a512a8b7c4584f6d438ee7c4cd84db46dd50ec2ee7acbcc86630e750d5e4980"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aiAgentStream (cyclomatic 14, cognitive 36): aiAgentStream has cyclomatic complexity 14 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7629000a48cea81ed2dbf2d736ae70c2728923863567c87ae08b2cc4adb845b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oracleGrantSources (cyclomatic 14, cognitive 35): oracleGrantSources has cyclomatic complexity 14 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSecurity.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e59b249445f7d93214f7e456752cce6f99bbbb6036b2eb7fc333ed955d856c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSelectColumnNames (cyclomatic 14, cognitive 35): extractSelectColumnNames has cyclomatic complexity 14 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4583}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4ed1c8af7b9da0f811253221ce0871de1872bf118950262fda0c9e74bc58ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toggleConnectionSelection (cyclomatic 14, cognitive 33): toggleConnectionSelection has cyclomatic complexity 14 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":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07c1d607c7ff0ed9689578c22754e3b2fb54001a5944ecd863488d7da3e841d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDataGripImportFile (cyclomatic 14, cognitive 30): readDataGripImportFile 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11617}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e5f6c8eabd83e48a196f9ecc024c5bad26a8b764bf67100f145a8e06778289"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 26): (anonymous) has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":4007}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c51c5e9399e65f9ee26e93991e715057bfbb2902644bc543186282008dfa348"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pollWatchMonitors (cyclomatic 14, cognitive 26): pollWatchMonitors has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAdminConsole.vue"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f427b85c507b01f9d6d7602b729e4d3cddba259ed2b70835dac93357110cfa64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doReplace (cyclomatic 14, cognitive 25): doReplace has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSearchPanel.vue"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bd3ea565ac5f32c84d0ae6bf685428e77a6556bea7577747065c7f6c8b3e10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editableSelectionCells (cyclomatic 14, cognitive 25): editableSelectionCells has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11295}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ad2e204dc55f5f1a6f50a86e99f8eca07171e12e93059294c7edd4f3453f7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openSqlFileExecutor (cyclomatic 14, cognitive 24): openSqlFileExecutor has cyclomatic complexity 14 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":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73158debd7282fd63d710d3286768b343eb47a8a3251a14e20ec5e4adfdba03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isWrappedByOuterParens (cyclomatic 14, cognitive 24): isWrappedByOuterParens has cyclomatic complexity 14 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":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"82080b50308e613da8b4f4bbedd30a0efe5aa9a1a5f4e29115afb597a8442ed8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDatabases (cyclomatic 14, cognitive 23): loadDatabases has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"487dc34ff3d2e4ef1ea50862cdacc2adb9572b3714ae955eefaa16015fd6bb79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 23): (anonymous) has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f445c397036ce4c865e38f583d87d20fb49303a0866e34d7e4dfc48305c65394"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeConnectionParameters (cyclomatic 14, cognitive 23): writeConnectionParameters has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionParameterDocument.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6962923cd5ba3a8cc03dd0b7f6febaeee26fafc245e87fb2fb841aac7b42dc05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTableColumns (cyclomatic 14, cognitive 23): loadTableColumns has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5215d7f6f2ed344a984a687e83c56057934704c564179667b03bfbd1ebbda0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFromSources (cyclomatic 14, cognitive 23): parseFromSources has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"d741c1477e89fe05dbd19345dd6fb9cef08170e21cd024bf686af80437fea138"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 23): main has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ai-html-runtime-canary.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"166a8ce0dddd8009a4e2f5cb7d93db025725dc73aaf4d2b1ea6a77218b5f1523"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchBulkObjectNames (cyclomatic 14, cognitive 22): matchBulkObjectNames 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":"apps/desktop/src/components/transfer/transferSelections.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5252b57fd37988db8a20ef1fd7334de00eca9777d1c11e2d153876e735c7f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileSelectionAfterColumnReorder (cyclomatic 14, cognitive 22): reconcileSelectionAfterColumnReorder 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":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5a0a28c47a25aa8fa1efcc1a2f5dfb9707b8b3f4fe9205734bf65e594ec45e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createDataGridCellContextMenuItems (cyclomatic 14, cognitive 22): createDataGridCellContextMenuItems 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":"apps/desktop/src/lib/dataGrid/dataGridContextMenu.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fce63c7d966a06f8e6019353ce6bed65ed2dfea032b75f7955bf9afc512b53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDraftTable (cyclomatic 14, cognitive 22): validateDraftTable 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":"apps/desktop/src/lib/diagram/draft-table.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed7e1a3effef2b365d26d734497d154937c20f128afccde89a2d44ef7beedec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyHoverSearchHighlights (cyclomatic 14, cognitive 22): applyHoverSearchHighlights 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":"apps/desktop/src/lib/editor/sqlHoverSearch.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ed9ff15dfa56ecf41705511d89a55ff12808964325a79770f3cb7f67e00764"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isInsideMongoComment (cyclomatic 14, cognitive 22): isInsideMongoComment 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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"2096b3cf2e5318f329ebdfbec0c8502df7957f76cc4c7535a19a6b7af0798b9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeNumericColumns (cyclomatic 14, cognitive 22): summarizeNumericColumns 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":"apps/desktop/src/lib/query/multiSourceResult.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"57964dc5319143bdea19e86218ff8632931bff355b9d1c38234de7e19a171aa1"}},{"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":"apps/desktop/src/lib/redis/redisKeyPattern.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4aa31c332671473fac3ea7bb7a1a1b0d103f1d10368ce6a5b48099466c5fe3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDdlSearchMarks (cyclomatic 14, cognitive 22): applyDdlSearchMarks 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":"apps/desktop/src/lib/sql/ddlSearchMarks.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0965e7aed01f7864fd8c023d65e9cb4ff560b07d961104fc2c1e4910ba77e822"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceMongoRegexLiterals (cyclomatic 14, cognitive 22): replaceMongoRegexLiterals 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":"packages/mongo-shell/src/json.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7766cc7863b4c16e753cfc500265851f41ae3024d2af101e9fdd7fea1adf105f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderJsonNode (cyclomatic 14, cognitive 21): renderJsonNode has cyclomatic complexity 14 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":"apps/desktop/src/components/common/JsonTree.vue"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3017b4d9a9b88aeff759aa4283b9ed6bdd8453efd62f883ad4442da8ec851e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 21): (anonymous) has cyclomatic complexity 14 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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c022dcb73cd79d0fd260f5d5ddf684bc019783448a2ebd883f645c9180b4ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnDefinitions (cyclomatic 14, cognitive 21): columnDefinitions has cyclomatic complexity 14 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":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb0aac1f85788029419270326a0d94cb8c830bb40adb1b3dfe0293575d38bb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 21): (anonymous) has cyclomatic complexity 14 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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"c028774876b73cd2fb5c5ce5dc0e20ae52ae884441b52f88421a2583eb8f9b49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeMessage (cyclomatic 14, cognitive 21): decodeMessage has cyclomatic complexity 14 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":"apps/desktop/src/lib/redis/codec/protobuf.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9911fc247a534e05e3e8e6898cce1c531363fb0dbbca462339c174d2543fc012"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function firebirdRoutineBlockIsComplete (cyclomatic 14, cognitive 21): firebirdRoutineBlockIsComplete has cyclomatic complexity 14 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2598}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f300520e14361346397dd1155eaea31d748078d6884d8fa0a60389d3549f28c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resetPrivilegeDefaults (cyclomatic 14, cognitive 20): resetPrivilegeDefaults has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e267f299a1554896de5be32c7b692ce5bef69c5210c10c981e819f44c43b7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPermissions (cyclomatic 14, cognitive 20): loadPermissions has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1891bcadeca92f595ba9aee8cceba66ba9871db6b62f0684334ce53c78187ff9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSchemas (cyclomatic 14, cognitive 20): loadSchemas has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"5565eae4181d6fd9e1753e8b517f215b03c60c86124fbb2bdab9049ae4ed9a5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDraggedRowRange (cyclomatic 14, cognitive 20): applyDraggedRowRange has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9490f32c1cece3130235673e19a121fe9d17ce87626825895fdef255227d4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNumberToken (cyclomatic 14, cognitive 20): readNumberToken has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c648e21077aed00b050873771c37358ffc80f11e56254e9081299e604c159a82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serviceEndpoint (cyclomatic 14, cognitive 20): serviceEndpoint has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0887662374691cfa196e66b22c34ef657cb517c96f0eb9dc1c7c0f8d8842f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDictionary (cyclomatic 14, cognitive 20): readDictionary has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSecurity.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d56b5f3a55ee535333561f675d01a19ee15c9a38b03a399089a471139cd80b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOracleObjectAuthorizationPlan (cyclomatic 14, cognitive 20): buildOracleObjectAuthorizationPlan has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleUserAdmin.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2a1437cb76ec4473bd620dccd2dd074b3469aecd28869f343394e7e67880f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDbForestGroupPaths (cyclomatic 14, cognitive 20): parseDbForestGroupPaths has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36996e4c44dfec4102058a6fbaadd67719bd2101c4c10cebc8ab3473b7bf1e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findOpenMongoQuoteStart (cyclomatic 14, cognitive 20): findOpenMongoQuoteStart has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b63a5b660906ec07eed515a63daeb6198ec34f52b2f5428bb7b752afeebfd48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMongoCopyUpdateDocument (cyclomatic 14, cognitive 20): buildMongoCopyUpdateDocument has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2695933bbb70c7f82c42f4d11e3ea1f2c494d0b39982d414b7bfe56fa81b7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestInit (cyclomatic 14, cognitive 20): requestInit has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bc29fa73af13e0ac71386e9052e5ce38b832095c848780e72a1dd94e3772fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openPluginWorkbench (cyclomatic 14, cognitive 20): openPluginWorkbench has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4561}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c279e059d9c435a85719ab345c56146cf1f2532c1926f1aebdd850ae6e2684"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyTransfer (cyclomatic 14, cognitive 19): applyTransfer has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"854e38b49d561c8a93c5de60e49d5fda4beb8749bfe11ddbe9bbcb602be2388f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activeQuoteAt (cyclomatic 14, cognitive 19): activeQuoteAt has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1120ffae36ad91d36e0f64f6127dd07458e285dc69aa6aef56a8e5571b8a5714"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundedFallbackTextAtDepth (cyclomatic 14, cognitive 19): boundedFallbackTextAtDepth has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"011a4eb61988822d0456843a7c89d1e854b0b089a120c0840eb0b83ee4a05629"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSingleInsertStatement (cyclomatic 14, cognitive 19): parseSingleInsertStatement has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"473fa96daea21c7dfe837091610184d0d6f702dd3fc94c7ecb5750bf2392b2a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTokens (cyclomatic 14, cognitive 19): validateTokens has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3fb6ad46605b3c9747d89f102dfd54bfc7e21534a4ed04a0a472f1fb01af01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNode (cyclomatic 14, cognitive 19): readNode has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d540d4ae0d2541d3514530d3ddea802e49591c1d6ba50f4f1d06cc0c45518707"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPackageMemberNodes (cyclomatic 14, cognitive 19): buildPackageMemberNodes has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/packageMembers.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e1178f8512bcbcae83cff10a408971b53ba1738ba18c62305015fa3e766fea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMysqlEventSql (cyclomatic 14, cognitive 19): buildMysqlEventSql has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/mysqlEventSql.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e5bcd6729e80c8fc5ea44218ab60b447866a7992eec5ab9fc7008168b7fbc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabDatabaseIconType (cyclomatic 14, cognitive 19): tabDatabaseIconType has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0b2281e3c44af1a2fe5f7b0cd4364be26bba64ce8465ecb8a745d10f71beb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileInstancePresence (cyclomatic 14, cognitive 18): reconcileInstancePresence has cyclomatic complexity 14 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":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"942610f30efa04d15b16893896749e81a67d747352272ca60c0f262ffa4db792"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function timestampTargetType (cyclomatic 14, cognitive 18): timestampTargetType has cyclomatic complexity 14 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":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dba54fa0dcc38c8c6047fe36d12788682ad944dabd8a2c79544c2031c151ef1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeState (cyclomatic 14, cognitive 18): sanitizeState has cyclomatic complexity 14 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":"apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5f12fc70df338742c5fd15bd41a906736059bb60df8b4bd83bab239ed8aa6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exprToFilter (cyclomatic 14, cognitive 18): exprToFilter has cyclomatic complexity 14 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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"165b6140be465fb0675248c585838a2b9a3e7d5600e156cb196f01cb5423a24f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSqlVariableSyntaxToggle (cyclomatic 14, cognitive 18): updateSqlVariableSyntaxToggle has cyclomatic complexity 14 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":"apps/desktop/src/lib/sql/sqlVariableSyntax.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f382a5405473c6e979cb9ba2282910c42af98eaf4bd5a7917979ca94340ce5dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTargetOptions (cyclomatic 14, cognitive 17): loadTargetOptions has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37c1cd29c6d88151ae9eacadbd3b087fa51a4f641a2981ed168ee0be320d845"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleDeleteDraftTable (cyclomatic 14, cognitive 17): handleDeleteDraftTable has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6dfe0762529a727855ef6fb9cae71f339b4479690247ed704cc31be80f9f4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completionOptionForItem (cyclomatic 14, cognitive 17): completionOptionForItem has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a3bd5a8ca6851f762dfc23218e9c272f82208f510bc7720183e2017dd513ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copySelectedResultSql (cyclomatic 14, cognitive 17): copySelectedResultSql has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ed9fdcad8ad636ebc0ec77808dd5246ce70daac6fe449a44621b0e5b1a3e36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTabPointerUp (cyclomatic 14, cognitive 17): handleTabPointerUp has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b5962b405e33db896e026b12b4f8f545becaaa95f74b430203de4e39c6f1a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileInstanceUpdate (cyclomatic 14, cognitive 17): reconcileInstanceUpdate has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"453707ee6fa76dc1bb6db5eebc1ec908f966981265b6b0f1f1da3c9c6eaa7093"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bitStringLiteral (cyclomatic 14, cognitive 17): bitStringLiteral has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c037b6a2d13db93275cda2608660c7b9ccf26292bee82b8524f017d4ef54ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function conditionCompletionTarget (cyclomatic 14, cognitive 17): conditionCompletionTarget has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fa35554b5c9fe677cb319e530e7299f950c019f3f590d5a4087609fe03ba3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJdbcOracleUrl (cyclomatic 14, cognitive 17): parseJdbcOracleUrl has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"7952ae3774efc518c24bbe0c7dec20f389ecf1fd9b9d56e352f9ded557f243b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildQueryChartOption (cyclomatic 14, cognitive 17): buildQueryChartOption has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/chartData.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24820aab397b8b69c6e6f18855d86b918359bd242f1e59e76a1b0d82d520915"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFilterValue (cyclomatic 14, cognitive 17): parseFilterValue has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"42db5d57a4f13e890b5bdcd1ea0de0c3cea503a53f1400c61e0616c8b8d8b5e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAction (cyclomatic 14, cognitive 17): parseAction has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/dynamicContextMenu.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e6de62da8c092ec58b7824ac82e3c80ce9924f6fdedcb5f10f048f1b73e057"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function leadingSqlKeyword (cyclomatic 14, cognitive 17): leadingSqlKeyword has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/query/queryResultDefaultView.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96b36c47521bd8a89427a67086d13910f4de273b502521d8fe700678f36598b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanNumber (cyclomatic 14, cognitive 17): scanNumber has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd71c66f121307dea1a56c4ae89f7e826cf271b674331d8c7633e452cf8f6943"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyTableVGroupsToChildren (cyclomatic 14, cognitive 17): applyTableVGroupsToChildren has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"9291510252c72f35383396d4c0ed16ac54af11210ef33f49dfe3f8a20062c5ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11998}}}],"partialFingerprints":{"codehealthFindingId/v1":"e556c1297576dc5f7f249d8e1ba3f1acbe2b46683824fe379ed93cc29029feb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function profileForConfig (cyclomatic 14, cognitive 16): profileForConfig 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3918337f2335c41fa33bb5417ab26b10dded31ab0f366a2008fcc47736dfc8a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) 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":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"600dd788f904379c77072f11412198b4a44fa6e5feed94cf14926674cdae2a8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPlusAction (cyclomatic 14, cognitive 16): onPlusAction 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":"apps/desktop/src/components/plugins/PluginBottomDock.vue"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7e981feeb66da728409c6b1fbc9bc55147b3655d20e4272facfd24b66d6d21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setStringValueFormat (cyclomatic 14, cognitive 16): setStringValueFormat 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":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a9988abc43744cfa9b83a972ac4c97f735ced9057fb9c0eea1b473346d1bac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reloadTriggerDraftAfterSource (cyclomatic 14, cognitive 16): reloadTriggerDraftAfterSource 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9ebd4100c41e20f1a6f9ef595b07a9cbe573a54cd753f0ac97e894a3334985"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentFormatterDraft (cyclomatic 14, cognitive 16): currentFormatterDraft 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":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ee1bad1e4598be85ec39bdc17332fbd2aecb9e9f27e0f2ea488b7ac0d0995b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onColumnHeaderPointerMove (cyclomatic 14, cognitive 16): onColumnHeaderPointerMove 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":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"4810e5c767a38c1123080d0416a818c320378dfe97a36f781957bcaa46f42ac8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) 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":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"35224134b712cab4729a3b9568ff6407876d8f8e518af70724ba901626f009eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportDataXlsx (cyclomatic 14, cognitive 16): exportDataXlsx 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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e27496ac22031d120c9ddec5a437c28140e6004b0bc67ddda5d9a1b8f91f43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffText (cyclomatic 14, cognitive 16): diffText 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":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26cdbeb8f7309be1b87cfde871ac457601977313d15de80405557134dc604bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redisDeleteValueItemPreview (cyclomatic 14, cognitive 16): redisDeleteValueItemPreview 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":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4c5e6f81d59bdba78e1372120ffb6406f95e2598f5191ae2e9d72b66b8fc4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sidebarVisibleFilterSummary (cyclomatic 14, cognitive 16): sidebarVisibleFilterSummary 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":"apps/desktop/src/lib/sidebar/sidebarVisibleFilterSummary.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeb6871f5d558a068370e94b6bd8ff2a8ab36c07bb621487ca6f8351f8f4467"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSource (cyclomatic 14, cognitive 16): readSource 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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed54412ee8b61c5f82776d14cb853a8033967dfde9d9039e345a96f6f273094c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSource (cyclomatic 14, cognitive 16): readSource 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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"475afb90160d624d6f22e7743018fadef887f61d3fdc6ec45a33b73c5ae40302"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshStack (cyclomatic 14, cognitive 16): refreshStack 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d336faedfc6a7a8dd3c78dd9bb716a31e25300128deab23783a9cf61f2f962d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9a6ab9b73fd56e20333ffe25779a6f93ac923889bdc74e23a5dd413aa2abec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnosticReply (cyclomatic 14, cognitive 15): diagnosticReply has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/__tests__/ProcessListPanel.spec.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"24639897d58d63a485809d937d96fdfabfad26e8d06d4f1427f9665fa723b370"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 14, cognitive 15): submit has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/auth/LoginPage.vue"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b01b3a90d90ef6ad35da801fba033baf791e405b809e4b818b3ca44829ed729"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testConnection (cyclomatic 14, cognitive 15): testConnection has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4764}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f1449e1aeee2917d66743c7d7f8c464febb6daeb0b1d54ab7bf2176058402a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 15): (anonymous) has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugPanel.vue"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d5e889af14eed85271f4f798e1c8354fa08d80f11b5e907a197b35d0016b04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSchemas (cyclomatic 14, cognitive 15): loadSchemas has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4f323afca3b447509f8526d211b9883370e93c913a6853605b7367b5bf2071"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countExactDocumentTotal (cyclomatic 14, cognitive 15): countExactDocumentTotal has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"199c6ddbf752e7e065d520a03477d0e857cc327c4f29dadf76769629b401779e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveSqlShortcut (cyclomatic 14, cognitive 15): saveSqlShortcut has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f78d40f6ea2ea5ff60605e1ec235e9eefbbb903bf4844e138c46035818d19a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabGroupDefaultLabel (cyclomatic 14, cognitive 15): tabGroupDefaultLabel has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca9f397ffa42f6ade40c72715f42ac0c9aff0bf2970364069881772ba8e1f06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateInstance (cyclomatic 14, cognitive 15): updateInstance has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bd45ba8cd075ac8ff7f92509c1f86f4c4b458e6e2edf3a7a6fa57d13de46de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSnapshot (cyclomatic 14, cognitive 15): loadSnapshot has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"543b22d07ce2d8b1eeee14353711bc4905873111af69a8735e3c1eb7ff1e20f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 15): (anonymous) has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47a1bde79370ac02bf006f1bd6abd3a9ec00adbb73b6702c9f1c69f2035eb2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRabbitmqAddress (cyclomatic 14, cognitive 15): parseRabbitmqAddress has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/rabbitmqAddresses.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec34ee5f1a1d0d73c108dad1e1589d258adf3351aaae94af5f1137043d0db2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStarrocksTableGrant (cyclomatic 14, cognitive 15): parseStarrocksTableGrant has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseUserAdmin.ts"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bd8bd916a6c54768405d28540626ce8cf2516d361cce3925c579412859428e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sortKey (cyclomatic 14, cognitive 15): sortKey has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f7010e46b4f127df5acf2b1588349e88b8f5d620c182cee8ad66e6a555a97c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 14, cognitive 15): visit has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarDatabaseStorage.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e095553d099f9d4b010e49608053470715bd1e3bdca002757cc780137e28b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmBatchCancel (cyclomatic 14, cognitive 14): confirmBatchCancel has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d152df1c672bdd295a2a10f702c6e3f330edf9dbfe82a76316c153fdb6a7f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSchemas (cyclomatic 14, cognitive 14): loadSchemas has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa30769b6d19b12066fb5dc75ba57bea8d48b30354058d1fe7dd71529658d7ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refresh (cyclomatic 14, cognitive 14): refresh has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c42824cc45e0c276908e3c5260f8ca52bcca18d556fad06098c1132867361b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aiTestConn (cyclomatic 14, cognitive 14): aiTestConn has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7786}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c682848bfa72d4c6f54875e860320442cf6bbaa0d3e8caddb6e1b778a46b61d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pasteRowsIntoSelection (cyclomatic 14, cognitive 14): pasteRowsIntoSelection has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":10880}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d208fdc9712776141ea71078e791667241eedc2d1ef05396176417ff0e9529"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleDataTypePickerKeydown (cyclomatic 14, cognitive 14): handleDataTypePickerKeydown has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"e208b794e326b18fa3fc572ab54e21afbeaf0238061769991cab861dd312db6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyCreateDatabaseAuthorizationPlan (cyclomatic 14, cognitive 14): applyCreateDatabaseAuthorizationPlan has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5975}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c99c822340345ae961e25a39862f1a83526ccf9e5f7a3d501709e7664ead4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/__tests__/TableStructureEditor.createModeSavedName.spec.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"05120c3de199c47426f1f8a1fff0bc570826f49708c8e1486c8a57f1b1f29342"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSourceType (cyclomatic 14, cognitive 14): normalizeSourceType has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d8af292edf577f9a7f4713572bb54b10abe38e2e344609180b6036ab4781cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareAddedRows (cyclomatic 14, cognitive 14): prepareAddedRows has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a31825c1e5a09a9836221c8ab86a2f881a0858fc92544899c1c05fbaaa462d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeCompleteLocalResult (cyclomatic 14, cognitive 14): normalizeCompleteLocalResult has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fecdb76a7deb472f0c4e291c6679426ada0d7a1d79a0720da66632c0a7f1ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferMongoFilterValueType (cyclomatic 14, cognitive 14): inferMongoFilterValueType has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1d1b44da1536c5c93d2dc4fd89468ca664e82222e7cdc08f3ccee6d277bd96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionDetailUrl (cyclomatic 14, cognitive 14): connectionDetailUrl has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDetailRows.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0a950e1bee7067d7dc33c1194ad8dfb7f568bf52daec74b6cbb56611f132e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionEndpointLabel (cyclomatic 14, cognitive 14): connectionEndpointLabel has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionPresentation.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e429255892e1b17a76bb77f51715617e889bf5363655be96ca7a8146312e2608"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJdbcDremioUrl (cyclomatic 14, cognitive 14): parseJdbcDremioUrl has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"5299dbfbcb751bdd7060f4201fa4d3dc03cae908680358a3b77d1913346c1691"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jdbcQuery (cyclomatic 14, cognitive 14): jdbcQuery has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2839604e80c11654460fce280041b5341800357faafa856066d7914559b9a9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMongoReplicaSetConnectionString (cyclomatic 14, cognitive 14): buildMongoReplicaSetConnectionString has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d50073fcd34bfe1234975bb76073f679f3ec02180e5a734cf152cd8e0455b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyExpressionCursor (cyclomatic 14, cognitive 14): classifyExpressionCursor has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bb13ccda145fc4c0f528913c1b97653be71d1ccc36316c31c8358fea060fdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoFindOneCommand (cyclomatic 14, cognitive 14): parseMongoFindOneCommand has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"51160303cc779fae4fc10a903b56e87122b0bbeeea1d58a00353787047b10226"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableMetaForDataTab (cyclomatic 14, cognitive 14): tableMetaForDataTab has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableDataTabMeta.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9145227713cc3f57fc87848d0f5edf479ce94df8e5e7f6409a7972d2df1142"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createForeignKeyDrafts (cyclomatic 14, cognitive 14): createForeignKeyDrafts has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff850a49ac610698894a434d649756070a7941d74313d717d3e6b9ff4aa81e4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryParseMongoAggregateCommand (cyclomatic 14, cognitive 14): tryParseMongoAggregateCommand has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/aggregate.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eb812c2e5c94c37ac01ca9378742edea5d1f181a592d2c15b9ebefc6ecb880"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHostPorts (cyclomatic 14, cognitive 14): validateHostPorts has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/database-env.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06115e2e9a4103257ce7f25ed9ad428e7978924a6c4edc132c586041615a521"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/NativeJobDefinitionEditor.vue"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef777b059eb09848d91f3991340bccfcd97b40625d21d2dedcd3a3f3ab6fe166"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugSourceEditor.vue"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6c63f5cd7ce25ca42783502d3af965aefc477c093c7bbee9931ef0ed3e83ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchTableOverview (cyclomatic 14, cognitive 13): fetchTableOverview 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":13906}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b1669f51c5b6ee71d3b332af542a654d5c7784e47b18492521ff20bd6b3433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canOpenStep (cyclomatic 14, cognitive 13): canOpenStep 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":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"f453faaa0a3707398877f5df196c30cc5d03e208bc15fda87e05a4e888743996"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowMatchesFilter (cyclomatic 14, cognitive 13): rowMatchesFilter 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"031c409ac62b3814a114f18754ee4d82a4dc21a727b0e95a204d59eb2c2d640a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onTableInfoColumnsKeydown (cyclomatic 14, cognitive 13): onTableInfoColumnsKeydown 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a79ed3a27391c40ca5b25bc862e0c43c734c62e5f306eae85075cb4db5b82f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectTableInfoTab (cyclomatic 14, cognitive 13): selectTableInfoTab 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bb65dc0781583af343e07bb7bc61353121373befd57062f623adf67c0d9933"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec41c91008562f62d273aa6ac052fc7c02e3a875f57e39ebafabec776bd50ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onClick (cyclomatic 14, cognitive 13): onClick 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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45d25a11b5525a7b32b921750a5b30c9bf193813b0fdb9bf265ca2b74eac992"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editOracleConstraint (cyclomatic 14, cognitive 13): editOracleConstraint 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6f3dba71089ed781c4a58baab31589d4e297996e18bb5e13c925716828e965"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configSignature (cyclomatic 14, cognitive 13): configSignature 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":"apps/desktop/src/composables/useAiModelCatalog.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f36e45c4e7e07dc3ad817fe7c56dbe1e1d6e42cd993d9a46c363d815dce3415"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"40047fa7deaff2b918dd22a7bd41d92ec29604a5c46dc6f5c78e7cbd8f8456cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visibleDatabaseFingerprint (cyclomatic 14, cognitive 13): visibleDatabaseFingerprint 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":"apps/desktop/src/lib/connection/connectionVisibleDatabases.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d79c30fd683a811c9ded646fa31b0bba16ace4931a41e06edd36788ecac0d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shortHeaderTypeName (cyclomatic 14, cognitive 13): shortHeaderTypeName 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":"apps/desktop/src/lib/dataGrid/dataGridColumnType.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"83424a9b99935c3125ce9e6e633eb6c7eab29b24f47ffc20188b632e5c7a21a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function damengCreateJobSql (cyclomatic 14, cognitive 13): damengCreateJobSql 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":"apps/desktop/src/lib/database/damengJobAdmin.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"27111689713fb8c43ee48443a7ab33a7977e03d1162481122bc01f9c1e8e00f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94675ab73bfaafabb7c8cf41ca2e12013704f2f8b1650e0ee2c1e2f15051eb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oracleTarget (cyclomatic 14, cognitive 13): oracleTarget 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":"apps/desktop/src/lib/database/oracleObjectDependencies.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9780300b544226c827125b416c0425dcfe5af1495b8c07a5adfe85cb9aec4931"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleSessionManagement.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca3fadf74e85c43f6487809848221f2ff2147e3710612631966c48cabcae40a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compositeLeafKind (cyclomatic 14, cognitive 13): compositeLeafKind 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":"apps/desktop/src/lib/debug/plDebugComposite.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d75f4da311f051a9d98a0f88480ae8cdd9eb37d7c244b32b088f20af02c1e2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePostgresNode (cyclomatic 14, cognitive 13): parsePostgresNode 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":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4f08bd7b67499ef1b5c1b7466536800db1e03092bcfe10e6b8a28ad806f9f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onBeforeInput (cyclomatic 14, cognitive 13): onBeforeInput 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":"apps/desktop/src/lib/editor/queryEditorNativeSelection.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5b48246bd75a73c3feb29630362ca04f891cf085e15d62988f657811d04fbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shortcutDefaultForPlatform (cyclomatic 14, cognitive 13): shortcutDefaultForPlatform 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":"apps/desktop/src/lib/editor/shortcutRegistry.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b431d23005b4ba77853ff273a8306c485c125e740177fbadb79e525338dff35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/schemaTreeCache.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c20cc5842eba6ae2a82f0c342e4886b8e5d0644d1822f92b0037b614b6cf1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeModelScalarType (cyclomatic 14, cognitive 13): normalizeModelScalarType 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":"apps/desktop/src/lib/model/modelShape.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf0e419f31c6c814048622d68ee5f4a9903d97724c39d8878300611b009dc26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoDistinctCommand (cyclomatic 14, cognitive 13): parseMongoDistinctCommand 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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc42a4ae27b119bf67cdc87775ca7de58cdf0a364f32584d00f50d56cdb7bd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractRepositoryBaseUrl (cyclomatic 14, cognitive 13): extractRepositoryBaseUrl 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":"apps/desktop/src/lib/plugins/pluginMarketplace.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72c3c2b98fc246cfaa4791e6900cb52c02dc158546614f1977d2a47f146c0ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectSourceKindForTreeNode (cyclomatic 14, cognitive 13): objectSourceKindForTreeNode 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":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7b825af4d94fe0e1d770f92f858b92edc17e27304187ff2427a1cd8a9f75c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSolrSystemInfo (cyclomatic 14, cognitive 13): parseSolrSystemInfo 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":"apps/desktop/src/lib/solr/solrAdmin.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ee2b8df199469078f2c362800647a8ebc08b34701aedb8f67692d3ff8cf9f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNewQueryTarget (cyclomatic 14, cognitive 13): resolveNewQueryTarget 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":"apps/desktop/src/lib/sql/newQueryContext.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"323251d1c14c3e424a3b3cf5a9c1bd94854ecfd365d87f7adfe3f4d2e325ce0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6210}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f159137e1ba5770d05eceb36a5769c893e78d3e72de26a7f36b40d7afccfd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSqlServerUseDatabaseCompletion (cyclomatic 14, cognitive 13): resolveSqlServerUseDatabaseCompletion 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":"apps/desktop/src/lib/sql/sqlCompletionLookupTarget.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff8aff2b7e6b6ae094b167ffeb1b76cb806661ded83f4e1dc4befa1c4f1c570"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 14, cognitive 13): walk 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":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea845d1edfa70715e4f2cdfbf513247da88604567e9aa9c2afa217dd9829bbbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSidebarDatabaseStorage (cyclomatic 14, cognitive 13): loadSidebarDatabaseStorage 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0f364bd66a2ae4221f838373c747572b0b534f4d82d4b82a3e44bd009dafc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeResultRun (cyclomatic 14, cognitive 13): removeResultRun 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2605bf6763638c7c2b516907090d97830d3142bfebccfe1f80850376dc41919"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openMessageMention (cyclomatic 14, cognitive 12): openMessageMention has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":3553}}}],"partialFingerprints":{"codehealthFindingId/v1":"148c3623c1753b65901516043d77570c7e3825c148ecf5b3f464b3c1440a8441"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreLastPublishedMessage (cyclomatic 14, cognitive 12): restoreLastPublishedMessage has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a79a393ce048a5541b9da3f8b27c9c2910e1edd8f53a709fa95d62d6ee2ee24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitRole (cyclomatic 14, cognitive 12): submitRole has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c9762fb3c7868b23d23289dd3e9b137df6e6ebc0c5401e0ed121afd08fc8a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandCompletionInsertion (cyclomatic 14, cognitive 12): commandCompletionInsertion has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":3563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5baee9b4ad9042472398fae86d7753cd44d11bb6e46291b52f25f302517dd98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createOracleTrigger (cyclomatic 14, cognitive 12): createOracleTrigger has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":6577}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab61fa6ba8fc3fbf2ff4d2433c50b6487db36737a51795695ad00531657bfe9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createCurrentDraft (cyclomatic 14, cognitive 12): createCurrentDraft has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"1846adb62d21fb3441b821651bb40023aba3ccfec97fd408204b868900b6c6a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function whereSuggestionRole (cyclomatic 14, cognitive 12): whereSuggestionRole has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed1a3452ebdf392b718ae3ff8cec3fe51c6b1b4d44a36a9b3a28a44dec224d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishDataTransferTask (cyclomatic 14, cognitive 12): finishDataTransferTask has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"363442f8f233d9da6c1d982fbf2bc9aaf8b0489121c8dcaa091b618250e4a84d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDataGridCellDetail (cyclomatic 14, cognitive 12): buildDataGridCellDetail has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridDetail.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41bd08f00a3483c655550e742976d5955d8e2014531359a5e29e1f29467c289"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionObjectTreeQuerySchema (cyclomatic 14, cognitive 12): connectionObjectTreeQuerySchema has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/jdbcDialect.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefbf818dde3d802ada508e600dd657611f1f31d336d8a989a574fdb3fe653b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeJobProgramArgumentLayout (cyclomatic 14, cognitive 12): nativeJobProgramArgumentLayout has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c11a17c653733e796b07b4d2ccca56358330967d6321b129fc4112cf76bdca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOracleCompileAction (cyclomatic 14, cognitive 12): runOracleCompileAction has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleCompileAction.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a965dd54a5429d50928e59f3279fb341028f19f90c9ac05da5e47cf807107a3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/schemaTreeCache.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36d04ac731215edaac3449a73332136ae7cb755c9e90c1dd72f7172cfd35c50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"6736e1ee8793d412d4ace00dc3d00339262b52f5fd8e84051e9508aa60c92ee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectIsQualifiedByContext (cyclomatic 14, cognitive 12): objectIsQualifiedByContext has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2a43c2fa8e06a63628cd21d95b1dbeee0c8688ac5a98365748eabcefcaa8c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripDeclaration (cyclomatic 14, cognitive 12): stripDeclaration has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d7e14a0e45844448089195faa9ba9c085679ee3ce300b4fc0803dd34ca387b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quoteTableDataIdentifier (cyclomatic 14, cognitive 12): quoteTableDataIdentifier has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0afce954871b97bf00cbb13491e38ae286da57de36cde36585c0154ecad860"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa2a4d34cff94308516bcfdbd4ba0f36ad82814faca86303e97e555a71c9d5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadMoreObjectGroupChildren (cyclomatic 14, cognitive 12): loadMoreObjectGroupChildren has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7988}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c456cd01c9c655b0fa3cfcf312d568105d43a587e1e0291f200687dd7e1ec6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changeNativeBreakpoint (cyclomatic 14, cognitive 12): changeNativeBreakpoint has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b02a5af9bb652e23fc25ab3c0b197336164815f5226a5e5fd5e282750ffdfd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawnCommand (cyclomatic 14, cognitive 12): spawnCommand has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/runtime.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"23db54e98cdc68f8edb55d6c42a12393b29b9367933bfc640ce0fb783b0fb50b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 11): (anonymous) has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dff052fb77307f2a49ebf4dd50fc98d813b9dd083b665266cb75acc315d7b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyWhereFilter (cyclomatic 14, cognitive 11): applyWhereFilter has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8458}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7cb804618b453914b30d0d57236e8965c15fd15f004709f4cc916a87f33aa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableMetadataRequest (cyclomatic 14, cognitive 11): tableMetadataRequest has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8623b13486dcb22fea763ffdbd2593e0003b06cba4cb7608f96b595c75e7f47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findTableObjectGroupNodes (cyclomatic 14, cognitive 11): findTableObjectGroupNodes has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a65243c3217db94f84f4e6cbd5665622a400ac4d146ad7145f8fc21927a9b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSessionRoutines (cyclomatic 14, cognitive 11): loadSessionRoutines has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSchemaDiffSession.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d83231350d01febc54bfbedd970cb48a97f1d4f00b97ca36d71b367a4fc35f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeBooleanCellValue (cyclomatic 14, cognitive 11): normalizeBooleanCellValue has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridBooleanColumn.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0267e916c738375327fba05a4deeb972f750080c602b76f3bc59dbf3c33bc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableGrantMatchesTarget (cyclomatic 14, cognitive 11): tableGrantMatchesTarget has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3763808f963899f775740ecbcb0b55374538f71e4df8e9bf367a7c7554d168"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sameSnapshot (cyclomatic 14, cognitive 11): sameSnapshot has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"214d9209f241cdd33456fd29ade64c33097d12c214c4da75df8ea0f9c5884d29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redisValuePreview (cyclomatic 14, cognitive 11): redisValuePreview has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27df7950e4cc6222a266def17d2f0aab870a10f8754cb099a3548abe1014771"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareTransferPackages (cyclomatic 14, cognitive 10): compareTransferPackages has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cabe731aa7632252f212dc641468fa6fda358e3a72f70a5afe5c511d16e9c05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 10): (anonymous) has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a1827f7453d79e92e08ceb874b9452a6fc4a3e390fc589391d5ac843074d3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertActionReadability (cyclomatic 14, cognitive 10): assertActionReadability has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedeb7deede2a70603f777fbac740d48b7004a9650f3aaede9123a5dfa5d97cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 10): (anonymous) has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyGrouping.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6b70863b2513555b2935bc66da90fb52e93089eb66a67d3289b13b4c24e07a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addRowFromArrowDown (cyclomatic 14, cognitive 9): addRowFromArrowDown has cyclomatic complexity 14 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11970}}}],"partialFingerprints":{"codehealthFindingId/v1":"936e8d860c560dc9cf70532abeece1536fe571ce00ecc444cadf4ddf499953c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnChanged (cyclomatic 14, cognitive 9): columnChanged has cyclomatic complexity 14 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c47008b1b4b74ef78f24bd15ad0c792fd71d20e40558906405c88d84f9686c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function booleanValue (cyclomatic 14, cognitive 9): booleanValue has cyclomatic complexity 14 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":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c349946e1e5fff910f57d2f0e5f83317b1d67193d55625930470f7933155c72d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 9): (anonymous) has cyclomatic complexity 14 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":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a0b4ccf60b17199d46a6f8684f47e37d6209b35267c5628674b1ab7127637f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isQueryTimeoutErrorMessage (cyclomatic 14, cognitive 9): isQueryTimeoutErrorMessage has cyclomatic complexity 14 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":"apps/desktop/src/lib/sql/queryError.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"76325b5644ed20556dcc4a7532a0b2edd99186b9d528d44f8cbd8cff1eebe778"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 9): (anonymous) has cyclomatic complexity 14 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":9852}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a442a296332234eefc62d381310968838405991557b373bdf20fd644ec5b81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickFromClass (cyclomatic 13, cognitive 39): pickFromClass has cyclomatic complexity 13 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05108f612ad23caca91058ab58ba737e722a1f5b459d677b233c81a28cc1b62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 28): (anonymous) has cyclomatic complexity 13 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":6106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb351528575e08436f5719085f425534a79c4efa97e6532a14b04c45e13bd9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function elasticsearchRequestLineCandidates (cyclomatic 13, cognitive 28): elasticsearchRequestLineCandidates has cyclomatic complexity 13 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fed7d837515b8a1c51cea4bf04af73dbd35d9981de2436cc25b7d1a3b1e4075"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipAccordingToRules (cyclomatic 13, cognitive 28): skipAccordingToRules has cyclomatic complexity 13 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"040b7549d20b8dbe7b6fd9e0419dbf559d3dedbfe177926a94f67b523541b261"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderCompactCaseExpression (cyclomatic 13, cognitive 26): renderCompactCaseExpression has cyclomatic complexity 13 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/primitives.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"58811ddf6b26500fbb636995c7315caea0a920c7f8cae081b7b031564123c97d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyTransferPrefill (cyclomatic 13, cognitive 24): applyTransferPrefill has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dd8bf99a73da0f5f96af462e4aa1a0a45ee83837cb5b6d31f455c374318643"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transactionalMysqlTableDdl (cyclomatic 13, cognitive 23): transactionalMysqlTableDdl has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d082df6cb13c3723f61992439e69b8b57df4698fbb85a3e826c6b8c8fe0853d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 22): (anonymous) has cyclomatic complexity 13 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7006151a54606a0f5e10dd6e7c0e7e30ca3809fbafd1b9ea800fd429fda4fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseClausesNearView (cyclomatic 13, cognitive 22): parseClausesNearView has cyclomatic complexity 13 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":"apps/desktop/src/lib/editor/codemirrorInsertValueHints.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8175c0f6663b7b8d42003c1d211fd763377c0e61b3065ee72c85d60f54680510"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanQuotedRanges (cyclomatic 13, cognitive 22): scanQuotedRanges has cyclomatic complexity 13 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":"apps/desktop/src/lib/editor/plainTextSelectionRanges.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5710d8ba15fc14e0c0e6e32735cd28cf1e32cc840857cb8fabd7b01f14585dd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function salesforceDevicePollLoop (cyclomatic 13, cognitive 21): salesforceDevicePollLoop has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9197e92787bacd4c51959e513b620ebea80c14e8efc0f82123e75e1992a8e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function alignWithinWindow (cyclomatic 13, cognitive 21): alignWithinWindow has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/DiffHunkBuilder.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2f56dadc9e8cadfe93e44573ae9e67291386aa8dc5e1a9ad6ae03e565a75e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 13, cognitive 21): onmessage has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisContentSearch.worker.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e7220e5c8c397e30bfbb2846a9991ae4699e5b446ce5465ca69ab563e088df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sourceOrder (cyclomatic 13, cognitive 21): sourceOrder has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"427eb7e488197fa8ef33e8e94481d91debb35b5d006a4c0cf7bddec5965f58dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeTrailingCommas (cyclomatic 13, cognitive 21): removeTrailingCommas has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"b969bd3ffe46102ca877da38be57e65faaa59041b4d74845269cca387c0a21c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCreateDraftTable (cyclomatic 13, cognitive 20): handleCreateDraftTable has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"06527ee4988b453f28ad609da8813066ea020efd7ca8d2c867ed3ea18c202063"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 20): (anonymous) has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ff275eaf19ea9cd5c9249ded44a7a81f5e9862fd7d2168e2ec68c87a71e4a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportFolderContents (cyclomatic 13, cognitive 20): exportFolderContents has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8445702eaf4e36974badd736660af16d159d7f45e82e5f0f949a6b0913e48e99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function surfaceColorWithAlpha (cyclomatic 13, cognitive 20): surfaceColorWithAlpha has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/appBackgroundImage.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e9ca2268b28150d5e5d5570a037d8b18cfcd126dd5297e0e7c7e0e3b77fac1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertSingleQuotedStrings (cyclomatic 13, cognitive 20): convertSingleQuotedStrings has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"209b2588dbaf29d01369797970ccaa273a20ba9980c63339276917f138bea773"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 13, cognitive 19): main 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":"agents/scripts/verify_offline_jdbc_release.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad93a4bff2a4b20560e9deaffef67696fe6caf0cafa5d89b063aa1f765a750a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1a1129376621e1edbccbd40c78acf0e9096b3230020dfdb64014445e829bbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitUser (cyclomatic 13, cognitive 19): submitUser 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":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb06dde07cdee3437e52eb18eb35bed25704a62cb68b6663be07d5edf329ddfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeSelection (cyclomatic 13, cognitive 19): summarizeSelection 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":"apps/desktop/src/lib/dataGrid/gridSelection.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1782f73117465ba7b0be918e4157ffc70e52dbb3966bde99e8e710c88e55053e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoUserInfoCommand (cyclomatic 13, cognitive 19): parseMongoUserInfoCommand 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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"c055469baf93a6fbc288fcabff82ffd5b650ba9f4ebebc4ba3453f1d17477066"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitPasteTokens (cyclomatic 13, cognitive 19): splitPasteTokens 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":"apps/desktop/src/lib/sql/sqlInListPaste.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1db6cf7777c8fb9cbd21a5405211bf73dd72b7045f0ef369cac0ae63d4bf32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expression (cyclomatic 13, cognitive 19): expression 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":"apps/desktop/src/lib/table/tableColumnDefinitionPaste.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b166c5e86ec11f96f282b1efc38b20faf5c3434defddf4e350befe8709067d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quoteUnquotedObjectKeys (cyclomatic 13, cognitive 19): quoteUnquotedObjectKeys 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":"packages/mongo-shell/src/json.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d00616e2fd0c85cbe4e2faccf9fd20b0146180a63be504fff50f0c282fcc81d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function documentIdFromGridValue (cyclomatic 13, cognitive 18): documentIdFromGridValue has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0cf5ffca43cac8994df7a2bb794a662dc09566f3a94c5e32117cc296a3b96d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function patchOpenDataTabsAfterColumnDrop (cyclomatic 13, cognitive 18): patchOpenDataTabsAfterColumnDrop has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":5867}}}],"partialFingerprints":{"codehealthFindingId/v1":"87eb66d042380f399413be8271c6a706a701c9beb98653af1533679428760200"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTopics (cyclomatic 13, cognitive 18): loadTopics has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TopicsPanel.vue"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a55c3645c509dcbdfba0d0c8a89c943ad66f35e4d1d2aaa05be28d17a02def6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acceptStatus (cyclomatic 13, cognitive 18): acceptStatus has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNativeJobExecution.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac45774d96e69da63f8827aba0c8393ed277ee9901d036330eac2402571a13b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDataGridColumnWidthState (cyclomatic 13, cognitive 18): loadDataGridColumnWidthState has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c73f793b355e670a4f1c9d3e7044e1771528acbe76b579a9eeb4f5949be1b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlParenthesisContentRangeAt (cyclomatic 13, cognitive 18): sqlParenthesisContentRangeAt has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorParenthesisMouseSelection.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6856487014d514d06dbd71c30f2632ea81ba8c07cc68ec3891ca3482f84f4169"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findUnsupportedValueConstructor (cyclomatic 13, cognitive 18): findUnsupportedValueConstructor has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3091a321aa9201b1ce27737a83f877d8f89857a0ec61b1add7e3712b27107c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printElement (cyclomatic 13, cognitive 18): printElement has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6f0e3d975f76081bc6c3295714aff98f42b7868c4f58ac92e21b1dd0ffc4b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabSwitcherReleaseKeys (cyclomatic 13, cognitive 18): tabSwitcherReleaseKeys has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabSwitcherKeyboard.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae303d4ddb16efad33ebfe95354a7c068f44b3e8bf80d823899c82d7f502256"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleSaveTab (cyclomatic 13, cognitive 17): handleSaveTab has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ff652ffc3223ee5f76d3b6fe9472b548ab047535e4f05fe239df6c5bb931e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBacktrace (cyclomatic 13, cognitive 17): parseBacktrace has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/StackTracePanel.vue"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda4defaeeb3662514baf451092091c653436f5172c9c3cef8f2dc19413aa17d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scrollToCurrentMatch (cyclomatic 13, cognitive 17): scrollToCurrentMatch has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":6410}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a728cd0dce4ac701e87c4637ec78d27f1e5683a27181008fc328754010d3d84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCreateDatabaseCharsetMetadata (cyclomatic 13, cognitive 17): loadCreateDatabaseCharsetMetadata has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5765}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6b1b12284424dc2b57a45e27f3481855c46fc2f16a64d94f6966a6e9d69e08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyKeylessGuards (cyclomatic 13, cognitive 17): verifyKeylessGuards has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"479a7d7bc6e267ce43cad9ddfab101c67c31eac49b85629f8f9c9488abb05dd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/table/oracleViewRename.spec.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5135ced2ecad1959b22a456f969cf18b34c1cb667edd3815415078b9c2e12bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCreateDatabaseCharsetMetadata (cyclomatic 13, cognitive 17): parseCreateDatabaseCharsetMetadata has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/createDatabaseCharsetOptions.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ae5c8918c3e24acdc323fcf67f79d3af3ca1f0c06ab7ce901cb0d846fe6fe4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOracleTriggerCreateDraft (cyclomatic 13, cognitive 17): buildOracleTriggerCreateDraft has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerSql.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3259d70a1410f240de854aba367a33e146352db473361493414346ec4ec377"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeLtrAutoLayout (cyclomatic 13, cognitive 17): computeLtrAutoLayout has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/ltr-auto-layout.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f380b35f1ada742528b4ed589f2c01eac5504609d5dbc6de32582c3414de9d9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellLineCommentRanges (cyclomatic 13, cognitive 17): shellLineCommentRanges has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/shellLineCommentRanges.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"762f193380c3daa044806e111db09be1820d84fa7b32d732071c9f2dc3dac8a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toJsonable (cyclomatic 13, cognitive 17): toJsonable has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/codec/msgpack.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"310d7f211b9d4dae057815498503010381c96fc38c609bf3fc718813cc94eb00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createCompletionIndex (cyclomatic 13, cognitive 17): createCompletionIndex has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e081a0e114798764dda49cae7caad9103af18d1e0f0aac914a38a40a78a90f15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function substituteSqlParameters (cyclomatic 13, cognitive 17): substituteSqlParameters has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0566f6b700e8332896bf4c7e74c69f3c40e7515eb2b521c847afd78a8c9945a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveTabToGroup (cyclomatic 13, cognitive 17): moveTabToGroup has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2133135160940e338738da7871182333d194f5c465b6cc6c3ae755a30dd17ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeCurrentSql (cyclomatic 13, cognitive 17): executeCurrentSql has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfe1c224247994e7ac4aa5d96da7fdd203ce108e14136f0be485f3f4b93bb8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 13, cognitive 17): main has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/migrate-archive.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ae09d57a61d477464518a0749c47646e1e885042442cfe0da89460f66d0f6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePayload (cyclomatic 13, cognitive 16): validatePayload has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/verify_offline_jdbc_release.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5fbe2e77e36b68b907ccd7be021adf3b3443d0923fb533a6959fd7edc7e4e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureRequiredAgentDriverInstalled (cyclomatic 13, cognitive 16): ensureRequiredAgentDriverInstalled has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"14af92ab1269fa24aba82c4ea3e991e3b1b901bd80a46441b5c218ff54aef0d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopDesktopAiRun (cyclomatic 13, cognitive 16): stopDesktopAiRun has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":5131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe9a4492d90565fc4b8e407d77bec9fa96bb77257d726400203c20ee19c711c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/__tests__/DataGridGoToColumnShortcut.spec.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b5159d91a15dac2706b0946c1cb8e36bd1b9a7fe59898794f272e6dd2f47cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSchemaOptions (cyclomatic 13, cognitive 16): loadSchemaOptions has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"a425c001174b5e368afbf1e9ae71d656bfe8de2c5df927419368a1b8cb094b72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableChildDropObjectName (cyclomatic 13, cognitive 16): tableChildDropObjectName has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"901284382924ea1a55958d2b8eeca4deb7315c1cba74830e5f654630c606113b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeItem (cyclomatic 13, cognitive 16): executeItem has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useMultiDbExecution.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5246c7a46bed4ac93139f255a39021875e94fafefe448d087315e7f99b91d315"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveHoverTableLookupTarget (cyclomatic 13, cognitive 16): resolveHoverTableLookupTarget has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/hoverTableLookup.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fecf5d420f3f2fdad4ebbe4f7c6e49044b3f30f5d6b54d3b590bf0664ed66b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quoteColumnReferenceName (cyclomatic 13, cognitive 16): quoteColumnReferenceName has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorTableDrop.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca146f333e410acdcaed3f70743bf9a878741feecc1ec362ab543402547acdde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRedisJsonDetail (cyclomatic 13, cognitive 16): parseRedisJsonDetail has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfd8109ce46b59510a480c1c46aa6019c0398ab048c7568bc23c9931291168a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readQualifiedName (cyclomatic 13, cognitive 16): readQualifiedName has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"733a5666b673e5bbb654c8762b12ad8b79e3f1797da70c132a248151322181b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lastTopLevelWhitespaceStart (cyclomatic 13, cognitive 16): lastTopLevelWhitespaceStart has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"484424c9bc71933826154711ef657e4e866c23c7a41ae5a0e5bd74ecb97f8ffe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSqlErrorLocation (cyclomatic 13, cognitive 16): parseSqlErrorLocation has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDiagnostics.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f53136c30d565c49f420203e9bbf8b2ff36ceac57d7b25f09156309ce45c70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keepFromClauseAndFirstSourceOnSameLine (cyclomatic 13, cognitive 16): keepFromClauseAndFirstSourceOnSameLine has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a81ac586b3117789c42bb6a9b468db3bf958621dce61c9d89425c68e523ec1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTableColumnTemplateField (cyclomatic 13, cognitive 16): parseTableColumnTemplateField has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableColumnTemplates.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ee45d550e2a2e7d4e8fd9106ba5a75b8a370145db0a059a2d918bee41eadf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesTableNamePattern (cyclomatic 13, cognitive 16): matchesTableNamePattern has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"964b9b3115274a85ea4a8dad5642625a987f1f82c7ac038caa3286cc29bfb228"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeTabUiState (cyclomatic 13, cognitive 16): sanitizeTabUiState has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabUiState.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5fd5d60b2e195db98ac6f88a224dbaf2909c15c2e8f24768978183ecfbf7fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 13, cognitive 15): main 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":"agents/drivers/oceanbase-oracle/scripts/verify-partition-ddl.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d71958275e89c0239bd031293075e72716a9a7fba7399d15b0f1b924814b125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSchemas (cyclomatic 13, cognitive 15): loadSchemas 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":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0c9ec2c35398a0d146b62d3a155d871e47854c38df00b04253e92b3f85deba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activateTabDocument (cyclomatic 13, cognitive 15): activateTabDocument 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":"apps/desktop/src/components/editor/useQueryEditorDocumentState.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c095742e966b730f91771530cbb4adcdf1fd7f12862492e641b005d18ef2c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function grantLease (cyclomatic 13, cognitive 15): grantLease 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":"apps/desktop/src/components/etcd/EtcdAdminConsole.vue"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb7ffc095670dbf623dc22c9aca054077d6c2c8faf8c92151a0d012abbe03d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPreview (cyclomatic 13, cognitive 15): loadPreview 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":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"08793ec9ea3dd467a67219aaa5ebd4cdbe05a24617c3c88d981b40e0dc54e20d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reloadBatchTextPreviews (cyclomatic 13, cognitive 15): reloadBatchTextPreviews 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":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc25b4cb53638c2a2e04ba79e882b672e4fc52fa7fddd64139c3aa56d1f698c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPrefixKeydown (cyclomatic 13, cognitive 15): onPrefixKeydown 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":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"c368f1f35b4cafedf9b02720cf53205cf62834234d52b3defa65c3cc8b8f93f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendMessage (cyclomatic 13, cognitive 15): sendMessage 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":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"968bec5a75fc5eeab7fa87b9cd419b1a58618831ae41aeb228a093eada69850b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onRowClick (cyclomatic 13, cognitive 15): onRowClick 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d980a1251ff1f34f6cb528fac12640ed98969b9355a2dd0abddf406238df4c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchTableOverview (cyclomatic 13, cognitive 15): fetchTableOverview 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9249a24273dc51d44ef84b60a365d5310f458905510d2f95a57239dfa6a282"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmBatchMysqlAutoIncrement (cyclomatic 13, cognitive 15): confirmBatchMysqlAutoIncrement 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4091}}}],"partialFingerprints":{"codehealthFindingId/v1":"136a4321d66f7ca55b60f9124dca6079227683296f9fd494226f4694890539ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCreateDatabaseUsers (cyclomatic 13, cognitive 15): loadCreateDatabaseUsers 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5664}}}],"partialFingerprints":{"codehealthFindingId/v1":"0010baf24aa0d5b0592de509f4cc242ca8c4d73b4f1755307c914e130c1a1cc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) 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":"apps/desktop/src/components/structure/StarRocksLayoutCopyDialog.vue"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35c36fa14642e73e86c01da85b41b7f358aa5d93a84ca96e45d4f3ffb232617"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportLog (cyclomatic 13, cognitive 15): exportLog 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":"apps/desktop/src/composables/useSqlFileFailureLog.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b79715ad5115598d93705628256820189a1b4cb3b52f96738427f3fb9160fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreDataGridLocalColumnFilters (cyclomatic 13, cognitive 15): restoreDataGridLocalColumnFilters 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":"apps/desktop/src/lib/dataGrid/dataGridLocalColumnFilterState.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"75402e287bfef786b9ecb9e34f98c74041f49a0c9d4050ec60abff3bb5a7739d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDataGridSavedRowRefreshPlan (cyclomatic 13, cognitive 15): buildDataGridSavedRowRefreshPlan 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":"apps/desktop/src/lib/dataGrid/dataGridSavedRowRefresh.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c484e93b7875c2daf6cab05317d36c559d648f2d8700598ebd5f3f1ffa9f547"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveExplainPlanExport (cyclomatic 13, cognitive 15): saveExplainPlanExport 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":"apps/desktop/src/lib/export/explainPlanExport.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd56881435a536ad7a97bf2d04f06dd16e38392d07d234605b6a06a79dacc61d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function influxTimeLiteral (cyclomatic 13, cognitive 15): influxTimeLiteral 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":"apps/desktop/src/lib/influxdb/influxDbV1Delete.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0f45dbd1cf9281d1f5558db54d0ae5db491e04847fb087b96ab7940550eab4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) 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":"apps/desktop/src/lib/redis/redisKeyGrouping.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2af229ca6c03f74ecc4afc1130174b5cd933a1e56f9975f3666ff3c81ff871d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnsForTable (cyclomatic 13, cognitive 15): columnsForTable 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":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e4b3dc00f0385f36ec630ddf2b5366fe8badd6469788889fb028cab91127da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadObjectSourceWithRoutineFallback (cyclomatic 13, cognitive 15): loadObjectSourceWithRoutineFallback 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":"apps/desktop/src/lib/table/objectSourceLoad.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3171f44ff9a35feea456eecef4d91af3b3af18dc2f0c38bf2bb09840489c831"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSource (cyclomatic 13, cognitive 15): readSource 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":"apps/desktop/src/lib/table/oracleViewRename.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff834dad74d179d77cbafb05a192a7d6217e300ec19e364f783d37bec71319f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setDatabaseCompatibilityModesFromDatabases (cyclomatic 13, cognitive 15): setDatabaseCompatibilityModesFromDatabases 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22cd4e6e7dc86b0f7e57a72b18056f55b38ef319cbe8e2523c7cc357dfededd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSqlServerDatabaseObjects (cyclomatic 13, cognitive 15): loadSqlServerDatabaseObjects 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3afcb587a9b26ad8984f1ff4abeee34f9766c23c9b533c55b7831df19fa193a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flushResponsiveControlDragMeasurements (cyclomatic 13, cognitive 14): flushResponsiveControlDragMeasurements has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c75ac307edadf3d742a55503cc72fbb0fb8c7c69a9902745df23ea331d74a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandSelectStar (cyclomatic 13, cognitive 14): expandSelectStar has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44d11bc2992307ea6d43354973510f031676dd0f481d88497a40f372c9d463e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"c671baa5bd7b968b10a94ab4ed4502c81558df1bed49f34087e6df2817e9d52a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmDropColumns (cyclomatic 13, cognitive 14): confirmDropColumns has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":5960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7058e8fb49908fce88a4113f1eb3140565379ebbddced869ac7f87fbee81be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function performCopy (cyclomatic 13, cognitive 14): performCopy has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridExtractorDialog.vue"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"66880f0276f39469249d2bbcbcc78a2ba0de46a2e5e914540ec12d688411c037"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginFloatingWindow.vue"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f84c7088d8e3008eedff316ae8b7350efde6a304544b9d2dc00173d33f0aa5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTemplateContext (cyclomatic 13, cognitive 14): loadTemplateContext has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"658fde9adf68c52f99690c96f0f860373e15c6880af9ee6db2d93411b25d9b19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmDropSchema (cyclomatic 13, cognitive 14): confirmDropSchema has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":6153}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3d40a1124c7d44d6d6db055e3a42b641e157670b1c809cd6c91dffb736fafd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exactTargetType (cyclomatic 13, cognitive 14): exactTargetType has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d0072d9f73b481159f4ae5592ad429add831f6691af14222aa1da47baab0d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMouseMove (cyclomatic 13, cognitive 14): onMouseMove has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDragSort.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf84332fb87d669447dc954a61171ff98422136d9e394be5886f67b2d3618f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildAiChartOption (cyclomatic 13, cognitive 14): buildAiChartOption has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/richContent/aiChartOption.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a5bbdee8bf65e96fbe86f63301aada64ccd69b04d815301fdcbc3fd08279a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSkillListing (cyclomatic 13, cognitive 14): buildSkillListing has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/skillListing.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3817af31fbb6b925ce5e53e0b049edc505daa462d68671bb800d876408e9faff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionAttemptTimeoutMs (cyclomatic 13, cognitive 14): connectionAttemptTimeoutMs has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionAttemptTimeout.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79bedce56c3b9f59a0edf17f3b44ec3ebcc89bf2b450d335185ccf3d93732d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionRedactedEndpointLabel (cyclomatic 13, cognitive 14): connectionRedactedEndpointLabel has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionPresentation.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea587766010b52ddd4ab2e891b04be9bf12f1f36c522258ac9f2029c6cc16b6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleConstraints.spec.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d97c092e071fb257236a4e396f30c122d95aedbdb16f7be1873d08c6e97f1f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleConstraints.spec.ts"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"268f18cdd4e6fc16e3cfdb7c88f62564568c59905417ffb37c9e0659c7a39f2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9482233104822ebaaf935106f56d2512164f4a0bd0a1969e792f2ccecaa5c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"68082e2065068180f830f3f6cca8da58d3d0d4d73621c562ff8167efee0b35d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefc5dc6b076265c2c8e2b129e84e5c06092383cb98755f62ddfb92caa47a32c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 13, cognitive 14): render has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorSqlAliasHighlights.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b76e569088d6977241cdcc2b46084c37eb7027b8565302538ee0616a203957d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function token (cyclomatic 13, cognitive 14): token has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphQueryLanguage.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f4768515ddeccc84b1cd21a87b4725b9033122f629fe8a552b2139b7801f9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/neo4jGraph.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace7e9271c49ce93d8f9afcf551feaaeb6244c331ea16e32d0b07f8e7cf50380"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mongoJsonNumericValue (cyclomatic 13, cognitive 14): mongoJsonNumericValue has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e35e433a842376359c01e540388bbc4d133f5eb1afb25b62afc3f3d8a027220"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlDatabaseTree.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"72abcddce429bbe59496ac840f82071ec78923615cba11c963edb2769e73f8ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlSemanticSelectStarTableSources (cyclomatic 13, cognitive 14): sqlSemanticSelectStarTableSources has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8353961bcb77bc8314892ee0d92959049edf2368fe00f4d11c1680243ebc6fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findActiveSqlStatementSpan (cyclomatic 13, cognitive 14): findActiveSqlStatementSpan has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/tokens.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3c2a3677092af0c972dd59abaed1e5044ca66cce2509bd468f0d11993a6423"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveExecutableSqlWithBackend (cyclomatic 13, cognitive 14): resolveExecutableSqlWithBackend has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlExecutionTarget.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e532850fa8343cf6d074494ca09e8583af4b8212216c5c1541784b29d33b21c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipQuoted (cyclomatic 13, cognitive 14): skipQuoted has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"a157d42eef340edf87fc0c87476f25950cb80c490f8cfbc1fe2418117a1de3ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeTableVGroupLayout (cyclomatic 13, cognitive 14): normalizeTableVGroupLayout has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cc3e1791889e9c502b1a96b02aa6f3a37e8d34a157d3db1a65d34b18c3b2e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openNacosAdmin (cyclomatic 13, cognitive 14): openNacosAdmin has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cce91966f0702bbe2ec7503155cd5b061c6144c2f092e347b654e3939967961"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableTargetFromActiveTab (cyclomatic 13, cognitive 13): tableTargetFromActiveTab has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f30a4a2a987961b16561879b6efecb93b4eb822353db284738bfbd31eed94c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmBatchTerminate (cyclomatic 13, cognitive 13): confirmBatchTerminate has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf8bacee865d58ae3286ec7492cb9d4dafcd038a9ea328df8c6f4c1b0026fbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildToolbarMenuItems (cyclomatic 13, cognitive 13): buildToolbarMenuItems has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/AppToolbar.vue"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd20bef9e2cdc46599675ed75f86abb4486410da985436f5e71423046370929"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function triggerToggleMenuItems (cyclomatic 13, cognitive 13): triggerToggleMenuItems has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3617}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f941e0653dafb4e6233f9ca70f7263540ec42407754e0aa465c623f1aac0d94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6e8e4991327bc0f856b0ac66865b6797b1c46cc806052189e79292ab871fa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dataGridHorizontalColumnWindow (cyclomatic 13, cognitive 13): dataGridHorizontalColumnWindow has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4ea34d846daf4b85da139911ef240b81498a5a8fe071a25a8a5ce6ca7009ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locate (cyclomatic 13, cognitive 13): locate has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/usePluginShortcutSort.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a72ce014d62c890357f7d7db2d007260b79124c19a1fcc27fa8fb0a51c98806"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmDeleteNacosNamespace (cyclomatic 13, cognitive 13): confirmDeleteNacosNamespace has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"680938f7ef9213f21c0009f818a3b8a8bbe97cf8fd080c9a7616c268ffe708f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeDatabaseBackupTableTargets (cyclomatic 13, cognitive 13): normalizeDatabaseBackupTableTargets has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6864276d0e690dff29bce268c24c5f782e3c8a7d7ddb73d8913a2f184e43de00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySshConfigHostAliasPrefill (cyclomatic 13, cognitive 13): applySshConfigHostAliasPrefill has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/sshConfigHosts.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4078b9aaa2d6054af6a15a30616cb21059b9b115092c7ac98f797313c2605e36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleConstraints.spec.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a768dee1506b18d8ed07ddd43a2fd25ba7711e07da5020b4dc168561924a0a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/__tests__/oracleConstraints.spec.ts"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0240509159faec8fb25a907ef35ee4b297f19a73e9a57089357e8496a5e536"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectForeignKeyRows (cyclomatic 13, cognitive 13): objectForeignKeyRows has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/objectDependencyDetails.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"609f05bd8cd4554b3b54d0a4980b07e7bbcae867e2659c2a8e7056cf4684f264"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizePositions (cyclomatic 13, cognitive 13): sanitizePositions has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/draft-storage.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0cc36adbb47b409d58035f353b4dd8eb1b22d8ac7eff33829cb5962807a317"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExplainResult (cyclomatic 13, cognitive 13): parseExplainResult has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f433ecb65de51b724b3afa91e21a85954251c0a5d34ce625a1c2800b81c03343"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDataGripUuidMap (cyclomatic 13, cognitive 13): getDataGripUuidMap has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1819a2221e61d8c8f775a72f5c66e2abc1b9f8f5426a99caa931cd07c92911"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoRunCommand (cyclomatic 13, cognitive 13): parseMongoRunCommand has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd55e270c5df25c1621e72e8eaf00a9ea7095ef11265a5d47af9898c28fff3d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nodeEnvelope (cyclomatic 13, cognitive 13): nodeEnvelope has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/neo4j/neo4jNodeResult.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7cb59c3b33a7cf91d07c70cd6f6188c46ee12cfc5911fb328ff416777f7c0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeSchemaDiffRoutineTextDiff (cyclomatic 13, cognitive 13): summarizeSchemaDiffRoutineTextDiff has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffRoutine.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"965e0fd45e8707c6d888ed6d2991e04002d1cdc79f74b030bc6e76fdabda3b17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRoutineDefinitionStart (cyclomatic 13, cognitive 13): isRoutineDefinitionStart has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfa32397bb8fab5995ed0995e891421227974da37db15cea956c8c15caee707"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setExceptionBreakpoint (cyclomatic 13, cognitive 13): setExceptionBreakpoint has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cc9ef50318fa863cd3887a1c4083501d7ef88cbb7eee6bdfa490ff3b5e0793"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cancel (cyclomatic 13, cognitive 13): cancel has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/tableCopyTaskStore.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec810bb70bd3d0e74460981e3bd25cc392f2c04768d3c5745b28668473bc47d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchDownloadCounts (cyclomatic 13, cognitive 13): fetchDownloadCounts has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5207d6c35c0a6eabab25e8b7fd61cc88dfb1e25b017d294c5c9c662c88e0af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadAssetManifest (cyclomatic 13, cognitive 12): loadAssetManifest has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/build_offline_jdbc_payload.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6048cc88e9ed5d3407c5b8995f6089036d4cfcbb05592ea6b53bb1bd4da9c23b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchStatus (cyclomatic 13, cognitive 12): fetchStatus has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/PostgresDashboard.vue"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2066c3c643eafcd9b322ec4e281e943c8c8d06c99c626d72ab1d6e8d080ebf17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyConnectionDraftToConfig (cyclomatic 13, cognitive 12): applyConnectionDraftToConfig has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6619}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41f48210001d69645e10ad0a37b377cf680ce3867f730f798927abfe4d837de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/DebugParamsDialog.vue"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"130ce2101d825a15950d50c72755de5eeacd748ed5bec5dd675757e38fec5395"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitLoadedDocuments (cyclomatic 13, cognitive 12): commitLoadedDocuments has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b839e3b5196c591c3f58cdb1da369415cbbeb44647df1f69fecc160b17c28563"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function conversationRowDetail (cyclomatic 13, cognitive 12): conversationRowDetail has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c696b4de3e93d7801c5e4156da7eb4421358934c31696ff0d6c0b68ad291241"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadMentionCandidates (cyclomatic 13, cognitive 12): loadMentionCandidates has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6004e7271cb084ade083441a6497c15c3bf4656dc31c1a0893f0b67da078276b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provideRedisCompletions (cyclomatic 13, cognitive 12): provideRedisCompletions has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"2747b4d699ce1b97af0bdc7385f8d72648c747d8285c245d7eceddfd844c5330"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectTableInfoTab (cyclomatic 13, cognitive 12): selectTableInfoTab has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14014}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcbb88966100e12525cfed4286f8ca40936b61425a37225e7eac9a3b96931ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadLazyChildren (cyclomatic 13, cognitive 12): loadLazyChildren has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b86bf757cf4d307c0c8864eb8aec3190f4b9708378bf4be012b4931386c1b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractConsumerLagMs (cyclomatic 13, cognitive 12): extractConsumerLagMs has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"586dcd33ff438be564bbaea91bf8dc5afc66501a55acb90fe88e73d95afada6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function iconFor (cyclomatic 13, cognitive 12): iconFor has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6632f9c093bc3c56e93d7fedec5eb70533e06d9b7149a147bdbd6bd9d0a66405"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openTableInfo (cyclomatic 13, cognitive 12): openTableInfo has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcf696f33e251ef5feaba62a2df424fc8c2bef13ce11d72827c91507ecf30bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshActiveTableInfo (cyclomatic 13, cognitive 12): refreshActiveTableInfo has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bba2c21e42f74e474b42417e2295e3f188beb689783f0e1980fa244137f724d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function value (cyclomatic 13, cognitive 12): value has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4588}}}],"partialFingerprints":{"codehealthFindingId/v1":"e032c99ec897b74ed2dd7e2cd014681e05901c764ae7d96cdf92d93e9320ded8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"824b9da9b0b4934f4b17cd6bdebd3b702c597010f67406f7f28c58f22e021740"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openDetail (cyclomatic 13, cognitive 12): openDetail has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/McpCapabilitiesPanel.vue"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8504a63bcabab46184afe421126ff2d512d432247754b380d273b496b7bcf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestDeleteSelectedNode (cyclomatic 13, cognitive 12): requestDeleteSelectedNode has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"861ec30fd6c036a8bd8e87d347a4bbba00faf7acdd985a43b8596000c681cde0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadMysqlTableEngine (cyclomatic 13, cognitive 12): loadMysqlTableEngine has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"969af04e9dcd2e39e96a72f038e8bfc5ddffdcdcee511734b173f861ce42dc1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTriggerKeydown (cyclomatic 13, cognitive 12): handleTriggerKeydown has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/searchable-select/SearchableSelect.vue"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7283db70bfb9fa788039fea01fd5a6cc2bbf647caa1c6b17ac4f8826da7049"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordDataGridHistory (cyclomatic 13, cognitive 12): recordDataGridHistory has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f4ef306ac828580102bf6d8ef76b2fe3c1bb5d6b6482fe7b7608a950a4b0bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmCreateNacosNamespace (cyclomatic 13, cognitive 12): confirmCreateNacosNamespace has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdbd6d89c50d7cc95265bce3d0bcd009ad04d181d2fcf3341f8b221fbd9becc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serviceConfigForDraft (cyclomatic 13, cognitive 12): serviceConfigForDraft has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3c9492227b6be451b51216b7da329d0f110a7d7f5df7975b5533c54e61e993"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mysqlTlsMode (cyclomatic 13, cognitive 12): mysqlTlsMode has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionErrorHints.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bb1a36b221e8b45dbe2e2e3a0fe08850e401ba9011ee5659c8718d1ecde526"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parameterValueError (cyclomatic 13, cognitive 12): parameterValueError has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionParameterCatalog.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c9ab840a752e05a4c2c039409c6d32dc0cb077301def4c8393bb41cf58af24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jdbcPrefixFor (cyclomatic 13, cognitive 12): jdbcPrefixFor has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec981359c69af9c54d1812b5ac094fe7a45b917aaff82c1a28deee57f7fe239"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeMqKafkaZooKeeperServers (cyclomatic 13, cognitive 12): normalizeMqKafkaZooKeeperServers has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/mqKafkaConnection.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c33b03ac2beb3879fdd755d12a37f8b8c5d62b49f7263c0840a70c4436878d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oraclePrimaryKeyState (cyclomatic 13, cognitive 12): oraclePrimaryKeyState has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oceanbasePrimaryKey.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50c669effac607d3f45e8a31d3d337a0da557f7f320169f92e6f272c4a573e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkOracleForeignKeyData (cyclomatic 13, cognitive 12): checkOracleForeignKeyData has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1515190064a31fa1204d5966ccbe24d14d4ec281f2f07af5c969d83819b4e042"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quoteValue (cyclomatic 13, cognitive 12): quoteValue has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/nebulaGraph.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d27b3252c87c11c710d401f3cfe919fd88f40094f69e777ba0de38a83a0fdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mongoExtendedJsonDateValue (cyclomatic 13, cognitive 12): mongoExtendedJsonDateValue has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"99462d0e34645cca00a9113ba1da75cae62ae880ac4929ef3d4e209fb764e564"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoCreateUserCommand (cyclomatic 13, cognitive 12): parseMongoCreateUserCommand has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79ac705444ffbd76bf56e70eeeb4845bfae4d8321484c2a75e2b4483a045a84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatDecodedValue (cyclomatic 13, cognitive 12): formatDecodedValue has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mqtt/mqttPayloadCodec.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a827495975c572ddaa8ee5853cf9fdcf9f3660c4ae78e9f083a7f89c8e421b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isValidRecommendation (cyclomatic 13, cognitive 12): isValidRecommendation has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginAiRecommendations.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e68cda4c02de7198fd1327842f2450038facc4088aa2c215e97bd1a17f7daa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleWindowMessage (cyclomatic 13, cognitive 12): handleWindowMessage has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1820f0bfa0f8dd66db2a5a22cc3a4d1c82b7c40bf35860b14c6406f57e1e0938"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trimSqlTextSpanWhitespace (cyclomatic 13, cognitive 12): trimSqlTextSpanWhitespace has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19b351f322a8510ffcc5976067fb5052ef06fc0c76809cad99fd75d5fa39eac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSqlVariableSyntaxToggles (cyclomatic 13, cognitive 12): resolveSqlVariableSyntaxToggles has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariableSyntax.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f500da53f3c0e46378c6c1c8e9c5c9a364203ce445d5c85ea59a2ed331059c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectBrowserRowTreeNodeType (cyclomatic 13, cognitive 12): objectBrowserRowTreeNodeType has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd486ced1e8b2f0dbe6d00c1f85837ed9749a8068062e6ecd1669ccf9518e08e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeObjectBrowserType (cyclomatic 13, cognitive 12): normalizeObjectBrowserType has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e318e3db3c38b61aecf07305fc8a8df731e88381f8cd72d3ed0b759ccc77f3c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSnapshot (cyclomatic 13, cognitive 12): readSnapshot has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c262603b919f5271d554e5b741a8aa02eb9ce6bd34c2ac8239721621628513e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStarRocksCapabilities (cyclomatic 13, cognitive 12): getStarRocksCapabilities has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksCapabilities.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46bf79c3615a1073c76e8d3c1984ef2b7bbbe2336cbc2546a46a35cb4ff6a16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeInferredType (cyclomatic 13, cognitive 12): mergeInferredType has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableImport.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ac89ebf2da0e46a5c358459bdee8227b0de008dc82e3d447d686e708dedf21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSidebarTableStorage (cyclomatic 13, cognitive 12): loadSidebarTableStorage has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4067f3dafa3b633303fbcc44bae0c1615575355f0e7c9eecba4158ecaf4e226d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadIndexes (cyclomatic 13, cognitive 12): loadIndexes has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8726}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f238bf8c89c5912396345bd8f2095933512009522c64a630b47cd17707c01a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreServerOperations (cyclomatic 13, cognitive 12): restoreServerOperations has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2536553b6d095790e48df46e7417bce9300d2a6aef6efe59d785d134ec6716"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbd2bf9f07815c3321daf22e8e5f0b0ceb37aa5de098493f902a24d8ec0a6eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeRememberedConnectionDatabases (cyclomatic 13, cognitive 12): normalizeRememberedConnectionDatabases has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfd0a37cf9c468c1bf513104095c106e998b7bb5882928e432f3ea101a7db9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startDevelopment (cyclomatic 13, cognitive 12): startDevelopment has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/runtime.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f50113c2ff742826898d6bde4024d41eeae678c35e0ca451f05a150b2786a0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 13, cognitive 11): main has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/build_offline_jdbc_payload.mjs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f138865ca0d2d011a23bb3c542dff52c82f79d6f373aa3b64293f47085b6387e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectModifySegments (cyclomatic 13, cognitive 11): collectModifySegments has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f61dc673f72826308610b4ffdd817e1503c14e4883826e33cedcdc51cfe6f15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildConversationSnapshot (cyclomatic 13, cognitive 11): buildConversationSnapshot has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"6216ce0a835b1b63f2dc2134e7bf63537b1b92c30fa71322d678bcf4e07eb147"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOnlyStructuredFilter (cyclomatic 13, cognitive 11): applyOnlyStructuredFilter has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a9a6ee8365629f6b009b966d413a4dcd1ba2e02383dcbbc8c45835f399b10f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleGridPaginationShortcut (cyclomatic 13, cognitive 11): handleGridPaginationShortcut has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":4589}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccda2ce1d7708f0364c6bce5c77283949874fef877d7c69f9f98c712b6e6879a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":7340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe9762aadea3a9760e330ebb1ed5da354b6ceb57f3e02712453d314db571a32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function navigateToForeignKeyCell (cyclomatic 13, cognitive 11): navigateToForeignKeyCell has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14337}}}],"partialFingerprints":{"codehealthFindingId/v1":"6148a2727195707db3ff79e90f7d1eb124b2d05f8b0e129f168441ebf70e3029"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadLaunchOptions (cyclomatic 13, cognitive 11): loadLaunchOptions has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginBottomDock.vue"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44a344d262626a98668f0be9f9fe0bed74263bd9213907d619d4c4c8a6422b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bufferFetchAllScanResult (cyclomatic 13, cognitive 11): bufferFetchAllScanResult has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf61a735fc18ac159be427731992a681d846a9b700f2dd417a36a90cfacd0b56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scheduleSqlPreviewRefresh (cyclomatic 13, cognitive 11): scheduleSqlPreviewRefresh has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23ec14167cf587df6c946980552294bb8b577e24b034837e01c9d2827315170"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadMysqlAutoIncrementCounter (cyclomatic 13, cognitive 11): loadMysqlAutoIncrementCounter has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0085f022c6518fa030c209ec74f3c8879080c23c9446093314f6992a0d06065"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshExecution (cyclomatic 13, cognitive 11): refreshExecution has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNativeJobExecution.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0e57697a814789fa3ba00525e3b93c4bb4f621983931339bbc38ff4c24f5bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionParameterSyntax (cyclomatic 13, cognitive 11): connectionParameterSyntax has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionParameterCatalog.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74406ca151e99ac6f676ff446f95b10bf5af1de96573731ee0fa35a5258dc81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeCustomBasemapConfig (cyclomatic 13, cognitive 11): normalizeCustomBasemapConfig has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/customBasemap.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0208a374bcd339c586ae5b869177fe9ffd0046582df182956ded2d962de300a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function knownReceiptFailure (cyclomatic 13, cognitive 11): knownReceiptFailure has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d980198583052cab61491fd090d53cc600cd243ba61c9e345f58069d3a3800d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTarget (cyclomatic 13, cognitive 11): validateTarget has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/sqlExecutionTargetRegistry.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed65089b87e334699c01aed2c4ed250525bc4f019b93a8bb49fa94a8a947e016"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function xuguEnrichAclColumnTargets (cyclomatic 13, cognitive 11): xuguEnrichAclColumnTargets has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2413acd28ebe491d21824fc4d8d8a90012f47d5c76f361f687081067e49f3635"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function graphPropertyFromUpdateResult (cyclomatic 13, cognitive 11): graphPropertyFromUpdateResult has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/nebulaGraph.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e87cb21aa52cdea6ede63f15de3935634229d805e4c52cd9fd480e3d918b6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lazyNodeFromSummary (cyclomatic 13, cognitive 11): lazyNodeFromSummary has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/slashPrefixLazyKeyTree.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d7a4ac0fb37590b5d99fd4dd7c063c364f1c1550b70d81797157efbd6fcd32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/completionTreeIndex.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a04cdfa5ee56838fef49699c83be87c1f8035fbe0bd389c08ec8be5e31c2528"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyParsedRequest (cyclomatic 13, cognitive 11): classifyParsedRequest has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/solr/solrRequestRisk.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10d1b751b9605908cc734d0c9ef8083245dbe72b585c616bfeb4398f2a34e09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitColumn (cyclomatic 13, cognitive 11): splitColumn has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/ddl.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e4b8d504df018f43bad218530f6d948e91778198582fbc0cd9322346b68b4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collapseWhitespace (cyclomatic 13, cognitive 11): collapseWhitespace has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27080850df38913d60ce6bb20020dd87f0ad467b306439424337e30824dc4e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTableImportParseOptions (cyclomatic 13, cognitive 11): buildTableImportParseOptions has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableImport.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"56df2d3bd92a49b5291305a47c60ae09ae51c7bf012919c8f9cc0d96cf5e9843"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTabResultSnapshot (cyclomatic 13, cognitive 11): buildTabResultSnapshot has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0889b8e40a4ac7bf7b6058f030990a5935db8ed8ffbef4c08f01743968825d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"937e9c4145d3015cb4af9bcfc43445d456808560337865c95859eddabee8c02e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifestTableSearchScopeMatchesTreeRefresh (cyclomatic 13, cognitive 11): manifestTableSearchScopeMatchesTreeRefresh has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3971}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4786ead26bcaf16b99eefed4c6d8906b108fd01a3fabf52c807bdcb3f8aeb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCustomTypeChildren (cyclomatic 13, cognitive 11): loadCustomTypeChildren has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7962}}}],"partialFingerprints":{"codehealthFindingId/v1":"4797bc31b25e5115a652432e43d38d13ce52d3f76bccc2941116f1c79fb862ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSchema (cyclomatic 13, cognitive 11): updateSchema has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6953}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d61972905bf09031f5996567649d9143f0e776592cb0594704e635195a8e0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canUseQueryKeylessRowPredicate (cyclomatic 13, cognitive 11): canUseQueryKeylessRowPredicate has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7382}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe206ca84dcafb121012f81b6ea1205df547426a177e3a79b6df6e63d6c4d7c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 13, cognitive 10): load has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/NativeJobReferencePicker.vue"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"98073ef3e9e88cbbcb1c440c34d5775189c2a6481c49a693afea7e864eda906b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compressCurrentSql (cyclomatic 13, cognitive 10): compressCurrentSql has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b9b650383b24f9b9b373843c8536f73b4b0ac25100d6ed7f119836cbc36f8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":3996}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd06f703bf26fd62ec0370a514eb8d4e93fc63dd13050b2a257f4974ea87ecc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":13768}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f0701dc8ad3cafca495c41312414626dc30de1bbfa1ca9bafdaecf89092e59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadInstances (cyclomatic 13, cognitive 10): loadInstances has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7906481636c075da9dc6e102b0bbe512f44801d7271284a8cdcaac945934089b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTableOwner (cyclomatic 13, cognitive 10): loadTableOwner has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b31734598f23db25c44e54dfc455cd8da366ca6cb8563acd05ae7d72917a89c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAiConfigDeepLink (cyclomatic 13, cognitive 10): parseAiConfigDeepLink has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiConfigDeepLink.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50834db0f5f04c80c86d6f1da14eac9721576bed3d17f67f82a02b4c7ff33a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dataGridColumnLayoutScopeKey (cyclomatic 13, cognitive 10): dataGridColumnLayoutScopeKey has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnLayoutStorage.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1406887ed24bec219cc2859bc06486eaf00ecc4f96371fff273a1af731d83dae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dataGridInfiniteScrollAppendCompletion (cyclomatic 13, cognitive 10): dataGridInfiniteScrollAppendCompletion has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInfiniteScroll.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"939395b23be340b5fcad1f02107c9fa0ce06e61c90863ab4b39bf1d22e3c3f7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function imagePreviewDialogSize (cyclomatic 13, cognitive 10): imagePreviewDialogSize has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/imagePreviewViewer.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"010e95c484eec98fe9f177deab4bb67f0f0c5bda4c0f51f21de353a4b94c56db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function strictInvalidObjectRows (cyclomatic 13, cognitive 10): strictInvalidObjectRows has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleInvalidObjects.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7b054fdbc8cc5e22f5f449abbea7466dd158bdd39a19b0db950c09a668ad0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySqlIdentifierCase (cyclomatic 13, cognitive 10): applySqlIdentifierCase has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4995}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac0f497755da7a64e620910d56007ff9cb065cfce4c2b772975106446b75897"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function starRocksLayoutChanges (cyclomatic 13, cognitive 10): starRocksLayoutChanges has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/starrocksAlterOptions.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7327093c241a060313a8e162f6cd4b61e57c2a9411cc5e99a046d43b962313"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeGroup (cyclomatic 13, cognitive 10): normalizeGroup has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/sqlExecutionTargetGroupStore.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4ba9bf065ab5942a7b497ef8bc7bb14b267688805390f7cabf41e7d770e4df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onOpenObjectSource (cyclomatic 13, cognitive 9): onOpenObjectSource has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3701}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d333325eaa50130ffb7a7eee8e5f947b5b6568417e121bd36a4d8c8139b2da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function value (cyclomatic 13, cognitive 9): value has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/NativeJobDefinitionEditor.vue"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c653732d0e661ef485a44fa66af39b1bb82f9b911fb0bf2eacf24fe2e17dfcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSqlLanguageExtension (cyclomatic 13, cognitive 9): buildSqlLanguageExtension has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bf4fec855615ca93c198406f31893ca2255f3120a6edc1e52710f82347a175"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retry (cyclomatic 13, cognitive 9): retry has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d982549f27d70dcdc40a76957990758e9f1a5e6968f8ba47b5b130e4e048309d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 9): (anonymous) has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/PoliciesPanel.vue"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7673c93c9f95dbddaa5e726af1228ba1f05cecddf6e6356b97200b0c3c6ae6f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canStartDataGridLoadAll (cyclomatic 13, cognitive 9): canStartDataGridLoadAll has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridPagination.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0a91862663a41401c901ce1c3bc54501f271d0a9bf0edb9e168c48e4cc6bc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stateFromMetadata (cyclomatic 13, cognitive 9): stateFromMetadata has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cc3ebc39f4ef25afbc5040c5bf85c36dd40bbdc135f20dcacd05716060cde2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffKind (cyclomatic 13, cognitive 9): diffKind has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dolt/doltVersionControl.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd55960ae090017b6447dde4620f33b3d327a3b06317587f17767eee5bf78fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isDangerousSolrRequest (cyclomatic 13, cognitive 9): isDangerousSolrRequest has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/solr/solrRequestRisk.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea8930f7edcb50d5b7fa021e65eff4db5e45908778d4fc4ad338ec97a10d053"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function persistSavedSqlExecutionTarget (cyclomatic 13, cognitive 9): persistSavedSqlExecutionTarget has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6863}}}],"partialFingerprints":{"codehealthFindingId/v1":"1938d7e56373f5b3d0587b5ef8d906c9bb697ac65c7064892da698940500efce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferRelationships (cyclomatic 12, cognitive 36): inferRelationships has cyclomatic complexity 12 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/match-engine.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8101f01e57833e8ad7b8c495360fc6756850b3e605e9eee06bde2116002517d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aiStream (cyclomatic 12, cognitive 30): aiStream has cyclomatic complexity 12 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f7495f636bacc3118a1125d8511ce7aa7bfe8e19488123b8d5aedfcfb5d5b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uncommentedLines (cyclomatic 12, cognitive 25): uncommentedLines has cyclomatic complexity 12 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchRequestRisk.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21676a230118299df4072abc4446b3f11cbeaa50fcb5760c0ac6fb70cb8131c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uncommentedLines (cyclomatic 12, cognitive 25): uncommentedLines has cyclomatic complexity 12 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/solr/solrRequestRisk.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"91903013d62d2de0b936be399ca6b34963d3b266b9990ed6de770fe0d6753675"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startWatch (cyclomatic 12, cognitive 23): startWatch 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":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"19908cd2e02b712b40eaea88881ac447598593217588c1738115d2f636861c07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanBracketRanges (cyclomatic 12, cognitive 23): scanBracketRanges 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":"apps/desktop/src/lib/editor/plainTextSelectionRanges.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdc18643b0bfb465dceceb41957d7bdb05f4dd14cc820b977cb4d29115cde88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findEnclosingDollarQuoteStartInText (cyclomatic 12, cognitive 23): findEnclosingDollarQuoteStartInText 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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60940186800eb3d9adcbfe21f0099bd708c83c457e0716dc0c3744cd639f161"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runWithDatabaseBackupSnapshot (cyclomatic 12, cognitive 21): runWithDatabaseBackupSnapshot has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExport.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"78743eab02836bdc09432f06f503368e30cc588f7167e43fe754e8be1d734200"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findRoutineDeclarations (cyclomatic 12, cognitive 21): findRoutineDeclarations has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcf007cccff672d719c63699266ca10596dd62169ef29a8ce015ad9c713dc21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleInspectorUpdateTable (cyclomatic 12, cognitive 20): handleInspectorUpdateTable has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e86480e3182771e9095c3bba95bfbe72ea6ab9a0f24b8547756bb6d73be45f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createFlatTreeIndex (cyclomatic 12, cognitive 20): createFlatTreeIndex has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useFlatTree.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ef7f0463cdfe95d5756630b9810eb2e1dc4f0f72741dda823877cf39d15dd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectStage (cyclomatic 12, cognitive 20): projectStage has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"30abc584d361bf1f9fcf2a01f49b31777f2c88acc753c4db0c8e55bb8a45b36d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findSavedSqlSearchMatches (cyclomatic 12, cognitive 20): findSavedSqlSearchMatches has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlSearch.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e7214cea86e422d4bef5c80d2aa57fb0585d0ff4f8f6f861c4c0f2a2a5a94f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateFromPattern (cyclomatic 12, cognitive 19): generateFromPattern has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/IdNumberParams.vue"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00ef9b5cbe2d9994fd340a9013023dfe9dada66597c2d1ba4958c341b7d34b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function literalFromPattern (cyclomatic 12, cognitive 19): literalFromPattern has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/params/SkuParams.vue"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"36acb29a1bee86b29c7cb735179a618d2e6a0a1a5067cf005ddb1e5b95f4f036"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyScrollPosition (cyclomatic 12, cognitive 19): applyScrollPosition has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde644a0eb2ed18c21519131372394eea338da20b7a2e14e1fdb5927ca34660f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 19): (anonymous) has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"68801939507bc35c4573b3fef361ecc1f439e7c2d8a446f3e233f4f619b3a5f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDocumentFilterValueList (cyclomatic 12, cognitive 19): parseDocumentFilterValueList has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afcc33a73c2ee5027380b4fa5854b21ea617e7646a14d168cfa62b275681d87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifestStoreVisibleAgentKeys (cyclomatic 12, cognitive 19): manifestStoreVisibleAgentKeys has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/__tests__/driverCategoryDefinitions.spec.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab802c0fce7e10887eed1e6201215f98e721812001a1159edd0277680487dcf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateSkuFromPattern (cyclomatic 12, cognitive 19): generateSkuFromPattern has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39885f3c65e574cb44fd9a3ac6e8edd1a5e5d85e7a52711e5c3c0ff02158f49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNavigationTarget (cyclomatic 12, cognitive 19): resolveNavigationTarget has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d8131815671026b57f7ceda21a09e028f8d19f49dcd1f02193f3e7054360a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateGraphResultProperty (cyclomatic 12, cognitive 19): updateGraphResultProperty has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphResult.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4e7f0b4015d2a23392246d30ff9c0a35c70e30a83d164760b38f65c3004e57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadObjectMetadataFacetInternal (cyclomatic 12, cognitive 19): loadObjectMetadataFacetInternal has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/objectMetadataCache.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce035b025bfb2a838cd24dfd60fd2b763f394d659b5ecb9442a78a16ae07570"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyFindProjection (cyclomatic 12, cognitive 19): classifyFindProjection has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76c0bd2af61fe92997670164293352c0974b42e4c5e35b95731bd4359789f78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runWatch (cyclomatic 12, cognitive 18): runWatch has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4711c1f82368d6d1582a6c4da90723dc9a5670f1aab6296216cbc3ac072a88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileServiceMutation (cyclomatic 12, cognitive 18): reconcileServiceMutation has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadc9e396ff9d4463fbba77736fffab289f248de5d4e6a50de62279c9beaf401"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatJsonPath (cyclomatic 12, cognitive 18): formatJsonPath has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b255ea8269436276c991fe747bc9a1a3a65c619a1aae37ff9fc0123f11e54a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 18): (anonymous) has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9938fbbbc1b6f618d27a7d07f4580b346bd2860410f438f90172dfbf5f73c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferProfile (cyclomatic 12, cognitive 18): inferProfile has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa596e361c947b496cbdfb480a54419a68246a5e9b27f7175c53e041fb50647d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pairChangedLines (cyclomatic 12, cognitive 18): pairChangedLines has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37027ba3afc9d3e952220b4a44e27d20c3fae17c96638a83405c40427cd83d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSourceSqlLiterals (cyclomatic 12, cognitive 18): parseSourceSqlLiterals has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlSourcePaste.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5604e6c023ca51d76e88e1ab815c2df82d65cd2572990fdca240f52e9b7d5dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeLocatedTreeChildren (cyclomatic 12, cognitive 18): mergeLocatedTreeChildren has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3081}}}],"partialFingerprints":{"codehealthFindingId/v1":"474dac311b022a29aecc5fef9fd382c53c0254ccc3a3406a63d7bc6bf5c2830e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) 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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e518f9d3c83b695d37f0af60d63447eba97968360a091f57c56a985a6317b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) 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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efeb3ce918cab0ebfbc933ce4bdea2299e3f6b1f05c3bf0bd741518ba3fb0e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabColorStyle (cyclomatic 12, cognitive 17): tabColorStyle 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":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bdd86593ceff8eb0acbd39edc71356c7984820e82ed907e80ae016e6fd8067"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMetadataBackfill (cyclomatic 12, cognitive 17): runMetadataBackfill 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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1aab6c7567e09d6f18effca60896bccea6a1fd9dc83dbd9ce7fd8388a2e1dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) 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":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e998a813f2eefc700757784dd64f70e5ffd5911fed9c085292b6fa6e4be6b239"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnHeaderDropTargetIndex (cyclomatic 12, cognitive 17): columnHeaderDropTargetIndex 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":"apps/desktop/src/lib/dataGrid/dataGridColumnHeaderInteraction.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"595cd50cf82662c40287533c9af27014ba479fc4219d86787baa25f0edb0fb2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareDataGridCellReplacements (cyclomatic 12, cognitive 17): prepareDataGridCellReplacements 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":"apps/desktop/src/lib/dataGrid/dataGridReplace.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c9b06e75353345793cacb6cdc2e303a21c56a489951b07972f07bbf15103f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) 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":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e363cf6b883d932bc803a06cb3474d311e0a8629e56203d8e203e0272eef3ffe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSavedSqlExecutionTarget (cyclomatic 12, cognitive 17): resolveSavedSqlExecutionTarget 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":"apps/desktop/src/lib/savedSql/savedSqlExecutionTarget.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9e3b3a7d32e2cb0db57afcbc74a24881703e48488eb4f646a0322a7979c045"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mutationTargetIntroducer (cyclomatic 12, cognitive 17): mutationTargetIntroducer 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":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c4678b6657a926a182c2b527a97c1b378b921eb68c82f7717567026943eb32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findActiveFunctionOpenParen (cyclomatic 12, cognitive 17): findActiveFunctionOpenParen 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0999cbf7134b000602a3ef7220ce3f1e6522dbaed1316c004a630f04f7c14d14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function highestRiskInSetTokens (cyclomatic 12, cognitive 17): highestRiskInSetTokens 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":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed08d396a8861918973cb13550726789a1a18edc23443a6313e286fc0e514a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabColorStyle (cyclomatic 12, cognitive 17): tabColorStyle 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":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"10669983f75d515ffd0ed555915289beaafcb3ecb563f8e1d327ce92d6b2316b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openDbFilePath (cyclomatic 12, cognitive 16): openDbFilePath has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b58340eb735713ac7460de4474d023e0fde9796a9e920c0fd99805fd2c0423"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runNodesWatch (cyclomatic 12, cognitive 16): runNodesWatch has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9a12e6c4b6cebce9618ef542e9d472adc1367923e97b68a1937705e2bf525d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleDeploy (cyclomatic 12, cognitive 16): handleDeploy has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"3671fb256584d758a56b6c7edffb6755e3dc16ab4586c9e576adae40eb61b2fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enrichSemanticDiagnosticTables (cyclomatic 12, cognitive 16): enrichSemanticDiagnosticTables has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba85b2b4b1842b3d962e29a442a98b5594e1fc99184c28a16f73a969c4b8cff8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newQuery (cyclomatic 12, cognitive 16): newQuery has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a95ed5650255f10f7265ade5e462e2a4d814ef3f59932e5e5c337f919d3c89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOracleForeignKeyCreateResult (cyclomatic 12, cognitive 16): readOracleForeignKeyCreateResult has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98c68fb6fca8ef3df7019580c945c88492f1e9aa4dd7db33bead81df62bca3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateMutationStatement (cyclomatic 12, cognitive 16): validateMutationStatement has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ab8aa8c5a73c44333eed410590f8a1947ca0be624f495442f1854ca4c2521a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDataSourcesXml (cyclomatic 12, cognitive 16): parseDataSourcesXml has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fd8a8762d6d679b6944889a9cec8fd593550015b18a0207c4597a6cf0fea99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTableMetadata (cyclomatic 12, cognitive 16): loadTableMetadata has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad101ed231e2770ba85bc158f0beacff8f7f8d1e40eab0846db10d91a7815356"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function firstRedisCommandToken (cyclomatic 12, cognitive 16): firstRedisCommandToken has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandSafety.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"587f4c5124c9b553c798ae01290f2b298a59183173a2e169a9c43405f44e26d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flattenVisibleRedisKeyTreeCooperatively (cyclomatic 12, cognitive 16): flattenVisibleRedisKeyTreeCooperatively has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisKeyTree.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"be53498300693be118f28236192b45efd3d0aeb8428ec5e46bab8dd3e8345113"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureRows (cyclomatic 12, cognitive 16): captureRows has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16ec5bdd5e3bc5e38d06032d2c21ef971b6963b3c76e1070ec363ee6c7d90ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isInColumnContext (cyclomatic 12, cognitive 16): isInColumnContext has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3580}}}],"partialFingerprints":{"codehealthFindingId/v1":"94318f115f68b9516546d987819947f796546b3042afbadaf98bf54719897fe7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function orderDependents (cyclomatic 12, cognitive 16): orderDependents has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2379aa677cc21463dc6adcf329674be1243c293834cd95f015b41e641c48c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fc2f2f350c0406e6c94377c76356d9aaf952b86b260298a0c22de49fd61c75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleDeleteLiveTable (cyclomatic 12, cognitive 15): handleDeleteLiveTable has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c07bf14746464b85c44fadbe6a0ac5b84c143885f3892dadaab987366fc3fee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPreview (cyclomatic 12, cognitive 15): loadPreview has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"768c57ec05dc596bbbb1ce4d66cd3134d8cec4475046e8d47b7839d7a78afffe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteKeyRaws (cyclomatic 12, cognitive 15): deleteKeyRaws has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e3f9be0e23f50a2df0bfbbb4165ced000eefb276c371cbcef90001fd0c8363"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oracleTemporalLiteral (cyclomatic 12, cognitive 15): oracleTemporalLiteral has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f0a3e579ad2012dbe71109bc43b269d396bcc197f3ac6951256cb3eebfa9e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/__tests__/connectionParameterExport.live.spec.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ea35c948240f1b3f90fee64e7e500a12d90258b0b8163240cde1281c8bd1bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareInsertStatementPaste (cyclomatic 12, cognitive 15): prepareInsertStatementPaste has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82b52e0ce997852a5fc3482ff9e9830d9e22d175accae02700d8f133656ffc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function xuguPrivilegesForScope (cyclomatic 12, cognitive 15): xuguPrivilegesForScope has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dfb92a0bdd8280efb9db60020b5ebb00d2a1889d0eafa0522f861b108b7709"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function orderTablesByConnectivity (cyclomatic 12, cognitive 15): orderTablesByConnectivity has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/ltr-auto-layout.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd684fdb3804993fc6a5d56ed2ac680534560c64faa76c30da6c5cf2dbeca55b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markerRectsForLineRange (cyclomatic 12, cognitive 15): markerRectsForLineRange has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorTrimmedSelectionLayer.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d9ece7cd2af3810bcd87bcd1a85a0cd60331063fc2d0ac07c93b9a1fa8b1f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readIdentifierPart (cyclomatic 12, cognitive 15): readIdentifierPart has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb97ac082991118f2776ba3028b6e051767e82f982b2ceef6efc90c39e435e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyPipeline (cyclomatic 12, cognitive 15): classifyPipeline has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5dfabf8905813781bf32f9501874db0ab8b49685b1f417472cb517a41e59b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countTopLevelCommas (cyclomatic 12, cognitive 15): countTopLevelCommas has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d645d732d821e3463cb6a1fba30749b56aeb7f217ce6fb114135e8b1a22a46c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSqlServerModuleBatchRanges (cyclomatic 12, cognitive 15): collectSqlServerModuleBatchRanges has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3dc2eaaaa199e9afee6e40bb43e16f5cf99f577e209db28b88ba1a26ed1452"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectEmbeddedQuotedBracedPlaceholders (cyclomatic 12, cognitive 15): collectEmbeddedQuotedBracedPlaceholders has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"6395a166cef8520279b455ef4bc12505dd0888ec74079ed44fb55718c57ba561"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markPartitionRows (cyclomatic 12, cognitive 15): markPartitionRows has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1054023443b280f1a77cc2cc0e8e4fbe138c77112e58ce9755ad0d93bff22843"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/__tests__/plDebugStore.silentFailureWarnings.spec.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"23450d6d9775eb8abcaec5a063a64367fb38b8568fbd3e6234710fcdeae61dff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localizePluginTabTitles (cyclomatic 12, cognitive 15): localizePluginTabTitles has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4639}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d0c18f08e30d67ac5c7ac3f37bafead3b6b22eb9028c6a3c7fffe10f2ac557"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyInitialLayerAwareLayout (cyclomatic 12, cognitive 14): applyInitialLayerAwareLayout has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34cfafd84b067c4a8fca08c3317c0c5d825b820c147d3c715edcae3a2f44a03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRename (cyclomatic 12, cognitive 14): applyRename has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bfa1d80de1b344f76d7e1141ef0a3946b566eab84b20c3acc6320f370e2e99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reloadDatabaseContext (cyclomatic 12, cognitive 14): reloadDatabaseContext has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d896b2e7416388c7eac490663de40a810d61f343bc537d5cbbfa0e1ea294f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportConversationAs (cyclomatic 12, cognitive 14): exportConversationAs has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":5499}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a5f8898bb38b7b4c62dc3a5c96433e97fec498a142c826b23765bb0c3cf718"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyCellNavigation (cyclomatic 12, cognitive 14): applyCellNavigation has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11703}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d9dd9069674b34726e4487d660b825e6d918c150d3501dbf028d4190224501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onHandleClickColumn (cyclomatic 12, cognitive 14): onHandleClickColumn has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"665bbf7d005ad67c977166ab448169fd09f02c7f2c9eefe456601ade92fe6265"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmBatchTruncateTables (cyclomatic 12, cognitive 14): confirmBatchTruncateTables has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3965}}}],"partialFingerprints":{"codehealthFindingId/v1":"98708ca53fb3501e5ddfdef99fc76dc21659e3477f3bc3e6d949d27a3bad81b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmTruncateTable (cyclomatic 12, cognitive 14): confirmTruncateTable has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5107}}}],"partialFingerprints":{"codehealthFindingId/v1":"389a8c2d35d49696cfe760a2c6cc90d4cca4c6f2b114e3accb2794f08073582b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCoreAction (cyclomatic 12, cognitive 14): runCoreAction has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9354505e3b8adf60824133834604977f9898e8f38d3d023fd693b7b4ee2ade"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGenerateSession.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"10da2fef6c68fce8dd1681016c32cc26265c49d774be2d2824c9cab44bce4dc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBetweenRangeSeparator (cyclomatic 12, cognitive 14): isBetweenRangeSeparator has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d8b6877ef2d92b4119f9918775ffa81dc6eaf139c5b77f6fb887217d45f1fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restorePendingChangesSnapshot (cyclomatic 12, cognitive 14): restorePendingChangesSnapshot has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"164f96a69f7e00ab8687c47af933608dada575c8c090e6a9d021b83ac1e1e712"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderTextContentMatchesHtml (cyclomatic 12, cognitive 14): renderTextContentMatchesHtml has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/textContentSearch.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1bd028a2f4d0acd91d448b41b3e31c403c1c102f7ba072d4bfa78209833734"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasBalancedXmlTags (cyclomatic 12, cognitive 14): hasBalancedXmlTags has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fae191967e5d997417b1a47dc2b39f2478c1813c7679638a3d32e4749461ba5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlServerRuntimeCounters (cyclomatic 12, cognitive 14): sqlServerRuntimeCounters has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db4df7d4b85580be20904a198d744cf5e4b1deeca877c34508c39ac29e2d3e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNormalizedShortcutEntry (cyclomatic 12, cognitive 14): resolveNormalizedShortcutEntry has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/shortcutRegistry.ts"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d585554c5742bd478d73e1053b72f391eca055010b0546f7f0a1565ef5eaec2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseElasticsearchProfile (cyclomatic 12, cognitive 14): parseElasticsearchProfile has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchProfile.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7097d65406c2e35bd9fa6d9089b8387f933b5a02bceb1ca6cf0f070ccb59ba00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scopeRelevance (cyclomatic 12, cognitive 14): scopeRelevance has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlHistory.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff043c6165355d0b976d91d450496249983ed4b1161c71bdf1cd3137ffe5dd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableCompletionTargetIsAliasUnsafe (cyclomatic 12, cognitive 14): tableCompletionTargetIsAliasUnsafe has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b84ec714734b67c3285077a4207619f306037f5abe963aff03ea9e4afce0d99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasBalancedExpressionDelimiters (cyclomatic 12, cognitive 14): hasBalancedExpressionDelimiters has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae9fd37ab926257743aaa8bdb913171ef555ab52c6102969c90a02e09f82ead"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNextKeyword (cyclomatic 12, cognitive 14): readNextKeyword has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e60ae70e878d7a67334159a6da7828c47bc0282130a39409e87f67ec45e65a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mongoCommandRangeAtCursor (cyclomatic 12, cognitive 14): mongoCommandRangeAtCursor has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7273f349aead2276bee2f74c131d3d2f1318effaf23f44194bde48db2d5afd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insertTemplatePrimaryKeyConflicts (cyclomatic 12, cognitive 14): insertTemplatePrimaryKeyConflicts has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableSqlTemplates.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69ad9215fd43d98898b5efa80ca2b47120d8f3cc3c9a8cbd31c3cf08bce7bd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPartitionTree (cyclomatic 12, cognitive 14): buildPartitionTree has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b6426045d8f51aff9cd6799fcb9ecc7684ad21a1f24bd20a970688dbc9110e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyConnectionRemoval (cyclomatic 12, cognitive 14): applyConnectionRemoval has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4938}}}],"partialFingerprints":{"codehealthFindingId/v1":"1398a472c206cf5c4075c9855d42ca8c5be98e90c7efee315395cec3cb56229f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 14): main has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-knowledge-base.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eda3fc9910694567392807fb6d6293e7ad324d3270a4780e38f844b19af2f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startImport (cyclomatic 12, cognitive 13): startImport has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a269450156ab495703c6b39fb1bf531571dad9c13722ecc640f2b54d08719f27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":6221}}}],"partialFingerprints":{"codehealthFindingId/v1":"904143f27d0daa28e02ebf9462747ad0e47fd74142271ef06976b8de3d15f4dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acceptCompletionOrNextSnippetField (cyclomatic 12, cognitive 13): acceptCompletionOrNextSnippetField has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionKeys.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"947ac8d5e9f2b35a080f59bf8109db2efc35a0d0e4ace2ec999a5a7ee41f4c5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 12, cognitive 13): save has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41dfe2418ed6511648b8946c7edfe42a8f3b783a204ddaf3dbc78536362e84b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginIcon.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4426db4134994606ead3055e78cc70269c3675c14a0c1e91151bfbdc6ee62009"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadActiveTableStructureMetadataIfNeeded (cyclomatic 12, cognitive 13): loadActiveTableStructureMetadataIfNeeded has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":8252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acf9b43a9018e3559ec834ff8a9c5d8baa3e7a93a490beab5a46f524689dd3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPending (cyclomatic 12, cognitive 13): runPending has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSqlFileContentSearch.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2502479cf03a70c795f1b3d291bf5faedea80d305c42e1dc6efa6e55140d255"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/database/DatabaseUserAdmin.component.spec.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73b8a68db53d7311bda2c67d7f76d866d4b8903b40668620a69fab8be4b7076"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function previewTableImportFile (cyclomatic 12, cognitive 13): previewTableImportFile has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18dba1ed0cdd8048751aeac15074aae84340d9d09f4023b61da3625cb054781"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scrubExternalConfig (cyclomatic 12, cognitive 13): scrubExternalConfig has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionConfigTransfer.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"91feffe1506a70de81ee0b40c80567720505edb96b11becb1d0baf306d0d8786"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoUrl (cyclomatic 12, cognitive 13): parseMongoUrl has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3608fa34f1d04ba52208e26992ed7afaa88286e2e29e51aa94b41b38951bea60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileStorageIndex (cyclomatic 12, cognitive 13): reconcileStorageIndex has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3093587de76a69d39abf64a57d5f34f56a4362f0684e8f9ff7c86d06b25a5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureHydrated (cyclomatic 12, cognitive 13): ensureHydrated has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1ee494be62057944be0ce445d3997c559d2705554f405745919b0ddf42493f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterDatabaseOptions (cyclomatic 12, cognitive 13): filterDatabaseOptions has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseOptionSearch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfe36ab3ba8fef58bc81fe732f23f41a7d76bd6876be65e4be471aca389f816"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferJdbcDialect (cyclomatic 12, cognitive 13): inferJdbcDialect has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/jdbcDialect.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cfcec35f6f589c00c3262444d66137b4735df6d80be4bd816e45cc29ba96ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnDefinitionRange (cyclomatic 12, cognitive 13): columnDefinitionRange has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/oracleSyntaxDiagnostics.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"580eff5d25b88853b53e8371d246d608e816a2fed44a0cfe681537b8663eb8e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveProjectionColumnToSource (cyclomatic 12, cognitive 13): resolveProjectionColumnToSource has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb61220b16c2e6e56fdecbbd1d13b1546219c81b82acf9c3d343a2b2583e340"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectTarget (cyclomatic 12, cognitive 13): inspectTarget has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"9540864eebbf9c74611a7dfac588ebec0da65836ffcf5b787e73c452169cd74a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openPluginConnection (cyclomatic 12, cognitive 13): openPluginConnection has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4712}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d9dac5e01e8415da808598f99d91df5793d32cfef514bac0e15a966ce06db4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reloadEvictedTab (cyclomatic 12, cognitive 13): reloadEvictedTab has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11280}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b2b116b167d7d42e5f6462e6c3f77db9e063e2626c59b92ec248d401ab5125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app-tests/connectionImportRoundTrip.test.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85175871d3a607a55d6fab27f10a18014f6574fcedc5c160564e14ad443d598"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 12, cognitive 12): execute 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":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"887759add5ce53a70cb6c41d0ca781da4737b2bacdd9c1804d3ea30f2cecfc70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upgradeAll (cyclomatic 12, cognitive 12): upgradeAll 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":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c90a85aad9036d0ce3d5280bde78384a4cf7e31f4e95b905ce95c4f63f2f98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e09d7ca96fa2f229bff23250adb19fcbbc29f409d613db7a078e7c54cf0189d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openVisibleNacosNamespacesPicker (cyclomatic 12, cognitive 12): openVisibleNacosNamespacesPicker 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f665579fae852657a255fbf9ed0a355fa9e3f2809fc21e5dc305ce602faa6c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deregister (cyclomatic 12, cognitive 12): deregister 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":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eedd25e0240836256ede7c876f41b6f3638cf0cf9547ac6d1e81005b0de4cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/__tests__/PlDebugLaunchDialog.public.spec.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa4efe01c7fd06b185a569d74e631cd8b7398b382080274315ad2536c9275be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportDiagram (cyclomatic 12, cognitive 12): exportDiagram 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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"29355f9010a6bef75b4517736f979ff786c2831b736f8f62fd88c01066f71d49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedd65748c0cacc65d7423c0b5f84394b82649fef2ac5a90f7fffbcd58ed7a80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preloadSkill (cyclomatic 12, cognitive 12): preloadSkill 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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d05a474f58270447d912064ec4961ed1e27c73e072950d3ecc95ceb4efde458"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshSnippetSyncSettings (cyclomatic 12, cognitive 12): refreshSnippetSyncSettings 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":5762}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f8b48afe76e125879c87b2ab804004d93a478e1b11d0d8e1e51f152aff58ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rollback (cyclomatic 12, cognitive 12): rollback 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":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa668b3fe2dfe9f90df4dc91c7b8c53c70e0e754b2a27b90ac3d2f27581838e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function taskTitle (cyclomatic 12, cognitive 12): taskTitle 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":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e182f569469d1e6871d9051640df15dc93fbcfd38dec99596a438002329af480"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestDropColumns (cyclomatic 12, cognitive 12): requestDropColumns 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":5783}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dbd85ac7e4ebac1a83c4411f7910ccdb5b66818135938454328f34aa078b8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDetail (cyclomatic 12, cognitive 12): loadDetail 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":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b75985f94efe31b65a08ee95fc20245427f029501c6ee65474aec93f7dfad7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadUserFormNamespaces (cyclomatic 12, cognitive 12): loadUserFormNamespaces 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":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb5b8c063e0d18c3979a982a99c2f2aa8a5f6255aa3bb455a0e76e7706ff05b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadErrors (cyclomatic 12, cognitive 12): loadErrors 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":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7a58b06d8d9c7d7177f29c6e0fb10662d7bb251d9d301a8aed49beb964bbfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connect (cyclomatic 12, cognitive 12): connect 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":"apps/desktop/src/components/redis/RedisPubSubPanel.vue"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a81789edb9ae59386f2ce6750e09b92e825cbaf2b4c9bc2bb5cf7e63bd267ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadStreamGroups (cyclomatic 12, cognitive 12): loadStreamGroups 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":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefc84b27b14e258490758c0c5ce3d75223fd98434ad436065a0a1fdcdacabbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 12, cognitive 12): visit 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3690}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4325882ec1edd2d433e3d91f21d595928d2a2bfa4ba7ec1510b9541548fe246"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savedSqlHistoryScopeForNode (cyclomatic 12, cognitive 12): savedSqlHistoryScopeForNode 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":7502}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea21e18e906eac7bfac238f674885eed64d3e05a83c68240190f9f7a276ff4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d993369b559f04e893daa09bc9e8092dcf34a0f43c36040dfcf01a1ebd087e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleWebEvent (cyclomatic 12, cognitive 12): handleWebEvent 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":"apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d929804a721409f2d79e8a2be3b2f5524b4164350737293023b856ef4d33b7b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadFormatterManualReferenceTables (cyclomatic 12, cognitive 12): loadFormatterManualReferenceTables 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":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"db34a9018abf55ab899bd3beebe2875ff9781c47cb4f35246a21b271021e07a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnHeaderDropTargetVisibleIndex (cyclomatic 12, cognitive 12): columnHeaderDropTargetVisibleIndex 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":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9c0a757915e1e848cbee1c446fae3175b6f4f590dde64541f0065fc2ae8ac4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clonedRowMeta (cyclomatic 12, cognitive 12): clonedRowMeta 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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc72fd2706f91e025ad452ddfd5467f2d1700947510b7faecd36e1fb63687d41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function databaseNamesForConnection (cyclomatic 12, cognitive 12): databaseNamesForConnection 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":"apps/desktop/src/composables/useMultiDbTargetSelection.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"12641e748f3b0785e774e0701a45bd7ba694323805de137beb30870183601870"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyStatement (cyclomatic 12, cognitive 12): classifyStatement 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":"apps/desktop/src/lib/ai/aiSqlExecutionPolicy.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb942744fa528356a917d4a102b6a70b9611e0b91c90c55c90dfaf09442fcd48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyAiSqlExecution (cyclomatic 12, cognitive 12): classifyAiSqlExecution 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":"apps/desktop/src/lib/ai/aiSqlExecutionPolicy.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"638139f3e8b5f92055c3d8a9cb2f7859cc69ee20613287d87c0afea41e9d0b1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatError (cyclomatic 12, cognitive 12): formatError 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":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0acb88a67195bd64f0d2cf5cd7d4e7a37da7c6e843b6e49e394c0f9e91e6df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function binaryCellClipboardText (cyclomatic 12, cognitive 12): binaryCellClipboardText 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":"apps/desktop/src/lib/dataGrid/binaryCellDownload.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc5c05ecd9c2472c155ff19dafb1f43240ee5e707a523c4850e24a2855f5824"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSqlStringLiteral (cyclomatic 12, cognitive 12): parseSqlStringLiteral 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":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e86d3b83f500bce9d87f3a22008b7590291572576860afc7ba6d024a5b9870"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyParsedRequest (cyclomatic 12, cognitive 12): classifyParsedRequest 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":"apps/desktop/src/lib/elasticsearch/elasticsearchRequestRisk.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbf476388fae6b0861185ff23f9fde7c86c219fb042505ea0712a2519eaeee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 12, cognitive 12): add 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":"apps/desktop/src/lib/graph/graphCompletionScope.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"885b52288a7c3f0422fb18ab420b439c84c28403fcf807deb03a16c382b0aaae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editOracleRoutineDraft (cyclomatic 12, cognitive 12): editOracleRoutineDraft 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":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c71dcda3a9634a5ce7b8d82ebfdc8caf996c06cbf497e9d6080585b5e033ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b460aec931ec6c36f219a5df1167100f1978645f7864086506f735c7a0bdd0ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderParenGroup (cyclomatic 12, cognitive 12): renderParenGroup 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":"apps/desktop/src/lib/sql/layout/primitives.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8997ed838fbfd49d2969668598a43653a6326110dc18bc8dd0208adf61bd3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectionNameFromTokens (cyclomatic 12, cognitive 12): projectionNameFromTokens 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":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fecdd08e034eb0f8e876b8346aa54ec5bb13c2280a73568ada5f1882a2b24b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findTableVGroupContainerNode (cyclomatic 12, cognitive 12): findTableVGroupContainerNode 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":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"293c56e0e0cd9a9ae1754e686e848aea93d905a12299222cc5619d917077ea2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11900}}}],"partialFingerprints":{"codehealthFindingId/v1":"4375086c7540ae36bf4a72cc49979c5d3547be4b8f5a83b49e52bdfb5b7db72b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function query (cyclomatic 12, cognitive 12): query 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":"plugins/sdk/dev-host/diagnostics.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"df42922821983ce3d72bcd34fc30a9db43894c35c823343b8648881bbf58340e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/tests/echo-sidecar.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96c698d2953662f41af869669420553188364487f106742aafb5ecb34584571"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveActiveExecutableSql (cyclomatic 12, cognitive 11): resolveActiveExecutableSql has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaf3387a809fd75d8ebd4bfb7f2a6c1f5f35243e5395085a26c4faea45b91b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveExternalSqlTabAs (cyclomatic 12, cognitive 11): saveExternalSqlTabAs has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff00a2ba64f0f8cb1194b563da238676700a07b34b8c9876e18e17dc14011abc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 12, cognitive 11): load has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulAcl.vue"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d209b77224014e3a158d6a0765828a58ad0fe4e83edcfc98a403b3ba5a3b91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ba9b5aef903d1404dc0998e1363b376c9c1e7a0a8568f2f60faa9d2d885c62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 12, cognitive 11): load has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulScope.vue"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f4b7761c9d64e3d183241bd9a614ae7a07a62e64a71e732374bb30cfef8bab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60f28b3e36f3282d5f8479c34745e10b16e563da5ec192a5fa87cf9e34b888a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectAllItems (cyclomatic 12, cognitive 11): selectAllItems has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82bb9b8269a79bd03186157ff6cc32a3308344f4516d75b0b8279aa05e7f9db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"233ee6d7c241c5bbd709077162aed3a10f54c8036f13a91c2027328465cebdd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provideSoqlCompletions (cyclomatic 12, cognitive 11): provideSoqlCompletions has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"0893638467a2314d366cb8aade5fc40a62be71224ae9ce7f6ff6cf50883066f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transposeCellTextColorClass (cyclomatic 12, cognitive 11): transposeCellTextColorClass has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"a882f6753ed33f2b7521493df39596e156fc4ad0af1678e055b22d1429c2f48a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":4210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0d6945961d7a6ed17f227b9fdab1c43ac5d42e2eddad478b4f249303373d08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshActiveTableInfo (cyclomatic 12, cognitive 11): refreshActiveTableInfo has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14051}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4529b925a8a98494a2c8afbff94f6df44eb30c2e4ef316fa4e79cfd6f0f3ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"7684f544bbd05f0655e1df5d019cc0e042462917ab482118864027a8b12b503a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadData (cyclomatic 12, cognitive 11): loadData has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/InstallExtensionDialog.vue"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2ec081ccbdd6d302d659cad793332d31b1f087b8199e1ef18b3ad59c7366e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function iconClass (cyclomatic 12, cognitive 11): iconClass has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"39420058b985e9136fce86539057bf421d1cb5bfb71d41ebc81e0cc96f9f512b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function iconBgClass (cyclomatic 12, cognitive 11): iconBgClass has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a0215ed6268e45a5a952aefa6a616274828117dc742f3808a3807997e558aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestRenameSelectedNode (cyclomatic 12, cognitive 11): requestRenameSelectedNode has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d26410e407ef70f8b0ffe742505db2e5c20cc41e3a053b1b1223e610f83004"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calendarFocusForMonth (cyclomatic 12, cognitive 11): calendarFocusForMonth has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/date-time-picker/DateTimePicker.vue"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"352c33363bfcc92a648dd72e9814426ed45f0fbeec3841978ab9ae7d4f77c56a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileOracleTableType (cyclomatic 12, cognitive 11): reconcileOracleTableType has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a59732a62871b603f0b60f44c2727077707884f619375e4c8f1066a2a70fa8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function externalCellValue (cyclomatic 12, cognitive 11): externalCellValue has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcea959c3369a64f166ef08c15d1f4b13be28ae574511c1e5f85e745f31d159f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlExportChoices (cyclomatic 12, cognitive 11): sqlExportChoices has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2831}}}],"partialFingerprints":{"codehealthFindingId/v1":"faca215e424795a130576e926e5649f7adf7b2b1ec291e723e0757cb26ea5467"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrimaryKeyColumn (cyclomatic 12, cognitive 11): isPrimaryKeyColumn has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b848d14c25c681dc88af41b29db5dd08d807888d4ed11a0d74395b33da4731aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/database/oceanbasePrimaryKey.spec.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8c8b4780e6c3c6f9373e3fbeec6e37bffa69302560bdb5b9d47e13e3f7fb0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/__tests__/database/oceanbasePrimaryKey.spec.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce96e625e08c99a6ef3774a35125fab1490383ab5019f1de6f73511ff0cb36d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAiChartSpec (cyclomatic 12, cognitive 11): parseAiChartSpec has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/richContent/aiChartSpec.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8188bf8551d2be7aae0792c2036712bb0c1cb2184d3f4287b434185082a6f668"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCanvasRenderState (cyclomatic 12, cognitive 11): resolveCanvasRenderState has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df4fed658f7da6be31df76c490dd9c87187ded1d84c4e15a6c0f2041af8f502"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cellImagePreviewUrl (cyclomatic 12, cognitive 11): cellImagePreviewUrl has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellImageUrl.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a153a0c5b9732debb8aee0ec399d6f06db109dfa35bd00a5c18ad8b17e4a5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeRule (cyclomatic 12, cognitive 11): sanitizeRule has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridFilterBuilderPersistence.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b42e3f8b989a3d9224d4d3d160cb100e51d092e9066f16e31b88be5490cb47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canGoNextDataGridPage (cyclomatic 12, cognitive 11): canGoNextDataGridPage has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridPagination.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4150f16eca13f9c582e5d794b1b7ef5493c9f684d2bd05fab1d96ecacd65fbc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transposeScrollLeftForRecord (cyclomatic 12, cognitive 11): transposeScrollLeftForRecord has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridTranspose.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea60862d48ea8e15a602fce37c1d16929311728cfebb391eea473e56ca84ee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDataGridWheelScroll (cyclomatic 12, cognitive 11): resolveDataGridWheelScroll has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridWheel.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0183fceb8f92ce67eed358269cdb17687fde4cf1ed7f22df3244a36971ec484"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionShouldLoadIdentifierQuote (cyclomatic 12, cognitive 11): connectionShouldLoadIdentifierQuote has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/jdbcDialect.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"743ccc3dbeac48c5e5dbdd535e482cacee111a4cbc091702bd402ace4b6ec69c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eventTrigger (cyclomatic 12, cognitive 11): eventTrigger has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b831b03044103aa5f85ffa99a39e256f9e07c77072a5ae8fb28f86b1b3ec3498"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSqlServerExplain (cyclomatic 12, cognitive 11): parseSqlServerExplain has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9e5a760ce2f724a71a72b72ad9159d72674bf7eed3becc5a36e7df0b208c5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeGraphResults (cyclomatic 12, cognitive 11): mergeGraphResults has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/graphResult.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ce1849a9df0981f7805052a42fb553e86c88da28b28c35f18a04821216be7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function propertyValue (cyclomatic 12, cognitive 11): propertyValue has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/neo4jGraph.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9408a5e4e9e73932e4be3e149a134a70e90e5fdb12dbcf78d23febd858ceec9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e4f7bc36d7c4e09402607e813a508d6dc386fda1f542f2ddec58b16b4c37cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchPluginInstallCounts (cyclomatic 12, cognitive 11): fetchPluginInstallCounts has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginMarketplace.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cddb53e7b9f604b9efad18fd2ae2ed073862a0e42406b035ff9a6aa9ddeec3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMarketplaceReleaseUrl (cyclomatic 12, cognitive 11): resolveMarketplaceReleaseUrl has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginMarketplace.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaacb24f5638f976919bec341ca16dc2a5a9fe3f52d1d7d33289519eeb88992"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pluginOpenUrlOrigins (cyclomatic 12, cognitive 11): pluginOpenUrlOrigins has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginOpenUrl.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"397c69c2ea7cf95eeb59f1e6c8aa84911bb837b00fa0e041671b1e66f0ae3224"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printRuleList (cyclomatic 12, cognitive 11): printRuleList has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1399518d87537dcaa049c8a754328dc75cef682c8a1501806667a525e92d52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startsWithOraclePlSqlBlockWords (cyclomatic 12, cognitive 11): startsWithOraclePlSqlBlockWords has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c15f638a11cf9021047de6a023084a19e07d390f04c2c7f2bd2540c392a74fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDeclaration (cyclomatic 12, cognitive 11): readDeclaration has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c07fac16aaa905fe12803491cb1ad3b52610eb814eeba5fcc6dd61d2ee5dcef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function estimateValueBytes (cyclomatic 12, cognitive 11): estimateValueBytes has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/queryResultSize.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ec60e9ba50a43883a247ac321b9f34401b3a05331c7cfd0314b2712e7604ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e8a383b4f305613c6d2663d44148ad2980f7b04909d26040af8bba4e1bbe92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toSqlCompletionObject (cyclomatic 12, cognitive 11): toSqlCompletionObject has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10617}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1165cf5b900b9bef3ffc774a957158d5554d7bcda353c184cde553126095c2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureManualTransactionSession (cyclomatic 12, cognitive 11): ensureManualTransactionSession has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6266}}}],"partialFingerprints":{"codehealthFindingId/v1":"542f6f791fccf32ae66383172b8061199031834c3e6cc31203e3d63ca2f365f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeLibrary (cyclomatic 12, cognitive 11): normalizeLibrary has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"62018c5736736875935e86e85e9b1f77141d2f8451ea91d2ea3b6194a6515342"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"687cd1851c1b0d3b00adbb6ac7d4166191043fd1d1e49df38bf9aeb67eec1caa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openImmediateSync (cyclomatic 12, cognitive 10): openImmediateSync has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53f616ad3517e6a89550bb539258ea48660b477c6cbcc70949e4d6ddb182581"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onClickTable (cyclomatic 12, cognitive 10): onClickTable has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3641}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eac57b706043dfb719449f44fa2ed43f72e0ff82406ba212d777e2c64ff925"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compilerOffset (cyclomatic 12, cognitive 10): compilerOffset has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDeployStep.vue"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca89751012aed50be2da0f220737fac25fe7d83e41c72c107eab4cddbb8d896"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":4565}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb20c1ed31bcc36bb24ad3ce4634e7e5c66f637651a591e71bdc8c2ac5ba7a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMcpDatabaseExecutionModeChange (cyclomatic 12, cognitive 10): onMcpDatabaseExecutionModeChange has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":5024}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0d4332ebf6296a40f10490c3a09db0f5cb3abab9dbe0720563dd08bd41bb15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canDeleteRowItem (cyclomatic 12, cognitive 10): canDeleteRowItem has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":5428}}}],"partialFingerprints":{"codehealthFindingId/v1":"545baf7727a564e8adf327d343b5564c9ae5d645158a6a63cf5137ac9c3ff223"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadExistingTables (cyclomatic 12, cognitive 10): loadExistingTables has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"3873a52e036d3f23c3dcfde45b27564695747d684acf7d952642df40d913bf8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openUpdateService (cyclomatic 12, cognitive 10): openUpdateService has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"9508b9efd5529e20a661c058c07001cdd49b31ecc829ec290c3de83bb93d1b3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmEditDatabaseProperties (cyclomatic 12, cognitive 10): confirmEditDatabaseProperties has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5522}}}],"partialFingerprints":{"codehealthFindingId/v1":"26de40cc18c85623c637c76d26aa7b4233df87a1a702a4d8f2c46b95073ca202"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPreparedUpdateObsolete (cyclomatic 12, cognitive 10): isPreparedUpdateObsolete has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd17e1ec4f52171d86aba3484791ee9fc1f6b1186adc453e186a2da2e0be816c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initColumnWidths (cyclomatic 12, cognitive 10): initColumnWidths has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridColumnResize.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15c2985bbde960218de6c9a72629962289619e72c9782b9f7fdf433c779b1e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dataGridPendingChangesState (cyclomatic 12, cognitive 10): dataGridPendingChangesState has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e48cc63bebb7bc2d3c6e090ddae58b8a74ded8b316af922635f23ca3e2b7c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onProgress (cyclomatic 12, cognitive 10): onProgress has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0477495f2f1a0c97f87d190168c48ab4cb52984f4ec50bc93af8e1e0b03a833"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function treeNodePinIdentity (cyclomatic 12, cognitive 10): treeNodePinIdentity has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/pinnedItems.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2144294b31985207a8dc8d627231b0b2310f370373336dea09a13a5a8756552"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function timeBoundSeconds (cyclomatic 12, cognitive 10): timeBoundSeconds has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/generatorTimeRange.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d842acb930b3ad3032e43e0a1e3a35f8dfb13749a8812bec7d9713a182547978"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function crossFamilyTransferableKinds (cyclomatic 12, cognitive 10): crossFamilyTransferableKinds has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/transferObjectKinds.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"129f62a03b0e6938b18ad6d9794677f2f9d70f14f0b013e4808b4f16b2d27ca1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decideKvMetadataRefresh (cyclomatic 12, cognitive 10): decideKvMetadataRefresh has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/kvMetadataRefresh.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99e8ead1e9fc255f94eca6a96169b45d02ce9535f0233526d9de61c56243c74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTableIndexes (cyclomatic 12, cognitive 10): loadTableIndexes has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b5be36ccedf6e37a080643818337e61b3c5076ee4e228a6bbbac296f3a8871"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoFindOneAndUpdateCommand (cyclomatic 12, cognitive 10): parseMongoFindOneAndUpdateCommand has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"466bfe816b65f5cc42af73baa315d563ddeda2a38693843a0dae38b71c552827"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoFindOneAndReplaceCommand (cyclomatic 12, cognitive 10): parseMongoFindOneAndReplaceCommand has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9c26db2c6a54c21781d9d53b358a51f294c8f29c3bc23004fb9e82246f5832"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectStructuredCodecs (cyclomatic 12, cognitive 10): detectStructuredCodecs has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"8698d68348b067c9c2b7988aa2cb72c9a67f9bf2c353b00bae96d7e64902e2e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withDatabaseSavedSqlRoot (cyclomatic 12, cognitive 10): withDatabaseSavedSqlRoot has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlDatabaseTree.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e793ad3c388a303cb0b1443c2a88c020264c9b2612d588e6671bc76a17e29e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyNameForTreeNode (cyclomatic 12, cognitive 10): copyNameForTreeNode has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/treeNodeClick.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2299cae6d477458c3f619ebe7fd0ac0c77fcecc2b85ec8b6faadc2aa48e0861"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importEngine (cyclomatic 12, cognitive 10): importEngine has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/internals.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0657863f4cc5240c3e633902c731d3250c36a1ed8d58466712b00cd28c3e042d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quoteSelectStarColumnIdentifier (cyclomatic 12, cognitive 10): quoteSelectStarColumnIdentifier has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4980}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fa6e93c8c542c2c5ff30cbda2c965a3e34fc4fc68cd546ebbe9d469892d12f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreResultRunPayload (cyclomatic 12, cognitive 10): restoreResultRunPayload has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f7f9dcce23cf8e1bdb1be6d05be2621722793823de74a3db31ef36947c5975"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function singleSourceFallbackColumn (cyclomatic 12, cognitive 10): singleSourceFallbackColumn has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b290b6c1cb2511a3ea2b08b365c46be5f8c232b91aab5599f2958f9fb16de1cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureQueryResultExportRequest (cyclomatic 12, cognitive 10): captureQueryResultExportRequest has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11818}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f9fbdcba321784aeede187c4a0469f91e34616dd804c06aa26fed8f0964bc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArchive (cyclomatic 12, cognitive 10): parseArchive has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fb91087b889462775f392feb7a54f23a2f53d6b96bc1f47636ae3ebce47305"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPendingAiConfigDeepLinkDraft (cyclomatic 12, cognitive 9): applyPendingAiConfigDeepLinkDraft 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b05ae3a43aa088a94b5f4e0387c49d66d136312787eb035b4e8a0452f2af239"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecdbffc5f0987dd809e64c46cace9f69d16d0e09a7fc033573983a87526e6fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cancelPendingRowOrRestoreCell (cyclomatic 12, cognitive 9): cancelPendingRowOrRestoreCell 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11990}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bb81313deb2ba07abf963218a6043015b6ba94955eae6e27468fcd5a65cbdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5958}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e5dc6201135843f6d3c770ae447aa44980413ad0ea7a1d6e1800723bbc4751"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"df42f0ac3a53b041393d934aa27c086b7896784abcc8a6e24bfcd7f6456c8486"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeXuguSchedulerJobAction (cyclomatic 12, cognitive 9): executeXuguSchedulerJobAction 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8742bc6f30dae4f88fa2406ce31c91c4d42af93672507877894fa29ef046b49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestDropSelectedNode (cyclomatic 12, cognitive 9): requestDropSelectedNode 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f14784d9457cc8f77c95105dbeea66beb4fb538065bfc0c31839d05eed50264"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swapSourceAndTarget (cyclomatic 12, cognitive 9): swapSourceAndTarget 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":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce576cf5fc955d7b42447035134a002ae22a7d834baa438b3d01f5c97f97ba4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa2f4c687695abefd630761db3d9fe46c4c28ffb805dbced873b584ea3201ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c58e7b0d66c767326e8e630c97c16adef31801bf08222af0a5d33db78b8baf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadColumnLayout (cyclomatic 12, cognitive 9): loadColumnLayout 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":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74495d68cdbe9a11f6af329c0a1722b87a155b74ac4d10517aa8a0ebf8d96d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchTableOwner (cyclomatic 12, cognitive 9): fetchTableOwner 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":"apps/desktop/src/composables/useDataGridTableMetadataLoaders.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"62666bda332bf32ccd3a873c34774132c99d3ce2a1cc124c906ad71407ea24e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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":"apps/desktop/src/lib/app/savedSqlEditorPosition.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6ec7a0b4f0a873c9f02296f536c409833ac22d399fa8d81cce1fbeae4c4326"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sameValue (cyclomatic 12, cognitive 9): sameValue 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":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"47205bd53c32fbe99940c1525f780bdd55c589e40e047abad1dea32bf077ae5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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":"apps/desktop/src/lib/database/oracleTriggerStructurePlan.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b58a0f61367fb0bbdd27cf811f2f499e78e51396e5ecd666d5839cac71f0eea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeMongoDateInput (cyclomatic 12, cognitive 9): normalizeMongoDateInput 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":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdf1f4f1f5ba1b3d6691276935a4d783a940fa7388979113651b8c14745def2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nodeMatchesCandidate (cyclomatic 12, cognitive 9): nodeMatchesCandidate 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":"apps/desktop/src/lib/sql/queryCursorTableTarget.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"848707e469eebf2f16410ba1d5f40e25fe0c9b5f0b941480f4e26c482a3ae9da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPostgresSequenceFunctionCall (cyclomatic 12, cognitive 9): isPostgresSequenceFunctionCall 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":2408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abb699c8c65a5571ec4b018d27832634b21f09e8299065f98a5d82098906df3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStandaloneSlashDelimiter (cyclomatic 12, cognitive 9): isStandaloneSlashDelimiter 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e5660043459b6901f952be07c43146359ac91479cea02bc1ec2087c15c9c0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editablePrimaryKeys (cyclomatic 12, cognitive 9): editablePrimaryKeys 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":"apps/desktop/src/lib/table/tableEditing.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57d48b3103145e9ff807510ff44d56db427c09a7ef6fef2e7095c766cb19ca0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncSidebarLayoutOnce (cyclomatic 12, cognitive 9): syncSidebarLayoutOnce 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9910956390062a4cdcb15636b4233c94d4c4453a86b98a30ee4ad1a8e4695c5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oracleRowIdIsSafeForQuery (cyclomatic 12, cognitive 9): oracleRowIdIsSafeForQuery 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7641}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2eb629f5149617fa7c521cb8c346c53bf2040d0b514ef4db0b0043da745702"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOracleRowIdSafety (cyclomatic 12, cognitive 9): resolveOracleRowIdSafety 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":7662}}}],"partialFingerprints":{"codehealthFindingId/v1":"f816dd751f84b2fa91eba108772e1f394b5b0402b386d2cd51e75780c7b839bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatTemporalValueForExport (cyclomatic 11, cognitive 27): formatTemporalValueForExport has cyclomatic complexity 11 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"457989f5c5358cd2ada965cab40bfbc4302350fa62e285223c63d12449963298"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterEntries (cyclomatic 11, cognitive 26): filterEntries has cyclomatic complexity 11 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFileTreeFilter.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"625e7729f77dee9901aec46c30163d903f69877b380851df052569a3e1e6f0ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildHunks (cyclomatic 11, cognitive 23): buildHunks has cyclomatic complexity 11 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":"apps/desktop/src/components/diff/DiffHunkBuilder.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af808884d38f66624101af9c7fa0d3c5bafe6a4484002d588070c970afa3a97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inlineLocalUiAssets (cyclomatic 11, cognitive 23): inlineLocalUiAssets has cyclomatic complexity 11 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":"apps/desktop/src/lib/plugins/pluginUiHtmlCache.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1101d0970a5cdcfe8e4d1fbbdc16d06cfa4d5672ad51379bd5cf8859c0a1afb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAiMessage (cyclomatic 11, cognitive 22): parseAiMessage has cyclomatic complexity 11 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":"apps/desktop/src/lib/ai/aiMessageRender.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f653682b3445db1ad55bb1d909763aea97f3d76b284afd383b46f21a015d678"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gapIsWhitespaceOrComment (cyclomatic 11, cognitive 22): gapIsWhitespaceOrComment has cyclomatic complexity 11 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":"apps/desktop/src/lib/editor/codemirrorSqlBlockFolding.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ee86d07defc3c2212c6ed51346259b37d8da40c7f1e6379e6f49ecf340789b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeExportRows (cyclomatic 11, cognitive 21): summarizeExportRows 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":"apps/desktop/src/lib/export/exportDiagnostics.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b966a11a4b46d112122cf55d4f432e1ad6108eae0439e3e2de5b19668881b348"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasSingleWrappingParentheses (cyclomatic 11, cognitive 21): hasSingleWrappingParentheses 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":"apps/desktop/src/lib/sql/sqlInListPaste.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a84d40b4cdab125253601e429f430b06a82263a5737571372341d6a9694a0a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeDictionaryRows (cyclomatic 11, cognitive 20): mergeDictionaryRows has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb29dee4b172cb86a960af2d0be99a1856c9afe3c0a761529775764238665ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function metadataBackfillCandidates (cyclomatic 11, cognitive 20): metadataBackfillCandidates has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea0e43ecadb3f0192f9f50c89546b72fe592769ee527afde9d93c1a30402d55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildInsertValueHints (cyclomatic 11, cognitive 20): buildInsertValueHints has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7974de745503073e087704bd22146d43e66eaddbcc856617217965bdca2b3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSqlParameterDescriptors (cyclomatic 11, cognitive 20): extractSqlParameterDescriptors has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d33a532a8b6b9aa20a6d4c7e05baf101b947a1104efab55a2d6266b22e8c54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceMongoEjsonDeserialize (cyclomatic 11, cognitive 20): replaceMongoEjsonDeserialize has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb130b480e2a44637b2f7861c7909a0168cf44d04bb2bba76b0cd60a9688adb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function allPortMappingsDefaultToLoopback (cyclomatic 11, cognitive 20): allPortMappingsDefaultToLoopback has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/database-env.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d06d6e3171b4ebedb82f33f6cdc405bd66587328b09febb6a9e3707f9b34685"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshBatchDropPreviewSql (cyclomatic 11, cognitive 19): refreshBatchDropPreviewSql has cyclomatic complexity 11 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"c231d18884f5557c432e952feceb24ec265ea37b15e306c0e7253c7b9d6449f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lastLineMentionsWriteSql (cyclomatic 11, cognitive 19): lastLineMentionsWriteSql has cyclomatic complexity 11 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":"apps/desktop/src/lib/ai/aiProposalDetect.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e54c696e1753b3215f377715f32455845d5657d6ac2110a7775b323ca7bd38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupStage (cyclomatic 11, cognitive 19): groupStage has cyclomatic complexity 11 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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42422d796c6a32a1cd90ed3431dda7292744664bf96204a1249c1891d150536"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oracleInvalidIdentifierRange (cyclomatic 11, cognitive 19): oracleInvalidIdentifierRange has cyclomatic complexity 11 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":"apps/desktop/src/lib/sql/sqlDiagnostics.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e68ff5cb886fc347bed9581850099a3a4475a413ae14435159f74797f29aee7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 19): (anonymous) has cyclomatic complexity 11 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":"apps/desktop/src/stores/__tests__/connectionStore.metadataLoading.spec.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6d48e063d9d0d8fef77e86ea250cf8206baabb232b09016ed58c290c80a812"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshWatches (cyclomatic 11, cognitive 19): refreshWatches has cyclomatic complexity 11 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"200130c10413f15226d381ff88abc96b303fc95a37b3cd618592aeef3d4061ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectTable (cyclomatic 11, cognitive 18): selectTable has cyclomatic complexity 11 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":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3830faf314a0e2b17064906a160eee3825bb618b6a29029e6403093e23eeee6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatPluginAiContextLabel (cyclomatic 11, cognitive 18): formatPluginAiContextLabel has cyclomatic complexity 11 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":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dea8abed46bd515d761ab8282bd612d3bcc0b740ed5fb3ac3933d82ea29879"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCatalogs (cyclomatic 11, cognitive 18): loadCatalogs has cyclomatic complexity 11 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":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c991eb2f07f8296ced335efdcaac95fde48796c67ff06a07f94f97ccc604c6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitFilterValues (cyclomatic 11, cognitive 18): splitFilterValues has cyclomatic complexity 11 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":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f58c333c2f5658c865ccb16396d511b9355b1af67637b1b2fd751191f50b2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOrderedGridRows (cyclomatic 11, cognitive 18): buildOrderedGridRows has cyclomatic complexity 11 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":"apps/desktop/src/lib/dataGrid/gridNewRowPlacement.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5e03b78ff5bdec04658a15254f58c23ee370d00a33ddee012c62c51c6d92ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectPluginShortcuts (cyclomatic 11, cognitive 18): collectPluginShortcuts has cyclomatic complexity 11 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":"apps/desktop/src/lib/plugins/pluginShortcuts.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbb2f2c55bea126adbd6fd5660e2e0958175545ec94e20726cf03560eb6323f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function leadingElasticsearchPreambleEnd (cyclomatic 11, cognitive 18): leadingElasticsearchPreambleEnd has cyclomatic complexity 11 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fafd43e8553a62bc0ecfdb3756890faff101c6d7793728920e98856a14f8d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipSqlTrivia (cyclomatic 11, cognitive 18): skipSqlTrivia has cyclomatic complexity 11 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cde3bd55591a69e3dd8601522418f4e82cd2b97fa1e76bf77596aaf789298f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshDropPreviewSql (cyclomatic 11, cognitive 17): refreshDropPreviewSql has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3330}}}],"partialFingerprints":{"codehealthFindingId/v1":"1828a3fa55cfd97449016d07da96afb85401f5dae0ce3e2c0cdba89a143d68e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4b6c5294c88276a286529d1c6a4b10a11c8e9f3b8a7c6b0f616cee418d6fcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 11, cognitive 17): update has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/codemirrorBookmarks.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d659614b425e059fd4234bfd3b86781076e2437fccd8c13b45ba97c8cd683e11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeTokens (cyclomatic 11, cognitive 17): normalizeTokens has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a0bd86450ab7206f3b15ed8299f682f1ee24595cb784971d753004fe02f53e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectExpressionRanges (cyclomatic 11, cognitive 17): collectExpressionRanges has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59a92131e497a7ba5aa0ec51077e0a431ef0a45a61f057ade1b47fe81a360cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spliceTightRemovals (cyclomatic 11, cognitive 17): spliceTightRemovals has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a85e58bf96f7cbf64cb489443206ba57783122b710b9930c81f0e1103abe534"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseValuesRows (cyclomatic 11, cognitive 17): parseValuesRows has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55c350647b86ba343d28d18d4b78af035cfc60cd5c78b08e39a0c653d2d5c6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildAliasCandidates (cyclomatic 11, cognitive 17): buildAliasCandidates has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5973}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d480172bb96a657b8ad4fa73d2c467bbb7b02b1a4d963619ea48dacee454cb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitCommaSeparatedValues (cyclomatic 11, cognitive 17): splitCommaSeparatedValues has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b29599320e94cf53589451809a3be9ac79ab117c89e99b99b0e860b9acd94f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setAutoCommit (cyclomatic 11, cognitive 17): setAutoCommit has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1fccdab279218b30f31306c8a3152500696cf04ea4cb5d7b4c973d70f5a9d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/__tests__/ConnectionDialog.deepLinkEdit.spec.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"de631e4ca0f40ad37003ab01b263b485a80c3f87a0b98292e3b46b40be30be19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runServicesWatch (cyclomatic 11, cognitive 16): runServicesWatch has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e46dfb761ee63555da95ba9e056f843a1337485ec84492a7c3eb8fe475a3f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSubscriptions (cyclomatic 11, cognitive 16): loadSubscriptions has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d7b2b1d8d44c11bd2c764b5cb0a962c3338a1b2a1e30c9bea2c49fbee63d80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDatabases (cyclomatic 11, cognitive 16): loadDatabases has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7305cae1a7b2c6e27c7082c7283a09c0ee83c9bf2a776af7a5b8770cbcd335"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDatabasesForCatalog (cyclomatic 11, cognitive 16): loadDatabasesForCatalog has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2dffa6edf8345de4a81213b51f40d51ffbeb916a3a748ad3ea1fb68526db56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hydrateLargeValueCells (cyclomatic 11, cognitive 16): hydrateLargeValueCells has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb140cc868ecaed52dab7f3416aae9f399f37522ee2ae70ae8acfe0ed51e3493"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsonObjectEnd (cyclomatic 11, cognitive 16): jsonObjectEnd has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02d737ef4689b39b13d3e2f62cc324551c12604a5cacf94feca9456a58ba41b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function geometryColumnIndices (cyclomatic 11, cognitive 16): geometryColumnIndices has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/geometryMapPreview.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a632010c953f62097bd6b62ae551ef98dc2f2c1b52d71e63a1b200a76bedf4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeLayoutWithLayers (cyclomatic 11, cognitive 16): computeLayoutWithLayers has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/elk-layout.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9ffd386abf05e2baab2db858af49e8817f62a6fb1066073c1c9e20af682529"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankLineDeletionChanges (cyclomatic 11, cognitive 16): blankLineDeletionChanges has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorTextEdits.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6bf328c93ed44ba176ed489799c53df7d113f977eecb1c7bd0569cc88e6759"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyGroup (cyclomatic 11, cognitive 16): classifyGroup has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"8039fdd117ba85b51b1c8f9ebfbd237af08c316e8dfe5c8bd62ffb2101692e2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findMatchingOpenParen (cyclomatic 11, cognitive 16): findMatchingOpenParen has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d6044abadce04ad3598e1f16ba80fe335c3fd1436b6f872f22d4b7242dde68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function missingDeclareDataTypeTokens (cyclomatic 11, cognitive 16): missingDeclareDataTypeTokens has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlServerRoutineSyntaxDiagnostics.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9e95b35eda2fd955c0ab1bf99ef1ee3dfd584e67764e864d7391c77ae9bfc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileBatchSqlResults (cyclomatic 11, cognitive 16): reconcileBatchSqlResults has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70639225b5fe533050dd8614393c8ac4f0bcd6b5148e3c25bcb73b6119630e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app-tests/queryStore.test.ts"},"region":{"startLine":8762}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ced40b353eb29d6700af96d850c760a97a326cf72f7c50d33f91d9fa168ff2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/sidecar.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"557f39d3fefdc4dbfe270ea85bac06853fe6ec6c25ac860b6e00c0d289f32bda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeydown (cyclomatic 11, cognitive 15): handleKeydown 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":"apps/desktop/src/components/connection/ConnectionTreeSelect.vue"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b141cc872e825b8813316f5c15d3c6b3351a766e17d58033341a76910ad6e9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreDetailsAfterRefresh (cyclomatic 11, cognitive 15): restoreDetailsAfterRefresh 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":6910}}}],"partialFingerprints":{"codehealthFindingId/v1":"42404a2ba628bbcb4a33f42e7b6a01746542ee250b26eb6a28a9d21ee4893614"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureTransposeSelection (cyclomatic 11, cognitive 15): captureTransposeSelection 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":12533}}}],"partialFingerprints":{"codehealthFindingId/v1":"3273d1f1a409b59b795e5aa53b58b9e6e90559d68157168de0f73cb55996a4fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshBrowserTriggerFeedback (cyclomatic 11, cognitive 15): refreshBrowserTriggerFeedback 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b6c9897767aec886fba9e87ed408227cb778865dd5e4590a7db9ed4e898a51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revalidate (cyclomatic 11, cognitive 15): revalidate 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":"apps/desktop/src/components/objects/OracleTypeManagementDialog.vue"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1e365a426d083b5befc0001b3309631f7ff9392177e8d6b7896e0b4e9a8c69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmBatchEmpty (cyclomatic 11, cognitive 15): confirmBatchEmpty 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5222}}}],"partialFingerprints":{"codehealthFindingId/v1":"792966e6f6cb4b79df68eda1cd24667d4e2a11df5df91b7b1572c9fe55018f60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupLeadingArrayObjectConditions (cyclomatic 11, cognitive 15): groupLeadingArrayObjectConditions 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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc941281d9ae6109f62f455ce38e4fa2dfecc652cd3e23bc488649fcca8eedb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTextDiff (cyclomatic 11, cognitive 15): buildTextDiff 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":"apps/desktop/src/lib/common/textDiff.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0054fb118caa4a49f9a151febd832808ac9208c71d9312881e40a462a3ebcc66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCrosshairTarget (cyclomatic 11, cognitive 15): resolveCrosshairTarget 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":"apps/desktop/src/lib/dataGrid/crosshairHighlight.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef2c0eb19c1e9c63f5ce386f9b49ba1888d9a70436143b1ff7fe07b74cf9189"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foreignKeyLineage (cyclomatic 11, cognitive 15): foreignKeyLineage 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":"apps/desktop/src/lib/diagram/fieldLineage.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"24be08f278ed76dfc582924621903a6bf97d5ca3c7945acac582d66e618613aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectFieldTypes (cyclomatic 11, cognitive 15): collectFieldTypes 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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c48adcaa1c7e1aec468522075ba9ee53800bdb86f978fff6734790f70ea985"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateAggregateCombinatorCandidates (cyclomatic 11, cognitive 15): generateAggregateCombinatorCandidates 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":"apps/desktop/src/lib/sql/clickhouse/aggregateCombinators.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fada309dc6f00303369b7e0537cab88dd6af45d6ff71aecaa680ff6b48d4757c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectResultCachePruneKeys (cyclomatic 11, cognitive 15): selectResultCachePruneKeys 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":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f9cc873279a5dedb1964bb4e01dd01a04c14f8b81feaeb5fd1a7965b451a67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readImportFile (cyclomatic 11, cognitive 15): readImportFile 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11700}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53feb1be160e9cd2b4a47391ac224b2efd0c39ae31693dd100ec5a54522d7d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorizationStepLabel (cyclomatic 11, cognitive 14): authorizationStepLabel has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"951ce77d724b6b590de6502a9b8da908867e85721e1dd4095224792677da8551"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":5681}}}],"partialFingerprints":{"codehealthFindingId/v1":"c615db1625dd81f7b38e13fb0a3edbd3ba541bbce9753a6cdd4f984b7b3f7738"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shortcutKeyEvent (cyclomatic 11, cognitive 14): shortcutKeyEvent has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/__tests__/EditorSettingsDialog.shortcutScopeGroups.integration.spec.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d14e8064e9d286fe4e3584e94db4d07becd1c5a13dabf226f7e14af73601fdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshPreview (cyclomatic 11, cognitive 14): refreshPreview has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridExtractorDialog.vue"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9b95dc22a1ae834b244b2c486600dd17705c2482cc9940be533475b6b50ae2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unwrapDataGridColumnType (cyclomatic 11, cognitive 14): unwrapDataGridColumnType has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnType.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57b86db0d84becd55f0795b2d20065a753f06bc964efc5a990e829705651d62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatOracleCompileErrors (cyclomatic 11, cognitive 14): formatOracleCompileErrors has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleCompileSql.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be5b84c6b5d00b462e729d7b7832dfd627b629c19ab8fa1a41e870390f20e84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chooseNextSemanticSelectionRange (cyclomatic 11, cognitive 14): chooseNextSemanticSelectionRange has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/semanticSelectionRanges.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"75be0071f11fd099648ec0eec06bf11888d768f0779810cc191a456d0b0ea421"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildEngineeringDiagramSvg (cyclomatic 11, cognitive 14): buildEngineeringDiagramSvg has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/diagramSvgExport.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d935c4d96a170af86749319835dd5cbeac6b28ef19a4c3e433c4cd1853d1bf26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDataGripImport (cyclomatic 11, cognitive 14): parseDataGripImport has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7031c1fbbfd80c548dbee50786bf349b079e1756e8e390cafe7750abdeade9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatRedisMemberDetail (cyclomatic 11, cognitive 14): formatRedisMemberDetail has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b056f4d49410a287892a9709f732e875a3efb83b6c7da3b956e079c0b940eb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function schemaDiffDependencyClosure (cyclomatic 11, cognitive 14): schemaDiffDependencyClosure has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e93362042d7b04aa6faca970de238e2bb7742a0761db4262825b222cf9df275"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function valueStartsInRow (cyclomatic 11, cognitive 14): valueStartsInRow has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"672e6c8046c27e19d35925ade7956d24183bfd101a594be611532deb2bbbce92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activeProjectionAliasClause (cyclomatic 11, cognitive 14): activeProjectionAliasClause has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/completion.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6afce65a8a31328778c221ef4f09b81a11351ca06ccf5b4ef0319ebed1734c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlMetadataRefreshTarget (cyclomatic 11, cognitive 14): sqlMetadataRefreshTarget has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlMetadataRefresh.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"18943cd5f979ce6d6a435d3c050c7fa0d09090f382c336632cf89505568d5119"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runForeignKeyChecksBatch (cyclomatic 11, cognitive 14): runForeignKeyChecksBatch has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/foreignKeyChecks.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e2bca25711c8cae34474f7d0dd1646482438c8bf3b9b389c2d505de34ac06d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMysqlTableEngineMetadata (cyclomatic 11, cognitive 14): parseMysqlTableEngineMetadata has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/mysqlTableEngine.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81b52df96b8b2a5448b8c82efccc82f43e465a1b7a10b1f79a9128698e64ff7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 11, cognitive 14): execute has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/tableCopyTaskStore.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbd8f6def9e1246c7ee90f7592531a77ca6116cf11329184b997329e1882790"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSearch (cyclomatic 11, cognitive 13): runSearch has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bbeb2fe60ae50dc873cb71c63890e67af7fa755519335458650dec49725e8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4319cb0bbe25260efd34cb67c66d0fe8fcd5a3cb092aebdf0fea621e0faa53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 11, cognitive 13): load has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdDashboard.vue"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5fc99728d8f23c3758671b55e4edbde58f03e5efd167ff85c5f5c5ac808d6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanConnection (cyclomatic 11, cognitive 13): scanConnection has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4143f2aeaeac5fd2718b27ddee0f0e36fa22151e497252acf12d6693866fb14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":3860}}}],"partialFingerprints":{"codehealthFindingId/v1":"db42bcba4b3300e01a76f8c2d0ee2275c67e7c68b73e56bc71cfe3fa1b796c23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyContextFilter (cyclomatic 11, cognitive 13): applyContextFilter has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8313}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fe97c5ee90809b8b39ba9f62228e0ee21dd955e0d9cd7be54f13a298f8df8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatCellCached (cyclomatic 11, cognitive 13): formatCellCached has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":8568}}}],"partialFingerprints":{"codehealthFindingId/v1":"0777b2156e01c99adf9987c63f7b839d9ee0ea8057fcba04ee39ef0b4bbd7b78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function issueToken (cyclomatic 11, cognitive 13): issueToken has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/PermissionsPanel.vue"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e58977f860ec50a72a69d30c7ca017d56c14baee06efa21764a247e480773c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchConfigContent (cyclomatic 11, cognitive 13): searchConfigContent has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"196b85198454a1ac6e341d75e82ff06b55d9ce03f09e8d0c8c8ba0883dbefb4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareBrowserTriggerDrops (cyclomatic 11, cognitive 13): prepareBrowserTriggerDrops has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":3663}}}],"partialFingerprints":{"codehealthFindingId/v1":"7302c9d94e703257a55523ac03d9d72eb92ca5fccd981e598901b236a2289618"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportDataLegacy (cyclomatic 11, cognitive 13): exportDataLegacy has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4121}}}],"partialFingerprints":{"codehealthFindingId/v1":"27647ba4e2b2a02e439ccb2f5c3694587f5b857af901044c7f7d086fa18e6b5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmEmptyTable (cyclomatic 11, cognitive 13): confirmEmptyTable has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef067ae1ce3a3a4a3336e9434951700299743b48ae617524c205cec25d499c4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 11, cognitive 13): load has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginFileManager.vue"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e08a012b9be525e7bb22dfb7f74116944fca7a6e9a0999995464b2493d1aa3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadStreamConsumers (cyclomatic 11, cognitive 13): loadStreamConsumers has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3f3f6f33cbe548f6a565771f151c631fd96b431fed940ab026c4a0fc9dafcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestPasteTreeClipboard (cyclomatic 11, cognitive 13): requestPasteTreeClipboard has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"91604763be56ca2111e5ccde816fbcf367c27881a325978328f2902d9839f4b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reloadStructureFromDatabase (cyclomatic 11, cognitive 13): reloadStructureFromDatabase has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4006}}}],"partialFingerprints":{"codehealthFindingId/v1":"b258ddd67128ae38465385b7309614d7ecf47c53655821dfdcfb2972c41ad8fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function schemaDiffSessionObjects (cyclomatic 11, cognitive 13): schemaDiffSessionObjects has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSchemaDiffSession.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d476bd5b5616f5a623093661072e2455587d01653516a0bd80f90ba39fb17a4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dateSortValue (cyclomatic 11, cognitive 13): dateSortValue has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSort.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3ae33eb62b21cd5ca4af201de440e4d63b8d3274e88cf435083109cd1e7144"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeTables (cyclomatic 11, cognitive 13): probeTables has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseSearchProbe.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f247bdbf6ced26e4b483d31ea7b2b4a542a0c8e2e1821776df3e99a67979677"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compositeObjectAssignable (cyclomatic 11, cognitive 13): compositeObjectAssignable has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/plDebugComposite.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b791ca3e498c07bffc956db3736f1138299d172aa9494ec6ff7cf47ac0a0137"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function liveTablePatches (cyclomatic 11, cognitive 13): liveTablePatches has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/draft-storage.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"905de075fc7e7add20df5dea5af0d3622d658f8316ca6de1ef0811cb6cb3127e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDiagramJoinSql (cyclomatic 11, cognitive 13): buildDiagramJoinSql has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/erDiagram.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92c6a9f0db4a5a7db326a83fc27bbd75809acd1bb5796bae3b579334f1a1e6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectOccupiedRects (cyclomatic 11, cognitive 13): collectOccupiedRects has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/size-layer.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09baf998ba9e9fde80dc7c09fa4963418af5109f27b5295cb34356a379531eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildInfluxDbV1DeleteStatements (cyclomatic 11, cognitive 13): buildInfluxDbV1DeleteStatements has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/influxdb/influxDbV1Delete.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"97138c2d8bc2620c57363e1f28f371b72e36c4e0f05733447fa73e754ad73d8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceLazyKvChildren (cyclomatic 11, cognitive 13): replaceLazyKvChildren has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/kv/slashPrefixLazyKeyTree.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c802aa90ddc28d6ea7d958c2b7f99572daea12d7972be1ee5921bc12d0ff08db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNacosConsoleUrl (cyclomatic 11, cognitive 13): resolveNacosConsoleUrl has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"495fb64bf04a5ffae69ea4a110d484057480b9cb4ff83f46d79d7a7017a252e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickPluginFieldFile (cyclomatic 11, cognitive 13): pickPluginFieldFile has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginFieldPicker.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b0795db44e84d9b2c4ccee4792b937b0e05bbe4494ef311edef3a1aaf438af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toJsonable (cyclomatic 11, cognitive 13): toJsonable has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/codec/pickle.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"529cdc546ac982486202448e600e56052f9b2773af47ea5e440a27be7557f29b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySearchCollapsedState (cyclomatic 11, cognitive 13): applySearchCollapsedState has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d81c1e0b3fdb3c808bf11b59e3eeef8fbf91b644810e2f0a49dea73e0129cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cfb58ecbff0b908362988942b4edaff3c3152ed63fec821f07d71f2a477564"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quoteSqlIdentifier (cyclomatic 11, cognitive 13): quoteSqlIdentifier has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4917}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbf1fb842fb6aae2a900d120c973e3b518012a01f7493d31a1faa13d2fc906d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildReferencedTableItems (cyclomatic 11, cognitive 13): buildReferencedTableItems has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":5085}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e1165c4a4c16a41a4a6e47fc68fcb96a189a5dfcd554c3ee52e1c507f74d0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSqlFileFoldersUiState (cyclomatic 11, cognitive 13): getSqlFileFoldersUiState has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sqlFile/sqlFileUiState.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85e6ad2820176505b5693c52dbafa6a830447146501ad2ae71cec0641c74b11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"556634a6ce603bce51fe62c822f811715c35a97c4f19947f6eb7f970230a0613"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeTableTreePageChildren (cyclomatic 11, cognitive 13): mergeTableTreePageChildren has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"25316cd602a25813a332930e70e84106130215db62fdacb70d884637250cd26a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function migrateToMultiConfig (cyclomatic 11, cognitive 13): migrateToMultiConfig has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccee2880332b5545bcdaa3d17b6046bdb3065bc64027a16a857c21b49d29c26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app-tests/queryStore.test.ts"},"region":{"startLine":9137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc0375e1054f89e05e3241f01691973913c027182c42afc4dcbe556e7128db1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89a8c684c45bbded6f2b8c12ec841b336d4f3ef0aa44244274dfc35f52af0f6"}},{"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":"apps/desktop/src/components/admin/NativeJobDefinitionEditor.vue"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c43f09fdac8c0bc1c456e4b0dc28046cdc0e3098c499ae3647e9343e4fdb689"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmSave (cyclomatic 11, cognitive 12): confirmSave 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":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d0a4672b769c4642b076821f47a952dba5a4bee2ce3d405b4f1c2cf78573a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRoutedPoints (cyclomatic 11, cognitive 12): buildRoutedPoints 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":"apps/desktop/src/components/diagram/RelationshipEdge.vue"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a932b9e27ed965e4bb4daf37c5dc157592c7556b4277866259a3f69e0957bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncEffortInputs (cyclomatic 11, cognitive 12): syncEffortInputs 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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4a84822bcc55393b033b095fd69037069b3dcffedeeefcfcdff22080f0ef2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cliEnvValidationError (cyclomatic 11, cognitive 12): cliEnvValidationError 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7304}}}],"partialFingerprints":{"codehealthFindingId/v1":"44653af291aa3583885b598c4a9f963420e5041935332941fad58633750e3b22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createHoverDom (cyclomatic 11, cognitive 12): createHoverDom 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":"apps/desktop/src/components/editor/queryEditorHoverContent.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"da15c18e058974903b0d04c78d8cd6af6c49846dcb10ed0bd8f2c523769629c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySnippetWithAdditionalCursors (cyclomatic 11, cognitive 12): applySnippetWithAdditionalCursors 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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95b1a910f09c8d1d32c2f18bd1b66a0ed827c05a47269a938d796e45d26b193"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provideElasticsearchCompletions (cyclomatic 11, cognitive 12): provideElasticsearchCompletions 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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ff325f34f97c95e7e2841710a3760073837c5f8aefef51ebe39458cd026ce3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expand (cyclomatic 11, cognitive 12): expand 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":"apps/desktop/src/components/graph/GraphResultView.vue"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1e1997b4625a56e53a580116e10892ab91510d74782f59cfe9467a5f3c1650"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchSnapshot (cyclomatic 11, cognitive 12): fetchSnapshot 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":"apps/desktop/src/components/nacos/NacosDashboard.vue"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f6f0b8ba70e906d36cf7594da85603d17a2050bfcdfc2a6a3aeae7791c526e"}},{"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":"apps/desktop/src/components/objects/CustomTypeInfoPanel.vue"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d5ce50453211e094222536c2404cde3ae4a05db56238809bc33472ef84d5a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmDuplicateStructureImpl (cyclomatic 11, cognitive 12): confirmDuplicateStructureImpl 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4517}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b62c978a10073f62462d2d25c0cf8cdfca7f28763445e8f60ab5d3d75c2e1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchInfo (cyclomatic 11, cognitive 12): fetchInfo 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":"apps/desktop/src/components/redis/RedisDashboard.vue"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1b502203489b4b8a1c51da71756346cda169f6ef15616498160d41303d275d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 11, cognitive 12): submit 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":"apps/desktop/src/components/structure/StarRocksLayoutCopyDialog.vue"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba839ef5b7fdeafd045775f082c7b2fa5e52aff3e1f1cc6cbd944bb01cf9beb"}},{"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":"apps/desktop/src/components/structure/__tests__/TableStructureEditor.oracleForeignKey.spec.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1153fe7bce78967e4a2514f6d0fc1c16fefb8e74178afc5e58fec81eb6cb4604"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadFormatterManualReferenceOptions (cyclomatic 11, cognitive 12): loadFormatterManualReferenceOptions 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":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f75ab51561d0d6ee0e645c45f949117d8d4bad92b502a25ab4ed804d0179c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareSaveStatements (cyclomatic 11, cognitive 12): prepareSaveStatements 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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ce4c013b592aa483e3f38de2b2fa2df1da47a0456ae51c6ea88fb67529f96e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkActiveFile (cyclomatic 11, cognitive 12): checkActiveFile 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":"apps/desktop/src/composables/useExternalSqlFileChanges.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"489e7a1e31815d7c9f4b2e3fbd62962d2b4a56e3497b07e7f17a3acd9e4c1770"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportMongoCollection (cyclomatic 11, cognitive 12): exportMongoCollection 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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27fea71ba2bc8fae0724272a90dbe3ba9d0a3484cdd50030756665d1a190379"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statusText (cyclomatic 11, cognitive 12): statusText 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":"apps/desktop/src/lib/ai/aiGenerationStatus.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24ecee21fe12fc38fdcf51e048514f82e6e0bbdb2c112b1656e376f8f0211cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function liveAnnouncementText (cyclomatic 11, cognitive 12): liveAnnouncementText 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":"apps/desktop/src/lib/ai/aiGenerationStatus.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3028fc86d5e6394454fb669cbaf7a2d21ed88510b52bec11e86093f6404dac76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateFilePath (cyclomatic 11, cognitive 12): generateFilePath 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":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4042da6de27e44acf0778e8e9491f189e97124420a3c1f736c841207c18a444"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceLazyKvFocusedRoot (cyclomatic 11, cognitive 12): replaceLazyKvFocusedRoot 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":"apps/desktop/src/lib/kv/slashPrefixLazyKeyTree.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d604739bf3c187ef1f02a53cdf4ad912458e2faa18c0a765b93fa4098fbafd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterValueEnum (cyclomatic 11, cognitive 12): filterValueEnum 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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab02751c71c8f4c1d5e92b133531950811898fad98422fabaaf013e87953cbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifySubDocument (cyclomatic 11, cognitive 12): classifySubDocument 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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"8731596290b3b01bfc367914f017ba75a9f3c183a89274bfaeaf327271809c5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupProject (cyclomatic 11, cognitive 12): groupProject 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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49506982952a7b2749d2cbeca849e887ffdfa6634405c128c655617351519e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pluginBootThemeCss (cyclomatic 11, cognitive 12): pluginBootThemeCss 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":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e87523e641c3db9bd9e47695d43ee734ad03908d0051a938487db367e68365"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitColumnDefinitions (cyclomatic 11, cognitive 12): splitColumnDefinitions 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":"apps/desktop/src/lib/sql/oracleSyntaxDiagnostics.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2656ee92aa7d74938a3a31e62a6d89769e7b42be0f06f7796e0665aaa4d67f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rangeForCursorInSoftRanges (cyclomatic 11, cognitive 12): rangeForCursorInSoftRanges 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c0580cecf66fc30127b04e63e6be8df0ab0940a93b210f31fd1527aa0b3b7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareObjectBrowserValue (cyclomatic 11, cognitive 12): compareObjectBrowserValue 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":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"f131723689b2c95217aecdd66801868af17db73c4e06f98fcfb9fe55fec3f60a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stringPlaceholderValue (cyclomatic 11, cognitive 12): stringPlaceholderValue 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":"apps/desktop/src/lib/table/tableSqlTemplates.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cfd1ab9ee220f3ebf12ffe060eb13365999b504051d5ebce495e0af3c5f9f3"}},{"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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f644661ae55faffbed4c4eb0dec1a408fd2ec5c12e6d3853e65a639cba641b6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useCachedChildren (cyclomatic 11, cognitive 12): useCachedChildren 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3a3eda2c619b9dbadce799ecccd8d54115c4615c5e1f187a8625617fa90635"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retirePasswordAfterChange (cyclomatic 11, cognitive 12): retirePasswordAfterChange 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5909}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1da23636d35579464bd53a1a3e886c7e24e1a844a0313059232a2dda96eb618"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadColumns (cyclomatic 11, cognitive 12): loadColumns 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":8661}}}],"partialFingerprints":{"codehealthFindingId/v1":"f210a2d3dfe87d9115bffbf68f256393258b1b6376dacd153a04f4311cc3d4d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rebuildSql (cyclomatic 11, cognitive 11): rebuildSql 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":"apps/desktop/src/components/diagram/DiagramSyncDialog.vue"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3032eb5fc3116773f3fa97fc9ebcb637ae4c85af6d53f02b977087bb0b84bf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function regenerateSelectedDeploySql (cyclomatic 11, cognitive 11): regenerateSelectedDeploySql 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":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f480dfef35464be4de68013e1692411c2140dc7fe07d55a12ef2ec2b2f857d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rehydrateLoadedSkillBodies (cyclomatic 11, cognitive 11): rehydrateLoadedSkillBodies 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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce36173d3cd7fa1e7690d99921e1433102006b9e57fb48ddd6503bf6fec5ae82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryConversationRun (cyclomatic 11, cognitive 11): retryConversationRun 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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6151}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2c9aac1e826ea5639a197c88f58866eeec62127814a7357c013b0ee36bc17e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function persistSettings (cyclomatic 11, cognitive 11): persistSettings 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":2774}}}],"partialFingerprints":{"codehealthFindingId/v1":"f702d412af55f1de9b64782087a0c51bed5bf4bf23a12c904722817559c8e517"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMcpConnectionSalesforceDmlChange (cyclomatic 11, cognitive 11): onMcpConnectionSalesforceDmlChange 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":4997}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5f7bf8a1d93efe5e45347959ed257b5f82f65eb538eecbf0697623ba51642b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMcpTreeScopeMode (cyclomatic 11, cognitive 11): onMcpTreeScopeMode 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":5081}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd85c853f5d146d1d280ce8dcd2db52b9110be9492415474ba828a7b63607bd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncContextMenuStateAtEvent (cyclomatic 11, cognitive 11): syncContextMenuStateAtEvent 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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"f317cdabe03ae61a7b2b83f747278af9d3b0150d8c89f7ae90a05540dd5805cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderGraph (cyclomatic 11, cognitive 11): renderGraph 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":"apps/desktop/src/components/graph/GraphResultView.vue"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd94dcf167c2e37eec4b0808dc80f170273525f2306984510ab42f8f9ba2dbe5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canvasHitTest (cyclomatic 11, cognitive 11): canvasHitTest 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9013}}}],"partialFingerprints":{"codehealthFindingId/v1":"c088e51ace56f193507eef5feb0a2282152810d4ea837c9ec5d1fd3fb35d8085"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceGridMatches (cyclomatic 11, cognitive 11): replaceGridMatches 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":11011}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e36940c25b929007cb9be7fe571fedcc60125130374b703012065cfe3ece7bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encodedJsonValue (cyclomatic 11, cognitive 11): encodedJsonValue 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":"apps/desktop/src/components/hbase/HBaseBrowser.vue"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dd35dd02e332d949d15e03450c16d0bd25c5e02c8e08ad7da03f3945fa1ac5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTopics (cyclomatic 11, cognitive 11): loadTopics 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":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7948da3b83af5277631958e38e912a88ec15c881bfd3cf171f1786a6a84e25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadBatchTargetNamespaces (cyclomatic 11, cognitive 11): loadBatchTargetNamespaces 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":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"815e905c365f167ea527c8a8763cd61d263da7448a90271a868ec064d4900226"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function displayValue (cyclomatic 11, cognitive 11): displayValue 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":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e319446c8abc14e20cdfd70ec8c98828d9633ea5129949e85da868e4f47476c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmBatchEmptyTables (cyclomatic 11, cognitive 11): confirmBatchEmptyTables 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4054}}}],"partialFingerprints":{"codehealthFindingId/v1":"1820ff7d64d6ce0edddfe055a41eb0c0a43c5998566c5e011f61b86e6d62588e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onTauriPluginDrop (cyclomatic 11, cognitive 11): onTauriPluginDrop 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":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb66243b774e674fffa5dc89bee7c2b0c9e91119bd5d633a5a50b307c4688a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnIndexes (cyclomatic 11, cognitive 11): columnIndexes 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c6d698dcc78801ceb5ceadd325974fac4ec5d80efd6676034774fb6287ddff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) 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":"apps/desktop/src/components/transfer/ObjectSelectionTree.vue"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5f10436df85c0fc5895e61392517074a042b27803e85cd72c5c32b17f759bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function growColumnWidthsToFitSamples (cyclomatic 11, cognitive 11): growColumnWidthsToFitSamples 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":"apps/desktop/src/composables/useDataGridColumnResize.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2522a76edb2a31d7db3196cc3f28268cc7c5383a2e82449ead5fe51699ba923"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchDdl (cyclomatic 11, cognitive 11): fetchDdl 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":"apps/desktop/src/composables/useDataGridTableMetadataLoaders.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0ae2768f98a69ef46b1a8375041d6bb541aaa8009531cce315d1c0102a850a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeTask (cyclomatic 11, cognitive 11): removeTask 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":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"8530260058abee513fcdab3fac47341a20596e386a4bcb4f11e6ef71892978a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) 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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ec59b1ec73a4659292638eeb3b63dcaabd5b1091fa2652dccb0616b49b1dba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSolrSystemPrompt (cyclomatic 11, cognitive 11): buildSolrSystemPrompt 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":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"489eb7c8d6d50da497e4a75db77f8297dd1e141c29a755b9dc4dd97cc1292c0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calculateDataGridColumnWidth (cyclomatic 11, cognitive 11): calculateDataGridColumnWidth 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":"apps/desktop/src/lib/dataGrid/dataGridColumnWidth.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"633534b6f6bbf65e0e4c1083238eb6854913b9c2876bcc4d0ab2d046c9361902"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeDataGridTypeColorSchemes (cyclomatic 11, cognitive 11): normalizeDataGridTypeColorSchemes 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":"apps/desktop/src/lib/dataGrid/dataGridTypeColorScheme.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91008398a005790d45bc542c0b11cf102c3d6aa5631dcc30a5ace4e4f75cc62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorizationPresetPrivileges (cyclomatic 11, cognitive 11): authorizationPresetPrivileges 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":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"29711fa261e00add5c96501f16d6f6bc67dd204e178111194d09989b4f35694e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStatusResult (cyclomatic 11, cognitive 11): parseStatusResult 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":"apps/desktop/src/lib/database/mysqlServerStatus.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b94d01ef0d37724ab80c88f80f54e25cc85c080ef2aa69c3777bfb89a7c20e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeDatabaseAccess (cyclomatic 11, cognitive 11): mergeDatabaseAccess 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":"apps/desktop/src/lib/mcp/mcpDatabaseAccess.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"deceb6de5a502eb44731cd9f4b6c79e6fcd631396a88529c0d1049df9c80fd04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMessageRow (cyclomatic 11, cognitive 11): parseMessageRow 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":"apps/desktop/src/lib/mq/rocketmqMessageUtils.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b66e8cfab380584638d690e7ce62a4ca2ecd9b8270bf1d0b894ec8686c9e64a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRedisCompletionContext (cyclomatic 11, cognitive 11): getRedisCompletionContext 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":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d970feb1b0053471b68ec056cfede25bd7ebe0ee1533ca5e195057897e39b8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRedisCompletionItemsFromContext (cyclomatic 11, cognitive 11): buildRedisCompletionItemsFromContext 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":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"409a373b336a52f80d910b832529d0b9269b082449d3cf9661cefcc7620e53b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redisCommandResultToQueryResult (cyclomatic 11, cognitive 11): redisCommandResultToQueryResult 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":"apps/desktop/src/lib/redis/redisQueryResult.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77f2bca9c2d0b379261842db6e5bf8b11e23ec69de91473984592b22018c11e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitParameters (cyclomatic 11, cognitive 11): splitParameters 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":"apps/desktop/src/lib/sql/doris/functions.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ef7f1343026875af09f40d5e80b3a971efb07e816b3def3780b4304f972e55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareCompletionItems (cyclomatic 11, cognitive 11): compareCompletionItems 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d927d6329c6cdfdabe7c62565d9da2cea1f963e8c8b496bed1ca9b5fda6bcac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editorStateFor (cyclomatic 11, cognitive 11): editorStateFor 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":"apps/desktop/src/lib/sql/sqlCompletionAnalysis.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b43552dcddd1140e10590abd8acba34361ab985710f07f341a8176073a10626"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareSqlFileEntries (cyclomatic 11, cognitive 11): compareSqlFileEntries 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":"apps/desktop/src/lib/sql/sqlFileTreeFilter.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1a8c7b73c1ed9f61719df5bb6641e4262a20b282625a8f5a856921db66285f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchSqlObject (cyclomatic 11, cognitive 11): matchSqlObject 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":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"892b55dbfaa3b69dcedf115402b06487464cfbabf46dc1eb26c1e1a3aa432cc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryReadQuotedBracedPlaceholder (cyclomatic 11, cognitive 11): tryReadQuotedBracedPlaceholder 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"57260925a2e99c7a516c1da6d507fbcc57bc3cd285e34eba9c8dd128b0183cb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOracleAlternativeQuoteEnd (cyclomatic 11, cognitive 11): readOracleAlternativeQuoteEnd 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":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74b9cfb0cae19f4a7d286c27eb5945d6ab8a1612c473f58e32ecf527b340a8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isNextDeclaration (cyclomatic 11, cognitive 11): isNextDeclaration 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":"apps/desktop/src/lib/sql/sqlVariables.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb99b97d06bb80a8f96c9c88786fec3976ab6194ad28f6524e58d1754dee0bce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function singleClickRowAction (cyclomatic 11, cognitive 11): singleClickRowAction 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":"apps/desktop/src/lib/table/objectBrowserRowAction.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d835b2a37647c7ff4328218c5460131a11622198a580d433cf82caa68dd8f339"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 11, cognitive 11): walk 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":"apps/desktop/src/lib/table/oracleViewRename.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2cb22dce7b445c94892a15f93b2c6cf2138dd146d91d772a35c1f4e4389b45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toColumnarResult (cyclomatic 11, cognitive 11): toColumnarResult 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":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb58b2fc14af357cb0a020e3290d373d79f47e4d31cf0ad832cc39443a5234cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) 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":"apps/desktop/src/stores/__tests__/connectionStore.pgTreeReopen.spec.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"281929d8a79c1e04acdfb8d977fb7c8cbac673e950138ce21a5a035176993e5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savePersistedTreeChildren (cyclomatic 11, cognitive 11): savePersistedTreeChildren 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3780}}}],"partialFingerprints":{"codehealthFindingId/v1":"963f9f1877f11768acb31e43b0fe5d97b047ddf7eaef0445dd6271c0da1326a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadElasticsearchIndices (cyclomatic 11, cognitive 11): loadElasticsearchIndices 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":7002}}}],"partialFingerprints":{"codehealthFindingId/v1":"5221495fb6ad2cf443ae35319a4e66335563325c6539d0bc2a900693a2e32b1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) 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":"packages/app-tests/queryStore.test.ts"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7b2f32a1e8059a5ffb0a6cf8a84aa50cc93b150002dbd7a457b63496fd812c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) 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":"packages/app-tests/queryStore.test.ts"},"region":{"startLine":2587}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b9e8b24d6c439771065e05732a1da487743c43c6d81ca2eb93814f8aa0cb2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onEvent (cyclomatic 11, cognitive 11): onEvent 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":"plugins/sdk/dev-host/browser-bridge.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e16e8f03b4e06a28a765108e74c461834fab9b8626c6956fd9dd3bb63e3f765"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleFloatingOpenFilesystem (cyclomatic 11, cognitive 10): handleFloatingOpenFilesystem 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":"apps/desktop/src/App.vue"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35ae59f95a497db5fc282e173c93a7a23ec3117c8c6a6f015828d9bbcf72b7a"}},{"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":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"46281553d0c0ea682bdffa1f61f710e41a10ea15a7dbb0135f9d843c1155e452"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function choices (cyclomatic 11, cognitive 10): choices 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":"apps/desktop/src/components/admin/NativeJobDamengEditor.vue"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dcf98c31a43f90ce0303c8f1f4fb797f201e43642b4bc56ba91d4c9112c4a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startDrag (cyclomatic 11, cognitive 10): startDrag 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":"apps/desktop/src/components/common/VirtualScrollArea.vue"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5105ad5b1ae8c8c05db3fd245e3c9e7a79aae812cbcadbcca26d11925c0386cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMqttExternalConfig (cyclomatic 11, cognitive 10): buildMqttExternalConfig 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b1082c1e7c7d1937fe72cd55467a686e03ac16a2f9d3d17f285132bb7d2a8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshPreview (cyclomatic 11, cognitive 10): refreshPreview 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":"apps/desktop/src/components/debug/PlDebugLaunchDialog.vue"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3efda3384ffdabd0764881f174a146462e5854729ed39cd360dab4c244668cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyHistorySnapshot (cyclomatic 11, cognitive 10): applyHistorySnapshot 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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b31fc1d12974d4497911a71c087c55a1e57b8ed8a8232471d79c04c2cab13e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleNodeDragStop (cyclomatic 11, cognitive 10): handleNodeDragStop 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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e1995224e22a1f03cf870d45d91f695d68d6226b87e594a057dc16cf8d685e"}},{"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":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e157e949b0d15ce4c61aa4380891bf95f69a09b5edc69a6c70e2cea1e91838f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshDocumentQueryCompletions (cyclomatic 11, cognitive 10): refreshDocumentQueryCompletions 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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1305a2d19b5eb772ecb5c773858596c543aa3a6ade241bcdf37d193c396eec79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCompletionResult (cyclomatic 11, cognitive 10): buildCompletionResult 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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b1fb15d90f8aab19b61aedfa1b9a07174c1d340141a1a692577112b31f3bd6"}},{"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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af6fedd8cfefccfbf5b966180f62a45f87da03a6ae17c2921fed0c44f2a42f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteSelectedTreeKeys (cyclomatic 11, cognitive 10): deleteSelectedTreeKeys 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":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fe3a3819f62a8969d8f1d2db458634a16b7405b0ca440906e33ac26d241021"}},{"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":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc537d18cc840b99139bd76bd5fa70c982848b5b448be415f6db79fe67177189"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gridCellTextColorClass (cyclomatic 11, cognitive 10): gridCellTextColorClass 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e184ce9055942abd0bbdbfb77302c77ed2198460e4d072c782485767f84cb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishOrContinueLoadAllRun (cyclomatic 11, cognitive 10): finishOrContinueLoadAllRun 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":4413}}}],"partialFingerprints":{"codehealthFindingId/v1":"2253400c83b0279b9639406c53e5068a7bd61c7c808d2ece85ea059f5cd7ee8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateGeneratorPickerPosition (cyclomatic 11, cognitive 10): updateGeneratorPickerPosition 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":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c061e60c63cc8338334b8b6e28b028da694d5d82a575517f4e8ad8f23852addf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revealExpandedTabGroupStartIfHidden (cyclomatic 11, cognitive 10): revealExpandedTabGroupStartIfHidden 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":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f77d8c951e92e28430aac502d6c07310a3739ad2f2a68bb3ad7de72a1f0014"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sortKeyLabel (cyclomatic 11, cognitive 10): sortKeyLabel 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6805226844b411c8bc772348d6fbe37c0e3cc9a2e53df0072fd302bc3f91f742"}},{"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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c4967110d97fbe1fc2a1e30b5abaf1b60d972f5c3bdb34bbced2f994fbc3a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manageTypeDrop (cyclomatic 11, cognitive 10): manageTypeDrop 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff4162b6e5ece1f4befb9d29aa6da9809fc54b3684e4950f822385a554f092d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showTriggerSnapshot (cyclomatic 11, cognitive 10): showTriggerSnapshot 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":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba5c1a553913f582c82c122f967e5c9228426c77eab5bac7994846534f3aeb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function focusSearch (cyclomatic 11, cognitive 10): focusSearch 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":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07da6d4776994572b38fadd8f3507ef7aa82333e70c9c939de0b3e54a8e9be9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attachSqliteDatabaseFile (cyclomatic 11, cognitive 10): attachSqliteDatabaseFile 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":5877}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59d4d6866b5199d12c35f54369593465c765f8c3e68be051010f0d86cedcf13"}},{"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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":9157}}}],"partialFingerprints":{"codehealthFindingId/v1":"57706b9b356db332d6dcff40dd5f41653b9c8945953327cdaae7cd9f91ac9a0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structureDataTypeToneClass (cyclomatic 11, cognitive 10): structureDataTypeToneClass 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8eacbdce9fcf671dc94604985ee83042fdc2d4a17706d79672d2a5a5cb36e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setSecondaryMetadataLoading (cyclomatic 11, cognitive 10): setSecondaryMetadataLoading 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4055}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca6169ed10f07b843225bcba232eb8c4c1d949dc6dc02e7660f6f072c348ea1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordStructureHistory (cyclomatic 11, cognitive 10): recordStructureHistory 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca8003496ab62ac87d712dfdee04ec25715a7faf0f42aa407d35edd62bb5c6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyCell (cyclomatic 11, cognitive 10): copyCell 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35b2bb6fad513fa1c18bda6193e82af09197d2a22b37729a215e13562f12463"}},{"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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"d524bf724892fc9e2b0ba3d40ac42737d42dee1b663bc1a7a457e7a4a36bf84e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showFailure (cyclomatic 11, cognitive 10): showFailure 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":"apps/desktop/src/composables/useOceanbaseCloneDialog.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8377b029681d09123593eb5bc25b2ddf980af15fd2a1bad2547e0056cd8c465f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function effortSelectionSupported (cyclomatic 11, cognitive 10): effortSelectionSupported 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":"apps/desktop/src/lib/ai/aiEffortPreference.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56ec6566a5b8f1324136e3feca1e9f375c4d1558ca22cca94a0318553728ea3"}},{"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":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d378e905df5b3340823c33fb1d8c140ddb3edf206fae5d0d0a0277c75b9929"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeJsonValue (cyclomatic 11, cognitive 10): writeJsonValue 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":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7922f060514d5c9aaef04197cceec0f511a85132eb02defd3ab5a6e199ad0c30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encode (cyclomatic 11, cognitive 10): encode 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":"apps/desktop/src/lib/connection/connectionParameterDocument.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"809e861faf06a2610114e3f958c765df0299097408920a3c267d241e6be1f033"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionUsesPasswordlessAuthentication (cyclomatic 11, cognitive 10): connectionUsesPasswordlessAuthentication 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":"apps/desktop/src/lib/connection/connectionPassword.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c04078fa6742073ac793e13b6dfcf43743faa287bd938cb2819520ab424bfac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionRedactedNameLabel (cyclomatic 11, cognitive 10): connectionRedactedNameLabel 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":"apps/desktop/src/lib/connection/connectionPresentation.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c773d9017e6ed881123de5e8ca1baefc20a43bdc2d8dfc8d50740b9deadf6102"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseZooKeeperUrl (cyclomatic 11, cognitive 10): parseZooKeeperUrl 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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f12368f90ebd2ec27b84f9a3054701276e688b6d8582abaacc3bd69f9f3744c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mysqlDataCharsetValidation (cyclomatic 11, cognitive 10): mysqlDataCharsetValidation 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":"apps/desktop/src/lib/connection/mysqlDataCharset.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3668930382414e1806038c2d869edcad0e2940ff485eb52954e2370b84a7ffa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectImageMimeType (cyclomatic 11, cognitive 10): detectImageMimeType 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":"apps/desktop/src/lib/dataGrid/cellImageUrl.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"435bb5e91fd0876de65ca11fb0341a1339e5cd2f53afb07689c9a811a0c7a229"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOracleDateLikeText (cyclomatic 11, cognitive 10): parseOracleDateLikeText 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":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2b25402d49eb3abc62f9ae2feabb6d7fb5cd547a3d1a27c8210079f8af7493"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnHeaderDragAutoScrollDelta (cyclomatic 11, cognitive 10): columnHeaderDragAutoScrollDelta 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":"apps/desktop/src/lib/dataGrid/dataGridColumnHeaderInteraction.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c8e60978e746e04a03e395913a19aca202554488cfe128d847d0f7c884f01a"}},{"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":"apps/desktop/src/lib/database/__tests__/oracleForeignKeys.spec.ts"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"08adfec27988ffff31231d5d2c738aa65958966101feb472421c68aa6c67991c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markerClass (cyclomatic 11, cognitive 10): markerClass 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":"apps/desktop/src/lib/editor/codemirrorTrimmedSelectionLayer.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67e40eee9d4570847a158c85ef7d9ff2e2e6b32cbd01afb70dd1cca3da4ed11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isJsonFieldNameSlot (cyclomatic 11, cognitive 10): isJsonFieldNameSlot 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":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"03be10eac8811a222a8ef63ee12faaad4bf3ef5d42f71ad9f36ca55bba0f89b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagramExportFileName (cyclomatic 11, cognitive 10): diagramExportFileName 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":"apps/desktop/src/lib/export/diagramFormats.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a5948e6993d98dfb2b74f0a5ae3ac58488f351a4729b98694a232e0ae499f5"}},{"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":"apps/desktop/src/lib/mcp/mcpAccessTree.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67d4b099b61a6edd15252fef3df2d8d9f6d9916f23144f38205569d033d0dc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getMongoDocumentQueryCompletionContext (cyclomatic 11, cognitive 10): getMongoDocumentQueryCompletionContext 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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a48cda77bc3df9c5b8b4c42accb13c3355b732133b883ff419dce5b93209b55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 11, cognitive 10): visit 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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de03c5410cb0267658b002239c7dccbea0d61ce5b0cd444c6546f8112503d86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePluginInstallDeepLink (cyclomatic 11, cognitive 10): parsePluginInstallDeepLink 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":"apps/desktop/src/lib/plugins/pluginInstallDeepLink.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69390e88a5d233527daf00fa50adffc30753021fb41fb2f11016bab97565187"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkLine (cyclomatic 11, cognitive 10): checkLine 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":"apps/desktop/src/lib/redis/redisSyntaxDiagnostics.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a84398cdf62f2fb23315d9025481212b7b4ff6f3930ce6ed0926e12414704a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scrollTopForSidebarNode (cyclomatic 11, cognitive 10): scrollTopForSidebarNode 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":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"da63eb0840cea5153187ef177ebd9529bd0df3ada7f2679aeacd43d7b61405e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSidebarStickyProductionNode (cyclomatic 11, cognitive 10): resolveSidebarStickyProductionNode 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":"apps/desktop/src/lib/sidebar/sidebarStickyProductionContext.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8088667a0c8ee6386c3d8ca78ed7373ce307ce26320b3c361c5f3b9e1aaa3552"}},{"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":"apps/desktop/src/lib/solr/solrAdmin.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98038cdaad824acb57a63ee7f0fef7ce30b35041e23c7b45a43b0aee35ce3f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findColumnAttributePositions (cyclomatic 11, cognitive 10): findColumnAttributePositions 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":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3104c15b2685926bb9a6d427725504562e79a81ee466e9660ed427edb21232"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMetadataColumnName (cyclomatic 11, cognitive 10): resolveMetadataColumnName 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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2386e133820a58d35f292548e04d73ef812444886c03bcd24d0c5838b3801de7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExpressionAlias (cyclomatic 11, cognitive 10): parseExpressionAlias 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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8a83aeaa9ebd5bdae30530543a2e0cb8a693fbbcf812347357b9ce8e33e183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSqlFormatterConfig (cyclomatic 11, cognitive 10): parseSqlFormatterConfig 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":"apps/desktop/src/lib/sql/sqlFormatterConfig.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61eed248d3edb6574566a4ccb9b23dde5fa396b6c68b38be1f3e97819dd22be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldSplitSlashSeparatedValues (cyclomatic 11, cognitive 10): shouldSplitSlashSeparatedValues 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":"apps/desktop/src/lib/sql/sqlInListPaste.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2136561a6770bb6af972946186a1e971b380d5afacf384d7abc791128bfdd00c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sqlObjectNavigationTarget (cyclomatic 11, cognitive 10): sqlObjectNavigationTarget 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":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d1459324e51af35c11b8fefa098f0a4fcc46da6938f7addab2f7ced4df71ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mysqlDelimiterDirectiveCursorRange (cyclomatic 11, cognitive 10): mysqlDelimiterDirectiveCursorRange 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":2927}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0da468bccf04854ff656980736e938a67d67b1722abb4e571e086dd27ad03a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeIncrementalBatch (cyclomatic 11, cognitive 10): mergeIncrementalBatch 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":"apps/desktop/src/lib/sqlserver/sqlServerActivityTraceRuntime.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3e29c881b5287e8e1dcf042bc8076478bae5e9c8831b68f1f866044d56e025"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startRuntime (cyclomatic 11, cognitive 10): startRuntime 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":"apps/desktop/src/lib/sqlserver/sqlServerActivityTraceRuntime.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdfe3dea242d6e8d46b13011a7b0f79f4867b0b02d8083aa896a97e4466b4bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyTableDefaultSortResult (cyclomatic 11, cognitive 10): applyTableDefaultSortResult 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":"apps/desktop/src/lib/table/tableDefaultSort.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd36e4d31f905f8d014dfc691ca14ffc00b9cdfa9b89cc2ed80ac5de14e8803"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectTreeCacheVersion (cyclomatic 11, cognitive 10): objectTreeCacheVersion 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":2544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8883d8779171530ecb0f5906b30e130a74590552e16984a521667cc02e80013"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hydratePostgresTree (cyclomatic 11, cognitive 10): hydratePostgresTree 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3728}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b99f204d8a9387eb8d8549d169fd166cf2fb3aae9a33fe7c241b7a6d6949c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncMongoLegacyDriverFallback (cyclomatic 11, cognitive 10): syncMongoLegacyDriverFallback 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5128}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bf5b597904660c0c6c1099451c2ddcbb97b1dbba1f1df5088a7ebeb074eccd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completionTableCacheKeyMatches (cyclomatic 11, cognitive 10): completionTableCacheKeyMatches 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":9338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48adf2ec6f438b07f94d53cd260df5e6ae0bbb5f0242d67d3e330cf0a0347b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openTableStructure (cyclomatic 11, cognitive 10): openTableStructure 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":4800}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e62db6efcd1ef7eaabab7c4cf3db857556e24b894ca96febfb6c498d2587cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 11, cognitive 10): run 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":"scripts/verify-plugin-cli-package.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb81578efe3bff760dbaa173fd4afca9be9397baaf3e5a5206af10956ec80cd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4566}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efe52ec8361421c8eac266049bf5ea2bd2c50704f1bccea5dff19c98774b86a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4408925d780053080f0bde695af9f83bce1f58a4054f609089d6c96cff847c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreNavigationAfterInitialLoad (cyclomatic 11, cognitive 9): restoreNavigationAfterInitialLoad has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"935c4a047339f51c1f9c2f057a5ca799bdd9b145eaa2548c9abd69324f3ec0cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshAiImportSourceCounts (cyclomatic 11, cognitive 9): refreshAiImportSourceCounts has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":7006}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c280c4ff04fc4ea8b34fc3cbd5d66771fa02b9dae7196e0da6e5e74f73cecc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reanchorCaretAfterDiagnostics (cyclomatic 11, cognitive 9): reanchorCaretAfterDiagnostics has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"37397a7101925aa0623e2a7e1ecc8da56e05422d4b5bc755542a6f735e0e6b52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canvasCellContentOverflows (cyclomatic 11, cognitive 9): canvasCellContentOverflows has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":9301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9370d57723f3897df3e6236578f0c56350f43c6caf3793ae28be2f18b5655ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":14084}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec8112d435bd48d027977e1acfa3e041c73fc340899e5a041fec3bc9a410bc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCreate (cyclomatic 11, cognitive 9): handleCreate has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/TopicsPanel.vue"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8340c9a97d9b9dc210d3c973ac11de5b6d4b2ae103bd45c7e0956234ba861c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onDialogHeaderPointerDown (cyclomatic 11, cognitive 9): onDialogHeaderPointerDown has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99d0a31beabb98009771305c44cdf2341289f06256b599b91ba10c6151be285"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function test (cyclomatic 11, cognitive 9): test has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleDatabaseLinksDialog.vue"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e314cf4ea83c79b03aaf29e8fe397894bee790444e0720dedc6b4139caad78f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadKeys (cyclomatic 11, cognitive 9): loadKeys has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9006338caa5b2ffb42cea5107482000c00fc5a7d13ee9902feb5cd3028ce92d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dropSqlForTreeNode (cyclomatic 11, cognitive 9): dropSqlForTreeNode has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3860}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac00521a38228477d3c374d2b9f1574a73f3e341541d4ae3d4f63e999958073"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCopySourceTables (cyclomatic 11, cognitive 9): loadCopySourceTables has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4909}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d575ef22c3cf663be9cc74e3debe5ecf9821bc9a0e0a8db16bc9dbcfa7a2682"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCopySourceColumns (cyclomatic 11, cognitive 9): loadCopySourceColumns has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4971}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1800db59717128f00b25c8a4492e08a6b7d7143b11bc94b15d51ee139e87d55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setOracleForeignKeyState (cyclomatic 11, cognitive 9): setOracleForeignKeyState has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":6411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82e90a2d7c77a5bd59933b0b8b50ed4767d37a29cc60cc03059dac9d67da732"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeydown (cyclomatic 11, cognitive 9): onKeydown has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/LightDropdown.vue"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"720511ebb1ba722a7be67eccabb248df1d91ac8bfb746d5067ed8b7939d612fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTableSql (cyclomatic 11, cognitive 9): buildTableSql has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a32f7422efb6964977dcb671fe056510dcac61449986bfb95f49119e1e69da3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startEdit (cyclomatic 11, cognitive 9): startEdit has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b6ded367bc05222722ec64cf1ef00e2f9360a646d6eda451f7bf46887e6b27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function estimatedBinaryByteLength (cyclomatic 11, cognitive 9): estimatedBinaryByteLength has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellImageUrl.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf5a6941c170530bcf43606abecfee739ebf40e7ea750260995c0d7fb4d1284"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatFilterRawValue (cyclomatic 11, cognitive 9): formatFilterRawValue has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a235d8a22641c052a7143f38847e89d4929214794d0044f26154a89d5126a4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalNumericReferenceValue (cyclomatic 11, cognitive 9): canonicalNumericReferenceValue has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridForeignKeyDisplay.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"014c2e2343eb2ff077cfd0c401506fe5355c55fb6df92d5d0f2a64094ac0c81f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dataGridLoadAllNextSegment (cyclomatic 11, cognitive 9): dataGridLoadAllNextSegment has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridPagination.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1f403c0e12a7371df4ea2dee003d6d370ebfd9e2894d7ae9d08ea8c165e980"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseColorMix (cyclomatic 11, cognitive 9): parseColorMix has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridPaintTheme.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f18b8d08fea306eaa5574b1865415c882ab1c1a273f1b69325137abb04a8bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseSearch.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3f74875a2f44d7c254bbe23c835533d941f4103d76d219c0005a17ecb00827"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function elasticsearchProfileBodyForResult (cyclomatic 11, cognitive 9): elasticsearchProfileBodyForResult has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/elasticsearch/elasticsearchProfile.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"643b2be05489163993f4979ebd19a0375545ab355cce7f380efd6e629afef358"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unwrapSnapshotCompletion (cyclomatic 11, cognitive 9): unwrapSnapshotCompletion has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/snapshotCompletion.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6d87229511cdad79c8245ea73799f7081dd83c45103ce79f204f78609b360c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMongoFindOneAndDeleteCommand (cyclomatic 11, cognitive 9): parseMongoFindOneAndDeleteCommand has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"6605d759ef96c3de36d1681219c78aa9e43377b6eb9c06badbbed52544b73cb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5cc71826ec9ae24c97c62dfe58d0161e1186159a9b8f1001cfc29f10c95c20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSelectItem (cyclomatic 11, cognitive 9): parseSelectItem has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"200b1a37b1a7a7dc109ffeb252fab09c9c4554f2a819d8e01877e2c4315f51f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function yamlKeyRange (cyclomatic 11, cognitive 9): yamlKeyRange has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosYamlDiagnostics.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdcc35d50fd5a0e92437cccc68380d5d217d4c7d4354638c3eae7ffe738ff27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeQueryResultArchive (cyclomatic 11, cognitive 9): decodeQueryResultArchive has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/query/queryResultArchive.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ae17f43cf4527bc3459abd49be21c0234134781d27460cd87f4ab81a77a843"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function yamlScalar (cyclomatic 11, cognitive 9): yamlScalar has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"0776583f77d7a55a002818210c273535fd82d41dc521791ef7b4c97b738fb0c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savedSqlMatchesHistoryScope (cyclomatic 11, cognitive 9): savedSqlMatchesHistoryScope has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/savedSql/savedSqlHistory.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0505cd4827e80203dfde4fcf3b12801f63f3ee3e0b576374ae2f23b8caff4eb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOracleRoutineRecovery (cyclomatic 11, cognitive 9): prepareOracleRoutineRecovery has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"a073a47180011968deedfcf23a88e4ea22e83c1f6abe2fc19043bfa4f9b374d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function containsComments (cyclomatic 11, cognitive 9): containsComments has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/layout/primitives.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdd997fa0f8a6c6eb52ec9f835f9fb41701b3e606bb4ac1fb29b7a17580425c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/references.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba18a0f94a0bc12b2661ad27f2f6bedffa7d1f41183ff6cba4c8c6dd6e361677"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function looksLikeComputedExpression (cyclomatic 11, cognitive 9): looksLikeComputedExpression has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b10010e505e0db2c0c6c5cfc06c0fcfbdb4fbee2ea1cbbea2577d33924eeae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e89e48ffeea61d1485e8220a543d0c03d21e7dac910e4acf2f7e80a694e93f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function referencedTableMatchesColumnQualifier (cyclomatic 11, cognitive 9): referencedTableMatchesColumnQualifier has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":6264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2ff4a15ae2d2e1d8cc43e604c092ad2e4f67a91c885a0960aef8ffe7850c08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":7042}}}],"partialFingerprints":{"codehealthFindingId/v1":"209ce4621e726108d6573b293f7d31f7bbe4eb72d97e47a449a377fc5755190c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSqlCompletionScope (cyclomatic 11, cognitive 9): resolveSqlCompletionScope has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletionLookupTarget.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f458bacf13fc300cd5cd278abe659f724982f07b19edea5ef4ef5b3b2577bd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipOracleAlternativeQuoted (cyclomatic 11, cognitive 9): skipOracleAlternativeQuoted has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"9726f7d76a5397e8fcb9be5dbbc1c147a1c9934efd6ff9824c53f38a66871351"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldUseNamedArguments (cyclomatic 11, cognitive 9): shouldUseNamedArguments has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/routineExecutionSql.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfdbf672a172a7691096ca5b84e6ed1bd0a1caec849c8c4dcc7abe0ec21d2a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadConnectedConnectionRootForSidebarSearch (cyclomatic 11, cognitive 9): loadConnectedConnectionRootForSidebarSearch has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6582}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd517beb4bb152fa73a8d69af6d256a75afff5f89f444747029db88d5d03cc43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aae78d60794c155081693df3a44836fff5a5bd0dbd9794a202ff7d4cecc843d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureMultiDbExecutionWorkerResult (cyclomatic 11, cognitive 9): captureMultiDbExecutionWorkerResult has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"59df6c3b875b3b4b8118fbfd9d7ac91b9cedeef46845bc52072b4db3b372de6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshObjectSourceTab (cyclomatic 11, cognitive 9): refreshObjectSourceTab has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5bfff04db6b3187d4b6d46d5e1c8af13f3edffe6a9c435f088cfb0d86e905d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countQueryTotalRowsInBackground (cyclomatic 11, cognitive 9): countQueryTotalRowsInBackground has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":8243}}}],"partialFingerprints":{"codehealthFindingId/v1":"90693109b31f3292b4d03963efc54a5e8792e05e64151edc90bb1df3f5e5f677"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setActiveResultIndex (cyclomatic 11, cognitive 9): setActiveResultIndex has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11017}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5771ee4b3074ecc438c330ba6671bb3e152fcfd73efe065d96188e264dc3a9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportQuerySqlDirect (cyclomatic 11, cognitive 9): exportQuerySqlDirect has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":11920}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e83e0ba0d06e827d30adb0666b7d2d8d32b651f1afd984a8ec61a41a5f2306"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/grid/DataGrid.vue: 17707 lines of code: apps/desktop/src/components/grid/DataGrid.vue has 17707 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":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9eb3bb1363865b9c8feaf06c67b7ec20d74f942cc17a048594c31bc1f04c512"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/en.ts: 14410 lines of code: apps/desktop/src/i18n/locales/en.ts has 14410 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":"apps/desktop/src/i18n/locales/en.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2918b37619d8ca8f55bd3315cae5041b878b3ad463c891aa33f49c5c3c2ad8"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/es.ts: 14403 lines of code: apps/desktop/src/i18n/locales/es.ts has 14403 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":"apps/desktop/src/i18n/locales/es.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5376cf543ee285ebd6a3f476a302ef5fdc493fbd185dcf5767110fab7929898"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/zh-CN.ts: 14370 lines of code: apps/desktop/src/i18n/locales/zh-CN.ts has 14370 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":"apps/desktop/src/i18n/locales/zh-CN.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87aaeac4bacb3c4d5c40e8c2dd901fdf62231bcbcc6f8134b65bd1ae1e89da96"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/EditorSettingsDialog.vue: 14187 lines of code: apps/desktop/src/components/editor/EditorSettingsDialog.vue has 14187 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":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e870ee91219ea2898fea09df294ddb67ba3fec8af3b2a84193bcdfc71b554f9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/ja.ts: 13747 lines of code: apps/desktop/src/i18n/locales/ja.ts has 13747 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":"apps/desktop/src/i18n/locales/ja.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"974d7423d7a637dd08f4879d590a0d3d43f1979287886f14944ce91488849dc1"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/pt-BR.ts: 13728 lines of code: apps/desktop/src/i18n/locales/pt-BR.ts has 13728 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":"apps/desktop/src/i18n/locales/pt-BR.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a189b2dfdb35d530811c1747534d23aa35af41a9d42bb5576ede00e385db01c1"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/it.ts: 13712 lines of code: apps/desktop/src/i18n/locales/it.ts has 13712 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":"apps/desktop/src/i18n/locales/it.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6e5d8e03b0328ab4246ed73c6bad1589ba923dc2ef2268f75e3f49050d6c92"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/zh-TW.ts: 13662 lines of code: apps/desktop/src/i18n/locales/zh-TW.ts has 13662 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":"apps/desktop/src/i18n/locales/zh-TW.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2523719b03e43ee5d425d7d6d2a3bc49d1c9b34a4c8d53017d21fc95d12d0b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/ko.ts: 13204 lines of code: apps/desktop/src/i18n/locales/ko.ts has 13204 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":"apps/desktop/src/i18n/locales/ko.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ce3e4eb51bdeb9c6f5be81b9ab2a1372c3defdb9d09900c316ff74a55de0ab"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/pl.ts: 12545 lines of code: apps/desktop/src/i18n/locales/pl.ts has 12545 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":"apps/desktop/src/i18n/locales/pl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1cefbc7301afad922861c67688658b2eb6c811d905dd32fc4fd115e906a61a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/id.ts: 12495 lines of code: apps/desktop/src/i18n/locales/id.ts has 12495 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":"apps/desktop/src/i18n/locales/id.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e766aa61b92c713f1588bfd7c3c50d91d4ba4d4eaa91b53cad00f76ac1d6373e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/stores/connectionStore.ts: 11609 lines of code: apps/desktop/src/stores/connectionStore.ts has 11609 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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"510440d93687f01ef1076c178f01ba1f9a0874e6065340bab34d5d087bbf8ccd"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/az.ts: 11601 lines of code: apps/desktop/src/i18n/locales/az.ts has 11601 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":"apps/desktop/src/i18n/locales/az.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49a999f9344b2efc6bc1cd0ae0fa01c0b7f2a39a9361f9a7eaa1bed51746a82"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/stores/queryStore.ts: 11592 lines of code: apps/desktop/src/stores/queryStore.ts has 11592 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":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc39dc81278f6d26697dcf0b5767026562372e08f7af0fa482189763e70377a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/i18n/locales/tr.ts: 11500 lines of code: apps/desktop/src/i18n/locales/tr.ts has 11500 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":"apps/desktop/src/i18n/locales/tr.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f4c20bf20f5bbbb003c3f5e9cf5cebf077817c8f6ca17140a2ad9e27faad29"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/connection/ConnectionDialog.vue: 11374 lines of code: apps/desktop/src/components/connection/ConnectionDialog.vue has 11374 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":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8957f4b8c4570577452f8ce83238ce82f7b9350f8362cbfbee7a28ac181461"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/structure/TableStructureEditor.vue: 10287 lines of code: apps/desktop/src/components/structure/TableStructureEditor.vue has 10287 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":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9e0e5fc42d32163f82f68c5a4847d077870ed15f2e7c7dfa9fbba4bec0b296"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue: 8909 lines of code: apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue has 8909 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":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c6acd29c231a2d63c055d32cfbb36635f508f54a5b6fbfdbf49dc2d309e2db"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/AiAssistant.vue: 7898 lines of code: apps/desktop/src/components/editor/AiAssistant.vue has 7898 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":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"206db06f9bb7ea041aae38fd37e8fbec876b2761fbcb38f9a37eb822186ca4a0"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/objects/ObjectBrowser.vue: 7679 lines of code: apps/desktop/src/components/objects/ObjectBrowser.vue has 7679 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":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa8ed46f183e6a839a95a4f9dadcc5a4fa39935bdb03c48e1afeddd962a75d1"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/sqlCompletion.ts: 6829 lines of code: apps/desktop/src/lib/sql/sqlCompletion.ts has 6829 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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec4a69c01a038936c981033be4917f4f121f568607972a4645323c53b4982ab"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/backend/tauri.ts: 6239 lines of code: apps/desktop/src/lib/backend/tauri.ts has 6239 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":"apps/desktop/src/lib/backend/tauri.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cab82f7a09fe82476679fa3f3e09820b08adfc11a34a88fc06e6724bf8ee8d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/App.vue: 5940 lines of code: apps/desktop/src/App.vue has 5940 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":"apps/desktop/src/App.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"010b4a89c9d2864afec23bee7a12d658c5a415020ae60ddc2283ee9fafcedfe1"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/backend/http.ts: 5226 lines of code: apps/desktop/src/lib/backend/http.ts has 5226 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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8605a7b983e97a925f0feca289d032838488c621ae79ce7f7bf938ca6235e055"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/redis/RedisKeyBrowser.vue: 4522 lines of code: apps/desktop/src/components/redis/RedisKeyBrowser.vue has 4522 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":"apps/desktop/src/components/redis/RedisKeyBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f5af3b2914053750598bc2751bfdfb6f46d539d476c57a4c916a7dbcd72f8f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/layout/ContentArea.vue: 4012 lines of code: apps/desktop/src/components/layout/ContentArea.vue has 4012 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":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfd4f21efb90f800135862655d7c7b9ffd89db676e7b612117d0a7f6c54e1e4"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/redis/RedisValueViewer.vue: 3997 lines of code: apps/desktop/src/components/redis/RedisValueViewer.vue has 3997 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":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0be96a44d07a28aa511eb6d153cfbac5f857d74ac2ce36d79ff948e408ab102"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/nacos/NacosAdminConsole.vue: 3788 lines of code: apps/desktop/src/components/nacos/NacosAdminConsole.vue has 3788 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":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1909e919e35858e72fb6cf357ca34f0f9e9a70ede5fd7d8a85bc1d2a1955d55d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/stores/settingsStore.ts: 3491 lines of code: apps/desktop/src/stores/settingsStore.ts has 3491 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":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4da6df0174c65d7838174f50631258e16a6baa8cb815ee504e84ae781592a9f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/QueryEditor.vue: 3372 lines of code: apps/desktop/src/components/editor/QueryEditor.vue has 3372 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":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a48965d8660a51403b53275662d423bb57255b4ff9e9c374fbb3bf6141e39f2"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/document/DocumentBrowser.vue: 3333 lines of code: apps/desktop/src/components/document/DocumentBrowser.vue has 3333 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":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"745bbae658be6a7e15a9679d3d8f2130b80612e4acba6290419bdea0668d8c40"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/sidebar/ConnectionTree.vue: 3285 lines of code: apps/desktop/src/components/sidebar/ConnectionTree.vue has 3285 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":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5912c00bc5f2098abd9b0d8cb0cfd94b3f3bc48411a271a563f0b5df8eb48a2b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataGridExport.ts: 3062 lines of code: apps/desktop/src/composables/useDataGridExport.ts has 3062 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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a61c51c055b5f603fa0fbf280c75d6351158efc1c166adf4c56bb2304fd914"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/types/database.ts: 2954 lines of code: apps/desktop/src/types/database.ts has 2954 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":"apps/desktop/src/types/database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ace031bf114d8f2bc531c6f6767788ff76113e955d391cc719228e9e96a5c79"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataGridEditor.ts: 2873 lines of code: apps/desktop/src/composables/useDataGridEditor.ts has 2873 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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4491c56d997d01e6580a0604dd16058b13a66e51046a9542d7196b6a913728e4"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/sqlStatementRanges.ts: 2809 lines of code: apps/desktop/src/lib/sql/sqlStatementRanges.ts has 2809 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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfad69841d82bb61479f0290ec16fe8c7f087d7f9a1a71175ae9cc20969b0da2"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/import/TableImportDialog.vue: 2693 lines of code: apps/desktop/src/components/import/TableImportDialog.vue has 2693 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":"apps/desktop/src/components/import/TableImportDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c2c1664bd9bc3e9644f9949e72a37de7bc32070a5e11bca86c1838c8692ebc"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/layout/EditorGroupTabBar.vue: 2497 lines of code: apps/desktop/src/components/layout/EditorGroupTabBar.vue has 2497 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":"apps/desktop/src/components/layout/EditorGroupTabBar.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02210e45a7e5b44fe049ad9ea6ae084b1e6009ba7a12ace90ee14e6908840dcc"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/mongo/mongoCompletion.ts: 2409 lines of code: apps/desktop/src/lib/mongo/mongoCompletion.ts has 2409 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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc83d504e072d968aea0b8397d92c44fbd2747711ff2938a3111abfca616b6a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue: 2314 lines of code: apps/desktop/src/components/plugins/PluginContributionsPanel.vue has 2314 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":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b30a718c932195a3ec2884bfe69a9e12f15d1cb4a01e20b4bb8b7387baae0da"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue: 2297 lines of code: apps/desktop/src/components/diagram/SchemaDiagramDialog.vue has 2297 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":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c13afb99dd1d9d237493f1267dc48868620910ec07b677f6e2a99e8e770b33"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/kv/KvKeyBrowser.vue: 2261 lines of code: apps/desktop/src/components/kv/KvKeyBrowser.vue has 2261 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":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34a4407c51be546b977a59ed3efad81cbc0643fad1d4ddfd011baa0de165172"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/config/DriverStoreDialog.vue: 2178 lines of code: apps/desktop/src/components/config/DriverStoreDialog.vue has 2178 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":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"824b70edb68c4c2b604520f0f1777e88bfe00c52c3da34483e6ef012e360418a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/stores/plDebugStore.ts: 2167 lines of code: apps/desktop/src/stores/plDebugStore.ts has 2167 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":"apps/desktop/src/stores/plDebugStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef84b8b31677897593cc4a01c5add122c5c36cd64af4f0498be13b84ead7d8e5"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/transfer/DataTransferDialog.vue: 2106 lines of code: apps/desktop/src/components/transfer/DataTransferDialog.vue has 2106 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":"apps/desktop/src/components/transfer/DataTransferDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7822cece504feb24c0824021b6fe6757530dc68c32a274a429c1ab2f92ad92b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/diff/SchemaDiffDialog.vue: 2060 lines of code: apps/desktop/src/components/diff/SchemaDiffDialog.vue has 2060 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":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c6d8338a0a64808c9646ec09c134bc844a2f778c46e8a64fedab13e8b9e428"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/dataGrid/dataGenerate.ts: 2059 lines of code: apps/desktop/src/lib/dataGrid/dataGenerate.ts has 2059 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":"apps/desktop/src/lib/dataGrid/dataGenerate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76ed85b539385c2208defefdfeb00faeedcbf8247db424a0311640629a57f43"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts: 1920 lines of code: apps/desktop/src/components/editor/useQueryEditorCompletion.ts has 1920 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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b411b6c82af49ed156102ea072bd82e0dd085c442bfa021a9ab3505c2db961"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/mongo/mongoShellCommand.ts: 1914 lines of code: apps/desktop/src/lib/mongo/mongoShellCommand.ts has 1914 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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"229b212c2c3abde756d7c41c1b34c597291b8ec597fddc27742bd9eceebc67e0"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/sqlParameters.ts: 1901 lines of code: apps/desktop/src/lib/sql/sqlParameters.ts has 1901 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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc7b4fa07860bae73007dd7817edcb7287fe87ba07a9eb02d548cec6e5c7ee8"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/dolt/DoltVersionControl.vue: 1897 lines of code: apps/desktop/src/components/dolt/DoltVersionControl.vue has 1897 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":"apps/desktop/src/components/dolt/DoltVersionControl.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8658626c88c30c813f9a8d095ff6ba95de9cd63359a15818a57b4d6d8e5c148"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/sidebar/TreeItem.vue: 1893 lines of code: apps/desktop/src/components/sidebar/TreeItem.vue has 1893 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":"apps/desktop/src/components/sidebar/TreeItem.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27580b3b963cf0b38ef58716778c1a308e1384b5330dc9f6cb9609d1515862d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/plugins/pluginHostBridge.ts: 1849 lines of code: apps/desktop/src/lib/plugins/pluginHostBridge.ts has 1849 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":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efb1e8be92688911a900c831f7c5b9007f19c4f78a817bc3e7fecdb0cc78cbc"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/table/tableStructureEditorState.ts: 1835 lines of code: apps/desktop/src/lib/table/tableStructureEditorState.ts has 1835 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":"apps/desktop/src/lib/table/tableStructureEditorState.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee582df5b8300ff63196a240eb12a2d5a3f02c3441155a2d6eea868acbadb84"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/layout/SqlLibraryPanel.vue: 1777 lines of code: apps/desktop/src/components/layout/SqlLibraryPanel.vue has 1777 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":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df60bf931223c466e96a4a7a332572919d7ab55fad4a7497773c782b3ea5eec"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/diff/DataCompareDialog.vue: 1713 lines of code: apps/desktop/src/components/diff/DataCompareDialog.vue has 1713 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":"apps/desktop/src/components/diff/DataCompareDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb6a59079c240b64a6bd92dd2bf6388f9eb190f60317d4144512a481432d9b6"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/layout/SqlFilePanel.vue: 1543 lines of code: apps/desktop/src/components/layout/SqlFilePanel.vue has 1543 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":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6242256d8b6507c22c0d9db1c23ce9706c533fe7ad0b3dcb371c6344b4a168"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue: 1448 lines of code: apps/desktop/src/components/admin/DatabaseUserAdmin.vue has 1448 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":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f958085a44d4f66b4da777f819e185ef1eed46b66c7bb21de0bdf3a9404824"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/export/DatabaseExportDialog.vue: 1436 lines of code: apps/desktop/src/components/export/DatabaseExportDialog.vue has 1436 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":"apps/desktop/src/components/export/DatabaseExportDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"031e9d9803434612f7f3bba873d514a966264a68ea8c8d85657e2ce6813ccc56"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/MonitoringPanel.vue: 1404 lines of code: apps/desktop/src/components/mq/MonitoringPanel.vue has 1404 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":"apps/desktop/src/components/mq/MonitoringPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09086f301c3f1ec781d55817a8cbef3ea92d88d96674e937d66572b74fcb01b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue: 1385 lines of code: apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue has 1385 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":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f0f11eba780ac2e05154f55f986756f9b009802cc4c610a6a61d534985cc6"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue: 1360 lines of code: apps/desktop/src/components/etcd/EtcdKeyBrowser.vue has 1360 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":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7ac636f6b7fe08bd626ffb67638419059e0a3819f59698f5894408ad77241a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/schema/schemaDiff.ts: 1339 lines of code: apps/desktop/src/lib/schema/schemaDiff.ts has 1339 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":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8030b964020a1bf37813f1881fad3503cbec95b3341d6c433812d39c0927f5c4"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue: 1306 lines of code: apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue has 1306 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":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fead5215ddc6cee573f6dca2df335aa69bbe8c74445592ef1b8c2bfd0fee8e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/solr/SolrAdmin.vue: 1304 lines of code: apps/desktop/src/components/solr/SolrAdmin.vue has 1304 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":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2a92bbad5f23062b46b1a22884c71319dc82cc4c229b91217dd16fe01967db"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/layout/EditorToolbar.vue: 1297 lines of code: apps/desktop/src/components/layout/EditorToolbar.vue has 1297 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":"apps/desktop/src/components/layout/EditorToolbar.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3e3f087d881f47e53379871f560694bc4cdcd1cc11673ba2664645b6f66832"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/TopicsPanel.vue: 1275 lines of code: apps/desktop/src/components/mq/TopicsPanel.vue has 1275 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":"apps/desktop/src/components/mq/TopicsPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6545999d55e7b8336e8d44c80256a570f70ef197dc1e4164d14f715ea513df8e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts: 1263 lines of code: apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts has 1263 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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf7f83656ffe5a415e1c567f9e03248096e46f5cf85a143d289ebeb1fa2072a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue: 1258 lines of code: apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue has 1258 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":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"630ee8dd7616d3691c19598db314c9bd6fc8fffb4e10d06153a6c3e1dde56896"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/backend/api.ts: 1247 lines of code: apps/desktop/src/lib/backend/api.ts has 1247 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":"apps/desktop/src/lib/backend/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"453a6621522ed5701c9b2a41168a13d24264f7b3102b42afa77b496eb00e89e0"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/editor/shortcutRegistry.ts: 1214 lines of code: apps/desktop/src/lib/editor/shortcutRegistry.ts has 1214 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":"apps/desktop/src/lib/editor/shortcutRegistry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1b345914cb107c6ffd78c4a17b7daf97f69c19ba618a0b4a5081c0f3ed1b8d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/editor/editorThemes.ts: 1200 lines of code: apps/desktop/src/lib/editor/editorThemes.ts has 1200 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":"apps/desktop/src/lib/editor/editorThemes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"939c75a57cb7b6c427c4cacad3be990523f8cbeca6b31311f712c5a65a538d1a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue: 1190 lines of code: apps/desktop/src/components/editor/MultiDbExecuteDialog.vue has 1190 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":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d10f8edac9a0fabf7dd4731e1fff68610fc16a0f9d14a27b0d6c266beb31f3"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/ai/ai.ts: 1177 lines of code: apps/desktop/src/lib/ai/ai.ts has 1177 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":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45a9e6638cc01ee15acc70930c3669d4044e65d6821e82e0a79a22a5ff635d3"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useSqlExecution.ts: 1173 lines of code: apps/desktop/src/composables/useSqlExecution.ts has 1173 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":"apps/desktop/src/composables/useSqlExecution.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8a422ff419534ac480913c0a6f26f66e7dad943a1b41472c2ebc1a6450c07c"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/SubscriptionsPanel.vue: 1165 lines of code: apps/desktop/src/components/mq/SubscriptionsPanel.vue has 1165 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":"apps/desktop/src/components/mq/SubscriptionsPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd4c033de02db82c8682feb3e47ffa6d8cb11e97c9638b0142d2bcf0a7bea43"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/generate/DataGenerateDialog.vue: 1161 lines of code: apps/desktop/src/components/generate/DataGenerateDialog.vue has 1161 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":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2096f34c9bfea68ae83304d233f1876de03e9cb3869e7c44278c2c0b8101afd3"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/stores/savedSqlStore.ts: 1140 lines of code: apps/desktop/src/stores/savedSqlStore.ts has 1140 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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a551d9dd9c5fb751e7ce43c080e3f699f2fffa0f250dd25b94935eb7662a8065"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/sqlFormatter.ts: 1108 lines of code: apps/desktop/src/lib/sql/sqlFormatter.ts has 1108 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":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81fcce16d2119986877dd59140f09477c2420e4a89633966f6c18f057f9f1e9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue: 1104 lines of code: apps/desktop/src/components/diff/SchemaDiffConfigStep.vue has 1104 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":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"195269b5939994cb13b9df3cb10f1091add76ba95d250f914ea6ec479cf637fb"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useQuickOpen.ts: 1091 lines of code: apps/desktop/src/composables/useQuickOpen.ts has 1091 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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be30d5d48cc1646f592a8326185a25891203dc98777cca154cc79f8c7b4ed4e8"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue: 1087 lines of code: apps/desktop/src/components/admin/DatabaseJobAdmin.vue has 1087 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":"apps/desktop/src/components/admin/DatabaseJobAdmin.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"178d23bfc011b81d154e23d8df866f463c2a1a5f38907e66e912edd1c0335a56"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/mongo/mongoCompletionTables.ts: 1080 lines of code: apps/desktop/src/lib/mongo/mongoCompletionTables.ts has 1080 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":"apps/desktop/src/lib/mongo/mongoCompletionTables.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac520d998e0e130c2ca4218099b8a13b71518ae5eb22440b0650d21909c2e0b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/table/tableTree.ts: 1077 lines of code: apps/desktop/src/lib/table/tableTree.ts has 1077 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":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d5a6ed78e8b7fb938b67515bcd7e16bd4d9fc6d8d327ba3a840d7ad92ebb9b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/mongo/mongoSql.ts: 1057 lines of code: apps/desktop/src/lib/mongo/mongoSql.ts has 1057 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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0557755d4e6effc7d19e19e282cfffa2e0ab7d9eda97c091f7e5eed5987f5df2"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useExportTracker.ts: 1052 lines of code: apps/desktop/src/composables/useExportTracker.ts has 1052 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":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9231535ffc43c296fba761d160cf795df7cf54ca72f0a615d5cc1677d3183d18"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/admin/ProcessListPanel.vue: 1045 lines of code: apps/desktop/src/components/admin/ProcessListPanel.vue has 1045 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":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a6df46c1e63d5e9df90f786c046ea1248359693009433bacd15059b27e08c6"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/semantic/model.ts: 1045 lines of code: apps/desktop/src/lib/sql/semantic/model.ts has 1045 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":"apps/desktop/src/lib/sql/semantic/model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06da9602001ef435cc739c11acb2df7a514ddf1457238aa6b3e368a805d16e1b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/sqlAnalysis.ts: 1042 lines of code: apps/desktop/src/lib/sql/sqlAnalysis.ts has 1042 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":"apps/desktop/src/lib/sql/sqlAnalysis.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c2f7d793e955c11f9fecc8fec6c188f026ed0a13725ce9b0e5e057ee226e59"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue: 1016 lines of code: apps/desktop/src/components/nacos/NacosRoleAccessControl.vue has 1016 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":"apps/desktop/src/components/nacos/NacosRoleAccessControl.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0539674b3a8525bf22f09ca1c107fa608b98db5d8d2110db38aec10248ecd2d9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/settings/settingsSearch.ts: 1011 lines of code: apps/desktop/src/lib/settings/settingsSearch.ts has 1011 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":"apps/desktop/src/lib/settings/settingsSearch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eef15b9523903b2d364a0ca58259a97e12ac73e5e5cc15672cfe707277d742"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/app/documentStoreProvider.ts: 1006 lines of code: apps/desktop/src/lib/app/documentStoreProvider.ts has 1006 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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b019363fdaa6412604d4351c935a145e8994d174cd8ad35809f7f272e3cd307a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataGridColumnLayout.ts: 993 lines of code: apps/desktop/src/composables/useDataGridColumnLayout.ts has 993 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":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c6869a61650f5dcdfaa2157ba4d1817200a694a623efe3f10969519324b74e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts: 965 lines of code: apps/desktop/src/composables/useSidebarTreeExportRuntime.ts has 965 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":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea19555bf0cc40b3b9183c2674255df5f8aee55bcd7c7ead5091d8a13d7a0e8"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue: 964 lines of code: apps/desktop/src/components/consul/ConsulKeyBrowser.vue has 964 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":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73227995971bc41c7561583b49edd02c28397fae34794d960f512903d9325fc2"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/consul/ConsulServices.vue: 951 lines of code: apps/desktop/src/components/consul/ConsulServices.vue has 951 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":"apps/desktop/src/components/consul/ConsulServices.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39336bacbb9f458296492b4b492e6adb77a0c05e126c2b327ae6f4b5f9a156e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/grid/DataGridConditionEditor.vue: 948 lines of code: apps/desktop/src/components/grid/DataGridConditionEditor.vue has 948 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":"apps/desktop/src/components/grid/DataGridConditionEditor.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3753691b2a9aacdf1b692342873b2040bb2c9bd2c00aa85f52b8b4b1bb078b2"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue: 943 lines of code: apps/desktop/src/components/plugins/PluginWorkbenchHost.vue has 943 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":"apps/desktop/src/components/plugins/PluginWorkbenchHost.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"587bdc87af77468b0e4d0c02bc4bb1e2910bd2fca7f0e945f83018cfcf4a0a42"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/layout/AppToolbar.vue: 939 lines of code: apps/desktop/src/components/layout/AppToolbar.vue has 939 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":"apps/desktop/src/components/layout/AppToolbar.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"421ec31c03afa475aca86d5486386ca2a315c6c3e768294184845745347e956e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/grid/DataGridFilterBuilder.vue: 936 lines of code: apps/desktop/src/components/grid/DataGridFilterBuilder.vue has 936 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":"apps/desktop/src/components/grid/DataGridFilterBuilder.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57349a49d011181eb5ba201f4a13c44b19d284b914d1f9ff288e92e8073926b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/diagram/explainPlan.ts: 929 lines of code: apps/desktop/src/lib/diagram/explainPlan.ts has 929 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":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1916d78c843aee560355aedf593f37d102be5a3e5946012ce78e79828bf5341f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/QueryHistory.vue: 927 lines of code: apps/desktop/src/components/editor/QueryHistory.vue has 927 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":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"040381da2005b70d2c1155428cf0fbe5a3074feca73ccbdb698f6697c1f06d9d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue: 925 lines of code: apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue has 925 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":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58770ff7ebd8417faffc56d9fa8d1be86561e1b43bb2eeceb0dc46ee3f12cd9d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue: 905 lines of code: apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue has 905 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":"apps/desktop/src/components/editor/CloudSyncSelectionDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"209838b0a6e75f9ec9d7b8d0ac76d3031a6624f0e28e7dd74f2235be89cb7dfa"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/etcd/EtcdAdminConsole.vue: 904 lines of code: apps/desktop/src/components/etcd/EtcdAdminConsole.vue has 904 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":"apps/desktop/src/components/etcd/EtcdAdminConsole.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6076b41fde27529db9a9bf210303c9c62f831d223c9f421473171a9702b02eb9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/databaseUserAdmin.ts: 904 lines of code: apps/desktop/src/lib/database/databaseUserAdmin.ts has 904 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":"apps/desktop/src/lib/database/databaseUserAdmin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3f68de42f0a75db0d6eb351ccf85f6ff281b200d00f27020fc559b5338447d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue: 896 lines of code: apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue has 896 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":"apps/desktop/src/components/editor/SqlFormatterSettingsPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6602df8b19f7219b9d7ee54b932d80603d7c3ecd1e8ee8aac01deb99eabb27"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/connection/connectionUrl.ts: 888 lines of code: apps/desktop/src/lib/connection/connectionUrl.ts has 888 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":"apps/desktop/src/lib/connection/connectionUrl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bee3b34c016a89e64ad37da8502fc896d6568a2a9c7f0082656718b284a6871"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/tabs/tabPresentation.ts: 883 lines of code: apps/desktop/src/lib/tabs/tabPresentation.ts has 883 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":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0fc9426e5938464643401367abc0f4db6c603ffe34a5dceccc6cb72aac38f9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/table/oracleTableRename.ts: 881 lines of code: apps/desktop/src/lib/table/oracleTableRename.ts has 881 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":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebff737283324eaa205708af8d71719427fc519a42d16b9433914c89d91c362"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataGridActions.ts: 872 lines of code: apps/desktop/src/composables/useDataGridActions.ts has 872 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":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cac4c840a15ee58392fd2be62772711db43f33260a16f062695192fbf9020e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/admin/XuguUserPermissions.vue: 862 lines of code: apps/desktop/src/components/admin/XuguUserPermissions.vue has 862 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":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"027302bb3b21b086f34928a84142d09ef2302defbf47652f0944eaa8cf77a515"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts: 860 lines of code: apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts has 860 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":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1528e4aa82630f5daaa7f8a5ed47177b677f1519d78e7b417e249fa030067ba3"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/tabs/tabResultCache.ts: 860 lines of code: apps/desktop/src/lib/tabs/tabResultCache.ts has 860 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":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f23c09cddf85863e8458aaeab9ea4097d1b21d67840c15963799ae618fc186"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/MqAdminConsole.vue: 856 lines of code: apps/desktop/src/components/mq/MqAdminConsole.vue has 856 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":"apps/desktop/src/components/mq/MqAdminConsole.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3d4933473ea06f4000d4993b3c7b4faef6546d53d7b0cf43a9f454abf583af"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/redis/redisValuePresentation.ts: 843 lines of code: apps/desktop/src/lib/redis/redisValuePresentation.ts has 843 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":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16dc319439c5ef058174a940232990ba9c0b239026d8acef66ea351f49d2530"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts: 838 lines of code: apps/desktop/src/lib/plugins/pluginFloatingWindow.ts has 838 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":"apps/desktop/src/lib/plugins/pluginFloatingWindow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e361f4cd3940fc67a01e64487385f2483f3ecbc34bf97213c6503cf650c480f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts: 837 lines of code: apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts has 837 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":"apps/desktop/src/lib/dataGrid/canvasDataGridRenderer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bab86a1a22d426564dc93aacb9917a1e37bf8b50c0feaa4bee10a0d064c52b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/ExchangesPanel.vue: 833 lines of code: apps/desktop/src/components/mq/ExchangesPanel.vue has 833 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/ExchangesPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"618d5d66e7a9137f94a550b8188538458fca34f99ab86b4642454ffd153cb103"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/ProducerConsumerPanel.vue: 832 lines of code: apps/desktop/src/components/mq/ProducerConsumerPanel.vue has 832 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":"apps/desktop/src/components/mq/ProducerConsumerPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75060c840d3074879ab7e8eaac6c431e035d0c60b1aa8943f1e0cc79fd57b430"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/table/tableVGroup.ts: 819 lines of code: apps/desktop/src/lib/table/tableVGroup.ts has 819 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":"apps/desktop/src/lib/table/tableVGroup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1907f5e68ce45aea4ccf59cf2bd581f60ff982d3edb2789306a87b49968d21f3"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue: 809 lines of code: apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue has 809 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":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbdef712b05c0436d51967d58b6c64623d07de8af698d21371a33ba8b5bb96b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/oracleConstraints.ts: 805 lines of code: apps/desktop/src/lib/database/oracleConstraints.ts has 805 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":"apps/desktop/src/lib/database/oracleConstraints.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce83dc0506e7158c2bc64d53503575250ef0897c972c2be1a76427c69ab47134"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/objects/DatabaseBrowser.vue: 797 lines of code: apps/desktop/src/components/objects/DatabaseBrowser.vue has 797 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":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb973ce3fa2b7c8af54c03e9af6c365ae587c2e84593d0dafc34f47f78d081e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataGridLargeValues.ts: 790 lines of code: apps/desktop/src/composables/useDataGridLargeValues.ts has 790 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":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06834b11d562d45a772cded0983b92d6b6f7ae36fc868aeb4a5df4a7cb8f5a89"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/insertValueHints.ts: 787 lines of code: apps/desktop/src/lib/sql/insertValueHints.ts has 787 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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce87389f9ecbdea402e5a33b43f9371231ef43387bf23909aaa4d18bb587b448"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/oracleForeignKeys.ts: 783 lines of code: apps/desktop/src/lib/database/oracleForeignKeys.ts has 783 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":"apps/desktop/src/lib/database/oracleForeignKeys.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec49bce316670f7baa66a60a44d4e4dadc1542481df9f2c287cc4afd332134d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/settings/settingsTransfer.ts: 755 lines of code: apps/desktop/src/lib/settings/settingsTransfer.ts has 755 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":"apps/desktop/src/lib/settings/settingsTransfer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1596095a39ca2c6b44f3924dee18926465d2b2bb98ce0aba9d24cd758e701e18"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/table/oracleTypeManagement.ts: 752 lines of code: apps/desktop/src/lib/table/oracleTypeManagement.ts has 752 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":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63a10d895178768ffb0e641629815f0f7aed41efb04ea6693ee030b4c235281"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/sqlIdentifier.ts: 749 lines of code: apps/desktop/src/lib/sql/sqlIdentifier.ts has 749 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":"apps/desktop/src/lib/sql/sqlIdentifier.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa51c3a1542052de68e9c832897d1b916a7d700da3492446d3ea8ea63a2f1cc6"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/editor/hoverTableSql.ts: 746 lines of code: apps/desktop/src/lib/editor/hoverTableSql.ts has 746 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":"apps/desktop/src/lib/editor/hoverTableSql.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fa20dc0b955111947825021c2e9a05f32afc2e61ce1cb5b7301b4836b113ed"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/grid/LayerPreviewDialog.vue: 745 lines of code: apps/desktop/src/components/grid/LayerPreviewDialog.vue has 745 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":"apps/desktop/src/components/grid/LayerPreviewDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75ad4c53d8cdf6e6cc4d02a6e7597e6b669f53b02ff0aab4a89d163f6113bc9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/admin/DamengUserAdmin.vue: 741 lines of code: apps/desktop/src/components/admin/DamengUserAdmin.vue has 741 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":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80391ed6e17f38529bcc8e3ff6e5c46cf4061e0c8a6bc65391ff5bebbff4f44f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/nacos/NacosAccessControl.vue: 740 lines of code: apps/desktop/src/components/nacos/NacosAccessControl.vue has 740 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":"apps/desktop/src/components/nacos/NacosAccessControl.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"841e678e08fa20e321383f2020b87d8bdb2694a75174414016bbcb0c1f8634c9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/PermissionsPanel.vue: 736 lines of code: apps/desktop/src/components/mq/PermissionsPanel.vue has 736 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":"apps/desktop/src/components/mq/PermissionsPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24de6193ae8681a3fc757fda54d48c28c29ef7c221deb46e26b3a87ffe779ee4"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/settings/McpCapabilityBrowser.vue: 736 lines of code: apps/desktop/src/components/settings/McpCapabilityBrowser.vue has 736 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":"apps/desktop/src/components/settings/McpCapabilityBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"348db914cb68819a6b8299149de765458e28e4fec3e68fe95a2c896d844ee67e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/document/MongoBucketBrowser.vue: 735 lines of code: apps/desktop/src/components/document/MongoBucketBrowser.vue has 735 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":"apps/desktop/src/components/document/MongoBucketBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a84396de47c3bd7e9bf1da18b7c6213ee8000d510ab495aa05a84c258b0fae"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins/sdk/dev-host/server.mjs: 733 lines of code: plugins/sdk/dev-host/server.mjs has 733 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":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df3a061a63197d8cbdb56cd9d5b60838d48fdd7b530c78343a1c0bab6d35918"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/etcd/EtcdAccessControl.vue: 728 lines of code: apps/desktop/src/components/etcd/EtcdAccessControl.vue has 728 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":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bc970b50943bec6139ef3787da3c26f42e5a8249bc5cd5448411ca7e73c62f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataGridSelection.ts: 727 lines of code: apps/desktop/src/composables/useDataGridSelection.ts has 727 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":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eeaee0d9d0460b0ee575bb2bf872faec1713cfdd083be2df1447448ca33136f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue: 726 lines of code: apps/desktop/src/components/mqtt/MqttAdminConsole.vue has 726 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":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c614fe3c94e20c512405725c19cd616e049c24775a3ae6fc9bc65d8236950a4e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/MessageQueryPanel.vue: 722 lines of code: apps/desktop/src/components/mq/MessageQueryPanel.vue has 722 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":"apps/desktop/src/components/mq/MessageQueryPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6283cb1954818904800773eb8cdcfe479ba13e54db5b74be4d657f2dbcb3ca"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/editor/sqlIntentionActions.ts: 718 lines of code: apps/desktop/src/lib/editor/sqlIntentionActions.ts has 718 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":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"773cbec72d724ae00c0061da4c709bc9ce47dc6a93ced438138ac6832038ebcd"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/oracleTriggerPlan.ts: 716 lines of code: apps/desktop/src/lib/database/oracleTriggerPlan.ts has 716 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":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af341c0c65828fd76bd6e38159791683a9d5425e1d54006185ba2b5975949a43"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/dataGrid/columnFormatter.ts: 707 lines of code: apps/desktop/src/lib/dataGrid/columnFormatter.ts has 707 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":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8974d7e7d2ab4248c6e2f3ed660730e5de9c6a58d5a7b68bbfcd044b470a238c"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/nacos/nacosAdmin.ts: 706 lines of code: apps/desktop/src/lib/nacos/nacosAdmin.ts has 706 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":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3bab434cf0d9ff2f0c2aeaf32388c5b2d219fd5968a0f71be96b96f03ba992"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mongo-shell/src/json.ts: 690 lines of code: packages/mongo-shell/src/json.ts has 690 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mongo-shell/src/json.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"583e98907259e1a67fee495de63ef93a140ed0018f92184ab80e8844a0e2ffb4"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDialogSources.ts: 688 lines of code: apps/desktop/src/composables/useDialogSources.ts has 688 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":"apps/desktop/src/composables/useDialogSources.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22bc0c8d1a1aabe068a36299a98e03a1d48f47b9708c8d1edf16a98cb36b262"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts: 688 lines of code: apps/desktop/src/lib/database/databaseAuthorizationPlan.ts has 688 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":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01834e306e7d8f3942bc36cb9aa356f8b004543ad4ec9ac0c7dc2fab7afec046"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts: 688 lines of code: apps/desktop/src/lib/schema/oracleRoutineDeploy.ts has 688 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":"apps/desktop/src/lib/schema/oracleRoutineDeploy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e02a049a4777c4cacaa97ede63766a810821bfe6d53c46b9fb520bd4bc3420"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useAppUpdater.ts: 684 lines of code: apps/desktop/src/composables/useAppUpdater.ts has 684 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fe4f0c71f4c98b286a7e74fcefc301200f09ae76888380a7c6d3e94272f9fd"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/sqlNavigation.ts: 678 lines of code: apps/desktop/src/lib/sql/sqlNavigation.ts has 678 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":"apps/desktop/src/lib/sql/sqlNavigation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fcbaf486494c5dfddcdab05c457bf43c9e9c25dc21a12ce1969bb7c1d714ab"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts: 675 lines of code: apps/desktop/src/lib/mongo/mongoDocumentValues.ts has 675 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":"apps/desktop/src/lib/mongo/mongoDocumentValues.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf32d920594dda3144da01e6b3899ef66a344812f1836610b1df70d0166efa6e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/EditorSearchPanel.vue: 673 lines of code: apps/desktop/src/components/editor/EditorSearchPanel.vue has 673 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":"apps/desktop/src/components/editor/EditorSearchPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ee7a9fca2ca9a212554b8d88d7006f799680d53741a93fe54c45374019641f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue: 673 lines of code: apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue has 673 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":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPermissionsPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2762a219c23a41001475d610d34c4510c65c2376123c3ff89c1ffa18ac9bd0"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/transfer/TransferTaskTree.vue: 663 lines of code: apps/desktop/src/components/transfer/TransferTaskTree.vue has 663 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":"apps/desktop/src/components/transfer/TransferTaskTree.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38c436ede2964f1174603f3557233b91e2d374ce3923e524dc3cac5199f0543"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataGridConditionEditor.ts: 662 lines of code: apps/desktop/src/composables/useDataGridConditionEditor.ts has 662 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":"apps/desktop/src/composables/useDataGridConditionEditor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06131753e37dc61bcbe2a4f52b701ea93a452ac25c7df6ef16223df691026b54"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts: 661 lines of code: apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts has 661 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6efe193c19a3c1a4b6f501a8c8052913101444e1c908417a519631e2c14f02"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/layout/printer.ts: 658 lines of code: apps/desktop/src/lib/sql/layout/printer.ts has 658 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":"apps/desktop/src/lib/sql/layout/printer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e357ddcfdab4672cd564dd7ec5c7b3863896c474af92bbd0c9f1919137b8078"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/diagram/DiagramInspector.vue: 657 lines of code: apps/desktop/src/components/diagram/DiagramInspector.vue has 657 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":"apps/desktop/src/components/diagram/DiagramInspector.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe469241a2ed4b02d596fa3b3bd274bcb26b2ec4239fd8f86c1a6886fb3fc89"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/common/safeJsonFormat.ts: 651 lines of code: apps/desktop/src/lib/common/safeJsonFormat.ts has 651 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":"apps/desktop/src/lib/common/safeJsonFormat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fe56da39813cae4a55778046696236666f974b17bda9c1a05eb1e09591e923"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/editor/queryEditorNativeSelection.ts: 648 lines of code: apps/desktop/src/lib/editor/queryEditorNativeSelection.ts has 648 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":"apps/desktop/src/lib/editor/queryEditorNativeSelection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a8f88fb912c5b677de453b49ce2839fd8e6c04677c808c65e6fa62e1c25eac"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/consul/ConsulHealth.vue: 646 lines of code: apps/desktop/src/components/consul/ConsulHealth.vue has 646 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":"apps/desktop/src/components/consul/ConsulHealth.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed9f10533baa86bc7c4d8f8944c657ce0d79d6d2c49dd41d87dfc01063cc367"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sidebar/sidebarLayout.ts: 646 lines of code: apps/desktop/src/lib/sidebar/sidebarLayout.ts has 646 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":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a26e9e768bc737e974a99aea27edfc8a733064f734ea896e58c68ff652ef459"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/table/oracleRoutineRename.ts: 646 lines of code: apps/desktop/src/lib/table/oracleRoutineRename.ts has 646 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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d64e89cba79cd282d47a5424cf03e7a7518ebf80247eaa974e14160e16e5596"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/diff/SchemaDiffDeployStep.vue: 645 lines of code: apps/desktop/src/components/diff/SchemaDiffDeployStep.vue has 645 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":"apps/desktop/src/components/diff/SchemaDiffDeployStep.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a3f8fc958749737b38845402eb3f09ba9aa57edf6f7e6937845c4a92ab17d6"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/TenantsPanel.vue: 644 lines of code: apps/desktop/src/components/mq/TenantsPanel.vue has 644 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":"apps/desktop/src/components/mq/TenantsPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fab74e797a8059af08e37a321bdaa17959543b9344bf2db923831243112596"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts: 643 lines of code: apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.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":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df1e58d255c66ed393e7256cec4402d39d5c9b4ffcbc6b6d6a8c6712e8e64fa"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/search/DatabaseSearchPanel.vue: 639 lines of code: apps/desktop/src/components/search/DatabaseSearchPanel.vue has 639 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":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84764c66c19d9a0fee0aca82f390cd6ae7c7d0bf5fd76b38a1ae4feca2fcd7df"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/plugins/PluginBottomDock.vue: 634 lines of code: apps/desktop/src/components/plugins/PluginBottomDock.vue has 634 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":"apps/desktop/src/components/plugins/PluginBottomDock.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f092541f803f1a125607bac48fa1d4dd7cfb850484a73f4c72a983ca1dba36c8"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/xuguUserPermissions.ts: 633 lines of code: apps/desktop/src/lib/database/xuguUserPermissions.ts has 633 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":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c46b8ab43c96271e6d96f073a676bcbe80b167815b2bccbd98544de32751e81"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/objects/DdlViewDialog.vue: 628 lines of code: apps/desktop/src/components/objects/DdlViewDialog.vue has 628 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":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01ef39337bebf202d94157053a0efc959024ffe5144b2ab46c9595663e34020"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue: 625 lines of code: apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue has 625 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":"apps/desktop/src/components/mq/rocketmq/RocketMqTopicDialogs.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0555dc4e9ceeb69982a9087a8548edf883ceb95a3233427545f4b7c182eec6f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataGridExtractor.ts: 625 lines of code: apps/desktop/src/composables/useDataGridExtractor.ts has 625 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":"apps/desktop/src/composables/useDataGridExtractor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b4a34998f069e148548c092209e6825b8ba6e68c5fcbf8dfec7d96c611fe5e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/imports/datagripImport.ts: 617 lines of code: apps/desktop/src/lib/imports/datagripImport.ts has 617 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":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6b8bcc04f3f2f1d30e76b65dfbe86b768c70ad88320895f9c003902bef630d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts: 615 lines of code: apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts has 615 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":"apps/desktop/src/components/editor/useQueryEditorBatchSelection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69463e1b97ad9d344b436bb5f8cd3db5640d75ff1e0fe2baa83d1c34587f1515"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/semantic/diagnostics.ts: 613 lines of code: apps/desktop/src/lib/sql/semantic/diagnostics.ts has 613 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":"apps/desktop/src/lib/sql/semantic/diagnostics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300358136f730b8f8d7ea71a66b241efd43eb2b01c8f78e382dd074106b556da"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/consul/ConsulSessions.vue: 609 lines of code: apps/desktop/src/components/consul/ConsulSessions.vue has 609 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":"apps/desktop/src/components/consul/ConsulSessions.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"480863a2cdef287b40d549d2b341943a95629cf98aab0239f94be37b5e6a192a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/SendMessagePanel.vue: 607 lines of code: apps/desktop/src/components/mq/SendMessagePanel.vue has 607 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":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74fac1476eb1d52347e25457daa43f8c5039d18a2142c33a1c9761e1c917fcf"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts: 601 lines of code: apps/desktop/src/components/editor/queryEditorSqlExtensions.ts has 601 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":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2a56aebb394c752a8168af215adbc1076839bd6ac753d20d50118ed3817e1c"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/layout/UpdateDialog.vue: 601 lines of code: apps/desktop/src/components/layout/UpdateDialog.vue has 601 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":"apps/desktop/src/components/layout/UpdateDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9e834f266ddc9aab0226c3312a7e62dd337efe57b6d31c3976e9e74a271afb"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts: 599 lines of code: apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts has 599 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":"apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8421894aa408c43ffe5388176268492fd8200bab44adfe1b670790e4a8dd8feb"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/objects/ObjectSourceDialog.vue: 597 lines of code: apps/desktop/src/components/objects/ObjectSourceDialog.vue has 597 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":"apps/desktop/src/components/objects/ObjectSourceDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8751463dd2b1bcd34072c63151a59ec4aff41c32769044579d3906dd40c5148c"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/redis/codec/pickle.ts: 591 lines of code: apps/desktop/src/lib/redis/codec/pickle.ts has 591 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":"apps/desktop/src/lib/redis/codec/pickle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9270c1661d3a9995be155f805e4166bcc048c6c4e591aa42bacaff54af5180f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/layout/primitives.ts: 591 lines of code: apps/desktop/src/lib/sql/layout/primitives.ts has 591 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":"apps/desktop/src/lib/sql/layout/primitives.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ead453ca0cd1c77b054dd5b147fca9cc826bae30f5514fdb53813a81787257a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/MessageBrowser.vue: 578 lines of code: apps/desktop/src/components/mq/MessageBrowser.vue has 578 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":"apps/desktop/src/components/mq/MessageBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9632e6854f900256db890c785ffa47474ea60a3ac059895cb07b38c9baafd6f2"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/table/routineParameters.ts: 575 lines of code: apps/desktop/src/lib/table/routineParameters.ts has 575 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":"apps/desktop/src/lib/table/routineParameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92359c94b46c08b9ec44f08418af3351994c4d3d28fc88077dc0cce58df4cff8"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue: 574 lines of code: apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue has 574 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":"apps/desktop/src/components/diff/SchemaDiffDdlPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5637b9c1d2faf91c0bc0de5fbaad9931e78ae6d46ba6d8a187df55bafd135583"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts: 574 lines of code: apps/desktop/src/lib/connection/connectionUrlBuilder.ts has 574 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":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae56f09c04cf817c5658efefdad3ef4f7a2cd819577ffc4cd05fb009245f515"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataGridColumnFormatter.ts: 573 lines of code: apps/desktop/src/composables/useDataGridColumnFormatter.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":"apps/desktop/src/composables/useDataGridColumnFormatter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31b127f41e20ae1352724db342b04dbf82d129f8cab5dc0746e63f7841b51ed"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue: 570 lines of code: apps/desktop/src/components/transfer/QueryResultTransferDialog.vue 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":"apps/desktop/src/components/transfer/QueryResultTransferDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d86c2ba4d4a564c946a2cf0a3b56c89756979b4cc589fd8ca8a518bf6b87a4"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/etcd/EtcdDashboard.vue: 569 lines of code: apps/desktop/src/components/etcd/EtcdDashboard.vue has 569 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":"apps/desktop/src/components/etcd/EtcdDashboard.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6989e8908ac882a97953e9b6acb48843cf5343e034b4d3a947eea36cbfc18aaa"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/admin/NativeJobDefinitionEditor.vue: 567 lines of code: apps/desktop/src/components/admin/NativeJobDefinitionEditor.vue has 567 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":"apps/desktop/src/components/admin/NativeJobDefinitionEditor.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb8d3609646de24cceb11ede1742ad668f0399a8cb370a0cccdb281b7eb125f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts: 565 lines of code: apps/desktop/src/lib/sidebar/sidebarSearchTree.ts has 565 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":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c8cd50e81651fc71b9c47aaf1e24567b7ac120899bbcade0e3ed2a6fed5a7a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue: 562 lines of code: apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue has 562 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosContentReplaceDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cfe5f3d032c914ca70585f83fb5bf04aaa95427537cb683a4a1afa07cc69c3"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/dolt/doltVersionControl.ts: 560 lines of code: apps/desktop/src/lib/dolt/doltVersionControl.ts has 560 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dolt/doltVersionControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8bdea12acf18542d8ea5c20bb9413f0a5fe0169505dbd7ab9079a980bc0ecb"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/redis/redisCommandPreview.ts: 551 lines of code: apps/desktop/src/lib/redis/redisCommandPreview.ts has 551 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":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1f4f88f24e5b12b5aa29f81747d766a70fd07190d6032e6c9f4a3805ae806b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useSidebarTableMutationRuntime.ts: 549 lines of code: apps/desktop/src/composables/useSidebarTableMutationRuntime.ts has 549 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":"apps/desktop/src/composables/useSidebarTableMutationRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ebacdee9448db8319c20ca85d1508df3070c5289c420fddefe37bd3b876dec"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue: 547 lines of code: apps/desktop/src/components/editor/ThemeCustomizerDialog.vue has 547 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":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4f8d88728fd46f518ab47dc669c21fed216967226557f030913df2839e9f03"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue: 541 lines of code: apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue has 541 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":"apps/desktop/src/components/mq/rocketmq/RocketMqConsumerGroupDialogs.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9da38727eacbd5be9e60864381281374db6d5ba1834b68796fd87c5beee3958"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins/sdk/dev-host/ui/App.vue: 541 lines of code: plugins/sdk/dev-host/ui/App.vue has 541 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":"plugins/sdk/dev-host/ui/App.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3a104bd4df2e62589bb856c8eeab47e13c9e50a95691254504a4af6b7c11d7"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useSidebarDataOpenRuntime.ts: 535 lines of code: apps/desktop/src/composables/useSidebarDataOpenRuntime.ts has 535 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":"apps/desktop/src/composables/useSidebarDataOpenRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4ee369a72db379572fb6c4788953b565c4581bde679cd438a3bcd00e4300bb"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/ddlDisplay.ts: 528 lines of code: apps/desktop/src/lib/sql/ddlDisplay.ts has 528 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":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"492f3797a6e1a9259825d48beea9ca17f30627932c6d97cfa098d392c03c1101"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue: 527 lines of code: apps/desktop/src/components/mqtt/MqttPublishDialog.vue has 527 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":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa11ebd8f725d34dba36d8dc14123079cd970e8aded1be31cf816220766ee44"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/hbase/HBaseBrowser.vue: 526 lines of code: apps/desktop/src/components/hbase/HBaseBrowser.vue has 526 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":"apps/desktop/src/components/hbase/HBaseBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"835a5d7447ade9f311e59aa67fd7ac279c83320ec06f38a1acba2ea0a664ea17"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue: 525 lines of code: apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue has 525 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":"apps/desktop/src/components/mq/rabbitmq/RabbitMqPoliciesPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca912d7abde657fc219967cde9322273885177f6ad4639cc55e4dc282b3f4af"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/grid/DataGridExtractorDialog.vue: 523 lines of code: apps/desktop/src/components/grid/DataGridExtractorDialog.vue has 523 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":"apps/desktop/src/components/grid/DataGridExtractorDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"291a4290f74fbbf6594f2048d522fbd5a8eba2e0a37a1b7dae9ea269b7656bac"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/redis/redisKeyTree.ts: 523 lines of code: apps/desktop/src/lib/redis/redisKeyTree.ts has 523 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":"apps/desktop/src/lib/redis/redisKeyTree.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a65d0934d70080066ce2ccd25079af867bf60fd95e793b128496d81f8d6d74"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/ui/CustomContextMenu.vue: 519 lines of code: apps/desktop/src/components/ui/CustomContextMenu.vue has 519 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":"apps/desktop/src/components/ui/CustomContextMenu.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ac56012d4ce977e24c2e99ad66d1b7374b7a4404e4d1c932ac3b0bdd9afec3"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/damengPrincipalAdmin.ts: 519 lines of code: apps/desktop/src/lib/database/damengPrincipalAdmin.ts has 519 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":"apps/desktop/src/lib/database/damengPrincipalAdmin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d5df278eed64c34a0b31bc648c1124117e5cacaf90c354fe154b09cfd39721"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/admin/XuguServerDashboard.vue: 515 lines of code: apps/desktop/src/components/admin/XuguServerDashboard.vue has 515 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":"apps/desktop/src/components/admin/XuguServerDashboard.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11e3e6d297cbdd0bdcfca4d0cbb497e51d9b8a9fdc8a5fbf03b065d98d94456"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/vector/VectorBrowser.vue: 514 lines of code: apps/desktop/src/components/vector/VectorBrowser.vue has 514 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":"apps/desktop/src/components/vector/VectorBrowser.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b317d5a8debe5084b11e8f5207b133b9a19d7db9b93ab202ae75a05ed2c7867e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/editor/keyboardShortcuts.ts: 513 lines of code: apps/desktop/src/lib/editor/keyboardShortcuts.ts has 513 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":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e67386dbe1b74a11b3004f44ebcd2c1b5813c754126318a0ff008a4c8dd514"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/solr/solrAdmin.ts: 513 lines of code: apps/desktop/src/lib/solr/solrAdmin.ts has 513 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":"apps/desktop/src/lib/solr/solrAdmin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28698b6a045358cba2461d6aa47afdcbb452a254b6d76ea888fd2431ce9bc452"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/redis/redisCommandTable.ts: 506 lines of code: apps/desktop/src/lib/redis/redisCommandTable.ts has 506 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandTable.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb5ed23a61b6136b18f2fde732a75b378885e164937f2263c58e71cecc761c6"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts: 503 lines of code: apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts has 503 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":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb7e5453911848ef739259cc91a4277ae7c492480a4b56b4baafbbbfd9501ee"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/admin/DamengRoleAdmin.vue: 498 lines of code: apps/desktop/src/components/admin/DamengRoleAdmin.vue has 498 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengRoleAdmin.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a6a847e71d99106df79750a4c3644e805f20c8cd922ceccf9fc6c5ea1acc2a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/export/ExportProgressPopover.vue: 498 lines of code: apps/desktop/src/components/export/ExportProgressPopover.vue has 498 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/export/ExportProgressPopover.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7993efbefbac0d268cc6fea9e1a0adec33b0ad2960f76f9d98fb694a91ac072"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/soql/soqlCompletion.ts: 498 lines of code: apps/desktop/src/lib/soql/soqlCompletion.ts has 498 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/soql/soqlCompletion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e2abf186baf46fe83796d97a37f2c76b0f36f54f3e76e3b86d44d8dde7c09b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useNavigationTargets.ts: 497 lines of code: apps/desktop/src/composables/useNavigationTargets.ts has 497 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":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a36381e14c60fff439a29df27ce10efe28c100f90891fb7279b669d58e9f70"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts: 495 lines of code: apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts has 495 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":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa9d3d7d28443b48231b57f7d33664c2cac20bfc11e0934258a041b8c589a46"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/quick-open/QuickOpenDialog.vue: 493 lines of code: apps/desktop/src/components/quick-open/QuickOpenDialog.vue has 493 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/quick-open/QuickOpenDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37224253671cb40992382decd70ed04a9c7e4beae46e48bc5d931c98f138fbed"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/ui/searchable-select/SearchableSelect.vue: 488 lines of code: apps/desktop/src/components/ui/searchable-select/SearchableSelect.vue has 488 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":"apps/desktop/src/components/ui/searchable-select/SearchableSelect.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc2573320114b58c285da29a7a8a8913bea0edb4597c0b61fec815ad3d6fb2c"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/redis/codec/javaSerialized.ts: 488 lines of code: apps/desktop/src/lib/redis/codec/javaSerialized.ts has 488 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":"apps/desktop/src/lib/redis/codec/javaSerialized.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c4c1c5e346180221478743ecf0db9d2301a600f8ffb578584b96bfbeea7a90"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/redis/RedisDashboard.vue: 483 lines of code: apps/desktop/src/components/redis/RedisDashboard.vue has 483 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":"apps/desktop/src/components/redis/RedisDashboard.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0537874566f3a95c41713039f562738aa7b0d55243fae4a5f60cdd35562d394"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/document/MongoImportDialog.vue: 482 lines of code: apps/desktop/src/components/document/MongoImportDialog.vue has 482 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":"apps/desktop/src/components/document/MongoImportDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29d838d7710b5fa4c20bbf4df39ab33d2d616c2c641e454b6a993e8db7e9fd3"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/cypherFormatter.ts: 479 lines of code: apps/desktop/src/lib/sql/cypherFormatter.ts has 479 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":"apps/desktop/src/lib/sql/cypherFormatter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcac83cf8447d48a7fbb0eefd75f50f1158aeee24c26d42a737b56696d0fe08d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/connection/TunnelProfileManager.vue: 478 lines of code: apps/desktop/src/components/connection/TunnelProfileManager.vue has 478 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":"apps/desktop/src/components/connection/TunnelProfileManager.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad5b638de01ce393e07848cc1e494d7d295109469e8fbf5b4338c1a7f83f4d9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/RawApiPanel.vue: 478 lines of code: apps/desktop/src/components/mq/RawApiPanel.vue has 478 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":"apps/desktop/src/components/mq/RawApiPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"208375525c370c4344a751d80d413f55cc97ba2e7fce22edcdda76489fb76867"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/dataGrid/binaryCellDownload.ts: 472 lines of code: apps/desktop/src/lib/dataGrid/binaryCellDownload.ts has 472 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/binaryCellDownload.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b308736bd5159cabe07bf71c46f2d1908c440e3a2743f0b64fde2391feeba2f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/table/objectBrowserRows.ts: 470 lines of code: apps/desktop/src/lib/table/objectBrowserRows.ts has 470 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":"apps/desktop/src/lib/table/objectBrowserRows.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74014b70eff54477fb375c320d8dced64953790c48f83891ca33a0c3aa22bee"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue: 468 lines of code: apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue has 468 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":"apps/desktop/src/components/meilisearch/MeilisearchKeysPage.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaa30e9bb7ee02799e06d07ef96205fcd797415ff5adc35ff9de90ad549897e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/redis/redisCompletion.ts: 468 lines of code: apps/desktop/src/lib/redis/redisCompletion.ts has 468 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":"apps/desktop/src/lib/redis/redisCompletion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"962e4c60cb1a75f0f68f010c4f5efcc56bf192dd6568ee55a7f3d9bbc050e2a3"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue: 466 lines of code: apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue has 466 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":"apps/desktop/src/components/backup/DatabaseBackupConfigFields.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e629281e5cfe4233bb0af68d7d85224cd39357ad49c5ebce2e5098fd952e4a9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/diff/DiffHunkBuilder.ts: 464 lines of code: apps/desktop/src/components/diff/DiffHunkBuilder.ts has 464 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":"apps/desktop/src/components/diff/DiffHunkBuilder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa854ebdb4a2f09806a2bd5c939cbd79f4be65e1eac9f3a5dc2a2af022d4b521"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/dbAdminSql.ts: 462 lines of code: apps/desktop/src/lib/database/dbAdminSql.ts has 462 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":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a49ab314a52eaed6c18121ab0a51758e0c94f245b261221915630c6f813eeb9"}},{"ruleId":"R3","level":"warning","message":{"text":"deploy/plugin-stats-worker/worker.ts: 461 lines of code: deploy/plugin-stats-worker/worker.ts has 461 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":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69651b9de2552ea5e411d7239a42fd3c42f0b0ec2bc7fda3bd9ab1343f3650d4"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/connection/connectionDeepLink.ts: 460 lines of code: apps/desktop/src/lib/connection/connectionDeepLink.ts has 460 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":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50225955010ce304eff9ceb35d4fd27a464d3a7c3bef96f5e474c174a47283b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sql/sqlRisk.ts: 460 lines of code: apps/desktop/src/lib/sql/sqlRisk.ts has 460 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":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"762adad81ce31c6d96f6aaccad4ad4b17ebd4f4db8e143004219b6ac529dd1b0"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts: 458 lines of code: apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts has 458 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":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7925203a941076d6a4edbf5e7ac852008707052f8ba50fee7562c5f027b13bb6"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts: 457 lines of code: apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts has 457 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9176a0ee57e0e237bca9956c4efe97d8d7523adba7e1c722b26bb74da343216"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/PoliciesPanel.vue: 455 lines of code: apps/desktop/src/components/mq/PoliciesPanel.vue has 455 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":"apps/desktop/src/components/mq/PoliciesPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e63f758f3f4872517e3d0e22cef84b7d762cfc08deaeee6da203438b4513e5"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/nativeJobAdmin.ts: 453 lines of code: apps/desktop/src/lib/database/nativeJobAdmin.ts has 453 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":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0407c53cb0a2bf66b20e8b3d94654ec3ba860af19b2bbf5f49f2ab62f26a431d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts: 452 lines of code: apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts has 452 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":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9deebf29105a6bd16ff34a5c6012af6593839a0a8f05310efe560e6c82232e8f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/table/tableSelectSql.ts: 451 lines of code: apps/desktop/src/lib/table/tableSelectSql.ts has 451 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":"apps/desktop/src/lib/table/tableSelectSql.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b5aecdfd088c6a49d5947133097df41976bfb5255b67eef7e4290599f6b7ea"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/QueryEditorContextMenu.vue: 449 lines of code: apps/desktop/src/components/editor/QueryEditorContextMenu.vue has 449 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":"apps/desktop/src/components/editor/QueryEditorContextMenu.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"257b68a46869bbe5287eb97e37cfb64b3d9375aa63d0b97a63be70f49cb58a92"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/nativeJobs.ts: 448 lines of code: apps/desktop/src/lib/database/nativeJobs.ts has 448 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fea16212b503197f30b0549f53766a6086f7417dc604f2ea4a7d5ae4c94d383"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/debug/VariablesPanel.vue: 447 lines of code: apps/desktop/src/components/debug/VariablesPanel.vue has 447 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":"apps/desktop/src/components/debug/VariablesPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83df7f03b06018e1f9d02165580d331ac2fd987c75927886d90075907c89e6e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/transfer/queryResultTransferValues.ts: 446 lines of code: apps/desktop/src/components/transfer/queryResultTransferValues.ts has 446 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba47043e7e8278ceb3d3a43030928dd39b32f7a44a0f62007ae4bbf98e684af"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/stores/transferTaskStore.ts: 445 lines of code: apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/stores/transferTaskStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b30e9886d053b75cee3e91664eec42a45e27188405abfdeed5dae301754c69e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataCompareSession.ts: 443 lines of code: apps/desktop/src/composables/useDataCompareSession.ts has 443 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":"apps/desktop/src/composables/useDataCompareSession.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05238c708ff3c51e177280cac638ef06cec2f754d24e874c903df333d329ecee"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/layout/SqlEditorWorkspace.vue: 442 lines of code: apps/desktop/src/components/layout/SqlEditorWorkspace.vue has 442 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":"apps/desktop/src/components/layout/SqlEditorWorkspace.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"966770ba037e265fccd43fd118a98d022e5a83faab167fb945268d96ce98507b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/queryEditorCodeMirrorRuntime.ts: 441 lines of code: apps/desktop/src/components/editor/queryEditorCodeMirrorRuntime.ts has 441 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":"apps/desktop/src/components/editor/queryEditorCodeMirrorRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"242bd16f943044e4117db1c59cce58c2bbc872270d7bda8b123c3777e8bc9434"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/objects/CustomTypeInfoPanel.vue: 441 lines of code: apps/desktop/src/components/objects/CustomTypeInfoPanel.vue has 441 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":"apps/desktop/src/components/objects/CustomTypeInfoPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"209b3bf757e1f45fc11815db9fe462f49847a571d7948c868b5609c47e6e8ec7"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/shared/RocketMqTopicSelect.vue: 440 lines of code: apps/desktop/src/components/mq/shared/RocketMqTopicSelect.vue has 440 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":"apps/desktop/src/components/mq/shared/RocketMqTopicSelect.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be134190f65c9ddefc92d1ac8250a554941205c6d8c83f69d53f28eae6db6e9a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/nacos/NacosDashboard.vue: 438 lines of code: apps/desktop/src/components/nacos/NacosDashboard.vue has 438 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosDashboard.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccc4ef24bd5ce92a82e916737dfdb8c833abf271c2ca000fc9dbbcf6619bda4"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/settings/McpPluginCapabilities.vue: 437 lines of code: apps/desktop/src/components/settings/McpPluginCapabilities.vue has 437 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":"apps/desktop/src/components/settings/McpPluginCapabilities.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d026cd0f2d9ad614b653134231800cb88bcfd4c7460042613161b600146055e9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useDataGridColumnFilters.ts: 436 lines of code: apps/desktop/src/composables/useDataGridColumnFilters.ts has 436 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":"apps/desktop/src/composables/useDataGridColumnFilters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c7259842dc60684c02977f471fac38ff372d8c465ebfdfac305ff9c98543eb"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useSchemaDiffSession.ts: 436 lines of code: apps/desktop/src/composables/useSchemaDiffSession.ts has 436 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":"apps/desktop/src/composables/useSchemaDiffSession.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b4a897310752c9dd1b415c1dfaee6bc18510360e6081b313b75075b2ca4e8b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/table/tableStructureCapabilities.ts: 436 lines of code: apps/desktop/src/lib/table/tableStructureCapabilities.ts has 436 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":"apps/desktop/src/lib/table/tableStructureCapabilities.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9ae8b70126d6dd4ef8ef433270b3c0330ad5213472d76c093dac9cfa35d0cb"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/metadata/tableMetadataCache.ts: 434 lines of code: apps/desktop/src/lib/metadata/tableMetadataCache.ts has 434 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":"apps/desktop/src/lib/metadata/tableMetadataCache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa13b387e52e5440411d0c753811ccd229506c03890940c2db28959aed14fc7"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/oracleIndexes.ts: 433 lines of code: apps/desktop/src/lib/database/oracleIndexes.ts has 433 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":"apps/desktop/src/lib/database/oracleIndexes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75bd83cd1364ef7ac9f159fa5ea4f166563365ea269cd5892b2d415618fcde2"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/grid/DataGridQueryControls.vue: 432 lines of code: apps/desktop/src/components/grid/DataGridQueryControls.vue 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":"apps/desktop/src/components/grid/DataGridQueryControls.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78fe235a7da746db4763b26527c73ebd3ff1c7c85d146ee8f5c0110040ec039"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/document/MongoDatabaseDumpDialog.vue: 431 lines of code: apps/desktop/src/components/document/MongoDatabaseDumpDialog.vue has 431 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":"apps/desktop/src/components/document/MongoDatabaseDumpDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2226ea96f7a683fbb8790fc3ab7f954e4c4d04e401de20429abef261a58358fb"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/composables/useCellDetailEditor.ts: 430 lines of code: apps/desktop/src/composables/useCellDetailEditor.ts has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useCellDetailEditor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cd1bbf1e5cb0edc76c7dbfbb53fc163473dc3964e186a333a6f01ce8905427"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sidebar/mongoCollectionMutation.ts: 430 lines of code: apps/desktop/src/lib/sidebar/mongoCollectionMutation.ts has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/mongoCollectionMutation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ba5d4b3b6faca9dd0feb68acf64b991a929805f2e32768395986f05627b957"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/ui/date-time-picker/DateTimePicker.vue: 429 lines of code: apps/desktop/src/components/ui/date-time-picker/DateTimePicker.vue has 429 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":"apps/desktop/src/components/ui/date-time-picker/DateTimePicker.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d2892d73a466fa4fccb91bce622850268092198b95d618f722ab8a74d0343b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/grid/DataGridSortBuilder.vue: 428 lines of code: apps/desktop/src/components/grid/DataGridSortBuilder.vue has 428 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":"apps/desktop/src/components/grid/DataGridSortBuilder.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a3117929c0353da73df54fd772588d109623f7125360196077aec3b50d9b9f"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts: 428 lines of code: apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts has 428 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":"apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"463123487515d6e04f0cecf1fbee170c869ca21f58041f05215eb2796f32171a"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/graph/GraphResultView.vue: 424 lines of code: apps/desktop/src/components/graph/GraphResultView.vue has 424 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/graph/GraphResultView.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4732fea9f10e491ee826308607915a7f9bd25c1e11a4d0fab46bd7e9793b7e36"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/dataGrid/regexGenerate.ts: 424 lines of code: apps/desktop/src/lib/dataGrid/regexGenerate.ts has 424 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8359f189e34b353fb720cef4592941bd8ace4f61e89d78115faf3414591f41e9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/meilisearch/MeilisearchTasksPage.vue: 419 lines of code: apps/desktop/src/components/meilisearch/MeilisearchTasksPage.vue has 419 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":"apps/desktop/src/components/meilisearch/MeilisearchTasksPage.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"778c1fdf76f6ca0f1a0d896bb34b864c3bcb4d9df804e9bb18a6877900546c26"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/grid/DataGridColumnLayoutPopover.vue: 418 lines of code: apps/desktop/src/components/grid/DataGridColumnLayoutPopover.vue has 418 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":"apps/desktop/src/components/grid/DataGridColumnLayoutPopover.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bcc52f31b859a821f1fc3cceb1b5f73c3d2673c23906d3f878b8bea9a1e87b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/database/jdbcDialect.ts: 417 lines of code: apps/desktop/src/lib/database/jdbcDialect.ts has 417 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":"apps/desktop/src/lib/database/jdbcDialect.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d60e99bc6a3540eea8195ff7eed1349650ad89033a85599b5d950f0922d21e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/editor/codemirrorSqlDialect.ts: 417 lines of code: apps/desktop/src/lib/editor/codemirrorSqlDialect.ts has 417 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":"apps/desktop/src/lib/editor/codemirrorSqlDialect.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2886732a4089aedef1a3294ddeac30bb863affb68d7cbf9de19de3efcc989b7d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/export/diagramSvgExport.ts: 417 lines of code: apps/desktop/src/lib/export/diagramSvgExport.ts has 417 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":"apps/desktop/src/lib/export/diagramSvgExport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ff5febdce4f4949c63e0ad861c2607f602e7c3b8f2d3dd05569e3dc1f519de"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts: 413 lines of code: apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts has 413 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":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beb6ce06b7b13df806b0c246decd3a70fbeca2ae7b9d46b3efc85f681c0998c"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/layout/AppDialogs.vue: 412 lines of code: apps/desktop/src/components/layout/AppDialogs.vue has 412 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":"apps/desktop/src/components/layout/AppDialogs.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ce0889fa8c987e29b2acb800bb2871d7e503e73dd7e3a458d702a594bb8006"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/RocketMqTraceDetailDialog.vue: 411 lines of code: apps/desktop/src/components/mq/RocketMqTraceDetailDialog.vue has 411 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":"apps/desktop/src/components/mq/RocketMqTraceDetailDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a1ba528fbd861194bd98a34908636e2b3904986a9a0cf6d31ec273366b111b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/diagram/engineeringDiagram.ts: 409 lines of code: apps/desktop/src/lib/diagram/engineeringDiagram.ts has 409 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/engineeringDiagram.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df2d658413e75fa5d3aac3d43f52ce08979898878f259d4657e58d3aa4fae8c"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/plugins/frontendPlugin.ts: 408 lines of code: apps/desktop/src/lib/plugins/frontendPlugin.ts has 408 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":"apps/desktop/src/lib/plugins/frontendPlugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d60d804b06271a62b2ee1700e37fdcb9c1c9437fb8759ca29e0a0d3a9ae78d3"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts: 406 lines of code: apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts has 406 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":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15fe13ff8952c0f50cc4b0e35515eb7808372fc4e87562c19e0e4a23ea322ea"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/lineage/FieldLineageDialog.vue: 405 lines of code: apps/desktop/src/components/lineage/FieldLineageDialog.vue has 405 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":"apps/desktop/src/components/lineage/FieldLineageDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d933b3fcf4fef2e028576da3415ecda8156b5a1d73b9b6e4ed08f8353b5a8d1"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/sqlserver/sqlServerActivityTraceRuntime.ts: 405 lines of code: apps/desktop/src/lib/sqlserver/sqlServerActivityTraceRuntime.ts has 405 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":"apps/desktop/src/lib/sqlserver/sqlServerActivityTraceRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b32bc7f724841f643ff4d344666e4ce923b7335362aca7d1c74acb68c70879"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/diagram/LayerPanel.vue: 404 lines of code: apps/desktop/src/components/diagram/LayerPanel.vue has 404 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":"apps/desktop/src/components/diagram/LayerPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8063d4a6e7e483b44c5c27b5f8bc1789e7c8e3dd3a74d6fc506fa0eae37e99"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/consul/ConsulMesh.vue: 403 lines of code: apps/desktop/src/components/consul/ConsulMesh.vue has 403 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":"apps/desktop/src/components/consul/ConsulMesh.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b99c5eb935dee747683b0555bf0ccba1ef0c5482fc2cf33fe42e8ec561c6e8"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/editor/TableStructurePeekDialog.vue: 403 lines of code: apps/desktop/src/components/editor/TableStructurePeekDialog.vue has 403 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":"apps/desktop/src/components/editor/TableStructurePeekDialog.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a380d619bf77ac5aaf26a781467fd2b022a50ff6d205a03466969c4501fc5114"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/components/mq/rabbitmq/RabbitMqClientsPanel.vue: 403 lines of code: apps/desktop/src/components/mq/rabbitmq/RabbitMqClientsPanel.vue has 403 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":"apps/desktop/src/components/mq/rabbitmq/RabbitMqClientsPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2596a56f684cb767951e55ff6c9abeb1bd1c926ba8440d6cefaa66cc61bef2ec"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/desktop/src/lib/app/openTabsPersistence.ts: 402 lines of code: apps/desktop/src/lib/app/openTabsPersistence.ts has 402 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":"apps/desktop/src/lib/app/openTabsPersistence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13f870f6087cf46e1ce6d1c9c5a8766c8af5bf1b078103e747d7cfafdb38386"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8002173a765abc3fff50f5b47ae20d9c7f89ff8f979fdfdb72cb37c1400bbc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/ui/App.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc01400990d5c9785503b85a2f1e288799320dbeb96604b1104d71b5b4f74fc5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49551698f8dedba143829700777c627046db30b480c1a7f0fdf4583b38c75c95"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/build_offline_jdbc_payload.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8f8e343d390069175c0aa696cf9299d080bfa64316c6d15257d78e43e94f2d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/scripts/verify-partition-ddl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c865a05af1abd38f303761c5aa2fcdaac0d2e7573b7ceac2d87c5dd66b6df6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlServerQueryWrapping.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac20f10a694e4f70bf956d855862bc9866f23f3c84de5a5dc97032b77af8712"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/plDebugWatch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da35c5f2dde175ddac56ad67b274101cc83181034ce1824b58d595b42dae992c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/plugin-cli/scripts/stage-sdk.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcec7b8b4a87ee8a0c89b634e467dd21527a90b1f095c777245c2e2bf8eccfd9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/viteConnectionTypesPlugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2329f63694d7561291b113bbc90a1b10126db29f4ddd9e286abe7a1201334635"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/pluginAiTools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ce6a5092786a8be52b9220269c7491bf4238e3c7ad7f5ffed587a56d66cf79"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/ui/PluginIcon.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7331dcfc442f1fc53862faa531f0a08de85d663c1a43ff633fbff5e9b82ce94"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/ui/DebugPanel.vue"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e2794d807ad5ff6a62a305ace72ac3ad19ede9225b909472af600a04f443ed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/cli/templates/svelte/src/App.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca899c362d4a1e57b33b266649214f71cabbec7b0e2db056c2b53e76a6e1fe7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/plugin-cli/scripts/stage-dev.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdeaccc05a0fb8df63f34c01e2f74a1aaa03f54620cc608a37a5b00c51529fa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/diagramZoom.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c72aae56035fa8539212ab9df772620bbcbe65795799f618ccbb38023c841bc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/pinnedTreeNodeIds.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0578362faaa30e407d28a90c067a710cfcac817e0c545c7f67f61d1f6f0c21"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57da39c749e14011af3c8a1aa4a0f49a7cf6ab11064224735cc10e091201785"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/history/historyActions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a823e6b4c28d297359eaa7361f060c9b32d3c68a1efba00500012a8f648cc8e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/cli/templates/svelte/src/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f345f48eac55e304edb6a8801a5ba09cc02f6d1b2ef7848c80e3f3e48ef91fd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/ui/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f259d74f63d52ae0791b0ec57c0c7934efa956904f7c21bf71b8086d235104"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/database/mongodb/5.0/init/001-smoke.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07f9a47ecb9a3e41bdf98b9edcd81b4ad0d13bc71505342b0c33ba3379d6768"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/database/mongodb/8.2/init/001-smoke.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c01e7704a8890856c1071763f8bc630b296f7fa067a9f05f6c29812a4f9445"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~502 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"669b0c3f57c0e04f583a272fdcb38a1afa9086bfd95d5b254b13f363af0c3154"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~208 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/scripts/verify-schema-objects.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8b4dd5e83de9a810d3fded461509ba0b654a9291641a644101f6ccb36ccf21"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~161 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-nacos-replace-history.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"510b957fe8580f33383038932d40c01cfa8d8de9fba9faf4884d07cf6ced0c60"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~146 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/scripts/verify-partition-ddl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8541d4017800516b6929f868746e6d48291f387a58796bc2c84450f86b51fbc7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~130 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlServerQueryWrapping.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ecfd547bbc3c677e0e620a643081332ede1202ce32a5dc7fc79e59fca30bbe"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~95 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-mq-integration.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2ad980930a806276f2a1307f104c4a3746fdc2582e8f089832d16ea1b8e98b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/debug/plDebugWatch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cf22a1bcc6c466625d89ebfc0da606cf922056d598de65720f32dc0e6387ec"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/diagramZoom.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4b3c9036849d0af139c3095077bd0ba77d4fe393f187c4af435fb073ab9389"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/pinnedTreeNodeIds.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faa0de93084494c9e1de2b0b3c62f03d980831a7ff3988d0f8935faf13cacf6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-node-packages.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc267d19583fe726b8b09f832708b66fdc3abd47a8d5ea1fc78a3a2cd2ed689f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/history/historyActions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca4256caa82656dd5d6de842c588c9da89d8d0dccd950a906ac4e6d27989bb6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/database/mongodb/5.0/init/001-smoke.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c3e41be1a3255b447a54e53e05264900399ff0a0bf773c13160b422c009141"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/database/mongodb/8.2/init/001-smoke.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b1365eb2dbeb4a14dcccd83675dd03c5d5ab46f260e846ff8c97f4fd2d9e95"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2 LoC): no import path from any entry point (97 application, 21 tooling, 2353 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/date-time-picker/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc1e189470da30a8b0824270afa413d3a4cf28a197ba64991d1e678b8d87436"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resolvePlDebugProbe\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/plDebugLaunch.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c0bbd776058bfa91ff54dbd3f7988f3d8ebbda175a45e0a7f18c638697b365"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATA_GRID_DISTINCT_VALUE_DEBOUNCE_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridDistinctValueLoader.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb1561ef3be612b1d50381f3f61f3759b2a441176e9de11d3e01506b3d705b9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027schemaDiffSessionNextProgressStep\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSchemaDiffSession.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"159e4bf869e3c00bb7cc63f9d7402cdb739ac365ad2357f5a397a234e1a91571"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runAiAction\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0614b163b3892abd5bbdf84bf68b7756a67d97a5b85c2a556d49624e27396a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runAiStream\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c514c95a3375349a080d8b6ebd95f078958546bdde6528985701ee5f387ba6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027extractSql\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/ai.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"901dbc8716ca7a5dc98196f0076fe9a9fa2bf668e69b65d1779881d76899a8f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027formatCouchDbDocumentOperationPreview\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreSave.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7753b80ab614e52ac0e6064fda5b987e8e5b177d06f86e852e7d0fc972da5de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PlainConfigPayload\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/configCrypto.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd9fc4e2dc54885f58a60e6fa6cf81f351b7c32e8fca4079fe076bf7deb7df5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027formatErrorWithContext\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1df3de557d55d537d7d230d7176a7c750a2e4571f1c8aa93cd3d7b333c90335"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027plDebugProbe\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/pl-debug-tauri.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e3c368583b0e25b45fc56b3e3efd927f9235bc2dacea857fa2ffd99b1dee18"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027plDebugExecute\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/pl-debug-tauri.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a47d32b49f12b78973073bb5cca8b0205e3f5ad0e7c21b2cab170878a44e43a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027plDebugSetValue\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/pl-debug-tauri.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9738afbd5ccc5a8ab0a600a2446b0a4afece07d24874440cae1aef2e65d6f54f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027plDebugSetExceptionBreakpoint\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/pl-debug-tauri.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2205f3af4901105e0b0f4b0ab4ee3df44f726518436a16a59acb4d6e1c3fd929"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027plDebugStepOut\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/pl-debug-tauri.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2158919ccae9e86257f311d4dd0baec9283422c9cd877d570dccddeae5ed0c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027plDebugAbort\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/pl-debug-tauri.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"884f00dfebcadd4dbea4b811bc99bd9131761addea94161668e359cf3c666a61"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATABASE_BACKUP_CONFIG_CHANGED_EVENT\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fe3bde14597196dab5a7097bdd86567dcdbf763db93b32e781455574a07596"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027writeDatabaseBackupSchedules\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada368f5fd8a67091bde0aa878d1e7e9956517a239e4f442a07ac66f40f90aa5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027writeDatabaseBackupRuns\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fedcadf17cf176ad58e55f7e2c950f7394664ce4c94038a70ed3887b09fe78"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027findJsonTreeMatches\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/jsonTreeSearch.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5704eea9974db858551e7ad7113682047404fdbf25eeb730766e90c0599e1b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TEXT_DIFF_MAX_CHARACTER_DIFF_CHARACTERS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/textDiff.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70ed4c671226af1afa57e184687ad83071f45ec424783d3f30028f6ad0c65e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027databaseInfoSummary\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDatabaseInfo.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"131053c998b8ea2307145cad70889851a7ffec60ee3cd7ad6cc042f0664dd4e9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isLocalFileDb\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionFile.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"573ff6560ceb82f0eb1d570407a8d17b630d4dbf961539771174b04dc3c557ad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ORACLE_LEGACY_CHARSETS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/oracleLegacyCharset.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe7d914fcb8c4a70f429bb75948453615fc232191f020c560fbd11c745fc637"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027layerReferencesProfile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/tunnelProfiles.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6bebdb37b2940499fd4e0b6a8b347fe50b8f3f239f7cb088655a02aa6e4d0a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027capabilityStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/consul/consulPolicy.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"637e3ef8d93ac72fb70b41dc9c9c59def93605bebbddb17f0bb03e78ae6ad69b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ConsulWatchState\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/consul/watchState.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd48e9720402060ddcb92c4746031caf593b9c09d48d2836af7b2d4e856d749a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cellDetailEditorText\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellDetailPresentation.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc5d27399c1c7ed32be4edb8556a758ccc4020c8fee940a43533bf44dadcd13"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027saveDataGridColumnOrder\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnLayoutStorage.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3c3f575216e5e5100c7f5d80b6fe56240957083ce9a47f56d54ea050dd785f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATA_GRID_CHAR_WIDTH\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidth.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1313f8db19ffb8f28966426469b6895617b92bd2e7b548fa2577943fa91b555"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATA_GRID_HEADER_CONTROL_WIDTH\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidth.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb64259dc35596bbc28ee3d4c665ab4d92a236612f4823f5548ab87336898194"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATA_GRID_CELL_PADDING\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidth.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55a8cfcec09be0c72558c510417c17c5e2de9ca351516a49d2d243203840728"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATA_GRID_SAMPLE_ROWS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidth.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7579c67e6fd1753fac1679c1c585707075cbc06aa9e2821df5dd7644ebf8eb91"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATA_GRID_VALUE_TEXT_LIMIT\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridColumnWidth.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f1cefdc7c1b0e16b049a6dbfb4744acf5221db46df32834b3ef7a83acbe527"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GridColumnLayout\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridRuntime.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa01a5bda09a02515d59f858f0036f7406ddfbc8cd2b2dd44b8a22ff71918206"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DataGridSelectionCapability\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridRuntime.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17e6756ebb76664083aa34452f027c759f35b7173826394f26b4812ce98cda7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DataGridNavigationCapability\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridRuntime.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c784a4367e699f9993565212cf94deae60c18305f320890768e64e699a2408f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DataGridRuntimeDependencies\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridRuntime.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f86551b5729452b0ca832da0c8cd72f930161b3a2cc273f7c8bddfa3d4eceb8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027nextDataGridSortState\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridSort.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc941b7752c03d99125b4c5377234431c932c8c9bcd6a6d6f73d98c93e868e07"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027selectionExceedsBudget\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridViewStateCache.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"607a8baf1598a1447cb0516a011cbae696202ae2cc7fdc1e8de7aeebf070bf94"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027legacyLargeValueIdentityKey\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/legacyLargeValueExport.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f910bb224432323166f2282f4c2a9fb76f740ae5eba08b4879ad94ada6c6794a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isCockroachDbDriverProfile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/cockroachdbProfile.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6935138c416b9bbb21127480df362511982b843b96b51cdd6b943e5788cb2c78"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027damengJobSchedulesSql\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/damengJobAdmin.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9302ba8883635f472102cc300b4def35e061d43b331cdd8093f54fd8f7d0ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027damengDropJobSql\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/damengJobAdmin.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e5737e2d8371923c91c6c8dc8713d90636dd23ce4fb949ab49df8bdf3deb76"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027damengStopJobSql\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/damengJobAdmin.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2466349f2c45b50ab3d01bfe2cbc525c654fa9bd9fbd6b893e23359cf96c0f8e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027damengClearJobHistoriesSql\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/damengJobAdmin.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"28985c873cde69ecc4194b7826367abde7fc18c30323b2259ade7517d386f6b8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027queryResultToObjects\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/damengJobAdmin.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"23643bd713b7825ee629e3f7d2cd38f1eb4b0370d890ee1b4cb6565435e42a1a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027databaseSupportLevel\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in apps/desktop/src/lib/database/databaseCapabilities.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in apps/desktop/src/lib/database/databaseCapabilities.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseDriverManifest.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"07eb6af1cb7de6e378f1adc2b6e69e0c8743d50baa8edb231cf7def00fbe48ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027databaseObjectTreeQuerySchema\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in apps/desktop/src/lib/database/databaseCapabilities.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in apps/desktop/src/lib/database/databaseCapabilities.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseFeatureSupport.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ea02fd20e7c33bfdc98713e26a6e4fdab07f04b3ea3986bd39e57b05e27e18"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027usesFetchFirst\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in apps/desktop/src/lib/database/databaseCapabilities.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in apps/desktop/src/lib/database/databaseCapabilities.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseFeatureSupport.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9087e81e332918c81624ed19d6914f6fed025a83c3de9034f1bbf60d9e0f5547"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027usesPostgresLikeStructureCopy\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in apps/desktop/src/lib/database/databaseCapabilities.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in apps/desktop/src/lib/database/databaseCapabilities.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseFeatureSupport.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5689488c52c809ef6dcda4032f4ff174e9d9050e6e5938f5ad2932b233add50"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027canEditSchemaProperties\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in apps/desktop/src/lib/database/databaseCapabilities.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in apps/desktop/src/lib/database/databaseCapabilities.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databasePropertyEditing.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"58eb19c7235c01b894aff119d6e8984ff136efeba1dcdb673f5e3d944ccd8bfc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027supportsPostgresStyleComments\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in apps/desktop/src/lib/database/databaseCapabilities.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in apps/desktop/src/lib/database/databaseCapabilities.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databasePropertyEditing.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"602c8cff4d24dbdad7d89fdcf1b9095e9fcb6f88f679db7014e2aa21cff43f03"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027supportsDatabaseStructureSearchBackend\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseStructureSearch.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1c292124dfbba41e83989ed92239f0ef69fc42331646e2ae03005f161b0448"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MYSQL_USER_ADMIN_TYPES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseUserAdmin.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bb47c87ba4c39ce6302c28f2f48639b881eb91ed4dd6625e85bf328946b10f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027KINGBASE_USER_ADMIN_TYPES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseUserAdmin.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d0e226558cbac0fd3188bc12a87680b9362105bdb459b5f633ef757e0b1e5d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027POSTGRES_USER_ADMIN_TYPES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseUserAdmin.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"371f2e9fc6bfd8682cfdd4fecf70b13bdff7f2bd4f50bd26e6a78ed6f8eba9b9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WRITE_UNLOCK_DURATIONS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/readOnlyWriteAccess.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cd998c2c43789f205aa84d69fb8c4f9beb3d6c3bfa53322c2c9b097ab1be92"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027targetUsesConnectionFallback\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/sqlExecutionTargetCapabilities.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7916043a2343b5927213f9de1c55a0c6b0edba7e390aec05ee347dc43c1f72f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027targetDatabaseListIsRequired\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/sqlExecutionTargetCapabilities.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"17626db3d6a49c41a1f2e2106ddba4e044a5f4015c119329d341fe7522052bbe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027targetDatabaseMetadataIsListable\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/sqlExecutionTargetCapabilities.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f500aa90e8df832012ae748c6d135da0eb42626bc3735ee656f1e37b5576297e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027targetNamespaceListIsRegistered\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/sqlExecutionTargetCapabilities.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34cae12bdc71a2a0ac75391ba748f187c5ac05b7b22d2b6f6e8139b2f10f6ee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027registeredSqlExecutionTargetNamespaceKind\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/sqlExecutionTargetRegistry.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0b4c8ca849993890dd05b17f837ebce3f6272bac62d4675de7a9e06f526508"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027sqlServerLinkedTableSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/sqlServerLinkedServers.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb1e6e8f1540302bc4e1cd2f3a8fd25b9ff582dfc585248055f7ae4138cae69"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SQLSERVER_DEFAULT_SCHEMA\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/sqlServerTree.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"422173dfe23723f7ba8558ec443dc1d15165709846f6e824d1813c56cce7963f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027EDGE_POPOVER_OPEN_DELAY_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/diagram-constants.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3543deb76543584c2e3d770031772fadb2f63711ebb0452da43a35348dd88389"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027EDGE_POPOVER_CLOSE_DELAY_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/diagram-constants.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"058eb6654edf18032d7fa3f33874a0c7d55230ec56fdda3f0e0f49a9bd0a5ba5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createDefaultIdColumn\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/draft-table.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36c0f203d71d7b30bd4eb7f05370cb30f9dda381d577e4c4b96402160670d98"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027mergeRelationships\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/match-engine.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"734330c612a304b1a64c02f7d240fa0e40f99c72dc9dbfd721a07a9f66e1766f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadMatchRules\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/match-storage.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a777aca5f9cc46603a770f400101ee40a9b1f54eb94f7d3314c9fa946a5fb5e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027saveMatchRules\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/match-storage.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"245574eaff43dce98fd6ec1017db44b81e3e678c08468a4e45fc3f1a4685fd68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027setAutoMatchEnabled\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/match-storage.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"671f47bb72c6ea28fc86a585d7c9d5f19db5d6a0f2b90b553a5f557cb4ccfa1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027toDiagramNodes\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/diagram/vue-flow-adapter.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f13fb14f27a717d5f543fd08052ce323610b89f115d32968886d7396ac58bc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DoltTextDiffKind\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dolt/doltCellDiff.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d304e4ce94d592337f392dcd76f5514b0fcba901c9290d26557b739c0bbcf5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DoltTextDiffSegment\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dolt/doltCellDiff.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"111f7cefc1109d752acd6b86da8c6a8cb20a49745853e57e2ddc70c7d600a109"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isAcceptCompletionShortcut\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/keyboardShortcuts.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7224a053ee7ed6438de1a730d8c4302233f5bcf092f6ed1e76c82b6322353da8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATABASE_EXPORT_ROW_LIMIT\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExport.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab54f4e6f3bf38b287252794f6aea27c6a29ee8ae4909423af1b351c03f0bb5e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATABASE_EXPORT_INSERT_BATCH_SIZE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExport.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"466cc955a3c5ec49cf586c7d18f9d6b631bb6c7800aaf21171840009d5d3c67f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildInsertStatements\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExport.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa7123b7403e0e78edc80515d491ae56ec17976d29164e8caeb5e5f817dc5ab"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildExportPageSql\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExport.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9cd0bc22e075e787eadf05d180a7e91da3693e05a9cb832be81c1c3233ad2c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildDatabaseSqlExport\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExport.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"6993330aadafc5e691257316a18206857de67c5f187ea899ad6522bf53806c9c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027McpTreeVisibility\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mcp/mcpAccessTree.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1128f49dad0706f3212e354a981b08abbb953c9019643857ff47d2a766000684"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027mcpReachableDatabaseTypes\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mcp/mcpToolCatalog.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5ff78c9ebf7c533920165ab2aa137ca5a4e00902c837b001649ff942f93b7b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027METADATA_CACHE_RECOMMENDED_MAX_MEMORY_MB\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/metadataRuntimeCache.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b62d1674db2ce6784987a74331da926fec318f972dd1621e15b4aeb4b67f11"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getConfiguredMetadataCacheMemoryMb\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/metadataRuntimeCache.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ff7b5b9882cd1fba30a79bf88292c66e4bc4187b347ea56788af9831ed4458"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027rocketMqMessageToPeeked\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/rocketmqMessageUtils.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad0b6a5a1c556389614a891379a754f8d4cf4044c8d126abb3084d6c781c65e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027NACOS_RAW_TEMPLATES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa672a0088d850ad92d885043a16375cd75a918625984c75e3c687f8fcd5a80"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildNacosConfigExport\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb54aae0a538c88fdc1fca1d6d9d6203763724954393ef7532c26c3713a6be4b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildNacosConfigCopy\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd22f130ab5f9b0cc4af2569310a2368745b4c7e8bd0bfe43682863548a8e39b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildNacosRawMutationConfirm\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/nacos/nacosAdmin.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d208caf8fb3ee13c06f57aeed0fc817f32d2bf6fb12faca2c19d2362c7f6dbd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027usePluginToolbarCommands\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginCommandRegistry.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef3518ddbdc83ebdccbd39fc8421c2b40effffd22f475862b35b11bbe38e684"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_PLUGIN_WORKBENCH_CONTEXT_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginData.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15366b8d6ca01e3a9c152141855ee6f69ff44ac6bbfe51f9a59a9c105f8b606"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_PLUGIN_STORAGE_VALUE_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"db393256096dddda50a2a64c9861e6bb176ef205cb5ec39e3ca6925224394448"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_PLUGIN_STORAGE_KEY_CHARS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cf74d2303e435ce5a583dbd3886d3c2dc0ea0c3299647cf2342d31503b17d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027unicodeRedisJsonText\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"775f4bab6c35d09125dd6ad36e7bb10b665788f2ba177be93f61f15ae59dd8fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027canRenderRedisValueView\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe289955c49916e955c4796da71edec05f9c5c508606d1fa9082db1a6013fad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027preferredRedisValueView\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a238df26f2d4e292521f4b4d251ec857be9a7b08fa46677ec076419ad967703"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027preferredRedisValueCodec\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"3585867eb255a155defa3988ded8547492a9bafff1ad9e08928cfc0827ca8f74"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027redisCollectionPageItems\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e81e1c0090cda10c696bee4fb0dfafb5e3b8f48ab5138fac4b7a8f64ad5439"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027REDIS_VALUE_PREVIEW_LIMIT_KIB_OPTIONS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePreviewLimit.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3633068a76ced1d2114330f31b7fc6e4b78a0d439cffba8baad6fc25c74a21ab"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RedisTextMatch\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValueSearch.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b6a91cb7cc74b9f2c3e01bbc69e2efac14bd6c49535b523b445f6d823be164"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SchemaDiffGroup\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiff.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90ba1cb1a76844b2f67531a9555e56455f595a9adbb4a813d671d5b5720ab2a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateSchemaDiffRoutineMapping\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffRoutine.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"238313650f31665e213b171bccf62d0b3268e02fcea7614fbfd6df953162f9ab"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027availableSchemaDiffTargetRoutines\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/schema/schemaDiffRoutine.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bbbeaac02628cb303c1374844bee7e3c0a35101b4f910d238a105193290e1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027findNodePathForActiveTab\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c31eac298a7155b98b749853f2feb683bb40fb3086981ce8823026929f2cb3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createSidebarSearchSubtreePreserver\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4771dd6ed22d42fab5acbc3e6138e08872f58446fc2bb5e849d22f77970547"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027localTableSearchParentTypes\u0027: Nothing imports THIS copy of \u0027localTableSearchParentTypes\u0027 \u2014 but apps/desktop/src/lib/sidebar/sidebarSearchTree.ts:85 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep apps/desktop/src/lib/sidebar/sidebarSearchTree.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarTableSearchControl.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70489fd02d9ed8d479b344f65703b4a7dd57a3ebd9355000a6d5245e850ca9e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SolrCoreAction\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/solr/solrAdmin.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"16663b8dac972506d9ca17d69ce0004920ba41992cc80f922f615fc55daa365b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027tokenContainsPosition\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/semantic/tokens.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9666b6704338aeef1d452c3c00da8d5020ea74a42f0ca575e9537a7769732dd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SQL_COMPLETION_TRIGGER_MODES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlCompletionTriggerPolicy.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25546bbb6b622ee0c77404eaa2959ddf5fb2b5c959005c14c3c605060d7db8f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SqlExecutionChoiceRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlExecutionTarget.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e7e1f22b5e4e88e95a9e3a703d4d30ece4a14b4a78926d6ccfe78cc658ea50"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027sqlServerTracePendingSessionLifetimeMs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sqlserver/sqlServerActivityTraceRuntime.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b9fe9f328d3b0412194cf9e5896b613679b1d675ba28045b953818cc35bc65"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildExecutableObjectSourceSql\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectSourceEditor.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40fd8c265092761964afa30cae2632eeaab232015e788597fbce4c17cc8a7d7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027sortDatabaseObjectsByPrefixPriority\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed750ec32ebd7f173b15e23f8482597f493480530722891082e424983a8878fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027hasTablePartitionGroups\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableTree.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a128be24db1a34d2013327518a50b681f907d94b6764fd3b28e8ace6464ea6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RelationshipKind\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/diagram.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de3dd22987934f80dddb0e820cdadc4b8c624bd08c5f93efe0fc8c7c31892bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MatchStorageKeys\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/diagram.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae631324cfa8d6b3e2d68629fff07ceb21689bc38807f1d48d634be2b9a7c6ef"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ConfigVersionSnapshot\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"420999ab0471fa9314a1feba06799a3fe1fcef528fcc591974e3c06d53df9874"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027AuditQuery\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0127b0f734b573de415f9b9addb4e828c65c27e004ae05a4c5a975a1502dd0c0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027AuditSummary\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a129a2b777debb06c20eae06d90b9f99017f04a6842339b9c4341a7ec9d2b8ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ApprovalRecord\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c323a2b7dff6bb6cddf94c0cce9d977b4e4fbe2753a609155181aa0265a6526f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DriftAlert\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94c51aee775502557ab8ff9abc462563723d8f69845406b0597b63545516d96"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DriftReport\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f020ccad5528b71254287be990254f5093f3fa7fb3b9b4eaec2659be7cc6f9f7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OscStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d5ebd2ab3899b75348bb87c300d3b3ed12530500053957d3265459078aba0a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DegradationLevel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a68ed6d64bd3e44a92d043f12d98f44f01cc06e3e4fe2901cdbd9585661fa6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BusinessTag\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8fc91a8e18dc411c2a9eadba4083c02b449b86e91584e4b0bd25eedff2ef1d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RebasePlan\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c680a6320c2d4e0235b6fdda9d0b73d9b7ff42ddcc3600f5d241f951cef11c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ConfigDriftSummary\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/governance.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54417636284b7ec2ff2b64a374909eee29f52fb1100cd3c3ffc663c83be591c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MqttPublishRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/mqtt.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"702c20557ea736f038d1705a67c15e3268a1bf874d62a05e764d769033e8bfae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MqttSubscribeRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/mqtt.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0c4d7f262dff22e448d5328ca695fc82f976d284bebbb0aa1dc717b9b54acc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MqttUnsubscribeRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/mqtt.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"106167367f6349b153a8bc9fb3774b73e10e5ad79e64101bfbd8dd69679a68b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PLUGIN_TOOL_NAME_SEPARATOR\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/pluginAiTools.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad8af311e9af23a18ba0246a63e00792168e329b1b185b275129e6ccceb09c5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SchemaDiffOptionsMap\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/schemaDiff.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"064a04c2cdc4f8fb291d53a40a1fd6e163c3dca01a6f6599d7bb3f6158e4341a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cloneConfig\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/types/schemaDiff.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ed74e51b6f794ae5b8e9f3cb354deb14cd9dfe31075e7378d1ca47d2c770a0"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@oxfmt/binding-darwin-arm64\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"245b3e329ad7992d80f5c1eb2d648a8940880ad8ad1ae6c0beda0cd36d5c13dc"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@oxlint/binding-darwin-arm64\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9e06bc2a0f0929f864c4663562f268d9e62aca250efbc65280184a3681970aca"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027daisyui\u0027: Declared in plugins/sdk/dev-host/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bdedf5b6d5b9bf91952330a52a6e7a14f9c29ee2cb7988260b0bff4263a1d78b"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): apps/desktop/src/components/ui/badge/Badge.vue \u2192 apps/desktop/src/components/ui/badge/index.ts \u2192 apps/desktop/src/components/ui/badge/Badge.vue"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/badge/Badge.vue"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9cae2b2f6bdca28c931325301ea009163bc521a84825243cc03b37d08b379d"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): apps/desktop/src/components/ui/button/Button.vue \u2192 apps/desktop/src/components/ui/button/index.ts \u2192 apps/desktop/src/components/ui/button/Button.vue"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/button/Button.vue"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a220b880a5cfcbc19c4cd49f27a05807008d2f5c680b95bd742681a5aa496de7"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): apps/desktop/src/components/ui/select/SelectContent.vue \u2192 apps/desktop/src/components/ui/select/index.ts \u2192 apps/desktop/src/components/ui/select/SelectContent.vue"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/select/SelectContent.vue"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"edefa17d590840cdd6b5d7c2f54495e75d8331251ae64d362334c30ee0f7d737"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): apps/desktop/src/components/ui/tabs/TabsList.vue \u2192 apps/desktop/src/components/ui/tabs/index.ts \u2192 apps/desktop/src/components/ui/tabs/TabsList.vue"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/tabs/TabsList.vue"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c53c50fc5e0d0c8527eb1e95244320ceca640d499193e73086b8e4d25309dc7"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): apps/desktop/src/lib/backend/http.ts \u2192 apps/desktop/src/lib/backend/tauri.ts \u2192 apps/desktop/src/lib/backend/http.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a69283c680e570c15df1eaccf6f74dc8d2b6a12fd78756cd485c5e0e9e5f954"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (5 files): apps/desktop/src/lib/sql/sqlRisk.ts \u2192 apps/desktop/src/types/database.ts \u2192 apps/desktop/src/lib/database/oracleTriggerPlan.ts \u2192 apps/desktop/src/lib/database/productionExecutionGuard.ts \u2192 apps/desktop/src/lib/database/productionSafety.ts \u2192 apps/desktop/src/lib/sql/sqlRisk.ts (one verified cycle inside a mutually-dependent group of 31 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlRisk.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff4f97e6da7fa59849569174ab27309a0db6ed3a59c47a038a468cce1733ce1"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://analytics.unihub.top/script.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/app/[lang]/layout.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d956f788b3f510f10c81fc1375de9b876d1738703a74abaac35f09520db23e2"}},{"ruleId":"S1","level":"note","message":{"text":"Security headers incomplete: Set: Referrer-Policy, X-Content-Type-Options. Missing: Content-Security-Policy, Strict-Transport-Security, X-Frame-Options \u2014 the four headers that carry the points of this card\u0027s security-headers term (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options), 0.5 each. (\u22121.5 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/public/_headers"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e6d0d9d7b7ff698a75ce617d4454fc369fda92328240201bbc8918ed0973c9"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: plugins/sdk/cli/templates/svelte/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/cli/templates/svelte/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5bab874978bffadc5709d6904f1239b41888dcaa5e72d9c058388c15713f16"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: vendor/tauri-plugin-updater/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/tauri-plugin-updater/package.json"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5dedeac4900370a08b7f856ea34ee6ec8a62548d14f942e7c9dd2598cd83ae"}},{"ruleId":"X1","level":"warning","message":{"text":"Blocking \u0060thread::sleep\u0060 inside an \u0060async\u0060 body: This \u0060async\u0060 body is polled on an executor\u0027s worker thread, and \u0060std::thread::sleep\u0060 blocks that thread: for the whole delay no other task scheduled on it makes progress \u2014 the Rust form of blocking on a task. Use \u0060tokio::time::sleep(\u2026).await\u0060 (or the runtime\u0027s own timer), which suspends only this task. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the executor with \u0060tokio::task::spawn_blocking(\u2026).await\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/storage.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8fd1ef5bbdc2873229fc4036e99dc256d9e729599e9964b49e7630fad595c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!acceptsHiveTable(constraints.ObjectTypes) \u0026\u0026 !(server.supportsRoutines() \u0026\u0026 acceptsHiveRoutine(constraints.ObjectTypes))\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6493c3e4d95d69ecbfcc9023c795a944b15ada11b64489f584b6cddec88e40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!e.closeRequested \u0026\u0026 (unknown || e.targetReturned)\u0060 appears character-identically in 2 files \u2014 agents/drivers/oracle-go/pldebug_breakpoint.go, agents/drivers/oracle-go/pldebug_frame_value.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c162946ff4e1f668b504fd1bc2e451c454e7c2c7559bc3508813595768e332"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!kerberos.UseTicketCache \u0026\u0026 !kerberos.UseKeytab \u0026\u0026 (kerberos.ClientPrincipal == \u0022\u0022 || kerberos.Password == \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"200a7a5fa2d3f8e5dba50a2753ce9966d63d244c2b25df28bd91d3aa261bf342"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!kerberos.UseTicketCache \u0026\u0026 kerberos.CCachePath == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7da25b0e05f7d36faa93e72532e9ca4fe64c84c762095e65a73af117f95b9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ok || !strings.EqualFold(strings.TrimSpace(key), \u0022sslmode\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"df18097636fc9a496d7967bfc8d5500cdedeb417ae6fb2b319bad2a9e5246e2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!source.Valid || strings.TrimSpace(source.String) == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/kingbase-go/routine_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"56674c37fc569f4f926be4cf4934d53704f5dfc0c102d90402fac12e373bb33b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!state.lastAccessed.IsZero() \u0026\u0026 now.Sub(state.lastAccessed) \u003E= querySessionIdleTime\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/query.go, agents/drivers/hive-go/query.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80631723866e2908a2a0fd223298b28de418512c5a37f4a66a8e9c67eaab7df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!stop.StackDepth.Valid || stop.StackDepth.Int64 \u003C= 0 || int64(request.Frame) \u003E= stop.StackDepth.Int64\u0060 appears character-identically in 2 files \u2014 agents/drivers/oracle-go/pldebug_frame_value.go, agents/drivers/oracle-go/pldebug_frame_write.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_frame_value.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f8a81f2649d3582b29db3807cf2448930a2548d440085d2f81cd4be1ce2dd2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!strings.EqualFold(config.Auth, \u0022DELEGATIONTOKEN\u0022) \u0026\u0026 !strings.EqualFold(config.Auth, \u0022DELEGATION_TOKEN\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d09e9f2eb66ce188cc6d3dcf3efda8612452260a1234fb0cf8095c450cdf87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!strings.HasPrefix(trimmed, \u0022-D\u0022) || !found\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0b47901219b0220e78b619d70a324b9b534f36ad932b2317ff3966739a7f9c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!typdefaultbin.Valid || typdefaultbin.String == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15ac92f8b1f9aa3e6cea6569971660e95408ed9a7e02ac1104874e26035d452"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!validatedUnsupported \u0026\u0026 isUndefinedColumn(err, \u0022convalidated\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6c1490ede2c5a6e0b9decd9b46d7d19b1f8722017f4f97cbfebc195b419799"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(hasLease \u0026\u0026 hasTtl) || (preserveLease \u0026\u0026 (hasLease || hasTtl))\u0060 appears character-identically in 2 files \u2014 agents/drivers/etcd-go/kv.go, agents/drivers/etcd2-go/kv.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45031e8d732c505c15d931215cbaf01c8bef402bf77f9fbf2df5704d05b187b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.Type == \u0022DATE\u0022 || a.Type == \u0022TIMESTAMP\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/oracle-go/pldebug_target.go, agents/drivers/oracle-go/pldebug_target_invoke.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target.go"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"6966b7523ff2a037dff394259c1af0b2dc7077d5b17bda19924e4333bb3825d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attempt\u002B1 \u003C connector.retries \u0026\u0026 connector.retryInterval \u003E 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/connector.go, agents/drivers/hive-go/connector.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"857ce69c96a9bdde6293b7e44df86882e6813b1f8e7373060f80508cb1efe8c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes \u003C 0 || s.watchBufferedBytes\u002Bbytes \u003E maxSessionWatchBufferBytes\u0060 appears character-identically in 2 files \u2014 agents/drivers/etcd-go/main.go, agents/drivers/etcd2-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/main.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1daee362f8b49e685ace11b1df3eea547a1c35cb5f72fabcec538d624a88609"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.end == \u0022\u0022 || rangeStartAtOrAfterEnd(candidate.start, candidate.end)\u0060 appears character-identically in 2 files \u2014 agents/drivers/etcd-go/auth.go, agents/drivers/etcd-go/kv.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/auth.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d3fa2b9345425a53974bfdb64eaef6c3fd21192842b9d2a17cbd00fce3b076"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060capture != nil \u0026\u0026 capture.ReferencesPending\u0060 appears character-identically in 4 files \u2014 agents/drivers/oracle-go/pldebug_anonymous_source.go, agents/drivers/oracle-go/pldebug_entry.go, agents/drivers/oracle-go/pldebug_execute.go, agents/drivers/oracle-go/pldebug_stack.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_anonymous_source.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0d2e120b27bf74f75fc81c1268af315c8545df2e2c4317ffea7d3167ca1689"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char == \u0027_\u0027 || char \u003E= \u0027a\u0027 \u0026\u0026 char \u003C= \u0027z\u0027 || char \u003E= \u0027A\u0027 \u0026\u0026 char \u003C= \u0027Z\u0027 || char \u003E= \u00270\u0027 \u0026\u0026 char \u003C= \u00279\u0027\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3bbf7da28bbfcbe3de85b275e15a282b6b7e7adcf6aa690ea17c5b7d5d73f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char == 0 || char \u003C 0x09 || char \u003E 0x0d \u0026\u0026 char \u003C 0x20\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"3028278a46bf443362e12b7feb0f4c55c6546d1856ba7187da166ee7b77785b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060column.Comment == nil || strings.TrimSpace(*column.Comment) == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"332154357d17ed4735a350c68f60d0bd65cef931a0f541c0a2cbf9445ee08227"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060comment.Valid \u0026\u0026 strings.TrimSpace(comment.String) != \u0022\u0022\u0060 appears character-identically in 3 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/oracle-go/main.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3016}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bd266bff6ea656065713ef7d35d4e88b5de4cdd0ef0369dd8fc61a986ddad6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.Database == \u0022\u0022 \u0026\u0026 parsed.database != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"407493b017c66ed14e220e98a834e1e7443c987c32aa7eb393195fbf89ea5170"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.Password == \u0022\u0022 \u0026\u0026 parsed.password != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa0e33c30cca69f336f29e3be535c13986de28ac8bb5d6ea5654014a04e0a98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.UseKeytab || parseJAASBool(value)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b8cf07b6b6315ddaaaee258f8bd5fc0f9cbc8bcecb62a8c88e621b58d25940"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.UseTicketCache || parseJAASBool(value)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b2d85e12d4c3303096c3e1d8857c78d7d0abd7b054a6f1770af509c6533fef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.Username == \u0022\u0022 \u0026\u0026 parsed.username != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"270ac4beb66935832de7e18576f95be40d15c3398ea5103296060bcf3ad2118d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.truststorePath != \u0022\u0022 || config.keystorePath != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/cassandra-go/config.go, agents/drivers/cassandra-go/config_file.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0960e118fe02d906dac33acd6e3d75ce42d1197550351cbaa2cbf601116530"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060consistency != gocql.Serial \u0026\u0026 consistency != gocql.LocalSerial\u0060 appears character-identically in 2 files \u2014 agents/drivers/cassandra-go/config.go, agents/drivers/cassandra-go/config_file.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"346640862108cc93fe061ca61cdfdae7aa09483a6743649bd79ca49278004620"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060containsString(requestedTypes, \u0022VIEW\u0022) || containsString(requestedTypes, \u0022MATERIALIZED VIEW\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"996cbf9f496569236602730d1f313b4bc081807be45bb3984b3d4ddb1b752ca9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060discovery.authScheme != \u0022\u0022 || discovery.auth != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/discovery.go, agents/drivers/hive-go/discovery.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cb9c611fa4254ebda548ab6511d06c5a75183cf765b7411d39e401fd97f8bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060discovery.authScheme == \u0022\u0022 || discovery.auth == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/discovery.go, agents/drivers/hive-go/discovery.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7e254c0dfab12d4060bbc8e91be7778b7ee59cdcf7a9e45770ed2b42dd5d57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.server.plAllocation.unknown || e.server.plAllocation.active != nil\u0060 appears character-identically in 8 files \u2014 agents/drivers/oracle-go/pldebug_breakpoint.go, agents/drivers/oracle-go/pldebug_breakpoint_write.go, agents/drivers/oracle-go/pldebug_entry.go, agents/drivers/oracle-go/pldebug_execute.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb0f03c3082324e4d68a1f653aea74dd9e960904b379361c5484ebfb70e0896"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil \u0026\u0026 expression == \u0022sys_get_expr\u0022 \u0026\u0026 isUndefinedFunction(err, expression)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee9580e9f7b9abc83bd2609489829225acc28716bff02ddd7a9d896eba8e7d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || !strings.EqualFold(decodedKey, \u0022sslmode\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fb4b2ada2690f4aa1385caf5f160ccf894a35f38179dffa5068aa1d469da74"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || parsed \u003C 0 || parsed \u003E 65535\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3b4663bd90a12f52de862917793c83efb731b1eb258e8dabb33a0d0f9fd19d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil || version \u003C 3 || version \u003E 5\u0060 appears character-identically in 2 files \u2014 agents/drivers/cassandra-go/config.go, agents/drivers/cassandra-go/config_file.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/config.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"94865f42928db0d7d33cf128c3331ea5936c318821639f6bcc980c96f241e83a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err == nil \u0026\u0026 (e.closeRequested || unknown || e.targetReturned)\u0060 appears character-identically in 2 files \u2014 agents/drivers/oracle-go/pldebug_breakpoint.go, agents/drivers/oracle-go/pldebug_frame_value.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_breakpoint.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"189f9c9b12973becd73a765353ba132c5b08b1cdcdc1e1c15866065b8a68ff03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060errors.Is(err, context.Canceled) || errors.Is(err, context.DeadlineExceeded)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"122f4b8514ccce27c8cfb41a63fbc488c46fb6e6460593f892d6f6333e370f40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060errors.Is(err, context.DeadlineExceeded) || isTimeoutError(err)\u0060 appears character-identically in 7 files \u2014 agents/drivers/argo-go/protocol_error.go, agents/drivers/etcd-go/protocol_error.go, agents/drivers/etcd2-go/protocol_error.go, agents/drivers/hive-go/protocol_error.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"210ca3b028878bc0bcc23fd5b71f19832d6271d4bc194ea9ec4c81e5a868b345"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060errors.Is(err, driver.ErrSkip) || strings.Contains(message, \u0022transactions are not supported\u0022) || strings.Contains(message, \u0022transaction is n\u2026\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/query.go, agents/drivers/hive-go/query.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cfdc9834f84aef56537631fd664967c0c2348e18e9376adb2cc74250bd6cb2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060errors.Is(err, io.EOF) || errors.Is(err, net.ErrClosed)\u0060 appears character-identically in 5 files \u2014 agents/drivers/cassandra-go/protocol_error.go, agents/drivers/etcd-go/protocol_error.go, agents/drivers/etcd2-go/protocol_error.go, agents/drivers/iotdb/protocol_error.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/protocol_error.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8167efda3b71945659c9a16102e301e4c122f4b6c1f97c888b06b638707f7f72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060errors.Is(err, io.EOF) || errors.Is(err, net.ErrClosed) || errors.Is(err, sql.ErrConnDone)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/protocol_error.go, agents/drivers/hive-go/protocol_error.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a823dbe76ecd434350fe85757a5fc6517006ae8e2421cede70de82d551c7369"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.Type == mvccpb.DELETE \u0026\u0026 previous != nil\u0060 appears character-identically in 2 files \u2014 agents/drivers/etcd-go/history.go, agents/drivers/etcd-go/watch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/history.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"689cf505d4e429339785c92763f50f538952a7c511821d473f1cf56d613367cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fallback.objectType == \u0022VIEW\u0022 \u0026\u0026 tableFallbackSucceeded \u0026\u0026 showViewsUnsupported(err)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ed328ac7aad328fa7eb9f0c02f3fa1b85699fb63dc76f09fe1c1251865d3c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filter == \u0022\u0022 || strings.Contains(strings.ToLower(name), strings.ToLower(filter))\u0060 appears character-identically in 5 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/cassandra-go/metadata.go, agents/drivers/hive-go/metadata.go, agents/drivers/iotdb/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ed887b546fe6e772a9e4f4d3cfa1cf2239c70bc6a382f2f528b5095ce575d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060includeColumnType \u0026\u0026 isUndefinedColumn(err, \u0022column_type\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a63ddddbd14a4216c2f5b98a4a89ca165fbfed85ba38a66263599a5b8e74030"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060includeUdtName \u0026\u0026 isUndefinedColumn(err, \u0022udt_name\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bed1d0f664815df56c052c701e81c7d36f2917870f9248b5e0cc8dda30d60e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C len(body) \u0026\u0026 isJSONSpace(body[index])\u0060 appears character-identically in 2 files \u2014 agents/drivers/rocketmq/consumers.go, agents/drivers/rocketmq/routing.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a83b397e870938e2ac35908d7658a25175a2ec39020b2b0460deea596f57db2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C len(value) \u0026\u0026 !isNativeDSNSpace(value[index])\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d9de49047ea9eee569dd7826094ccab48e50c19b63ffc536286938a62b5d60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C len(value) \u0026\u0026 isNativeDSNSpace(value[index])\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"568d244b3770fbeeaf39432ffa4ce0fe3abcf48b9b50c9f2749de6ca7cd8afc4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C len(value) \u0026\u0026 value[index] != \u0027=\u0027\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfea5be452615b46698b85e70c25f3774d6b5826ac9f699a880e84b068d3c53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C len(value) \u0026\u0026 value[index] == \u0027\\\u0027\u0027\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46461fb0920619c17258f93bf24505ef368e5c26b2c7a725acd365d18953650"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003E= len(body) || body[index] != \u0027:\u0027\u0060 appears character-identically in 2 files \u2014 agents/drivers/rocketmq/consumers.go, agents/drivers/rocketmq/routing.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcab18eebddd3116cbae6e0f14f264a3930d37f8cb7b0dc68bc1aca1f8a628e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index\u002B1 \u003C len(sqlText) \u0026\u0026 sqlText[index] == \u0027-\u0027 \u0026\u0026 sqlText[index\u002B1] == \u0027-\u0027\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/connection_state.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf1928b2ade22b7962b994bcb80abeddf1abaea15b6e219f2af4ecc12c5c06c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index\u002B1 \u003C len(sqlText) \u0026\u0026 sqlText[index] == \u0027/\u0027 \u0026\u0026 sqlText[index\u002B1] == \u0027*\u0027\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/connection_state.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc5e7e5e44f6c6d769792dc4cff2cf0bdcd2a9ffd036ac3615a4edc5da63f30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.GlobalSearch || input.Schema == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/cassandra-go/metadata.go, agents/drivers/iotdb/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/metadata.go"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fef3faf0427bcf13c55a1a9cd1a3f21b58a13df20cb9fa4eb59509a08b2a1f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060int64(len(w.batches)) \u003E= maxWatchBatches || int64(w.eventCount\u002Blen(events)) \u003E maxWatchEvents || batchBytes \u003E maxWatchBufferBytes || w.buffer\u2026\u0060 appears character-identically in 2 files \u2014 agents/drivers/etcd-go/watch.go, agents/drivers/etcd2-go/watch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8085f957437e830369bdbd70201c41a31912c2942b0cdec0b22d247f09eadeb7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isZooKeeperDiscovery(config.ServiceDiscoveryMode) \u0026\u0026 len(parsed.endpoints) \u003E 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2838dc7f66705bcf4a0fed12e4aaf1affb85980c5e5d7d1502582071219e393d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kerberos.ClientPrincipal == \u0022\u0022 \u0026\u0026 !kerberos.UseTicketCache \u0026\u0026 !kerberos.UseKeytab\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a411f1449f7d8e61d70aa8d23b8a2c702769c938bb928e79d45790cd7106e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kerberos.ServerPrincipal != \u0022\u0022 || strings.EqualFold(config.Auth, \u0022KERBEROS\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3cec70e6b4934e52b784995dd31cdcd3e0e11b69687a3eb03f4368664aa852"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keyStoreLocation == \u0022\u0022 \u0026\u0026 len(config.Certificates) == 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa02bfff141984e24cc1e9cee0b38a2a165758f009f7b1015fc078ae573c741"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == \u0022FUNCTION\u0022 || kind == \u0022PROCEDURE\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d6245a5669b246442f744ab344bf7c3315a1c755c30ed52371a929d69127d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kinds[\u0022column\u0022] \u0026\u0026 request.ParentName != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac34134c8213e4929a36de10660c001d72d3d75157bd9cf174d598027c65b492"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(allowed) == 0 || allowed[strings.ToLower(name)]\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"249c17de9069350dfe7e5098b5ddd9ca1294d6d3cf43c69ecf0ef7432ca300e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(cell.Nodes) == 0 \u0026\u0026 len(cell.Edges) == 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/nebula-go/query.go, agents/drivers/neo4j-go/graph.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/query.go"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9574342590a62258d9262a09a68abd504da1369819ddde0bcf75fca7cd03692"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(constraints.ObjectTypes) \u003E 0 \u0026\u0026 len(requestedTypes) == 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49e0eda684913c75e0a7fde65dad12c41e8a86d0988fd7e4eefadf417a47c25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(identifier) == 0 || len(password) == 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6e5f41fdf92990bd0c024e52398f01d887136782f88707542768de4a2a8dac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(key) \u003C= len(prefix) || !strings.EqualFold(key[:len(prefix)], prefix)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f76801189068ddf6fb9266d42b205ea06cf12895c12702be20a54228f1ec36f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(normalized) \u003C 10 || len(normalized)%2 != 0 || (normalized[:2] != \u002200\u0022 \u0026\u0026 normalized[:2] != \u002201\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/vastbase-go/spatial.go, agents/drivers/xugu/spatial.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b8d02d152d17bc1a65055eb92e74f478a2d28c3c3a9223c6b0e09d323e314d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(result.Rows) \u003C pageSize \u0026\u0026 session.remaining \u003E 0\u0060 appears character-identically in 4 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/oracle-go/main.go, agents/drivers/vastbase-go/main.go, agents/drivers/xugu/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4c7a99592b2f8a7390a20390b291ddc6265a5391110b696a562c1eda75fe6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(sqlText) \u003C len(keyword) || !strings.EqualFold(sqlText[:len(keyword)], keyword)\u0060 appears character-identically in 2 files \u2014 agents/drivers/oracle-go/main.go, agents/drivers/xugu/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6585}}}],"partialFingerprints":{"codehealthFindingId/v1":"272ad675786f3054e5572430a5c06cce7431c8687ef15418274ade44462314a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(value) \u003E= 2 \u0026\u0026 ((value[0] == \u0027\u0022\u0027 \u0026\u0026 value[len(value)-1] == \u0027\u0022\u0027) || (value[0] == \u0027\\\u0027\u0027 \u0026\u0026 value[len(value)-1] == \u0027\\\u0027\u0027))\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe39962795566e5968109e39eceaba327f380532e76cdcbd4533c6fea966c82a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(value) \u003E= 2 \u0026\u0026 value[0] == \u0027\u0022\u0027 \u0026\u0026 value[len(value)-1] == \u0027\u0022\u0027\u0060 appears character-identically in 4 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go, agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/oracle-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a28b53776da39686292bc1789ce9a5f5e158cc41488a96bb493aa6f0acab8c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(value) \u003E= 2 \u0026\u0026 value[0] == \u0027\\\u0027\u0027 \u0026\u0026 value[len(value)-1] == \u0027\\\u0027\u0027\u0060 appears character-identically in 3 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go, agents/drivers/xugu/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8a17c9f0236a37d4e5796fc5f09e04e817f06b5723f59760b4ffa0ed9c8c49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(values) \u003C pageSize \u0026\u0026 state.remaining \u003E 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/query.go, agents/drivers/hive-go/query.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58f68058c3c36f8ec7dea7eba22d57313b8da2f5d49fac213112d26747bfe7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060length \u003C -1 || length \u003E zooKeeperMaxFrameSize/4\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/zookeeper_protocol.go, agents/drivers/hive-go/zookeeper_protocol.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b7009d5e010828ed3e3d1b039fa331164c58ba469a496bb006ec9814b77d76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060length \u003C 0 || decoder.offset \u003E len(decoder.data)-length\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/zookeeper_protocol.go, agents/drivers/hive-go/zookeeper_protocol.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc21a1e1c5a8edc0774c565fa18b7aaaa80c2821f54f0b04cec0ea5595a9717"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060length \u003C 0 || length \u003E zooKeeperMaxFrameSize\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/zookeeper_protocol.go, agents/drivers/hive-go/zookeeper_protocol.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"914c1d0c23271c71356536c3f1ec7e0b2b7ecfeb5aff5fdc8d19cc203346a0d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line == \u0022\u0022 || strings.HasPrefix(line, \u0022#\u0022) || strings.HasPrefix(line, \u0022--\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a8ad59ec1d6fb590716cce908d8115252e53a580b62f49dc8376fdd0d8ffe3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == \u0022\u0022 || !metadataNameMatches(name, constraints.Filter)\u0060 appears character-identically in 3 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go, agents/drivers/iotdb/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bec98d71331e6c1e2808f611d098cf121347d48bc5b24282c3c63a1e9f5777c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == \u0022\u0022 || strings.HasPrefix(name, \u0022#\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d9f841b82341d43cd102ad1c2dd6cca524a69eb3c139a557ffa539afce0c93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized == \u0022geometry\u0022 || normalized == \u0022geography\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/vastbase-go/spatial.go, agents/drivers/xugu/spatial.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc2a54524817d35cf80616243b362a5b183c4deb49884cc102194c25cd0486c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized == \u0022tablename\u0022 || normalized == \u0022tabname\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"e357327429490c503afcd736a58a22eb526f62f053566a0821bb99c4fb7813d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060objectType != \u0022PROCEDURE\u0022 \u0026\u0026 objectType != \u0022FUNCTION\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/oracle-go/pldebug.go, agents/drivers/oracle-go/pldebug_target.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug.go"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd66b96f325ed1299f077de0c4ce1dc512d6aeb863d41fb45590258655c3ba42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ok \u0026\u0026 strings.EqualFold(strings.TrimSpace(key), \u0022sslmode\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fe0e8fb8e1c4e4ee09a58ed43d8e71a339404e6ea9142e0565b713e2897e3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.ServerName == \u0022\u0022 \u0026\u0026 config.ZooKeeperKerberos.Realm != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/zookeeper_protocol.go, agents/drivers/hive-go/zookeeper_protocol.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/zookeeper_protocol.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6245ca648676b4ce27f25e712ac7f36542f4e8b8abb18ebe5cf563dc013a44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parameter(values, \u0022keystorepassword\u0022) == \u0022\u0022 \u0026\u0026 credentialProviderPath != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbca3f9f899a025b5bc48493c3d2dcfe1dd96b45689a0a996ea566a3f86ce76a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parameter(values, \u0022truststorepassword\u0022) == \u0022\u0022 \u0026\u0026 credentialProviderPath != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1041af3d92afcd971e74f9c62df53f3f65aa60cb5e27436b3cf97b1e974998"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parameterBool(values, \u0022kerberoschannelbinding\u0022) || parameterBool(values, \u0022tlschannelbinding\u0022) || parameterBool(values, \u0022channelbinding\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"b113439df9f9d3e9ecc2044bf1813c6009f6132294e66ab38445ee7202302837"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parameterBool(values, \u0022sslinsecureskipverify\u0022) || parameterBool(values, \u0022allowselfsigned\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a9fa7e387ce9ea3fab5cc41b658d4320c4be0399eab3bfa89168acf9692165"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parameterBool(values, \u0022usekeytab\u0022) || kerberos.KeytabPath != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfe01ebf56beacb36f88c0086b7a940c52f3d0f2915a442e6a689db545df721"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parameterBool(values, \u0022useticketcache\u0022) || kerberos.CCachePath != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a2dcd19439eb7e1119d49d2e3405c00ad0bd5281269bca57f094585ecc3a7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060params.ClientCertPath != \u0022\u0022 || params.ClientKeyPath != \u0022\u0022\u0060 appears character-identically in 3 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go, agents/drivers/neo4j-go/driver.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc391621467fda59aab8ac506aa86f68489428ce97dabf831a983d450b7e5c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060params.ClientCertPath == \u0022\u0022 || params.ClientKeyPath == \u0022\u0022\u0060 appears character-identically in 3 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go, agents/drivers/neo4j-go/driver.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"a504bdded407d373000abc7d1bcf2a031e5faf3f3eaf84611674428cb7836456"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060params.SSL || parameterBool(values, \u0022ssl\u0022) || strings.EqualFold(parameter(values, \u0022ssl\u0022), \u0022true\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92f122f0d82653a94872ab52c3586ac838901610f328f24ae3de4ec66ac719a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relkind.Valid \u0026\u0026 relkind.String != \u0022\u0022 \u0026\u0026 relkind.String != \u0022c\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e291f229e43214b762096932865f9fa61e32e749417c0f2737d01f3bc9ed88"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.StatusCode \u003C 200 || response.StatusCode \u003E= 300\u0060 appears character-identically in 3 files \u2014 agents/drivers/etcd2-go/client.go, agents/drivers/etcd2-go/watch.go, agents/drivers/rabbitmq/management.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/client.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"6beb8c40c3519f32ab2646cd8367a643f21ce0f87688ad0a0a1d41c4557994b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime != nil \u0026\u0026 runtime.references == 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/cassandra-go/runtime.go, agents/drivers/neo4j-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/runtime.go"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba393008bd7b9db049e92fcee742bc0a8906b4b88a721c051996f219de2c131"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime != nil \u0026\u0026 runtime.references \u003E 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/cassandra-go/runtime.go, agents/drivers/neo4j-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cassandra-go/runtime.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"11262bc7b1602e089a7bf63fdc9f4a53b619b6ea2f5306d1af25d27e8411734a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime.GOOS == \u0022windows\u0022 \u0026\u0026 kerberos.ConfigPath == \u0022\u0022 \u0026\u0026 kerberos.KeytabPath == \u0022\u0022 \u0026\u0026 kerberos.CCachePath == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced4c792547cc02be609c6b872e76d106f9c2a5219d74841fe9c439c6f55da86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.connectionRuntime != nil \u0026\u0026 !s.sessionAffinity\u0060 appears character-identically in 2 files \u2014 agents/drivers/vastbase-go/runtime_pool.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/runtime_pool.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fcb44745ab69d5971546e254123e4bf6dc6c5eaed07a4a530429d941dd11c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060schema == \u0022\u0022 || strings.EqualFold(schema, server.config.Database)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/query.go, agents/drivers/hive-go/query.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"02419828cc861393c27193130169c5c543b6c75b941d8ff2d2ff4fa869e2475e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060schema == \u0022pg_catalog\u0022 || schema == \u0022information_schema\u0022 || strings.HasPrefix(schema, \u0022pg_toast\u0022) || strings.HasPrefix(schema, \u0022pg_temp\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d401bf110c95a6a1c5aa3879d1364d8cae11a5639e248a38b9ed8b7b7950b472"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060server.supportsRoutines() \u0026\u0026 acceptsRoutineType(constraints.ObjectTypes, \u0022FUNCTION\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f5e8c1513529f9c4c779f909bf657b03241c60b2eebaa91b37e54366949acb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060server.supportsRoutines() \u0026\u0026 acceptsRoutineType(constraints.ObjectTypes, \u0022PROCEDURE\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"f020479af57b37ea1003495bc2bf2bb9b41c7a3c8d02c3e66fbc3d371fa2415c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060socks.Username != \u0022\u0022 || socks.Password != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/rocketmq/proxy.go, agents/drivers/rocketmq/routing.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/proxy.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"652861cc31b5c75ed75ffd6ae16590fef4b16a4b099c34583bd556a023c67824"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stage == \u0022connect\u0022 || stage == \u0022validate\u0022\u0060 appears character-identically in 11 files \u2014 agents/drivers/argo-go/protocol_error.go, agents/drivers/cassandra-go/protocol_error.go, agents/drivers/etcd-go/protocol_error.go, agents/drivers/etcd2-go/protocol_error.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"794e386ff8dccb61cab8891619f0e4e1f23e94a261d492b361e49bd037c1c016"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stage == \u0022request\u0022 || stage == \u0022connect\u0022 || stage == \u0022validate\u0022\u0060 appears character-identically in 5 files \u2014 agents/drivers/argo-go/protocol_error.go, agents/drivers/hive-go/protocol_error.go, agents/drivers/iotdb/protocol_error.go, agents/drivers/nebula-go/protocol_error.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/protocol_error.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"326200ebdddb27a9093a58781eb1df4923872ff21577c3a55b55c735706a9764"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.pending != nil \u0026\u0026 state.remaining \u003E 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/query.go, agents/drivers/hive-go/query.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/query.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9741c7042705c9f67bbf98701609a0cc8ebe64c9e54fd22f40a6ec360b549ef0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.Contains(normalized, \u0022char\u0022) || strings.Contains(normalized, \u0022text\u0022) || strings.Contains(normalized, \u0022string\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5031db3fb34181a8c334e500c1379e35c1afe23804171b44ad11bddaf96a70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.Contains(warning, \u0022domain constraints\u0022) || strings.Contains(warning, \u0022default value could not be rendered\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb87bf7357e02605da50f2176118bb7506539dd289e35ed95d8b78d01cff889b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.EqualFold(config.Auth, \u0022JWT\u0022) \u0026\u0026 config.JWT == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"8496f6f2cdefdbf19e4e34aee131549c86cf0c89c1f0b5fbe4a9451e2fb2ff79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.EqualFold(config.ServiceDiscoveryMode, \u0022zookeeper\u0022) || strings.EqualFold(config.ServiceDiscoveryMode, \u0022zookeeperha\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/discovery.go, agents/drivers/hive-go/discovery.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/discovery.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"558448f5d7b79b9c9e283f457b748a32650e8c5d94edf14c0e5e0c7597f939e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.EqualFold(config.ServiceDiscoveryMode, \u0022zookeeperha\u0022) \u0026\u0026 parameter(values, \u0022zookeepernamespace\u0022) == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84af90bf24fa3980429084afaf1ace5bfd89698242011f40622df3829982006"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.EqualFold(databaseType, \u0022impala\u0022) || strings.EqualFold(databaseType, \u0022kyuubi\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/connector.go, agents/drivers/hive-go/connector.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"121bf56d1c6c7b5cf266a4649191b1610fb2257ac6c8b76a7d6237f838f55be1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.EqualFold(mode, \u0022zookeeper\u0022) || strings.EqualFold(mode, \u0022zookeeperha\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"75075ada46e8790abf9cf8ccd1e8a0ff7514658cf9836fd285d3425fbff72694"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.EqualFold(normalizeTableType(allowed), normalizeTableType(kind)) || strings.EqualFold(allowed, kind)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3527}}}],"partialFingerprints":{"codehealthFindingId/v1":"2849bbe94b2267189e1d65ef44e0d5d9b5b4f36988c9d0847e1d6462467be73f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.EqualFold(objectType, \u0022PROCEDURE\u0022) || strings.EqualFold(objectType, \u0022FUNCTION\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df69efdb43b9bed976f07fffa3b7e6460b39794ff2915071c1ccc2423b7cb7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.EqualFold(objectType, \u0022table\u0022) || strings.EqualFold(objectType, \u0022view\u0022) || strings.EqualFold(objectType, \u0022materialized view\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6da053fb9ebb65add938954181ebcf74d27fd9529fde230af6d08690fe83856"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.EqualFold(server.config.Auth, \u0022BROWSER\u0022) \u0026\u0026 strings.TrimSpace(server.config.BrowserToken) == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/main.go, agents/drivers/hive-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/main.go"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04d84af2a59df30a589cd0d785caea371fac3019b62a5952d38bcfae809655c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.EqualFold(strings.TrimSpace(item.kind), \u0022f\u0022) \u0026\u0026 item.refSchema.Valid \u0026\u0026 item.refTable.Valid\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71068178f1ba11df03448398cb0a8f17594eddb9ab3cb1863f77fbc43b2e364"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.HasPrefix(endpoint, \u0022http://\u0022) || strings.HasPrefix(endpoint, \u0022https://\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/etcd-go/client.go, agents/drivers/etcd2-go/client.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/client.go"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eba647b244edec86f762761c8b14a7710de88827dc747b7cf5c23b7be6e98ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.HasPrefix(normalized, \u00220x\u0022) || strings.HasPrefix(normalized, \u00220X\u0022) || strings.HasPrefix(normalized, \u0060\\x\u0060) || strings.HasPrefix(norma\u2026\u0060 appears character-identically in 2 files \u2014 agents/drivers/vastbase-go/spatial.go, agents/drivers/xugu/spatial.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/spatial.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"957c07eeae654709c7c77680177bf0290ca6b6de0d45d951501d53c91ebe7bac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.HasPrefix(value, \u0022[\u0022) \u0026\u0026 strings.HasSuffix(value, \u0022]\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dc9f21f3baa9da18b516fc587be151684d2c1fb2d5b559866f41c875be8691"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.HasPrefix(value, \u0060\u0022\u0060) \u0026\u0026 strings.HasSuffix(value, \u0060\u0022\u0060) \u0026\u0026 strings.Contains(value, \u0060\u0022.\u0022\u0060)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b89032f2c2682c0f5b1e4d0a941a72b57662a62a84dcb267f9a753af6d4756"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.TrimSpace(database) == \u0022\u0022 \u0026\u0026 strings.TrimSpace(schema) == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dbdf3f149afe6bca7eb8caf1c0c95232c68174a3bb04ff30285dde938e1a62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.TrimSpace(host) == \u0022\u0022 || port \u003C= 0 || port \u003E 65535\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"b948d0541deed766130a89e3bb695c192029549a07e64fcea9aa083b631b8e94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tableComment != nil \u0026\u0026 strings.TrimSpace(*tableComment) != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2958}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e578e7be1ed7afd7341e875cd3d744a4d611e43d739fd96c00dc1b46ae1ba8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.Auth != \u0022\u0022 \u0026\u0026 !config.AuthExplicit\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/connector.go, agents/drivers/hive-go/connector.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d560fb621b9e7e825e13ae9b5aeea50adf1082f887702f2bd4e163f7e138a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.HTTPPath != \u0022\u0022 \u0026\u0026 !config.HTTPPathExplicit\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/connector.go, agents/drivers/hive-go/connector.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c851ce2cd2b93f984ec8b1b736548f672688d1dcde999bb37e952cb8713daef5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.Principal != \u0022\u0022 \u0026\u0026 !config.Kerberos.ServerPrincipalExplicit\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/connector.go, agents/drivers/hive-go/connector.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02313c6cc6105ee6222a9582fda7e2c975c43fe2b27cec7ccb35588225aa05a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.SSL \u0026\u0026 tlsConfig == nil \u0026\u0026 !config.TLSExplicit\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/connector.go, agents/drivers/hive-go/connector.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7f92dfe81bdfe8a45c6a7c23b4f4020fa8d702d273338ff3eb2df728e1b89c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.TransportMode != \u0022\u0022 \u0026\u0026 !config.TransportModeExplicit\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/connector.go, agents/drivers/hive-go/connector.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f5ef32d320622807d253b60d1ca706caca8443c8bf233e09af598c6926490d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tlsConfig.ServerName == \u0022\u0022 || tlsConfig.ServerName == config.Endpoints[0].Host\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/connector.go, agents/drivers/hive-go/connector.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/connector.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6705efcd91f7052b98c5919a7c96db356e9476e35859ec9e7deb9edf2f9aa7b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed == \u0022\u0022 || strings.HasSuffix(trimmed, \u0022;\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2574f77fadeb26348fc0e6150be07e0e56c8080420deb988f35f416ece8cf7a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trustStoreLocation == \u0022\u0022 \u0026\u0026 config.RootCAs == nil\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d82b955194c574709876b4d38a036200680f38b02365136d24e63345f87020"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typdefault.Valid \u0026\u0026 typdefault.String != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"956aea906e9bdbc23b279392cb2aeaa33d7433909340ea41004d67f298a2c4d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060undefined \u0026\u0026 strings.Contains(normalized, strings.ToLower(columnName))\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03c12a14af320e267ae3e80f29b7c6e9de9b80621e4c6d9aa2df9975b0e06d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060undefined \u0026\u0026 strings.Contains(normalized, strings.ToLower(functionName))\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a9e912cd8ac572ec7c1dbdcdafa70495262247f064a89afb67cb4e6065b475"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060undefined || strings.Contains(normalized, \u0022does not exist\u0022) || strings.Contains(normalized, \u0022\u4E0D\u5B58\u5728\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/kingbase_metadata.go, agents/drivers/vastbase-go/vastbase_metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"b655cc05a835c30ec2430b46d2a18205aa4fe14d6e803b313b79c19b59d41ae7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value == \u00221\u0022 || value == \u0022true\u0022 || value == \u0022yes\u0022 || value == \u0022on\u0022\u0060 appears character-identically in 3 files \u2014 agents/drivers/argo-go/config.go, agents/drivers/hive-go/config.go, agents/drivers/iotdb/driver.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/config.go"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c039cbbe5cf9f13937ad2e1cf946c38a30c864a529c50be51035c223d338ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value == \u0027 \u0027 || value == \u0027\\t\u0027 || value == \u0027\\n\u0027 || value == \u0027\\r\u0027 || value == \u0027\\f\u0027\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3e15aaf73c090990ab567f21269eaa12839b3af6a40ff72285c54ae859ed99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value[index] == \u0027\\\\\u0027 \u0026\u0026 index\u002B1 \u003C len(value)\u0060 appears character-identically in 2 files \u2014 agents/drivers/kingbase-go/main.go, agents/drivers/vastbase-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca5b151567e4fb33222acb9d365102ffa857ce9500f37d8f0fe262db85ef2e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060visibleSchemas != nil \u0026\u0026 !visible[database.Name]\u0060 appears character-identically in 2 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5b44639fc81b7b1dc0effb03a6bbfdbd36a499d5d7fe2967273d68a7944e86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060visibleSchemas != nil \u0026\u0026 len(visibleSchemas) == 0\u0060 appears character-identically in 3 files \u2014 agents/drivers/argo-go/metadata.go, agents/drivers/hive-go/metadata.go, agents/drivers/oracle-go/main.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"da86b6bc597d0cedd993fef16f22c9994fcb8068247a6f382033dffdd55f81c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060w.terminalReason != \u0022\u0022 \u0026\u0026 len(w.batches) == 0\u0060 appears character-identically in 2 files \u2014 agents/drivers/etcd-go/watch.go, agents/drivers/etcd2-go/watch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/watch.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0f7c5d4bd9045b508fdc7101b74ff08dd1d4af3219bb0833e8344ca49db113"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!constraints.hasFilter() \u0026\u0026 !constraints.hasLimit() \u0026\u0026 !constraints.hasOffset() \u0026\u0026 !constraints.hasObjectTypes()\u0060 appears character-identically in 8 files \u2014 agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java, agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java, agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java, agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/bigquery/src/main/java/com/dbx/agent/bigquery/BigQueryAgent.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"164c7ab95a3bf91883414197fa2c9cb6675d3253bfe78537213f4860cd1cc718"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!nextDate.matches(\u0022[0-9]{4}-[0-9]{2}-[0-9]{2} [0-9]{2}:[0-9]{2}:[0-9]{2}\u0022) || LocalDateTime.parse(nextDate, DATE).getYear() \u003C 1\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java, plugins/jdbc/src/main/java/app/dbx/jdbc/NativeLegacyJobSession.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a6d3879123158a0d37a4bf2337502b756bf602231f6f26df37399b013f5603"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!normalized.contains(\u0022char\u0022) \u0026\u0026 !normalized.contains(\u0022text\u0022)\u0060 appears character-identically in 3 files \u2014 agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java, agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java, agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b42788478ec03cef6ac220f9c7c86f752134f15a49915c49052bbf63a89c606"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!params.has(\u0022agentSessionId\u0022) || params.get(\u0022agentSessionId\u0022).getAsString().trim().isEmpty()\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java, agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd57b9975dbe8225e979cfa4c7c05ebc5721bffe1cc4683195ddb346bd33cc8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!requestedToken.isEmpty() \u0026\u0026 !token.equals(requestedToken)\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/NativeJobSession.java, plugins/jdbc/src/main/java/app/dbx/jdbc/NativeJobSession.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/NativeJobSession.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e87b1ca21db36b3c990f5b4cf960f1d2a64534b29b2c5d6b583098eabeba412"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value.isJsonPrimitive() || !value.getAsJsonPrimitive().isString()\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java, agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e59a4bd2a68900b9257753f54a395440ea257e1bfa6608ba39ff1c911dbd86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022numeric\u0022.equals(normalized) || \u0022decimal\u0022.equals(normalized)\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/DdlBuilder.java, plugins/jdbc/src/main/java/app/dbx/jdbc/GenericJdbcDdlBuilder.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e41acf04bfb52a7fef2c94403061af21755564caa2c1775bab4e6b4918a8ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022timestamp_tz\u0022.equals(kind)||\u0022timestamp_ltz\u0022.equals(kind)\u0060 appears character-identically in 2 files \u2014 agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java, agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugTemporalJson.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e0082e58f5414efa12b0da0b4396ac37687a18e5d2db7567342a81bd3aac66"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cache != null \u0026\u0026 !\u00220\u0022.equals(cache.trim())\u0060 appears character-identically in 2 files \u2014 agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java, agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"e979b6380926b44fc52f8a0cc2849b3f7a92fd892eb9cb211874481abb44c6d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.contains(filter) || (filter.length() \u003E= 2 \u0026\u0026 fuzzySubsequenceMatches(candidate, filter))\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java, plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"146770f1f52d3da8449ed3fba0f5791c23fe9f7ac401d999ec7e2a2db8d94f0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch == \u0027-\u0027 \u0026\u0026 index \u002B 1 \u003C sql.length() \u0026\u0026 sql.charAt(index \u002B 1) == \u0027-\u0027\u0060 appears character-identically in 2 files \u2014 agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java, plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f9b9b3e3da14ee7473648ef63d76f01a13933afcb18a9f272c18f2fce0a8d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch == \u0027/\u0027 \u0026\u0026 index \u002B 1 \u003C sql.length() \u0026\u0026 sql.charAt(index \u002B 1) == \u0027*\u0027\u0060 appears character-identically in 2 files \u2014 agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java, plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2ExplainPlan.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1abba4b9d7a5cf5e9ea455b23781b88e1816d8c3b7b687862d0ba5748b57b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060comment != null \u0026\u0026 !comment.trim().isEmpty()\u0060 appears character-identically in 4 files \u2014 agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java, agents/common/src/main/java/com/dbx/agent/PostgresLikeAgent.java, agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java, agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3378c8adb848368db114bcb5533dde26625cc715e86f7bce83a3d471347f9d90"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060connectionString != null \u0026\u0026 !connectionString.trim().isEmpty()\u0060 appears character-identically in 4 files \u2014 agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java, agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java, agents/drivers/ignite3/src/main/java/com/dbx/agent/ignite3/Ignite3Agent.java, agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fdebb54fcb5a851b41ce28516904a4e98ab6d172a8da0351667dc536f33c91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.includesTableLikeTypes() || constraints.objectTypeAllowed(\u0022PROCEDURE\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java, agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/db2/src/main/java/com/dbx/agent/db2/Db2Agent.java"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"4895bda317469e4be62b12986881762905e5f46b78ab060ee4d63078a40d452b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.includesTableLikeTypes() || constraints.objectTypeAllowed(\u0022PROCEDURE\u0022) || constraints.objectTypeAllowed(\u0022FUNCTION\u0022)\u0060 appears character-identically in 3 files \u2014 agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java, agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java, agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"370ed8cf73abf0ab7acb212e6fc47d41cda527c472e9d0ff905849852cce741b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.objectTypeAllowed(\u0022PROCEDURE\u0022) || constraints.objectTypeAllowed(\u0022FUNCTION\u0022)\u0060 appears character-identically in 3 files \u2014 agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java, agents/drivers/goldendb/src/main/java/com/dbx/agent/goldendb/GoldendbAgent.java, agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2Agent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde5791ad6053b96447b7ca8110cfa4dd01c7aaf44c937fa497627aee6e3620d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deadlineNanos != 0 \u0026\u0026 System.nanoTime() \u003E= deadlineNanos\u0060 appears character-identically in 2 files \u2014 agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompile.java, agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSource.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompile.java"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"126bf198ac782117b13eb2f86d7e380fec9b51877366a225534fe77ab69df4bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060element == null || element instanceof JsonNull\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java, agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0aabd7cd67126f63e26975611b5bf4016e417a6c46443c3006dadeb734446c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060end \u003E 0 \u0026\u0026 contains(chars, value.charAt(end - 1))\u0060 appears character-identically in 2 files \u2014 agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java, agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5a45ecab2223c44552beefc8d0c8c09af380ceb15f28342dd91b40f1ac3541"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expression != null \u0026\u0026 !expression.isBlank()\u0060 appears character-identically in 2 files \u2014 agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java, plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/OceanBaseOracleAgent.java"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bb54c8357ca1aff447a6960fbe0bde7b9ef27122837d916bb78a1100e3aaec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host.matches(\u0022\\\\d{1,3}(\\\\.\\\\d{1,3}){3}\u0022) || host.contains(\u0022:\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java, agents/drivers/informix/src/main/java/com/dbx/agent/informix/InformixAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"50faa97a477e99c4efdb85316f77b7729b01f1ddec936d90ceb758b6b6471760"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060id.isEmpty() || id.length() \u003E 128 || id.indexOf(\u0027\\0\u0027) \u003E= 0\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/NativeJobSession.java, plugins/jdbc/src/main/java/app/dbx/jdbc/NativeJobSession.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/NativeJobSession.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ae474b11562e39cfe2c56010b4430426003a5a1785183e9bf48f15f1c1eedc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060increment != null \u0026\u0026 !\u00221\u0022.equals(increment.trim())\u0060 appears character-identically in 2 files \u2014 agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java, agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d66d0e55f413e0495d40bf0ec2e605416c547ff3a728fa98c71afab794084d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isCharacterType(normalized) \u0026\u0026 characterLength != null \u0026\u0026 characterLength \u003E 0\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/DdlBuilder.java, plugins/jdbc/src/main/java/app/dbx/jdbc/GenericJdbcDdlBuilder.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DdlBuilder.java"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d3983202a2d1a746b2f6be969df7901a331a52f487f9b1724ec3a720db777b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060jdbcMajor != null \u0026\u0026 jdbcMinor != null \u0026\u0026 jdbcMajor \u003E= 0 \u0026\u0026 jdbcMinor \u003E= 0\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/JdbcDatabaseInfo.java, plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcDatabaseInfo.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5001a0a57624999a54429d99324d69a4588acf5e23610e137330b54d6e53fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kinds.contains(CompletionAssistantObjectKind.TABLE) || kinds.contains(CompletionAssistantObjectKind.VIEW)\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java, agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"86321e662e796f3dcf269ef4660448a604f1622b962dfea4246073d1c0497c93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060minValue != null \u0026\u0026 !\u00221\u0022.equals(minValue.trim())\u0060 appears character-identically in 2 files \u2014 agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java, agents/drivers/oscar/src/main/java/com/dbx/agent/oscar/OscarAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8e845aeffbfb95c7420350dd051d8926a152c7ae7634de7c8f2755c2f6daf9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == null || name.isBlank() || column == null || column.isBlank()\u0060 appears character-identically in 2 files \u2014 agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java, plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/ignite/src/main/java/com/dbx/agent/ignite/IgniteAgent.java"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01f33ba8f986fcc1b8d2ba9238f1059f350b941de8b097acb68010ceb0891f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.equals(\u0022user\u0022) || name.equals(\u0022username\u0022) || name.equals(\u0022password\u0022)\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java, plugins/jdbc/src/main/java/app/dbx/jdbc/JdbcConnectionParameters.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fe25b3a547588654d18d1fa61b93afcb9136a73468bbdb23fd03c03c57cf25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060operationId == null || !operationId.matches(\u0022[A-Za-z0-9_-]{1,128}\u0022)\u0060 appears character-identically in 3 files \u2014 agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java, agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompile.java, agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugManager.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3ac669b187eba702878ad1f4c6d94841a60990191c2c1dc8d01961189d55d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parentSchema != null \u0026\u0026 !parentSchema.trim().isEmpty()\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java, agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d08df1aed17c16bc144bdfd40c65c0eeb9bea93dcfa74dc990369e0381f997"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060planText == null || planText.trim().isEmpty()\u0060 appears character-identically in 2 files \u2014 agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java, plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3613}}}],"partialFingerprints":{"codehealthFindingId/v1":"0907c37411a50e139839d21d02475e6c66e368ad01c1a854a6a33053497bc2c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060property == null || property.name == null || property.name.isBlank()\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java, plugins/jdbc/src/main/java/app/dbx/jdbc/JdbcConnectionParameters.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fe84edbe807b96040bd503bfcd62117089f27357aca9972f4d1f135cb8fd3d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.has(\u0022params\u0022) \u0026\u0026 req.get(\u0022params\u0022).isJsonObject()\u0060 appears character-identically in 2 files \u2014 agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java, agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kafka/src/main/java/com/dbx/agent/kafka/KafkaAgent.java"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde4192679446a894c5822c0d25cd56c7abd8723f914ea59cef3a8c7ddc2c2be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.get(prefix\u002B\u0022OWNER\u0022)!=null||row.get(prefix\u002B\u0022PACKAGE\u0022)!=null\u0060 appears character-identically in 2 files \u2014 agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java, agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeOutput.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugCompositeInput.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba95c16c3d2a67fa722d7fc2025b2b0ab0e9091a5dc7baab91c10cbe3492e3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060schema != null \u0026\u0026 !schema.trim().isEmpty()\u0060 appears character-identically in 6 files \u2014 agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java, agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java, agents/drivers/gbase8a/src/main/java/com/dbx/agent/gbase8a/Gbase8aAgent.java, agents/drivers/saphana/src/main/java/com/dbx/agent/saphana/SapHanaAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/DatabaseAgent.java"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"569e70cdc708b78592ccc3ad4e5d9ef677ee402f42333705409322fa56a78504"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060schema == null || schema.trim().isEmpty()\u0060 appears character-identically in 5 files \u2014 agents/common/src/main/java/com/dbx/agent/JdbcSchemaSwitcher.java, agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java, agents/drivers/databend/src/main/java/com/dbx/agent/databend/DatabendAgent.java, agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcSchemaSwitcher.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8248f024b5a717f0fe877934ac65051a7c8e6c563fd46b834e58c4f2a467ac0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060schema.isEmpty() || schema.equals(rows.getString(9))\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java, plugins/jdbc/src/main/java/app/dbx/jdbc/NativeLegacyJobSession.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/NativeLegacyJobSession.java"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"239923a9c4ca8f5c9f6488e82050133eb98d3f192c10b54a2cf8cea28f04c3b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sessions.size() \u003E= MAX_SESSIONS \u0026\u0026 !sessions.containsKey(sessionId)\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java, agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbef480d2e898e611d08f183989fce1500ec4706a2817ac34248e2c15de00f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060spatial_columns == null || spatial_columns.isEmpty()\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/QueryPageResult.java, agents/common/src/main/java/com/dbx/agent/QueryResult.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/QueryPageResult.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1193c0dd72c0745213d283a190e94e476e8904dd14626d2aa1e88cc183b1673"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060spatial_values == null || spatial_values.isEmpty()\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/QueryPageResult.java, agents/common/src/main/java/com/dbx/agent/QueryResult.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/QueryPageResult.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe725e84ccc2a21a917075446718155d32d2e487b72c2b3ac056c3ee7d7ef4fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060upper.contains(\u0022MATERIALIZED\u0022) \u0026\u0026 upper.contains(\u0022VIEW\u0022)\u0060 appears character-identically in 3 files \u2014 agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java, agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java, plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MetadataListConstraints.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c96df94099598b16745a26d95062b71d0538bff3e166ee0cee0abcfaa0e4fc0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value != null \u0026\u0026 !value.trim().isEmpty()\u0060 appears character-identically in 6 files \u2014 agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java, agents/common/src/main/java/com/dbx/agent/JdbcDatabaseInfo.java, agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java, agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/ConfiguredJdbcAgent.java"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bf6d4bc1a716d26b623f6e056740a73b7c43dcdf50395fb2f4e63d88a91a17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value instanceof Number || value instanceof Boolean\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java, agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a03eb546a89c811a8442560c4496a4d8b5c09340041142f1a6f98260472509"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.equalsIgnoreCase(\u0022true\u0022) || value.equalsIgnoreCase(\u0022false\u0022)\u0060 appears character-identically in 2 files \u2014 agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java, plugins/jdbc/src/main/java/app/dbx/jdbc/JdbcConnectionParameters.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcConnectionParameters.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d67148ec26d4986e6acc2d43c65090bfc6eed5daf42c68fad37a5ff53f630c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.startsWith(\u0022?\u0022) || value.startsWith(\u0022\u0026\u0022) || value.startsWith(\u0022;\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java, agents/drivers/sqlserver-legacy/src/main/java/com/dbx/agent/sqlserverlegacy/SqlServerLegacyAgent.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/access/src/main/java/com/dbx/agent/access/AccessAgent.java"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b566e00749b869877e6a1ed33b9f41010b4b9596b9c7f7a8e63c3c7997a24c63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!databaseType \u0026\u0026 BACKSLASH_ESCAPE_STRING_DIALECTS.has(databaseType)\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/lib/dataGrid/dataGridColumnNameCopy.ts, apps/desktop/src/lib/sql/sqlCompletion.ts, apps/desktop/src/lib/sql/sqlStatementRanges.ts, apps/desktop/src/lib/sql/sqlWithoutCommentsForCopy.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":"apps/desktop/src/lib/dataGrid/dataGridColumnNameCopy.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0ce220fe873787f35c30de816bcbcaf699d5ecabd36cf36d44f91a12f11324"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!layout \u0026\u0026 (layout.groups.length \u003E 0 || layout.order.length \u003E 0)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sidebar/sidebarLayout.ts, apps/desktop/src/lib/table/tableVGroup.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":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"85db73a805014b81184671311799822bfa07e049c11429e2d7889ac88b0a73c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!schema \u0026\u0026 normalized !== \u0022information_schema\u0022 \u0026\u0026 normalized !== \u0022sys_catalog\u0022 \u0026\u0026 !normalized.startsWith(\u0022pg_\u0022)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/databaseAuthorizationPlan.ts, apps/desktop/src/lib/database/databaseUserAdmin.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":"apps/desktop/src/lib/database/databaseAuthorizationPlan.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e7187d1007bcac84d5f4f202c5f4916e864d8703bea6e39314c3ccad8e7391"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!value \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 6 files \u2014 apps/desktop/src/lib/app/documentStoreProvider.ts, apps/desktop/src/lib/connection/connectionDatabaseInfo.ts, apps/desktop/src/lib/connection/connectionUrl.ts, apps/desktop/src/lib/elasticsearch/elasticsearchCompletion.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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f265421ccc5fc92fe305a129fadf0b6e9f0b67b37ed1e7a25375d7fca8bc1889"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(minX) || !Number.isFinite(minY)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/diagram/ltr-auto-layout.ts, apps/desktop/src/lib/diagram/size-layer.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":"apps/desktop/src/lib/diagram/ltr-auto-layout.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3480a3540a73566a0cd34dfdc650dd0461b0f76405d39df828fa2e1273549ed2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(rowIndex) || !Number.isInteger(colIndex) || rowIndex \u003C 0 || colIndex \u003C 0\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useDataGridSelection.ts, apps/desktop/src/lib/dataGrid/dataGridSelectionPersistence.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":"apps/desktop/src/composables/useDataGridSelection.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"5109d727d9948223c9ed5af8ed4a361a3b9442eb8a384e8b860662df487d6831"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(offset) || offset \u003C 0\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/dataGridPagination.ts, apps/desktop/src/lib/sql/sqlDiagnostics.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":"apps/desktop/src/lib/dataGrid/dataGridPagination.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adae4142675168d026319d9cfcab6c7e8929450657a62a56056ecfe770cc7e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(value) || value \u003C 0\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/mongo/mongoShellCommand.ts, apps/desktop/src/lib/mq/mqPeekFilters.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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81e24aada0dd4221affaaa0b74f8caa1360b075639e5e418eb9f2fff63d5e8b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!config || !store.connectedIds.has(target.connectionId)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/oracleTriggerPlan.ts, apps/desktop/src/lib/database/oracleTriggerStructurePlan.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":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f070df52300d16d810f5fba38070bbd65cf0d4aed34a382ec413f9f62ba0e6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!connection || connectionIsEffectivelyReadOnly(connection)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/databaseNamespaceCreation.ts, apps/desktop/src/lib/database/databasePropertyEditing.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":"apps/desktop/src/lib/database/databaseNamespaceCreation.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bf802d86491a92c8fac7900737c2b7220729d109caa35a04d3a47fe486453a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!connectionId || !database || !collection\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useDataGridTableMetadataLoaders.ts, apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.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":"apps/desktop/src/composables/useDataGridTableMetadataLoaders.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e7d94e5cd47b4f169dfd2634731572233e7b82031204b69457adf71bd18854"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!current || connectionConfigFingerprint(current) !== fingerprint\u0060 appears character-identically in 5 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/composables/useDataGridLargeValues.ts, apps/desktop/src/composables/useSidebarTreeExportRuntime.ts, apps/desktop/src/lib/export/oracleObjectExport.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4261180097e5492958131bfd3e56c9aa52e4a0d602020669252e36b497d01e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!current || current.status !== \u0022running\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useMultiDbExecution.ts, apps/desktop/src/composables/useScheduledDatabaseBackups.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":"apps/desktop/src/composables/useMultiDbExecution.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45f5aede9ea6ac139e1dd9c8cbd6cf2da6651f29188aa2823b2f75655adec26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!current.executable || planIdentity(current) !== planIdentity(plan) || !isCurrent()\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/table/oracleRoutineRename.ts, apps/desktop/src/lib/table/oracleTableRename.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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8e23d3f79d2c04d8af0e8209c187252be2c58cae94b9ff1e1f4578924dcb0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!currentView || !props.connectionId || props.database == null\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts, apps/desktop/src/components/editor/useQueryEditorObjectNavigation.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":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"557f3fdc49a042e0ec46e52a636eacacbb6784a889d2b550fb39d45e3edf2d9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!document || typeof document !== \u0022object\u0022 || Array.isArray(document)\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/lib/mongo/mongoDocumentValues.ts, apps/desktop/src/lib/mongo/mongoQueryResultEditing.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"905029c379893730cee95fcd56abe0b7c6a8a1a5ae94478c6d0a577986fb009f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!dragged || !target || dragged.id === target.id\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/stores/savedSqlStore.ts, apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44223f6612ada84a245c9d1f4f6d345b08d8aaadf23ad552b7256417ffc8054"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!item || item.depth !== depth || item.kind !== \u0022word\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/insertValueHints.ts, apps/desktop/src/lib/sql/semantic/model.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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efe5181b7299bcc8861cf36afce326ee949de0def079e7a931d4b1607bfe182"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!options.connectionId || !options.tableName\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/dataGridColumnIndexIcon.ts, apps/desktop/src/lib/dataGrid/dataGridForeignKeyNavigation.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":"apps/desktop/src/lib/dataGrid/dataGridColumnIndexIcon.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"564b28058fd35c85269e25cc672f63884949c2e5ccef357205917e24c85ae80b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!originalDocument || typeof originalDocument !== \u0022object\u0022 || Array.isArray(originalDocument)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/lib/mongo/mongoDocumentValues.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"20db63f589581a2cde3439f7fc9e42667e1cc549e5d3f8407de12d7a15f6720c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || typeof parsed !== \u0022object\u0022 || Array.isArray(parsed)\u0060 appears character-identically in 9 files \u2014 apps/desktop/src/composables/useMqTopicColumnResize.ts, apps/desktop/src/lib/app/documentJsonValues.ts, apps/desktop/src/lib/dataGrid/dataGridFilterModeOrder.ts, apps/desktop/src/lib/document/gridFsBrowser.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":"apps/desktop/src/composables/useMqTopicColumnResize.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ecdda12bcc4ecc22770a0d56fc8658f30770554a883863046c9062b5781ab3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pluginStatus.installed || !pluginStatus.compatible\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/jdbcProductProfile.ts, apps/desktop/src/lib/database/jdbcxBuiltinDriver.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":"apps/desktop/src/lib/database/jdbcProductProfile.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f58aeaecb9e2171b231af5dab3a654e0cfa76a3af5db7c561a66bb1b9fc145"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!preserveDraft || current.value === current.originalValue\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/table/mysqlAutoIncrementCounter.ts, apps/desktop/src/lib/table/mysqlTableEngine.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":"apps/desktop/src/lib/table/mysqlAutoIncrementCounter.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d9d2b7631fe265b3495131bf4b0a6dc5e456464a397b9048f31f2ed4b5d685"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!profile || profile === \u0022mysql\u0022 || profile === \u0022custom_mysql\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sidebar/mysqlObjectTemplates.ts, apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.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":"apps/desktop/src/lib/sidebar/mysqlObjectTemplates.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c57b4badb03709ecdf8c4e4c14c4fe90f727e5e99b08da47647ea60dbf0307"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!props.connectionId || props.database == null\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/components/editor/useQueryEditorCompletion.ts, apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts, apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts, apps/desktop/src/components/editor/useQueryEditorObjectNavigation.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":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68e5c560355af43133b717a8461da6b85e8744d5456821a1bfb4e3c1becf9f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!raw || typeof raw !== \u0022object\u0022 || Array.isArray(raw)\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/composables/useDataCompareConfig.ts, apps/desktop/src/lib/diagram/draft-storage.ts, apps/desktop/src/lib/sql/sqlVariableSyntax.ts, apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/composables/useDataCompareConfig.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12f0eb4709a6117c6a06fdc8dbc9d12a3c932cf06113a8fd2fd967f05aaa757"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!result || !Array.isArray(result.columns) || !Array.isArray(result.rows)\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/database/mysqlProcessList.ts, apps/desktop/src/lib/database/mysqlServerStatus.ts, apps/desktop/src/lib/database/postgresProcessList.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":"apps/desktop/src/lib/database/mysqlProcessList.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4830abf86fa0d82e57fec9309beba1082763fdc659e4bda96731f0c73eaa27c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!status.target || nativeJobRefKey(status.target) !== nativeJobRefKey(details.snapshot.ref)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/nativeJobAdmin.ts, apps/desktop/src/lib/database/nativeJobs.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":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9337dfd911da7cc6a7b3c932967365b8063f71e393688a3d9e1bf97066b711b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0022object\u0022 || Array.isArray(value)\u0060 appears character-identically in 19 files \u2014 apps/desktop/src/composables/useDataCompareConfig.ts, apps/desktop/src/lib/ai/aiPluginConversation.ts, apps/desktop/src/lib/backend/errorUtils.ts, apps/desktop/src/lib/backend/meilisearchTransport.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":"apps/desktop/src/composables/useDataCompareConfig.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddef4eec33856e2ad6c127738313648699616e06780605f096f2727b604c9c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value.startsWith(open) || !value.endsWith(close)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/productionSafety.ts, apps/desktop/src/lib/sql/sqlRisk.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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac9195a5e4e0645b47dee4631b74f767f6a43a8176e0b556ce931c359f4756f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(char === \u0022\u0027\u0022 || char === \u0027\u0022\u0027) \u0026\u0026 current.trim().length === 0\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/app/documentStoreProvider.ts, apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts, apps/desktop/src/lib/sql/sqlInListPaste.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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"890bc2a3faf44de1c2338677277dc2724117b22ef94e38486754b070a39495f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(char === \u0022/\u0022 \u0026\u0026 next === \u0022/\u0022) || (char === \u0022-\u0022 \u0026\u0026 next === \u0022-\u0022)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/mongo/mongoShellCommand.ts, apps/desktop/src/lib/sql/cypherFormatter.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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3896abbf672474365c6182e7a6df0dc1a6dfebd9e831ad82869756f66975a544"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(trimmed.startsWith(\u0027\u0022\u0027) \u0026\u0026 trimmed.endsWith(\u0027\u0022\u0027)) || (trimmed.startsWith(\u0022\u0060\u0022) \u0026\u0026 trimmed.endsWith(\u0022\u0060\u0022)) || (trimmed.startsWith(\u0022[\u0022) \u0026\u0026 trim\u2026\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/sqlMetadataRefresh.ts, apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/lib/sql/sqlMetadataRefresh.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ecfd524137b803d55918fd85d4d314610b806aba86a8abaa7cbe61b96b3085"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(value.startsWith(\u0027\u0022\u0027) \u0026\u0026 value.endsWith(\u0027\u0022\u0027)) || (value.startsWith(\u0022\u0060\u0022) \u0026\u0026 value.endsWith(\u0022\u0060\u0022)) || (value.startsWith(\u0022[\u0022) \u0026\u0026 value.endsWith\u2026\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/sqlCompletion.ts, apps/desktop/src/lib/sql/sqlIdentifier.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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":4901}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41f301af60af64c90826e69540fa12a8d2c9dad3e35994c0ced96d38d066edd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060/[^A-Za-z0-9]/.test(previous) || (/[a-z0-9]/.test(previous) \u0026\u0026 /[A-Z]/.test(current))\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/identifierSearch.ts, apps/desktop/src/lib/sql/sqlCompletion.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":"apps/desktop/src/lib/sql/identifierSearch.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"de01d8301578d5f0b253ecfbe9660519884f91c3ae4e734c6f1b8e586b994b8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060/^-?\\d\u002B$/u.test(property.value) \u0026\u0026 /^-?\\d\u002B$/u.test(value) \u0026\u0026 BigInt(property.value) === BigInt(value)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/graph/graphResult.ts, apps/desktop/src/lib/graph/nebulaGraph.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":"apps/desktop/src/lib/graph/graphResult.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84172de3fde416afd523d3cbe33fd370333f8526519e333e9cb9b6e7dd65640"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(left) || Array.isArray(right)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/nativeJobs.ts, apps/desktop/src/lib/mongo/mongoShellCommand.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":"apps/desktop/src/lib/database/nativeJobs.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfb2319343bad24612fdffb6416780840d86f96704ea14f80893e04dc6be518"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isInteger(port) \u0026\u0026 port \u003E 0 \u0026\u0026 port \u003C= 65535\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/imports/navicatImport.ts, apps/desktop/src/lib/sqlserver/sqlServerHostPort.ts, apps/desktop/vite.config.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f71da6dd46b5a5eaf3f2e01899cd6b2cc178434892d00977ddf48ef735fc0c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060assetManifestArg || DEFAULT_ASSET_MANIFEST\u0060 appears character-identically in 2 files \u2014 agents/scripts/build_offline_jdbc_payload.mjs, agents/scripts/verify_offline_jdbc_release.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/scripts/build_offline_jdbc_payload.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d2e23659c0f791c8d35e588f3f64ab29224c3d82c92f9c2ef873320c87d39e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060backslashEscapes \u0026\u0026 sql[index] === \u0022\\\\\u0022 \u0026\u0026 (open === \u0022\u0027\u0022 || open === \u0027\u0022\u0027)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/productionSafety.ts, apps/desktop/src/lib/sql/sqlRisk.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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"52af12eb9606f55200382b399738fc5017cc619c17f36b6c67953920e5bd4241"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060base === \u0022geometry\u0022 || base === \u0022geography\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/cellDetailPresentation.ts, apps/desktop/src/lib/dataGrid/geometryMapPreview.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":"apps/desktop/src/lib/dataGrid/cellDetailPresentation.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ff1506f948cb53e5b7e82c1fcddfc74cd8b624cfd400b8546728d68ea4ce3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060binding.scope === \u0022TABLE\u0022 || binding.scope === \u0022VIEW\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/oracleTriggerPlan.ts, apps/desktop/src/lib/database/oracleTriggerSql.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":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"810e211ea6aded90ef7c9facf82a4a1869b57e4035133d072aad3b972b56af6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch === \u0022 \u0022 || ch === \u0022\\t\u0022 || ch === \u0022\\n\u0022 || ch === \u0022\\r\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/geometryPreview.ts, apps/desktop/src/lib/sql/sqlStatementRanges.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":"apps/desktop/src/lib/dataGrid/geometryPreview.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6862da8247234ddcbfb88eed21a204d17978bac5d4bc9482063d67e14b2da1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch === \u0022 \u0022 || ch === \u0022\\t\u0022 || ch === \u0022\\r\u0022 || ch === \u0022\\n\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/sqlStatementRanges.ts, apps/desktop/src/lib/sql/sqlVariables.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":"apps/desktop/src/lib/sql/sqlStatementRanges.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba6a1f113611310df202076c4e6106aebe92551932d6127160ce765795c7428"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char === \u0022\u0027\u0022 || char === \u0027\u0022\u0027 || char === \u0022\u0060\u0022\u0060 appears character-identically in 7 files \u2014 apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts, apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts, apps/desktop/src/lib/editor/hoverTableSql.ts, apps/desktop/src/lib/sql/cypherFormatter.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":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"152926c02299b46265f62faa54090e49538b12ee401e23b6fc10a077c0faaf4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char === \u0022,\u0022 || char === \u0022\\n\u0022 || char === \u0022\\r\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/documentStoreProvider.ts, apps/desktop/src/lib/dataGrid/dataGridColumnFilter.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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ee326c38ffe7380881d33588ddc45b908d29f6cb45e018e693c1067618506d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char === \u0022{\u0022 || char === \u0022[\u0022 || char === \u0022(\u0022\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/lib/mongo/mongoCompletion.ts, apps/desktop/src/lib/mongo/mongoFormatter.ts, apps/desktop/src/lib/mongo/mongoShellCommand.ts, packages/mongo-shell/src/json.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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca30fef887218702112777559c85e1c005bb4bc049500497b820a17ad057b83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char === \u0022}\u0022 || char === \u0022]\u0022 || char === \u0022)\u0022\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/lib/mongo/mongoCompletion.ts, apps/desktop/src/lib/mongo/mongoFormatter.ts, apps/desktop/src/lib/mongo/mongoShellCommand.ts, packages/mongo-shell/src/json.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":"apps/desktop/src/lib/mongo/mongoCompletion.ts"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"962aa8ba165650b9b69c7db0e1063b62a578bd5382f44cbce42e0b702d250d2e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char === \u0027\u0022\u0027 || char === \u0022\u0027\u0022 || char === \u0022\u0060\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/editor/shellLineCommentRanges.ts, apps/desktop/src/lib/mongo/mongoFormatter.ts, apps/desktop/src/lib/mongo/mongoShellCommand.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":"apps/desktop/src/lib/editor/shellLineCommentRanges.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c668c55403d09400ee95bab8e0d1d19bcf994955f6aeb1d1cbdcb6578fca3b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char === \u0027\u0022\u0027 || char === \u0022\u0060\u0022 || char === \u0022[\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/productionSafety.ts, apps/desktop/src/lib/sql/sqlRisk.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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9afb902309a2540eb70fee4931ca8f4849c48f3f1926d3560c41b49967653ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character !== undefined \u0026\u0026 character \u003E= \u00220\u0022 \u0026\u0026 character \u003C= \u00229\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/documentJsonValues.ts, apps/desktop/src/lib/common/safeJsonFormat.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":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"5168328a1b036711eb089e9a7aeb587d86b5fb7f36d3a0c30740b52a73b1e0a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character === \u0022 \u0022 || character === \u0022\\t\u0022 || character === \u0022\\n\u0022 || character === \u0022\\r\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/documentJsonValues.ts, apps/desktop/src/lib/common/safeJsonFormat.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":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d153b2fc8219cbfb74685fac12acb4f0791bde055319fd3e942cb722230401bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character.charCodeAt(0) \u003C 32 || character.charCodeAt(0) === 127\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/transfer/queryResultTransferValues.ts, apps/desktop/src/lib/table/tableColumnDefinitionPaste.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":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee5da8c52a6cbc095522756b26a2726341d1c9eb2356100d4b8f30ed03468df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060children !== node.children || hiddenChildren !== node.hiddenChildren\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/savedSql/savedSqlDatabaseTree.ts, apps/desktop/src/lib/sidebar/sidebarUserAdminVisibility.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":"apps/desktop/src/lib/savedSql/savedSqlDatabaseTree.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d5ebe77f56e844eefbb26856ea673680c5f38057fad56d1421f640ab20bd57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060clientX \u003E= rect.left \u0026\u0026 clientX \u003C= rect.right \u0026\u0026 clientY \u003E= rect.top \u0026\u0026 clientY \u003C= rect.bottom\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useDataGridColumnLayout.ts, apps/desktop/src/lib/editor/tableReferenceDragFeedback.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":"apps/desktop/src/composables/useDataGridColumnLayout.ts"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e623a6297c4d0c474290b0006bb72c482711e438d7d754fc1f191c863d5758"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config?.driver_profile || config?.db_type\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useDataGridActions.ts, apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd6cbfef9e73108dc4a5e197ab2b1f500c43e79a553e7dffe510a8b37d4efe4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060connection?.db_type === \u0022redis\u0022 \u0026\u0026 database !== \u0022\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/defaultDatabase.ts, apps/desktop/src/lib/tabs/tabPresentation.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":"apps/desktop/src/lib/database/defaultDatabase.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69d566f395bf1259310b13e62e516ad47b995642f7e04b53a508abbcde3e00f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060connection?.driver_profile || connection?.db_type\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useNavigationTargets.ts, apps/desktop/src/stores/queryStore.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":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"763370eb420cf29e8d8ae9fffa16564da0c3935d62ad10f74fc33cddd636dc2a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060databaseType !== \u0022oracle\u0022 \u0026\u0026 databaseType !== \u0022oceanbase-oracle\u0022\u0060 appears character-identically in 5 files \u2014 apps/desktop/src/composables/useDataGridActions.ts, apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts, apps/desktop/src/lib/database/objectDependencyDetails.ts, apps/desktop/src/lib/schema/connectionSchemaInitialization.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":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cefef2666c34c3bb209bc9161a193690996172b6807d8d7767ffc77a049e2ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060databaseType !== \u0022oracle\u0022 \u0026\u0026 databaseType !== \u0022oceanbase-oracle\u0022 \u0026\u0026 databaseType !== \u0022dameng\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/database/oracleTriggerIdentity.ts, apps/desktop/src/lib/database/triggerToggleSql.ts, apps/desktop/src/lib/table/tableStructureEditorState.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":"apps/desktop/src/lib/database/oracleTriggerIdentity.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21962d53372fb972c3c05803bbc56c518a2866e06318d66fb01d269cd434f73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060databaseType !== \u0022tdengine\u0022 \u0026\u0026 isBinaryCellColumnType(columnType) \u0026\u0026 BARE_HEX_RE.test(trimmed)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/binaryCellDownload.ts, apps/desktop/src/lib/dataGrid/cellImageUrl.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":"apps/desktop/src/lib/dataGrid/binaryCellDownload.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c459b695f2ffa652e91e89da39697a1ae0f043d345472a3ab56e1c114c4bc447"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060databaseType === \u0022doris\u0022 || databaseType === \u0022starrocks\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/sql/ddlDisplay.ts, apps/desktop/src/lib/sql/sqlCompletion.ts, apps/desktop/src/lib/table/tableEditing.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":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d617dfbf811e60b614fcaf3a3e482af7b9e2171a6e3eaa867ea398ceafdce05d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060databaseType === \u0022mysql\u0022 || databaseType === \u0022goldendb\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/transfer/queryResultTransferDdl.ts, apps/desktop/src/lib/table/objectRenameSql.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":"apps/desktop/src/components/transfer/queryResultTransferDdl.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a89059ef2096abda33c714b09b248de5184686aabf587faca1aa72666900699"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060databaseType === \u0022oracle\u0022 || databaseType === \u0022oceanbase-oracle\u0022\u0060 appears character-identically in 12 files \u2014 apps/desktop/src/components/transfer/queryResultTransferValues.ts, apps/desktop/src/composables/useDataGridTableMetadataLoaders.ts, apps/desktop/src/composables/useSchemaDiffSession.ts, apps/desktop/src/lib/dataGrid/dataGenerate.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":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70375239a44e0106d08f722a8d92b784e2f7d181cc78875bf5ae283483ffa9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060databaseType === \u0022postgres\u0022 \u0026\u0026 ch === \u0022]\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/sqlParameters.ts, apps/desktop/src/lib/sql/sqlVariables.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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d1303e638f317d98a9a0a1287c9a7f5028f8c76438d7c1b3a0c7d75413ac15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060databaseType === \u0022postgres\u0022 || databaseType === \u0022redshift\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/lib/table/tableSqlTemplates.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":3186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48b97e5a762045b972b2e9200c246cb5a8a5629cd85a6e292190d17ae069e9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dbType === \u0022gaussdb\u0022 \u0026\u0026 connection.driver_profile?.toLowerCase() === \u0022opengauss\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/postgresServerStatus.ts, apps/desktop/src/lib/database/processListDrivers.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":"apps/desktop/src/lib/database/postgresServerStatus.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb4a4f29965c23aaa43d42d5f862f5c2706218f2e74abe71db4e921d00c2060"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dbType === \u0022oracle\u0022 || dbType === \u0022oceanbase-oracle\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/database/databaseFeatureSupport.ts, apps/desktop/src/lib/database/databaseObjectCapabilities.ts, apps/desktop/src/lib/database/transferObjectKinds.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":"apps/desktop/src/lib/database/databaseFeatureSupport.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d4ccdb6300ea72dc154fe241f1c528d965c6be5113aa932cfb61ffb6c400c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dialectId === \u0022mysql\u0022 || dialectId === \u0022doris\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/editor/queryEditorFormatSelection.ts, apps/desktop/src/lib/sql/sqlWithoutCommentsForCopy.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":"apps/desktop/src/lib/editor/queryEditorFormatSelection.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19d2f31bcc8941cc09175ae578e1d091195fe40b950d6ad2e97f7faeb831241"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060editorSettings.globalDateTimeExportFormat || undefined\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/composables/useSidebarTreeExportRuntime.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0efd701cbfa58c397e4ef8be14312e2ac14064600953b4803fd8c37559abdba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060effective === \u0022doris\u0022 || effective === \u0022starrocks\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/transfer/queryResultTransfer.ts, apps/desktop/src/lib/database/jdbcDialect.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":"apps/desktop/src/components/transfer/queryResultTransfer.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8a91ee3b5c8e838bcd219609e8e2361d27de0e5504b7db8558bde0a81c0251"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060el \u0026\u0026 typeof ResizeObserver !== \u0022undefined\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useTabScroll.ts, apps/desktop/src/composables/useVerticalOverlayScrollbar.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":"apps/desktop/src/composables/useTabScroll.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2ee31f5620425d29fb8dbc485c7837a2b8e92ea51730cebf4e6a77310bb728"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060element \u0026\u0026 typeof ResizeObserver !== \u0022undefined\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useMeasuredWidth.ts, apps/desktop/src/composables/useToolbarOverflow.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":"apps/desktop/src/composables/useMeasuredWidth.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c20bd831511fd704b864be554889b027222f01c7de1e3e8bb276791a919106f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060end \u003C text.length \u0026\u0026 text[end] !== \u0022\\n\u0022 \u0026\u0026 text[end] !== \u0022\\r\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/editor/shellLineCommentRanges.ts, apps/desktop/src/lib/mongo/mongoFormatter.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":"apps/desktop/src/lib/editor/shellLineCommentRanges.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb32512263d579262c9b3b8c93817d3d2a8afd9f6e88e8208afded5b56ed44a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.contribution.icon || entry.plugin.manifest.icon\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useQuickOpen.ts, apps/desktop/src/lib/plugins/frontendPlugin.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":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba86dbcf8d01a4c583be27e82efb6324b0e12ee91e6c6b6ed0753fc34cd3efe5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060envelope?.operationOutcome === \u0022not_started\u0022 || (envelope?.code === \u0022DBX-JDBC-4001\u0022 \u0026\u0026 envelope.diagnostics?.category === \u0022sql\u0022 \u0026\u0026 envelope.\u2026\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/table/oracleTypeDataMapping.ts, apps/desktop/src/lib/table/oracleTypeManagement.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":"apps/desktop/src/lib/table/oracleTypeDataMapping.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca30437abd7a0b4ab4737c11278ff96778117c3b90934de03af3fb06be9a6ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error \u0026\u0026 typeof error === \u0022object\u0022 \u0026\u0026 \u0022message\u0022 in error\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts, apps/desktop/src/lib/table/objectSourceEditor.ts, apps/desktop/src/lib/table/objectSourceTabSave.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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5018b06dcf43673e8e7089f9e1fae0d17231c6c51bd7d42aca48ec70d89ed72e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error \u0026\u0026 typeof error === \u0022object\u0022 \u0026\u0026 \u0022message\u0022 in error \u0026\u0026 typeof error.message === \u0022string\u0022\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/i18n/backend-errors.ts, apps/desktop/src/lib/app/detachedTabWindow.ts, apps/desktop/src/lib/backend/errorUtils.ts, apps/desktop/src/lib/sql/sqlFileOpen.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":"apps/desktop/src/i18n/backend-errors.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"28698329c29d76357f2ba6f275327f8e3da15c1e9c4c5d3bdcb8331c99d2d701"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof SnapshotCompletionError \u0026\u0026 error.status === \u0022cancelled\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/composables/useSidebarTreeExportRuntime.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8dc6cf6cfe5ff90cc7b26c8207dba931ca7de19a0d08f70e2c8fb40766c55d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof SnapshotCompletionError \u0026\u0026 error.status === \u0022failed\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/composables/useSidebarTreeExportRuntime.ts, apps/desktop/src/stores/queryStore.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2677}}}],"partialFingerprints":{"codehealthFindingId/v1":"d411fb0446db7023b3414c0586e299b66adff6c79e4a1d8a70b6d7380f77e475"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.button !== 0 || event.detail !== 2 || event.altKey || options.composing || options.language === \u0022text\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/editor/queryEditorParenthesisMouseSelection.ts, apps/desktop/src/lib/editor/queryEditorStringMouseSelection.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":"apps/desktop/src/lib/editor/queryEditorParenthesisMouseSelection.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"398781fd522bf1c9657736750586362da21802eac2c78f81f9d4814ed513eb07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.key === \u0022Shift\u0022 || event.key === \u0022Alt\u0022 || event.key === \u0022Control\u0022 || event.key === \u0022Meta\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/editor/useQueryEditorPointer.ts, apps/desktop/src/lib/editor/queryEditorNativeSelection.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":"apps/desktop/src/components/editor/useQueryEditorPointer.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a369a5c92f9f1b556380f032f4125d2cd275a0dce4ee4cc74f157c0c8ac2f8c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060folder.id !== draggedId \u0026\u0026 (folder.parentFolderId || \u0022\u0022) !== (targetParentFolderId || \u0022\u0022) \u0026\u0026 (folder.parentFolderId || \u0022\u0022) !== (previousPare\u2026\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/stores/savedSqlStore.ts, apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"4406c303a8751519afb265e4922dffe18910914d92be367e02cd687ff60bfd95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060folder.id !== draggedId \u0026\u0026 (folder.parentFolderId || \u0022\u0022) === (previousParentFolderId || \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/stores/savedSqlStore.ts, apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c6ac9cc973e881dd10b5cb9c8ba367b448bd8ed2b371b1988b04e897039b77"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060folder.id !== folderId \u0026\u0026 (folder.parentFolderId || \u0022\u0022) !== (previousParentFolderId || \u0022\u0022) \u0026\u0026 (folder.parentFolderId || \u0022\u0022) !== (nextParentF\u2026\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/stores/savedSqlStore.ts, apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"611a5da85c3aef0b7fc1135a5e0375e8ace65f83a3eb8bb490f4289efc65e0ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060folder.id !== folderId \u0026\u0026 (folder.parentFolderId || \u0022\u0022) === (nextParentFolderId || \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/stores/savedSqlStore.ts, apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f87aa0b6f8ce835c001e511d1d414965fac4a1b5401b7097eea69d7773467dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060folder.id !== folderId \u0026\u0026 (folder.parentFolderId || \u0022\u0022) === (previousParentFolderId || \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/stores/savedSqlStore.ts, apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"5234af7d12bd6ec50011143c905e05e9ca6e33b12be52261ec544e6ea76f4c41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060folder.parentFolderId \u0026\u0026 ids.has(folder.parentFolderId) \u0026\u0026 !ids.has(folder.id)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/stores/savedSqlStore.ts, apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5df58acea2655b42d8140459e4e29fea9a90d19cbeafefea4a354fc2ce23e36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060from == null || to == null || to \u003C= from\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts, apps/desktop/src/lib/sql/semantic/diagnostics.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":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e775191a203d09e79cc8fc8b6b47ddc3a04c5067181e1ab371b7edd084bff08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060grantor !== target.schema || privilege !== \u0022EXECUTE\u0022 || !grantee\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/table/oraclePackageSaveAs.ts, apps/desktop/src/lib/table/oracleRoutineRename.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":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ca08b80f45317a4546ae180134418799983d63847b27e15cf71aa894144f23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060group.id === groupId || descendantGroupIds.has(group.id)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sidebar/sidebarLayout.ts, apps/desktop/src/lib/table/tableVGroup.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":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"1792593f9a3dd3abfed932f472a2085b7310e446512114c4a93a9b1292ab2cf2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host.includes(\u0022:\u0022) \u0026\u0026 !host.startsWith(\u0022[\u0022)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/connection/connectionDeepLink.ts, apps/desktop/src/lib/connection/gaussdbHosts.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":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1aeaae102c3bc137495b3e2a56416c2e3d646718b8b7f55c561c6eefe4fa4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hostname === \u0022localhost\u0022 || hostname === \u0022127.0.0.1\u0022 || hostname === \u0022::1\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/cellImageUrl.ts, docs/worker.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":"apps/desktop/src/lib/dataGrid/cellImageUrl.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"408f632f4e61d45397545e7a3b61a9195dc3a5b2d51cab870a17a63aba876379"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C sql.length \u0026\u0026 !(sql[i] === \u0022*\u0022 \u0026\u0026 sql[i \u002B 1] === \u0022/\u0022)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/mongo/mongoSql.ts, apps/desktop/src/lib/sql/sqlAnalysis.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":"apps/desktop/src/lib/mongo/mongoSql.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8052d1ae06d271c560414a736b05d0e00d721b45c63d75eac7376b2cc4c6b4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060identity.parts.length === 2 \u0026\u0026 identity.qualifier\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts, apps/desktop/src/lib/sql/sqlNavigation.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":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"276d23c4e8e73b7acca714da504af5e3b12bd9f76f4c3698e62b73ba964aaf96"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C sql.length \u0026\u0026 sql[index] !== \u0022\\n\u0022 \u0026\u0026 sql[index] !== \u0022\\r\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/database/productionSafety.ts, apps/desktop/src/lib/sql/sqlFormatter.ts, apps/desktop/src/lib/sql/sqlRisk.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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b581138fe39e2c90ae1e3fb8877d3ebdf0bc62d25b588c1b42bd6ab2e9ba96"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C text.length \u0026\u0026 text[index] !== \u0022\\n\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts, apps/desktop/src/lib/debug/plDebugAnonymousBlock.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":"apps/desktop/src/lib/dataGrid/dataGridInsertPaste.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dcc5b89fe99b1405ee8cefddea9d9b1daa534d5325749a03a12ce4f8bb0572"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003E= 0 \u0026\u0026 index \u003C result.columns.length\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/lib/dataGrid/chartData.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de5a473116fb7acce2303469dff603d4b0d921719c566ba6f64fcb76d02f2dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index.is_primary \u0026\u0026 index.columns.length \u003E 0\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/dbAdminSql.ts, apps/desktop/src/lib/table/tableEditing.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":"apps/desktop/src/lib/database/dbAdminSql.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf8d5a01049d401ab82d777150e32fb04ce93561a5b14aecc9ce8828545a471"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.databaseType \u0026\u0026 !isSchemaAware(input.databaseType) \u0026\u0026 !isSingleDatabase(input.databaseType)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/editor/hoverTableLookup.ts, apps/desktop/src/lib/sql/queryCursorTableTarget.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":"apps/desktop/src/lib/editor/hoverTableLookup.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4937d90d44520f30cf50099ad189d8591390d66f3ae3ce39c5a5bbd4656f40d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060integer \u003E MAX_SAFE_BIGINT || integer \u003C -MAX_SAFE_BIGINT\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/documentJsonValues.ts, apps/desktop/src/lib/mongo/mongoDocumentValues.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":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb9a14febd909f4a37f5e191004968729f631c23a5df1f54d4e81e14c6c355a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060integer \u003E= MIN_BSON_INT64 \u0026\u0026 integer \u003C= MAX_BSON_INT64\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/documentJsonValues.ts, apps/desktop/src/lib/mongo/mongoDocumentValues.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":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"92247579fe528362d9fb4b3a2c3fee37090dcc3e1004eef3b5fba812cca8253b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.kind !== \u0022punctuation\u0022 || item.text !== \u0022;\u0022 || item.depth !== 0\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/insertValueHints.ts, apps/desktop/src/lib/sql/semantic/tokens.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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"88675f4f0486eea2d0d5fd2eb95b3ddb9f0fbcda485c8b89be62096560e6d3c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.name === step.objectName \u0026\u0026 item.objectType === step.objectType\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/table/oracleRoutineRename.ts, apps/desktop/src/lib/table/oracleTableRename.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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69c84342eb093e974211267ad2c9cc40c896f9023b8b274c1f210dfc8e692e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.status === \u0022success\u0022 || item.status === \u0022error\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/query/batchSqlRecovery.ts, apps/desktop/src/stores/queryStore.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":"apps/desktop/src/lib/query/batchSqlRecovery.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd3f448dc4bf743b6ff4d5817fe7b46b583458e417a807ba440e337c41ae06f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind === \u0022kafka\u0022 || kind === \u0022rocketmq\u0022 || kind === \u0022rabbitmq\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/mq/mqConsoleDefaults.ts, apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/lib/mq/mqConsoleDefaults.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f21f7638c03215f36a7483a05d815c8af7b5ec92fbab1546bafa872957cb2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060last \u0026\u0026 ((last.kind === \u0022string\u0022 \u0026\u0026 last.open) || (last.kind === \u0022comment\u0022 \u0026\u0026 (last.open || (!last.text.startsWith(\u0022/*\u0022) \u0026\u0026 !/[\\r\\n]/.test(s\u2026\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/graph/graphCompletion.ts, apps/desktop/src/lib/graph/graphSignatureHelp.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":"apps/desktop/src/lib/graph/graphCompletion.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c9f98c5165a434f5ddd0b0d885bbb4841b6853a288b1541af160f5e98f1649"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060layer.enabled !== false \u0026\u0026 layer.type === \u0022ssh\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts, apps/desktop/src/lib/connection/agentDriverInstallHint.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":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fecef210fcd55ffb51f357f1eb0f12933d1e9f1a6169b87585c31655cf3b9a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.connectionId === right.connectionId \u0026\u0026 left.database === right.database \u0026\u0026 left.schema === right.schema\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/oracleInvalidObjectCacheRefresh.ts, apps/desktop/src/lib/schema/schemaDiffTableList.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":"apps/desktop/src/lib/database/oracleInvalidObjectCacheRefresh.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"133f7c6fcef5009c2c338940453cf3613d39572e9aa37466fd3157fd7f41501c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.from - right.from || left.to - right.to\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts, apps/desktop/src/lib/editor/codemirrorSqlUnknownObjectHighlights.ts, apps/desktop/src/lib/editor/semanticSelectionRanges.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":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e0a94ae7a39b29004b5f301de237aad01645cdc56540855d042120441ff466"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.from \u003C right.to \u0026\u0026 right.from \u003C left.to\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts, apps/desktop/src/lib/sql/semantic/diagnostics.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":"apps/desktop/src/components/editor/useQueryEditorDiagnostics.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"503eecd11ba72d4f84f1afe1ab36f7307a84e064012d99ffcd383e3ac4198897"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lines.length \u003E 0 \u0026\u0026 lines[lines.length - 1] === \u0022\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/components/diff/DiffHunkBuilder.ts, apps/desktop/src/lib/nacos/nacosAdmin.ts, apps/desktop/src/lib/schema/schemaDiffRoutine.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":"apps/desktop/src/components/diff/DiffHunkBuilder.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d3bf6a1e8fa9810f36f96d84253c6af4964df1a630e9724695ff050ed4abd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.scope === \u0022TABLE\u0022 || metadata.scope === \u0022VIEW\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/database/oracleTriggerPlan.ts, apps/desktop/src/lib/database/oracleTriggerSql.ts, apps/desktop/src/lib/table/tableTree.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":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf3cfbfee90f8658d166dc7a3bbf20c9bb558d843b78f4f67c50868858fee83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060method === \u0022GET\u0022 || method === \u0022HEAD\u0022 || method === \u0022OPTIONS\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/couchdb/couchdbRequestRisk.ts, apps/desktop/src/lib/elasticsearch/elasticsearchRequestRisk.ts, apps/desktop/src/lib/solr/solrRequestRisk.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":"apps/desktop/src/lib/couchdb/couchdbRequestRisk.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2cdc296c3c83b761f6723b13f1ffd38402292f5269ab5745eebf7662fb5b60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode === \u0022between\u0022 || mode === \u0022not-between\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/documentStoreProvider.ts, apps/desktop/src/lib/dataGrid/dataGridColumnFilter.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":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8856a75eece36ccc22509c4ce85dd9c00b93bb3a2f47394a6273a6ae125851"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mysqlLexer || (postgresEscapeStrings \u0026\u0026 endsWithEscapeStringPrefix(sql, index))\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/productionSafety.ts, apps/desktop/src/lib/sql/sqlRisk.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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ca267bf99ebad9c32453b25144a679106472149507bf4475f60a31b5400912"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nextParentFolderId \u0026\u0026 descendantFolderIds(folderId).has(nextParentFolderId)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/stores/savedSqlStore.ts, apps/desktop/src/stores/transferTaskStore.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":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6be637b5e150f3bc3051a51bf71e5863cd6dc4c71de0c2cbab6c26d068e4b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.children \u0026\u0026 node.children.length \u003E 0\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sidebar/sidebarSearchTree.ts, apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/lib/sidebar/sidebarSearchTree.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"805c1f2aebd191ccd855aedba5f7beaa783600b8f278a053ba0f246812823677"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.objectName || node.tableName || node.label\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/pinnedItems.ts, apps/desktop/src/lib/sidebar/sidebarTableNameCopy.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":"apps/desktop/src/lib/app/pinnedItems.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a527e6f8a5bfe1511fe2cab32fd0afb4a5456f53a0eae09d07d603dcae81ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type !== \u0022connection\u0022 || !node.connectionId\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sidebar/sidebarExportRuntime.ts, apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/lib/sidebar/sidebarExportRuntime.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4057caf5c9dfea06b9c13be825af317a34405acd76909163ffdb9112aff48a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type !== \u0022database\u0022 || !node.connectionId || node.database == null\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts, apps/desktop/src/lib/sidebar/sidebarDatabaseOpenState.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":"apps/desktop/src/composables/useSidebarConnectionMutationRuntime.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca88ef63d9abff5e5d77e5fdbd5cc46c47c53124e9a0ec629d080e8674909c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type !== \u0022mongo-collection\u0022 || !node.connectionId || !node.database\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts, apps/desktop/src/composables/useSidebarTreeExportRuntime.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":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc3dd6c11a4227aedf8e7a45950adc1c603a4f143cd68d3bb34e78113d0235e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type !== \u0022table\u0022 \u0026\u0026 node.type !== \u0022view\u0022 \u0026\u0026 node.type !== \u0022materialized_view\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/newQueryContext.ts, apps/desktop/src/lib/sql/queryCursorTableTarget.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":"apps/desktop/src/lib/sql/newQueryContext.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd09c0d134ee452df14a3d06e5752d29fcd032ac04f2c8a52278017e094d0037"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0022clause\u0022 || node.type === \u0022set_operation\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/layout/primitives.ts, apps/desktop/src/lib/sql/layout/printer.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":"apps/desktop/src/lib/sql/layout/primitives.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"51654bfa4dc1abaaa6b6a6c6ce7b513cffc87ca93230280163b6dfefe613ec80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0022connection\u0022 \u0026\u0026 node.connectionId\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sidebar/treeNodeContext.ts, apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/lib/sidebar/treeNodeContext.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d7c26394a77cf76e0f81e5d8786de432ce625ab5b93e67d5f81ef2b03873a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0022connection-group\u0022 \u0026\u0026 node.children\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/sidebar/connectionListSort.ts, apps/desktop/src/lib/sidebar/sidebarActiveTabTarget.ts, apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/lib/sidebar/connectionListSort.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ae5e1c3fcbba58cf4b24a4711930d61d711fd84d5a2f2c0be3682463a56a4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0022database\u0022 \u0026\u0026 node.connectionId \u0026\u0026 hasTreeNodeDatabaseContext(node)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sidebar/treeNodeContext.ts, apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/lib/sidebar/treeNodeContext.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6df1447cf0fe2212af38ea76a800de4ae1ec0e068ace119378266330d9e1b31"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0022group-triggers\u0022 \u0026\u0026 node.connectionId \u0026\u0026 hasTreeNodeDatabaseContext(node) \u0026\u0026 node.tableName\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sidebar/sidebarObjectGroupRouting.ts, apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/lib/sidebar/sidebarObjectGroupRouting.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d5978259cdd21941065a57770359f2304b2602e656311b033866388de6b960"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0022index\u0022 \u0026\u0026 node.objectScope === \u0022schema\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useSidebarTreeToolRuntime.ts, apps/desktop/src/lib/table/schemaIndexNavigation.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":"apps/desktop/src/composables/useSidebarTreeToolRuntime.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"661b85e6037696202feea776f9bed6d3f25bffa12fc8be4e70b93f30f5dbb722"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0022table\u0022 || node.type === \u0022view\u0022 || node.type === \u0022materialized_view\u0022\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/composables/useSidebarTreeToolRuntime.ts, apps/desktop/src/lib/sidebar/sidebarExportRuntime.ts, apps/desktop/src/lib/sidebar/sidebarTableNameCopy.ts, apps/desktop/src/lib/sidebar/sidebarTreeDdlShortcut.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":"apps/desktop/src/composables/useSidebarTreeToolRuntime.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1207d9f59ef067050f40386ec05fdd8d2232ffece965c2327735f7e6fa93a53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized === \u0022false\u0022 || normalized === \u0022f\u0022 || normalized === \u0022no\u0022 || normalized === \u0022n\u0022 || normalized === \u00220\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/sqlParameters.ts, apps/desktop/src/lib/table/routineExecutionSql.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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e36a83a653e3daf51deb756b709959864df71ef2b6471763b5744952cd64b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized === \u0022true\u0022 || normalized === \u0022t\u0022 || normalized === \u0022yes\u0022 || normalized === \u0022y\u0022 || normalized === \u00221\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/sqlParameters.ts, apps/desktop/src/lib/table/routineExecutionSql.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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"115672160fa042a92c38feb83862cbcc744f0ad6357d89c474d154943a379037"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060objectType === \u0022TABLE\u0022 || objectType === \u0022VIEW\u0022 || objectType === \u0022MATERIALIZED_VIEW\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/table/objectRenameSql.ts, apps/desktop/src/stores/connectionStore.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":"apps/desktop/src/lib/table/objectRenameSql.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da82a58b99b735248235a5b43e82607d10e53fcf1d19626a630c1ca8e52026b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opening === \u0022\u0060\u0022 || opening === \u0027\u0022\u0027 || opening === \u0022[\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/diff/DiffHunkBuilder.ts, apps/desktop/src/lib/schema/schemaDiffDdlLocate.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":"apps/desktop/src/components/diff/DiffHunkBuilder.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9656d3f01307ee45d2f0718fed521adda25407576fdbb2a9096db32872288369"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.diagnostics || new Diagnostics()\u0060 appears character-identically in 2 files \u2014 plugins/sdk/dev-host/runtime.mjs, plugins/sdk/dev-host/server.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/runtime.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a14df4d0beef9850e44f0040c75e61c7b2d52a26220bb2900d94be8a315372"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.isCurrent \u0026\u0026 !options.isCurrent()\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/oracleInvalidObjects.ts, apps/desktop/src/stores/queryStore.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":"apps/desktop/src/lib/database/oracleInvalidObjects.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4711e3dbb34835ec5a0b0067d82a982573111d451bf1afcef9e651abe0d54ca4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.requestGeneration === options.currentGeneration \u0026\u0026 options.requestIdentity === options.currentIdentity\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/dataGridColumnIndexIcon.ts, apps/desktop/src/lib/dataGrid/dataGridForeignKeyNavigation.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":"apps/desktop/src/lib/dataGrid/dataGridColumnIndexIcon.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbc3c30160f4a53b7042be84ea5f8970afa577015c36b31c6f03a3f2cd3cd9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060oracleAlternativeQuotes \u0026\u0026 (char === \u0022q\u0022 || char === \u0022Q\u0022 || char === \u0022n\u0022 || char === \u0022N\u0022)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/productionSafety.ts, apps/desktop/src/lib/sql/sqlRisk.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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f2b0ad5281a2ae7a40f3aa7926b433acc4d8cc371da2a6f80999000cc76cd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parentFound \u0026\u0026 current.id === parentGroupId\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sidebar/sidebarLayout.ts, apps/desktop/src/lib/table/tableVGroup.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":"apps/desktop/src/lib/sidebar/sidebarLayout.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d8fb65c4d50aad765d33c2e6842c9d28a06075aa129d63e25f47e10928f167"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed \u0026\u0026 typeof parsed === \u0022object\u0022 \u0026\u0026 !Array.isArray(parsed)\u0060 appears character-identically in 5 files \u2014 apps/desktop/src/lib/app/appAppearance.ts, apps/desktop/src/lib/app/documentStoreProvider.ts, apps/desktop/src/lib/table/tableEditing.ts, apps/desktop/src/lib/webdav/webdavAutoUploadConfig.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":"apps/desktop/src/lib/app/appAppearance.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"465623e406712c16cce8a51312593265a952b11ea3cedde272d9310f3a90dffd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.version !== 1 || !parsed.scopes || typeof parsed.scopes !== \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/dataGridConditionHistory.ts, apps/desktop/src/lib/redis/redisKeySearchHistory.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":"apps/desktop/src/lib/dataGrid/dataGridConditionHistory.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c21a4ef1912d35c18b340a93b168280624c9857610ec780daaad85f427d926"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060part === \u0022bool\u0022 || part === \u0022boolean\u0022 || (part === \u0022bit\u0022 \u0026\u0026 databaseType !== \u0022postgres\u0022)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts, apps/desktop/src/lib/dataGrid/dataGridConditionValueSnippets.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":"apps/desktop/src/lib/dataGrid/dataGridColumnFilter.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"084b501713980bf4667b2513f37c4bf99000532af07d1c84449b22cbdcc263fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060payload.tooLarge || payload.text === undefined\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useSqlFileFailureLog.ts, apps/desktop/src/lib/backend/http.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":"apps/desktop/src/composables/useSqlFileFailureLog.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2c6187b8d73e3fc407b22d72f6c3ab1e8bc18259ebe6f2b2915b3008637191"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CNB_API_BASE || DEFAULT_API_BASE\u0060 appears character-identically in 2 files \u2014 .github/scripts/cleanup-cnb-releases.mjs, .github/scripts/sync-cnb-release.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/cleanup-cnb-releases.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29bd2ca7eb3119b4770e3f9d21bd8d1092131b0e033499e3e6a767857c0f452"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CNB_REPOSITORY || DEFAULT_REPOSITORY\u0060 appears character-identically in 2 files \u2014 .github/scripts/cleanup-cnb-releases.mjs, .github/scripts/sync-cnb-release.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/cleanup-cnb-releases.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf9cca3ab82529d760233ac930384b921f134303ddc8070621e5a3dfa56c2e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.DRY_RUN === \u00221\u0022 || process.env.DRY_RUN === \u0022true\u0022\u0060 appears character-identically in 3 files \u2014 .github/scripts/label-issue-database.mjs, .github/scripts/label-pull-request.mjs, .github/scripts/suggest-similar-issues.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/label-issue-database.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"34889dab340a5351ee8571601212cd100d4991bb6ff9040e961d816cdbbca633"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.GITHUB_EVENT_PATH \u0026\u0026 fs.existsSync(process.env.GITHUB_EVENT_PATH)\u0060 appears character-identically in 2 files \u2014 .github/scripts/label-issue-database.mjs, .github/scripts/suggest-similar-issues.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/label-issue-database.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb463d67fef8aaca72c972056eea5e37b519e0ebcaabab501a2f9c28f40eaa2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0022win32\u0022 \u0026\u0026 command === \u0022npm\u0022\u0060 appears character-identically in 2 files \u2014 plugins/sdk/dev-host/runtime.mjs, scripts/verify-plugin-cli-package.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/runtime.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"efeb1e90ab21342d90d473a7e6aa57daeef280c7b4b3c8848528735513a33168"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060productionAssessment.active \u0026\u0026 productionAssessment.isMutation\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/composables/useDataGridEditor.ts, apps/desktop/src/composables/useSqlExecution.ts, apps/desktop/src/lib/ai/aiSqlExecutionPolicy.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":"apps/desktop/src/composables/useDataGridEditor.ts"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a114b4c42ab0e45d6a71f458046b3c7b2fc745c9193a50dc6f94db39326e878"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile === \u0022mongodb-legacy\u0022 || profile === \u0022mongodb_legacy\u0022 || profile === \u0022legacy\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/connection/agentDriverInstallHint.ts, apps/desktop/src/lib/mongo/mongoCapabilities.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":"apps/desktop/src/lib/connection/agentDriverInstallHint.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cd40e9fdf2efb58b45b64899b1c196edb98e5fc0ca8001e32a15ef9ea5da6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile.dbType === \u0022jdbc\u0022 || profile.dbType === \u0022mongodb\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/imports/datagripImport.ts, apps/desktop/src/lib/imports/dbeaverImport.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":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcee867ecfe4fef828285efcbc2125fc5a8b5eabc0f6f721f3b531f2db8fe98a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060progress.status === \u0022Done\u0022 || progress.status === \u0022Error\u0022 || progress.status === \u0022Cancelled\u0022\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/composables/useSidebarTreeExportRuntime.ts, apps/desktop/src/lib/backend/http.ts, apps/desktop/src/stores/queryStore.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f26e6fc991b81999a2f59497c6ae49cf12552bb2720ef2dfb23e30924ea453f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060progress.status === \u0022done\u0022 || progress.status === \u0022error\u0022 || progress.status === \u0022cancelled\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/backend/http.ts, apps/desktop/src/lib/sql/httpSqlFileProgress.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":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3760}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1a18d4c8450fdd3ca66b29bfb13731d6bfd9242de6e716706f6bddfa69a345"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060property.type === \u0022float\u0022 \u0026\u0026 typeof property.value === \u0022string\u0022 \u0026\u0026 typeof value === \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/graph/graphResult.ts, apps/desktop/src/lib/graph/nebulaGraph.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":"apps/desktop/src/lib/graph/graphResult.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c17ec6fa0888e646fe5b7bf076603d053fa3aece25b0bd4c923ff272b91a55b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060property.type === \u0022int\u0022 \u0026\u0026 typeof property.value === \u0022string\u0022 \u0026\u0026 typeof value === \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/graph/graphResult.ts, apps/desktop/src/lib/graph/nebulaGraph.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":"apps/desktop/src/lib/graph/graphResult.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc2326464298f48bed70e9baa2de561df2ab2f665dfd9e6f4ee0d94e7cdf6de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060property.type === \u0022int\u0022 \u0026\u0026 typeof value === \u0022number\u0022 \u0026\u0026 !Number.isSafeInteger(value)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/graph/graphResult.ts, apps/desktop/src/lib/graph/nebulaGraph.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":"apps/desktop/src/lib/graph/graphResult.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1701977772a6173001abdd66670fe97ab31c440bed16a4709a48a56e645aa6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060props.databaseType === \u0022elasticsearch\u0022 || props.databaseType === \u0022easysearch\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/editor/queryEditorSqlExtensions.ts, apps/desktop/src/components/editor/useQueryEditorCompletion.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":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ef62b3fbc1e6eedb14185e02946b569ec65b905ba1c3729516ca3b32c06da5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw === null || typeof raw === \u0022number\u0022 || typeof raw === \u0022boolean\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/documentJsonValues.ts, apps/desktop/src/lib/mongo/mongoDocumentValues.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":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"544faa96c152a53bdf81a3cd1460860109ad91604917efae145deabb0fe71123"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw.split(/\\s*(?:\\.\\s*)?recent stderr\\s*:/i, 1)[0]?.trim() || raw\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/kv/etcdDashboardError.ts, apps/desktop/src/lib/kv/kvMutationError.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":"apps/desktop/src/lib/kv/etcdDashboardError.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b3dfcace431e760c9410699c5d37e71fba3bff5af38b72e0f4721667ea06c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rawLine[offset] === \u0022#\u0022 || rawLine.startsWith(\u0022//\u0022, offset)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/elasticsearch/elasticsearchRequestRisk.ts, apps/desktop/src/lib/solr/solrRequestRisk.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":"apps/desktop/src/lib/elasticsearch/elasticsearchRequestRisk.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a60996f423d8613ec430b0f5b4efd684faa0366dba7f480477cbef303ea015"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.method !== \u0022GET\u0022 \u0026\u0026 request.method !== \u0022HEAD\u0022\u0060 appears character-identically in 2 files \u2014 deploy/plugin-stats-worker/worker.ts, docs/worker.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":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ba75a654c046686c4e9f7da18a734d03a711e9876c70bdfb8b4dea18d32c54"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.txnSessionId \u0026\u0026 isManualTransactionSessionExpired(error)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/stores/queryStore.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c901c4057ac49fde6353fbd8d904d586a13f64814538fc00cd09942828175f02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.error || \u0022Metadata query failed.\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/table/oracleRoutineRename.ts, apps/desktop/src/lib/table/oracleTableRename.ts, apps/desktop/src/lib/table/oracleViewRename.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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a442328c8609ee2102a8dfc2987268f5038b3d5fadef13952e7b481f7be8a559"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.rows.length !== 1 || result.rows[0][0] !== target.schema || result.rows[0][1] !== target.schema\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/lib/table/oraclePackageSaveAs.ts, apps/desktop/src/lib/table/oracleRoutineRename.ts, apps/desktop/src/lib/table/oracleTableRename.ts, apps/desktop/src/lib/table/oracleViewRename.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":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a925898f14d56ab9d681c59e2582ad8205560963160bd638b8d64a42e5141f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.truncated || result.has_more || result.rows.length \u003E metadataLimit || result.large_value_cells?.length\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/lib/table/oraclePackageSaveAs.ts, apps/desktop/src/lib/table/oracleRoutineRename.ts, apps/desktop/src/lib/table/oracleTableRename.ts, apps/desktop/src/lib/table/oracleViewRename.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":"apps/desktop/src/lib/table/oraclePackageSaveAs.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c717b1d87f7af48b49d9f3aed1f93c4f72a40a4b88114754c9e0eb1f06146a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.type === \u0022TABLE\u0022 || row.type === \u0022VIEW\u0022 || row.type === \u0022MATERIALIZED_VIEW\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/table/objectBrowserRowAction.ts, apps/desktop/src/lib/table/objectBrowserRows.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":"apps/desktop/src/lib/table/objectBrowserRowAction.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"12517bd218cb1261319e8ba6dbf91798e7f56336d01ec43a2672eed5c73ab36f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rows.length !== offsets.length || chunks.size !== offsets.length\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/table/oracleRoutineRename.ts, apps/desktop/src/lib/table/oracleTableRename.ts, apps/desktop/src/lib/table/oracleViewRename.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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c414751ea4444660de8ae410e554b4ab5a9a1b2f6107e4cfb6b7e8c82dea2317"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rt.alias?.toLowerCase() === qualifier.toLowerCase() || rt.name.toLowerCase() === qualifier.toLowerCase()\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/components/editor/useQueryEditorHover.ts, apps/desktop/src/components/editor/useQueryEditorObjectNavigation.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":"apps/desktop/src/components/editor/useQueryEditorHover.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a877d96d27286b52e51444111d833116905b94d1188b942512f54076c5d30f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selection.ranges.length !== 1 || !selection.main.empty\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/editor/queryEditorOccurrenceSelection.ts, apps/desktop/src/lib/editor/queryEditorPasteCaretResync.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":"apps/desktop/src/lib/editor/queryEditorOccurrenceSelection.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d45f4b9b8f4c80ad177e475c3c3da6ea6ebd0664bf80e5b3e680d6bb0b677cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060size \u003E= 1024 \u0026\u0026 unitIndex \u003C units.length - 1\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sidebar/sidebarDatabaseStorage.ts, apps/desktop/src/lib/table/objectBrowserRows.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":"apps/desktop/src/lib/sidebar/sidebarDatabaseStorage.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"559cbcf6ab21fc5e1cfbcbd91a178df1ff4c98e4e6063c3d98407395c9557a23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.alias?.toLowerCase() === qualifier || source.name.toLowerCase() === qualifier\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/semantic/cteNavigation.ts, apps/desktop/src/lib/sql/semantic/model.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":"apps/desktop/src/lib/sql/semantic/cteNavigation.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"234fbaa9d33a20e3b618f0660e013fc39f657d655f998c58884dce6e84bfca69"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source[index] === \u0022\u0027\u0022 \u0026\u0026 source[index \u002B 1] === \u0022\u0027\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/table/oraclePackageSource.ts, apps/desktop/src/lib/table/oracleTableRename.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":"apps/desktop/src/lib/table/oraclePackageSource.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd41d693a5d7ec56fa8d5a87e4177fceb8ca5e6a9922f9d4f15c0b41c8c9541"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sql[index \u002B 2] === \u0022M\u0022 \u0026\u0026 sql[index \u002B 3] === \u0022!\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/productionSafety.ts, apps/desktop/src/lib/sql/sqlRisk.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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"316f75e6b5038206a91a96eb87d781206dcbe8f219201de403d955272b1e5163"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sql[index] !== \u0022/\u0022 || sql[index \u002B 1] !== \u0022*\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/productionSafety.ts, apps/desktop/src/lib/sql/sqlRisk.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":"apps/desktop/src/lib/database/productionSafety.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5838e4dc363f5855e995ae120301878d1cc00da0a3ef997c790fca2f8973119b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sql[index] === \u0022*\u0022 \u0026\u0026 sql[index \u002B 1] === \u0022/\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/sqlFormatter.ts, apps/desktop/src/lib/sql/sqlStatementRanges.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":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"72aca1ff2f7e9ca972d853ce380dc659c73be1dc9d373ef7fe0daa6c23ae6e20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sql[index] === \u0022/\u0022 \u0026\u0026 sql[index \u002B 1] === \u0022*\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/sqlFormatter.ts, apps/desktop/src/lib/sql/sqlStatementRanges.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":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2ed57251f8ab02aa4f3817a05f56a74b0bd4f97697fbfa2088bd44460409ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sql[index] === \u0022\\\\\u0022 \u0026\u0026 index \u002B 1 \u003C sql.length\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts, apps/desktop/src/lib/sql/sqlFormatter.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":"apps/desktop/src/lib/sql/mysqlRoutineSyntaxDiagnostics.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc63bb1b9917b5068c199acd9529a55756bfb1af7617efb2aacfe11c4db47f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tab.mode === \u0022query\u0022 \u0026\u0026 tab.externalSqlPath\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/tabs/tabPresentation.ts, apps/desktop/src/stores/queryStore.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":"apps/desktop/src/lib/tabs/tabPresentation.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a74b2e4cbc56ef8147e132b5b03dfe0a78ca76d0dfd521418b567ef4b661fde"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.database.trim() || target.catalog !== undefined || target.schema !== undefined\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useMultiDbTargetSelection.ts, apps/desktop/src/lib/database/sqlExecutionTargetRegistry.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":"apps/desktop/src/composables/useMultiDbTargetSelection.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d137b8e66e93f1086ffa7342c8586a447b6537a91b9e2f4f34bc81fc0b237cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.text[this.position] === \u0022\u002B\u0022 || this.text[this.position] === \u0022-\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/documentJsonValues.ts, apps/desktop/src/lib/common/safeJsonFormat.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":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f590b4d5db90f35adf28706ad85fc1cc35dbf6cb1958af114e6e885fea564d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.text[this.position] === \u0022e\u0022 || this.text[this.position] === \u0022E\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/documentJsonValues.ts, apps/desktop/src/lib/common/safeJsonFormat.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":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"073759d2326949cac87354be682d98990e5c5f4f6496633bb378b59bb9316241"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.depth === 0 \u0026\u0026 token.kind !== \u0022comment\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/dataGridColumnLayoutStorage.ts, apps/desktop/src/lib/sql/starrocksDdlDisplay.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":"apps/desktop/src/lib/dataGrid/dataGridColumnLayoutStorage.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b38502947bae1a002332f70b93da331fa26ff55747f4e93dc41ba4ceab6495"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.kind !== \u0022word\u0022 || token.normalized !== \u0022go\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/sqlCompletion.ts, apps/desktop/src/lib/sql/sqlParameters.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":"apps/desktop/src/lib/sql/sqlCompletion.ts"},"region":{"startLine":3226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4623c3cb408c5dd88e8c08456b1b74fa6e00cbd0d968a0d694ad42d78979fe9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.kind === \u0022symbol\u0022 \u0026\u0026 token.value === \u0022(\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/oracleSyntaxDiagnostics.ts, apps/desktop/src/lib/sql/sqlServerRoutineSyntaxDiagnostics.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":"apps/desktop/src/lib/sql/oracleSyntaxDiagnostics.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e58a2969e4dba1a3e50f7754d56a6bdc2141aee3a109ba34a3634045be4d077"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.kind === \u0022symbol\u0022 \u0026\u0026 token.value === \u0022)\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/oracleSyntaxDiagnostics.ts, apps/desktop/src/lib/sql/sqlServerRoutineSyntaxDiagnostics.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":"apps/desktop/src/lib/sql/oracleSyntaxDiagnostics.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d012c8756004c474dd06dd593d7f93a94d5ae810995f9612bd071a154d4b6528"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.kind === \u0022word\u0022 \u0026\u0026 token.normalized === \u0022create\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/ddlDisplay.ts, apps/desktop/src/lib/sql/ddlStorage.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":"apps/desktop/src/lib/sql/ddlDisplay.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9c528a3de9e844e5cdd897a2edf2103dfbf7e4a33c85c86777cb20cfbecd29"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.kind === \u0022word\u0022 \u0026\u0026 token.normalized === \u0022select\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts, apps/desktop/src/lib/sql/semantic/completion.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":"apps/desktop/src/lib/editor/sqlSemanticSelectionRanges.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"654c41672bf8eaf42380040e01c7c9db8fbbf857040b9569b8d0136d12a36142"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.kind === \u0022word\u0022 || token.kind === \u0022quoted_identifier\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/editor/sqlIntentionActions.ts, apps/desktop/src/lib/table/tableColumnDefinitionPaste.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":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"af20e884564f5e5da25144375f75a1181656e3bc9a594e9c6f436996c67c8096"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token?.kind === \u0022word\u0022 || token?.kind === \u0022quoted_identifier\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/ddlStorage.ts, apps/desktop/src/lib/sql/semantic/completion.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":"apps/desktop/src/lib/sql/ddlStorage.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7bbd887109b2ee1eabd1188df24170f5987fd962cc358d16071cd65913f13c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tokens[index]?.normalized === \u0022with\u0022 \u0026\u0026 tokens[index \u002B 1]?.text === \u0022(\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/sql/insertValueHints.ts, apps/desktop/src/lib/sql/semantic/model.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":"apps/desktop/src/lib/sql/insertValueHints.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f335c393066d0facdd447b950bc951fb0c3a6593faf723917a6346aca573bc3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.startsWith(\u0022{\u0022) || trimmed.startsWith(\u0022[\u0022)\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/composables/useCellDetailEditor.ts, apps/desktop/src/lib/dataGrid/cellDetailPresentation.ts, apps/desktop/src/lib/dataGrid/dataGridDetail.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":"apps/desktop/src/composables/useCellDetailEditor.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbc58c960eb43228a7e5abc17009670fc73bbb0f4ddfb2ce57258bb04a04fe6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof chunk !== \u0022string\u0022 || Array.from(chunk).length !== Math.min(1000, length - offset \u002B 1)\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/table/oracleRoutineRename.ts, apps/desktop/src/lib/table/oracleTableRename.ts, apps/desktop/src/lib/table/oracleViewRename.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":"apps/desktop/src/lib/table/oracleRoutineRename.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17c70e586f3d6694b49c2a9ec0ad6b1790e097314b4d0ca111c0af79bfda7a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof entry !== \u0022string\u0022 \u0026\u0026 entry.size \u003E 0\u0060 appears character-identically in 2 files \u2014 docs/lib/issueSubmission.ts, docs/worker.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":"docs/lib/issueSubmission.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf168ebc45fb5201fc12c5465d5fbb83564d400fc19fba79460ca85ea691a6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof error === \u0022object\u0022 \u0026\u0026 error !== null \u0026\u0026 \u0022code\u0022 in error\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/postgresProcessList.ts, apps/desktop/src/lib/database/postgresServerStatus.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":"apps/desktop/src/lib/database/postgresProcessList.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca587c24c9882e5dda023834d73b72a1dfa27f108cc99bd8aae6cb5df132138"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof id === \u0022string\u0022 \u0026\u0026 id.trim().length \u003E 0\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/quickOpen/quickOpenScope.ts, apps/desktop/src/stores/settingsStore.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":"apps/desktop/src/lib/quickOpen/quickOpenScope.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb3cae43a29a5399861a34526d911e39e6943abe5f21a7ffa25976617e09d1f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item === \u0022string\u0022 \u0026\u0026 item.length \u003E 0\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/composables/useDataCompareConfig.ts, apps/desktop/src/lib/diagram/draft-storage.ts, apps/desktop/src/lib/redis/redisCommandDocs.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":"apps/desktop/src/composables/useDataCompareConfig.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6068167e819c2b1559aa635480865124a65d94772f1dca0acf7b856b2178acbe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item.id !== \u0022string\u0022 || !item.id.trim()\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/plugins/pluginAiRecommendations.ts, plugins/sdk/dev-host/server.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginAiRecommendations.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f561c2b2c655b8dbafc2c3a6b4d4f6bf1ea72ff74ad5f4018057fe9c6db8ca5f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof part === \u0022string\u0022 \u0026\u0026 part.length \u003E 0\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/connection/connectionUrlBuilder.ts, apps/desktop/src/lib/table/oracleTypeDataMapping.ts, apps/desktop/src/lib/table/oracleTypeManagement.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":"apps/desktop/src/lib/connection/connectionUrlBuilder.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c33da2c9e1f7f1ee107a084ae8121640ec242dafd637981e8b425af9ac4003"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof payload !== \u0022object\u0022 || payload === null || typeof payload.installs !== \u0022object\u0022 || payload.installs === null\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/plugins/pluginMarketplace.ts, docs/lib/pluginStats.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":"apps/desktop/src/lib/plugins/pluginMarketplace.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bf2918fb26ea5deb8558ff9dfa2beb22cb1bbaa6966cdd7e3af2ef472976c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof performance !== \u0022undefined\u0022 \u0026\u0026 typeof performance.now === \u0022function\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/connection/actionActivation.ts, apps/desktop/src/lib/metadata/metadataLoadCoordinator.ts, apps/desktop/src/lib/metadata/metadataRuntimeCache.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":"apps/desktop/src/lib/connection/actionActivation.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b4780a49bfd94de7202c8a29b1dee0d8247bd7b1af035b7daf943881b9dcd8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof selection !== \u0022object\u0022 || selection === null || typeof selection.includeSecrets !== \u0022boolean\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/cloudSync/snippetAutoUploadConfig.ts, apps/desktop/src/lib/webdav/webdavAutoUploadConfig.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":"apps/desktop/src/lib/cloudSync/snippetAutoUploadConfig.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0f54aa4208ba6cc7292b10202859fe37eda89617be25e0438bc3fe57a543a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022number\u0022 || !Number.isFinite(value)\u0060 appears character-identically in 11 files \u2014 apps/desktop/src/lib/ai/aiTypography.ts, apps/desktop/src/lib/connection/timeoutLimits.ts, apps/desktop/src/lib/dataGrid/dataGridTextFilterPanel.ts, apps/desktop/src/lib/metadata/metadataRuntimeCache.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":"apps/desktop/src/lib/ai/aiTypography.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd30810c9a0e949c30730dc16d09e3f6c9bd006045b42a5226e84cbf99af8c2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022number\u0022 || !Number.isFinite(value) || value \u003C 0\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/lib/connection/timeoutLimits.ts, apps/desktop/src/lib/nacos/nacosDashboard.ts, apps/desktop/src/lib/plugins/pluginHostBridge.ts, apps/desktop/src/lib/sidebar/sidebarDatabaseStorage.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":"apps/desktop/src/lib/connection/timeoutLimits.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"acacde4b04c4609121bcfb0b75981edf3b874e88ed35fb1e15278594096e009c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022number\u0022 || !Number.isFinite(value) || value \u003C= 0\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/connection/timeoutLimits.ts, apps/desktop/src/lib/plugins/frontendPlugin.ts, apps/desktop/src/lib/plugins/pluginHostBridge.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":"apps/desktop/src/lib/connection/timeoutLimits.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b95d256bef8f564a01692b419850328da526c45fd510247ca8850d3636553a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || !/^[A-Za-z0-9][A-Za-z0-9._:/-]{0,255}$/.test(value)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/plugins/pluginHostBridge.ts, plugins/sdk/dev-host/sidecar.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffd332454b2fe36080f8c49eec79a1b5eec38df3a4eeb921a033a1d05b42203"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || !/^\\d\u002B$/.test(value)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts, apps/desktop/src/lib/database/sessionDiagnostics.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":"apps/desktop/src/lib/database/oceanbaseSessionDiagnostics.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a26a1a194797aaad78c22d23f28bc9c3c1b24ddbe6b7d16aa28c846f6f796d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || !value.trim()\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/diagram/db2ExplainPlan.ts, apps/desktop/src/lib/table/objectBrowserRows.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":"apps/desktop/src/lib/diagram/db2ExplainPlan.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a043fd78e14170d5249b035be8b4f457339db56efc5d20d37102ad9d74f6fdb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 17 files \u2014 apps/desktop/src/components/transfer/queryResultTransferValues.ts, apps/desktop/src/lib/ai/maxAgentTurns.ts, apps/desktop/src/lib/app/appBackgroundImage.ts, apps/desktop/src/lib/dataGrid/dataGridCountValue.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":"apps/desktop/src/components/transfer/queryResultTransferValues.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba08fdd590717bb46f380232cd70578629fba6c67d0ccba0cd228b9d4c0f408"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 \u0026\u0026 Number.isFinite(value) \u0026\u0026 value \u003E 0\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/connection/connectionAttemptTimeout.ts, apps/desktop/src/lib/plugins/pluginMarketplace.ts, apps/desktop/src/lib/table/routineParameters.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":"apps/desktop/src/lib/connection/connectionAttemptTimeout.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"97550438ebc786dc2bfa53494dfe664178e156e5b4a17b39c6bb747f96351ca5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 || typeof value === \u0022bigint\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/redis/redisValuePresentation.ts, apps/desktop/src/lib/tabs/queryResultSize.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":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"90281f65cad81ec0f9c739de279d19610a79b343ea853013a38a6313afdb6dc8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 || typeof value === \u0022boolean\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/diagram/explainPlan.ts, apps/desktop/src/lib/mongo/mongoDocumentValues.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":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd8be883ea2cf259105bdc620c6b966951b7505652c6d0f98283368e7110683"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 || typeof value === \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/imports/anotherRedisImport.ts, apps/desktop/src/lib/imports/redisDesktopManagerImport.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":"apps/desktop/src/lib/imports/anotherRedisImport.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b831b5f13b2a12cff8580048b64aca9860e5b13cd0b1df0df44fe2f621744a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022object\u0022 \u0026\u0026 value !== null\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts, apps/desktop/src/lib/dataGrid/dataGridCopyExtractor.ts, apps/desktop/src/lib/redis/redisValuePresentation.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":"apps/desktop/src/lib/dataGrid/dataGridColumnHighlight.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f13e2ed0fd47052d1181e70b950127c0234799674822a0bf1a2307e6d15352"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022object\u0022 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 8 files \u2014 apps/desktop/src/lib/common/jsonCopyValue.ts, apps/desktop/src/lib/connection/connectionPassword.ts, apps/desktop/src/lib/plugins/frontendPlugin.ts, apps/desktop/src/lib/plugins/pluginHostBridge.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":"apps/desktop/src/lib/common/jsonCopyValue.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bad136be3e8611cf19fb8cd5e0705c9a3e15eb2775bfcdf88fd282c2e157c46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 value.trim()\u0060 appears character-identically in 7 files \u2014 apps/desktop/src/lib/ai/aiPluginConversation.ts, apps/desktop/src/lib/diagram/db2ExplainPlan.ts, apps/desktop/src/lib/diagram/explainPlan.ts, apps/desktop/src/lib/mq/kafkaTopicStats.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":"apps/desktop/src/lib/ai/aiPluginConversation.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"106376beaa78fc0a914978a6971efac8b0f92e7f6cff9dc8a22affea0e4115ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 value.trim() !== \u0022\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/gridClientFilter.ts, apps/desktop/src/lib/mq/mqPolicyForms.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":"apps/desktop/src/lib/dataGrid/gridClientFilter.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aade0e5784c04e9b901fb04d5cd8df5034424b83cfc917081e0cadf184b9c18"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 value.trim() === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/connection/sshLocalPort.ts, apps/desktop/src/lib/query/multiSourceResult.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":"apps/desktop/src/lib/connection/sshLocalPort.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"106c2b8c80a1fbbb777cc9dfacc043b3e843ce14833015c6b7792136a1fa6f01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 value.trim().length \u003E 0\u0060 appears character-identically in 6 files \u2014 apps/desktop/src/lib/app/appAppearance.ts, apps/desktop/src/lib/diagram/diagram-constants.ts, apps/desktop/src/lib/metadata/metadataLoadScope.ts, apps/desktop/src/lib/plugins/frontendPlugin.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":"apps/desktop/src/lib/app/appAppearance.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6474ce3b980e4b84ecfe5598cd26d78c8e83741e2ab5b9c27fdf15494d0a294f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 || typeof value === \u0022number\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/hbase/hbaseBrowserPreferences.ts, apps/desktop/src/stores/plDebugStore.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":"apps/desktop/src/lib/hbase/hbaseBrowserPreferences.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe656983250cce28165079f8bf0645d2b7d51537a4d52cf1f7766455ef035755"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof window !== \u0022undefined\u0022 \u0026\u0026 typeof window.setTimeout === \u0022function\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/dataGrid/dataGridViewStateCache.ts, apps/desktop/src/lib/tabs/documentBrowserStateCache.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":"apps/desktop/src/lib/dataGrid/dataGridViewStateCache.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ef2e55f7b364a9182fe67006cae93e530b5b9f4912775c745c0e838cff9303"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof window === \u0022undefined\u0022 || typeof window.matchMedia !== \u0022function\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useTheme.ts, apps/desktop/src/lib/ui/legacyWebView.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":"apps/desktop/src/composables/useTheme.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47dbe2b82ab25012d6a9b835e83a7b7906acd8b6cc3419c3e804431400e61e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060update.docChanged || update.selectionSet\u0060 appears character-identically in 4 files \u2014 apps/desktop/src/components/editor/queryEditorSqlExtensions.ts, apps/desktop/src/lib/editor/codemirrorSelectionMatches.ts, apps/desktop/src/lib/editor/codemirrorTrimmedSelectionLayer.ts, apps/desktop/src/lib/editor/queryEditorNativeSelection.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":"apps/desktop/src/components/editor/queryEditorSqlExtensions.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23b04ced1e8a41a95de7c748602d084992dce18a32d441179adfcb87d47b3de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060update.docChanged || update.selectionSet || update.viewportChanged || update.geometryChanged\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/editor/codemirrorSelectionMatches.ts, apps/desktop/src/lib/editor/codemirrorTrimmedSelectionLayer.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":"apps/desktop/src/lib/editor/codemirrorSelectionMatches.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e38882634dd6f080eb0bf66dac3283893d9443f3c85310274c9093ca04ecb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060update.docChanged || update.viewportChanged\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/editor/codemirrorInsertValueHints.ts, apps/desktop/src/lib/editor/codemirrorShowWhitespace.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":"apps/desktop/src/lib/editor/codemirrorInsertValueHints.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00007c26d9bd483643db45383f2b6d9117a740e13b3b561d9127c520ebf3f87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060updateFrame \u0026\u0026 typeof cancelAnimationFrame === \u0022function\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/composables/useTabScroll.ts, apps/desktop/src/composables/useTabTitleTruncation.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":"apps/desktop/src/composables/useTabScroll.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72abd14046bdba48f52e016af306a42919b6c13819b74482b8a0f6c34bdcc05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0022object\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/composables/useDataGridExport.ts, apps/desktop/src/lib/common/safeJsonFormat.ts, apps/desktop/src/lib/mongo/mongoShellCommand.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":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"40455838c2b84dad6849142b700949aa29c807d7fd5651bef1cd89958b0bdbff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 5 files \u2014 apps/desktop/src/lib/diagram/explainPlan.ts, apps/desktop/src/lib/mongo/mongoShellCommand.ts, apps/desktop/src/lib/plugins/dynamicContextMenu.ts, apps/desktop/src/lib/table/tableImport.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":"apps/desktop/src/lib/diagram/explainPlan.ts"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"c848439a6d9c1303818219b066e809588be6e7ad4b3c2269c66e41cc317720a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 12 files \u2014 apps/desktop/src/i18n/locales/fallback.ts, apps/desktop/src/lib/app/windowContext.ts, apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts, apps/desktop/src/lib/connection/elasticsearchKibanaProxy.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":"apps/desktop/src/i18n/locales/fallback.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7096f406252880eaffff7239bf14dc7832bc437ce191aae2251714cc9287843"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value \u003C= BigInt(Number.MAX_SAFE_INTEGER) \u0026\u0026 value \u003E= BigInt(Number.MIN_SAFE_INTEGER)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/redis/codec/msgpack.ts, apps/desktop/src/lib/redis/codec/pickle.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":"apps/desktop/src/lib/redis/codec/msgpack.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e34821e58d14f4aff005ea7e38c3bdad8f846339002b603a249d3ca9ff2e8a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === \u0022current\u0022 || value === \u0022first\u0022 || value === \u0022new\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/ai/aiSqlTargetTab.ts, apps/desktop/src/lib/settings/settingsTransfer.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":"apps/desktop/src/lib/ai/aiSqlTargetTab.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b21c7a8c1ce3df60a99317798b4d684496fefdc83e9ceb2ba23600425cf07f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0022object\u0022\u0060 appears character-identically in 3 files \u2014 apps/desktop/src/lib/database/nativeJobAdmin.ts, apps/desktop/src/lib/database/nativeJobs.ts, apps/desktop/src/lib/settings/editorSettingsDraft.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":"apps/desktop/src/lib/database/nativeJobAdmin.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc789b2214a491fea92e50cb0e96da082f6b24e7ddd15b0ceabd6e95f9bdd09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value === \u0022string\u0022 || typeof value === \u0022number\u0022 || typeof value === \u0022boolean\u0022\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/app/documentJsonValues.ts, apps/desktop/src/lib/mongo/mongoDocumentValues.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":"apps/desktop/src/lib/app/documentJsonValues.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e05d5979780b541075ed6bdb0c0d9595faac7f3ff4f7f86775b09ee182cdfe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === undefined || value === null || value === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 .github/scripts/backfill-similar-issues.mjs, plugins/sdk/dev-host/connections.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/backfill-similar-issues.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ea00d4ce5e555d0f8e025b8029babfd25a3feba3d5f7c4d081adf79cbba0b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060year % 4 === 0 \u0026\u0026 (year % 100 !== 0 || year % 400 === 0)\u0060 appears character-identically in 2 files \u2014 apps/desktop/src/lib/influxdb/influxDbV1Delete.ts, apps/desktop/src/lib/mongo/mongoShellCommand.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":"apps/desktop/src/lib/influxdb/influxDbV1Delete.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2253fb344cdf243a14aa52d195329e39f2cc2f694c44c5710496a89eceeabbbd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!has_active_assignment \u0026\u0026 !has_committed_offsets\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/admin/mq/adapters/kafka.rs, crates/dbx-core/src/admin/mq/adapters/rocketmq.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/kafka.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8333117ddc56ed08e90233d9d4f0650fcbc4cf733102409640292dfb7f99a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!model.is_empty() \u0026\u0026 !model.eq_ignore_ascii_case(\u0022default\u0022)\u0060 appears character-identically in 5 files \u2014 crates/dbx-ai-provider/src/ai_codebuddy_cli.rs, crates/dbx-ai-provider/src/ai_codex_cli.rs, crates/dbx-ai-provider/src/ai_opencode_cli.rs, crates/dbx-ai-provider/src/ai_pi_agent_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"0819fed4a4cf8b0f0e32e653a5e5cf67109e0d77b59b1016b9b36fa56fa2e2fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ordinary.statements.is_empty() || !ordinary.warnings.is_empty()\u0060 appears character-identically in 3 files \u2014 crates/dbx-sql-schema/src/table_structure_sql/existing_primary_key.rs, crates/dbx-sql-schema/src/table_structure_sql/oracle_constraints.rs, crates/dbx-sql-schema/src/table_structure_sql/oracle_foreign_keys.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/existing_primary_key.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1e879740c1cdf6763ae0d44c79056b021fc91088e28634e466b957152ccf7f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!plugin.compatibility.compatible || plugin.manifest.backend_entrypoint().is_none()\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/ai/plugin_tools.rs, crates/dbx-mcp/src/backend.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_tools.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"357168e08c962c993e9cda17f78d1168a8991b4e3c4e9276590d84305bb6f1e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!proxy.username.is_empty() || !proxy.password.is_empty()\u0060 appears character-identically in 4 files \u2014 crates/dbx-core/src/admin/consul/client.rs, crates/dbx-core/src/connection/mod.rs, crates/dbx-drivers/src/db/cloudflare_d1/mod.rs, crates/dbx-drivers/src/db/proxy_tunnel.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/client.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f29bf5e06d001b3009d475824e3fbbc4d577d3e8be7ecf2ec8b6fcf95b23e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!trimmed.starts_with(\u0027(\u0027) || !trimmed.ends_with(\u0027)\u0027)\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-schema/src/schema_diff.rs, crates/dbx-sql-schema/src/table_structure_sql/column_format.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa635c3a595a9cc2ec16dda3c630b32e901ef70034f46e8a4264517e61507a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value.is_empty() \u0026\u0026 !value.contains(\u0027\\0\u0027)\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-schema/src/native_job_changes.rs, crates/dbx-types/src/native_jobs.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/native_job_changes.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0c067eb731abf143928c7ccbbe281b24d6dac5a9d37c32a3f8a0de219d5d89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060base_name.is_empty() || base_name == \u0022.\u0022 || base_name == \u0022..\u0022\u0060 appears character-identically in 3 files \u2014 crates/dbx-web/src/routes/mongodb_import_export.rs, crates/dbx-web/src/routes/sql_file.rs, crates/dbx-web/src/routes/table_import.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/mongodb_import_export.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15cf5fb8eb1ae140c983a28d9f9beeec14c2484c385109cc8557d9d9d00f72a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060before.columns != after.columns || before.rows != after.rows\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/schema/oracle_routines/transfer/packages/external_types.rs, crates/dbx-core/src/schema/oracle_routines/transfer/packages/pending.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/transfer/packages/external_types.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c09127f94bc55c46795d4f88eac49dcef934c3e259129dc4ca2422383e20528"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byte.is_ascii_alphabetic() || byte == b\u0027_\u0027\u0060 appears character-identically in 3 files \u2014 crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs, crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs, crates/dbx-sql-schema/src/schema_diff.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb5db709360484f1215dfa444af5b8aa05b8e0d054c3a5a26f0e45e2013f068"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidates.len() \u003C limit \u0026\u0026 kinds.iter().any(CompletionAssistantObjectKind::is_routine_like)\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-driver-postgres/src/postgres.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3938}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a25c1787095358eaf27bdf048dd90c459b2929f80e0bc7f89e92efa9b6c72a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidates.len() \u003C limit \u0026\u0026 kinds.iter().any(CompletionAssistantObjectKind::is_table_like)\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-driver-postgres/src/postgres.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3910}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd9497bc4a8abf6ad18fce1d85b6a469b46b71237a344718fb0db1694ead0bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch.is_ascii_alphanumeric() || ch == \u0027-\u0027 || ch == \u0027_\u0027 || ch == \u0027.\u0027\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-agent/src/agent_service.rs, crates/dbx-driver-agent/src/driver_delta.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_service.rs"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9cc579493b240d60843aaee808856c90edfa2f3cdcf5ca0e7ed36ff5c13a9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060channel_len == 0 || payload.len() \u003C 2 \u002B channel_len\u0060 appears character-identically in 2 files \u2014 crates/dbx-plugin-runtime/src/plugins/runtime.rs, plugins/sdk/rust/dbx-plugin-sdk/src/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/runtime.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ed64b59529e860c7e87fc99bdd0b58ff8514041cf33de59d48e25933fe645a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060column.character_set.trim() != original.character_set.as_deref().unwrap_or(\u0022\u0022) || column.collation.trim() != original.collation.as_deref().u\u2026\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs, crates/dbx-sql-schema/src/table_structure_sql/columns.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f159cc1b9a94e6850d07c09de22f564342c39341f03dde26e91a6749ba1fded0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.db_type == DatabaseType::Oracle \u0026\u0026 !is_default_oracle_agent_config(config)\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/schema/exact_metadata.rs, crates/dbx-core/src/schema/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/exact_metadata.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcec3f6f1334013dda8fc748f4cf3b35b50a2bb85c063e62d3148f406b8b232"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.driver_profile.as_deref() != Some(MONGO_LEGACY_DRIVER_PROFILE) || config.driver_label.as_deref() != Some(MONGO_LEGACY_DRIVER_LABEL)\u0060 appears character-identically in 2 files \u2014 crates/dbx-web/src/routes/connection.rs, src-tauri/src/commands/connection.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/connection.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"918528517d90b813747431961283f6562c5b051c91c950b9b50dea76103822b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.mode == JavaRuntimeMode::Custom || config.mode == JavaRuntimeMode::System\u0060 appears character-identically in 2 files \u2014 crates/dbx-web/src/routes/agents.rs, src-tauri/src/commands/agents.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/agents.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2ebfe6c49489ec91e4733232ce6352306c2ecd0088fc0975888a7bb2586430"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.generation != generation || data.runtime_exited\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/query/pl_debug.rs, crates/dbx-core/src/query/pl_debug/lifecycle.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/pl_debug.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f5dc5ddb06077c893c2b7e549e9f39785c264a576686c6e03fc4b407fcb7a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060database.trim().is_empty() || catalog.is_some()\u0060 appears character-identically in 2 files \u2014 crates/dbx-web/src/routes/query.rs, src-tauri/src/commands/query.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/routes/query.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dfe2bd2a8fece1a7c6ea7746b5b7aed16fc54b2a13175f48ea6deb3203f7f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing.data_type.trim().is_empty() \u0026\u0026 !column.data_type.trim().is_empty()\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/schema/mod.rs, crates/dbx-core/src/schema/normalization.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":10206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bdd11f61b4835dc4f9cc6c92fe996e42c9e2ecdddd0b7654c577f0100c99ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060extension != \u0022cmd\u0022 \u0026\u0026 extension != \u0022bat\u0022\u0060 appears character-identically in 3 files \u2014 crates/dbx-ai-provider/src/ai_codex_cli.rs, crates/dbx-ai-provider/src/ai_opencode_cli.rs, crates/dbx-ai-provider/src/ai_pi_agent_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6956d046996146ffc6ef719cf19c4a960f57bd991427f291925c5f7bcbc162"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filter.is_empty() || filter.contains_key(\u0022$where\u0022) || filter.contains_key(\u0022$expr\u0022)\u0060 appears character-identically in 3 files \u2014 crates/dbx-driver-mongodb/src/mongo_shell.rs, crates/dbx-web/src/routes/mcp_policy.rs, src-tauri/src/commands/mcp_bridge.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e07112d44174354393b48f657958fc766699f9389e130215f5ab79b7997608"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first == \u0027_\u0027 || first.is_ascii_alphabetic()\u0060 appears character-identically in 7 files \u2014 crates/dbx-ai-provider/src/ai_codebuddy_cli.rs, crates/dbx-ai-provider/src/ai_codex_cli.rs, crates/dbx-ai-provider/src/ai_cursor_cli.rs, crates/dbx-ai-provider/src/ai_opencode_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"426962a42108dbd4401f55af86199c74f0268a46abfaf987d4491356c655ac7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first.is_ascii_alphabetic() || first == \u0027_\u0027\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-dialect/src/sql_dialect/capabilities.rs, crates/dbx-sql-schema/src/table_structure_sql/util.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/capabilities.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da3ab7884af487d46490b0e8414a1519fb796505dad1bb5a46a1fa3796088f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first.is_ascii_alphabetic() || first == \u0027_\u0027 || first == \u0027$\u0027\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-agent/src/agent_connection.rs, crates/dbx-plugin-runtime/src/plugins/manifest.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_connection.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa52de91a7abfd1eb3d7edfe807e30462d83c75ed056854f9027fe2d546e3a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first.is_ascii_lowercase() || first.is_ascii_digit()\u0060 appears character-identically in 3 files \u2014 crates/dbx-plugin-runtime/src/plugins/installer.rs, crates/dbx-plugin-runtime/src/plugins/manifest.rs, src-tauri/src/commands/plugin_storage.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/installer.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f565867b6a62aecd70f0d8acf23dd4c7b3e5808029032946955b2050c1463508"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_attribute_change \u0026\u0026 !capabilities.alter_existing_column \u0026\u0026 dialect != StructureDialect::Sqlite\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs, crates/dbx-sql-schema/src/table_structure_sql/columns.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc3269b3afcaccd6c44c8ed2c169ec0ccf3f2290d06ceacd37b84a466f5b108"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_comment_change \u0026\u0026 !capabilities.comment\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs, crates/dbx-sql-schema/src/table_structure_sql/columns.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b251d591784d6771e1cb5d40ea6e2d815ba59c8090d8522957aaf870178afa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_comment_change \u0026\u0026 capabilities.comment\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs, crates/dbx-sql-schema/src/table_structure_sql/columns.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b438b3d0b05ec38f84b93697c00093a227d31362f943af0248d71f18badb803"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_rename \u0026\u0026 !capabilities.rename_column\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs, crates/dbx-sql-schema/src/table_structure_sql/columns.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c07533e850cf0212c69ff26800d065d8946e0c15d7a49f44471eb65c7c3000"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host != config.host || port != config.port\u0060 appears character-identically in 3 files \u2014 crates/dbx-core/src/connection/mod.rs, crates/dbx-driver-agent/src/agent_connection.rs, src-tauri/src/commands/connection.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":4208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1e1d015aacc08e1ab8b40bc03d3b552fed4307122d4625113a56e8f9bbcac4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host == config.host \u0026\u0026 port == config.port\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/connection/mod.rs, crates/dbx-driver-agent/src/agent_connection.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8920}}}],"partialFingerprints":{"codehealthFindingId/v1":"4005f6011d49e69eb01bc1c79177c1c98001bd72185cc9e987ca2e5e848788e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host.contains(\u0027:\u0027) \u0026\u0026 !host.starts_with(\u0027[\u0027)\u0060 appears character-identically in 2 files \u2014 crates/dbx-platform/src/proxy.rs, crates/dbx-types/src/models/connection.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-platform/src/proxy.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2dffcddebe91aa0f678785ea46c419f7a14797a5df50c03ceae0b7ceecb9bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 \u003C bytes.len() \u0026\u0026 !(bytes[i] == b\u0027*\u0027 \u0026\u0026 bytes[i \u002B 1] == b\u0027/\u0027)\u0060 appears character-identically in 3 files \u2014 crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-driver-sqlserver/src/sqlserver.rs, crates/dbx-drivers/src/db/sqlite.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7924}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b0f7ea1ff3f78ce10231207842c03d81b3c28bcad12752b97df7bbf07b5fd4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 \u003C bytes.len() \u0026\u0026 bytes[i \u002B 1] == quote\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-drivers/src/db/sqlite.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":5786}}}],"partialFingerprints":{"codehealthFindingId/v1":"163468e3c6e894a8a3e14ea4407869b918e2d3ed2c3aabc25b8dbf13194ab42c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 \u003C bytes.len() \u0026\u0026 bytes[i] == b\u0027-\u0027 \u0026\u0026 bytes[i \u002B 1] == b\u0027-\u0027\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-driver-sqlserver/src/sqlserver.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7906}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2c4d01ee53b221a34c4029427aff01a34778f519c24174c4e4bd523df5adeb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 \u003C bytes.len() \u0026\u0026 bytes[i] == b\u0027/\u0027 \u0026\u0026 bytes[i \u002B 1] == b\u0027*\u0027\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-driver-sqlserver/src/sqlserver.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7922}}}],"partialFingerprints":{"codehealthFindingId/v1":"990dc743a39116b720e0d3448e461cecedc630e8d0481d58e652738b5927598b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C bytes.len() \u0026\u0026 bytes[i].is_ascii_whitespace()\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-driver-sqlserver/src/sqlserver.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":7902}}}],"partialFingerprints":{"codehealthFindingId/v1":"113f946d17c481e162e0a4f11b64ed73c9c7f146028375b41bbfd83adeee42ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060identity.seed.is_some() || identity.increment.is_some()\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs, crates/dbx-sql-schema/src/table_structure_sql/column_format.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6821255f59bd83bad5de1d404ea4096691b9dc583cb6274acb51aebf8a9db83f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u002B 1 \u003C bytes.len() \u0026\u0026 !(bytes[index] == b\u0027*\u0027 \u0026\u0026 bytes[index \u002B 1] == b\u0027/\u0027)\u0060 appears character-identically in 5 files \u2014 agents/drivers/duckdb/src/sql.rs, crates/dbx-core/src/data/table_import.rs, crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c0e8c3f1d02fc9730c9fb29a4ea974aacdea3d6b1d40ccae8c915afdad10c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u002B 1 \u003C bytes.len() \u0026\u0026 bytes[index] == b\u0027-\u0027 \u0026\u0026 bytes[index \u002B 1] == b\u0027-\u0027\u0060 appears character-identically in 2 files \u2014 agents/drivers/duckdb/src/sql.rs, crates/dbx-core/src/data/table_import.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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"3feb83bbfd864631483a4ab1156740685ae3c3b1a9ca5c7e432b70f509b86536"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u002B 1 \u003C bytes.len() \u0026\u0026 bytes[index] == b\u0027/\u0027 \u0026\u0026 bytes[index \u002B 1] == b\u0027*\u0027\u0060 appears character-identically in 3 files \u2014 agents/drivers/duckdb/src/sql.rs, crates/dbx-core/src/data/table_import.rs, crates/dbx-driver-mysql/src/mysql.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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"74be3a98bbb1287472d79eedada89a1470911c69ec97f7b6ef356999de5edcc9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C bytes.len() \u0026\u0026 (bytes[index].is_ascii_alphanumeric() || bytes[index] == b\u0027_\u0027)\u0060 appears character-identically in 4 files \u2014 agents/drivers/duckdb/src/sql.rs, crates/dbx-core/src/data/table_import.rs, crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs, crates/dbx-driver-mysql/src/mysql.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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eedfdbf16a5a931678f827b65dc83a6f7f57f6d4e2334f66fbce41269bb7cea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C bytes.len() \u0026\u0026 bytes[index] != b\u0027\\n\u0027\u0060 appears character-identically in 6 files \u2014 agents/drivers/duckdb/src/sql.rs, crates/dbx-core/src/data/table_import.rs, crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs, crates/dbx-driver-mysql/src/mysql.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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"612d8bbd51ba278b27a9a2d331dcd1f7f2dbd80a17339c53e920a3684339e1a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C bytes.len() \u0026\u0026 bytes[index].is_ascii_digit()\u0060 appears character-identically in 2 files \u2014 crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs, crates/dbx-drivers/src/db/dynamodb_driver.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/cloudflare_d1/sql_lexer.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8d380ab743dfd7260b21115d7ee81a7209192f05d0bd5fea190665ef6d30ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C bytes.len() \u0026\u0026 bytes[index].is_ascii_whitespace()\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/data/table_import.rs, crates/dbx-core/src/schema/table_structure_sql/sqlite_rebuild.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":2255}}}],"partialFingerprints":{"codehealthFindingId/v1":"80eceb57b076652161d2963601e774add1b7acb0169573b209d5ea0937df7707"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060k == \u0022auth_token\u0022 || k == \u0022authtoken\u0022 || k == \u0022auth-token\u0022\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/connection/mod.rs, src-tauri/src/commands/connection.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":8792}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c97ddc4cf138b5319d4f587e325b46f4700e7fa02bb91a9c75c80780d4031bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key == \u0022$or\u0022 \u0026\u0026 mongo_or_has_complementary_field_clauses(clauses)\u0060 appears character-identically in 3 files \u2014 crates/dbx-driver-mongodb/src/mongo_shell.rs, crates/dbx-web/src/routes/mcp_policy.rs, src-tauri/src/commands/mcp_bridge.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d8386a3d1af11dba59eee27897173b3bfe33d5f0102125457a36c1fd1c627a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.eq_ignore_ascii_case(\u0022require_ssl\u0022) \u0026\u0026 value.eq_ignore_ascii_case(\u0022true\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-types/src/models/connection.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3100}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a5a1e2e2d0d74d8acfd842e2c7996022f9cb939b683a3951611c4dc8f86500"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.eq_ignore_ascii_case(\u0022ssl-mode\u0022) || key.eq_ignore_ascii_case(\u0022sslmode\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-types/src/models/connection.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"274140cbe83013eb401ffc51d9f5a92db264268615c511502b762434869219a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.starts_with(\u0027$\u0027) || mongo_field_predicate_contains_opaque_logic(value)\u0060 appears character-identically in 3 files \u2014 crates/dbx-driver-mongodb/src/mongo_shell.rs, crates/dbx-web/src/routes/mcp_policy.rs, src-tauri/src/commands/mcp_bridge.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a38e74ce0ae1251a67da6b0fe5b456c61e6eeec9c3635215032428ffc1f52e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line == location.line \u0026\u0026 column == location.column\u0060 appears character-identically in 3 files \u2014 crates/dbx-core/src/data/transfer/oracle_table_contract/length.rs, crates/dbx-sql-core/src/object_source_sql.rs, crates/dbx-sql-schema/src/schema_diff/mysql_charset.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/oracle_table_contract/length.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"633164100f461fa9076c205c27ae4076262f93f176843204938ce63b472e940c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.is_empty() || line.starts_with(\u0027#\u0027)\u0060 appears character-identically in 3 files \u2014 crates/dbx-core/src/ai/agent_kv.rs, crates/dbx-sql-schema/src/sql_parser/git.rs, src-tauri/src/commands/support_info.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc2cdb613a90ee004a7e4ad83f5a4f2b4b43d7ed9a00399b91ede4151d866ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022auto_increment\u0022) || lower.contains(\u0022autoincrement\u0022) || lower.contains(\u0022identity\u0022) || lower.contains(\u0022serial\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-dialect/src/sql_dialect/type_rewrite.rs, crates/dbx-sql-schema/src/table_structure_sql/column_alter.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/type_rewrite.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ee80e897e46ee60f58d9aae33707cfd9951c3d58788006cf4efb4ad25e12f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022dbx-mcp-server\u0022) || lower.contains(\u0022enoent\u0022)\u0060 appears character-identically in 5 files \u2014 crates/dbx-ai-provider/src/ai_codebuddy_cli.rs, crates/dbx-ai-provider/src/ai_codex_cli.rs, crates/dbx-ai-provider/src/ai_cursor_cli.rs, crates/dbx-ai-provider/src/ai_opencode_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7cad7537a457c79f05504fcea6e1adaa75365fc5aaf913663d0a71333b9bc6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022json\u0022) || lower.contains(\u0022protocol\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-ai-provider/src/ai_cursor_cli.rs, crates/dbx-ai-provider/src/ai_opencode_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8a21f7b54346805043a3c88e28d3711364a4cdfcf6683ba7b91adc4ee4d595"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022mcp\u0022) \u0026\u0026 (lower.contains(\u0022dbx\u0022) || lower.contains(\u0022server\u0022))\u0060 appears character-identically in 5 files \u2014 crates/dbx-ai-provider/src/ai_codebuddy_cli.rs, crates/dbx-ai-provider/src/ai_codex_cli.rs, crates/dbx-ai-provider/src/ai_cursor_cli.rs, crates/dbx-ai-provider/src/ai_opencode_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d568f67d6339fb15d813f991c745233f60e22c781d6f30e6a05394626f29b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022no such file\u0022) || lower.contains(\u0022not found\u0022) || lower.contains(\u0022cannot find\u0022)\u0060 appears character-identically in 3 files \u2014 crates/dbx-ai-provider/src/ai_cursor_cli.rs, crates/dbx-ai-provider/src/ai_opencode_cli.rs, crates/dbx-ai-provider/src/ai_pi_agent_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"902deb00c00b7b0c6a0e44aabc854e44074a5fa428d87782faaded7dbacfae48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022not authenticated\u0022) || lower.contains(\u0022authentication required\u0022) || lower.contains(\u0022unauthorized\u0022) || lower.contains(\u0022please\u2026\u0060 appears character-identically in 2 files \u2014 crates/dbx-ai-provider/src/ai_cursor_cli.rs, crates/dbx-ai-provider/src/ai_opencode_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cursor_cli.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b6224cc70470bc4940443bd989e78005deed1d1f66bbec213f4444be682cb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022protocol\u0022) || lower.contains(\u0022invalid json\u0022) || lower.contains(\u0022parse\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-ai-provider/src/ai_codebuddy_cli.rs, crates/dbx-ai-provider/src/ai_qoder_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c0b46646337758c91b295219588260aa83c07117b17274e1baca1d597f6c3c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022unknown method\u0022) || lower.contains(\u0022method not found\u0022) || lower.contains(\u0022-32601\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/ai/plugin_mcp.rs, crates/dbx-mcp/src/backend.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/plugin_mcp.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfd43246f3f6a4a443f0c9b96e08bd9859ef4d3a603ff6db5341dd6beb90441"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(method) \u0026\u0026 (lower.contains(\u0022unknown method\u0022) || lower.contains(\u0022method not found\u0022))\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/query/document_ops.rs, crates/dbx-core/src/query/mongo_ops.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/query/document_ops.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3add55c5e4041977b258a5c627568cf304982bdda5b3412c68589e3e0824296"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(config.db_type, DatabaseType::Questdb) || matches!(config.driver_profile.as_deref(), Some(\u0022questdb\u0022))\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/schema/mod.rs, crates/dbx-core/src/schema/providers/native.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":12101}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fcd7a6417718fce4e53185d117ff12c5cfb009dfab23b29db00a73a64003e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.contains(\u0022No such file\u0022) || message.contains(\u0022not found\u0022) || message.contains(\u0022os error 2\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-ai-provider/src/ai_codebuddy_cli.rs, crates/dbx-ai-provider/src/ai_qoder_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89fa9f12bd9e5e124db76ff4d34fba601b9ac3cce8ac6c9c5d7b2057a7c118c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060object_type.eq_ignore_ascii_case(\u0022PROCEDURE\u0022) || object_type.eq_ignore_ascii_case(\u0022FUNCTION\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-mysql/src/mysql.rs, crates/dbx-mcp/src/backend.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":4878}}}],"partialFingerprints":{"codehealthFindingId/v1":"40701be07796eaf95b17021d4ae86dcd6bb4486b3043ae13a2c15dc2a24e0dd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.database_type != Some(DatabaseType::Mysql) || options.is_gaussdb_m_mode\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-schema/src/table_structure_sql/mysql_engine.rs, crates/dbx-sql-schema/src/table_structure_sql/mysql_table_charset.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/mysql_engine.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb1e8577c23fc469b4004e1ea31cfa7fd16dea3ebcbf12e883c7773422d29b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path == \u0022~\u0022 || path.starts_with(\u0022~/\u0022) || path.starts_with(\u0022~\\\\\u0022)\u0060 appears character-identically in 4 files \u2014 crates/dbx-drivers/src/db/clickhouse_driver.rs, crates/dbx-drivers/src/db/influxdb3_driver.rs, crates/dbx-drivers/src/db/influxdb_driver.rs, crates/dbx-drivers/src/db/victoriametrics_driver.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/clickhouse_driver.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7741355f417c0622925fef6db80cca2fd556786fe0aa3520829216a71b8e4101"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.as_os_str().is_empty() || path.is_absolute()\u0060 appears character-identically in 2 files \u2014 crates/dbx-plugin-runtime/src/plugins/assets.rs, crates/dbx-plugin-runtime/src/plugins/installer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-plugin-runtime/src/plugins/assets.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e711795c3ca8e984f3e31759b78c6a759f7e0e28240c639a3b23f645adf802c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.starts_with(\u0022\\\\\\\\\u0022) || path.starts_with(\u0022//\u0022) || path.contains(\u0022wsl.localhost\u0022) || path.contains(\u0022wsl$\u0022)\u0060 appears character-identically in 2 files \u2014 agents/drivers/duckdb/src/connection.rs, crates/dbx-drivers/src/db/sqlite.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":"agents/drivers/duckdb/src/connection.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"62702a8a2ffc3e352307ebe3e48d2099cd2db944376978492ef686198eefcf92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060percent_decode_str(key).decode_utf8_lossy().eq_ignore_ascii_case(\u0022directConnection\u0022) \u0026\u0026 percent_decode_str(value).decode_utf8_lossy().eq_ign\u2026\u0060 appears character-identically in 2 files \u2014 crates/dbx-driver-mongodb/src/mongo_driver.rs, crates/dbx-types/src/models/connection.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_driver.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d88618e6801fe79aed8e84ea87c36215b9670f3865594ac1c8d091dfdbe96c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060predicate.len() == 1 \u0026\u0026 predicate.get(\u0022$exists\u0022).and_then(serde_json::Value::as_bool) == Some(true)\u0060 appears character-identically in 3 files \u2014 crates/dbx-driver-mongodb/src/mongo_shell.rs, crates/dbx-web/src/routes/mcp_policy.rs, src-tauri/src/commands/mcp_bridge.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb4fc1174034c0f5f278ddc0b151cc3c88c26932093b99033b6e72a224cb101"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060predicate.len() == 1 \u0026\u0026 predicate.get(\u0022$nin\u0022).and_then(serde_json::Value::as_array).is_some_and(Vec::is_empty)\u0060 appears character-identically in 3 files \u2014 crates/dbx-driver-mongodb/src/mongo_shell.rs, crates/dbx-web/src/routes/mcp_policy.rs, src-tauri/src/commands/mcp_bridge.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mongodb/src/mongo_shell.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c6aad4d4df15b2d1fbd3b6e79787d8df37e45023b72bc0e804979e1aa3fd87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060program.contains(\u0027/\u0027) || program.contains(\u0027\\\\\u0027) || program.starts_with(\u0027~\u0027)\u0060 appears character-identically in 6 files \u2014 crates/dbx-ai-provider/src/ai_codebuddy_cli.rs, crates/dbx-ai-provider/src/ai_codex_cli.rs, crates/dbx-ai-provider/src/ai_cursor_cli.rs, crates/dbx-ai-provider/src/ai_opencode_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codebuddy_cli.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ef351406f60ab4baecdc1820f8ebdcd2a7e7c022702bb25cf843b6b73450d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060proxy.host.contains(\u0027:\u0027) \u0026\u0026 !proxy.host.starts_with(\u0027[\u0027)\u0060 appears character-identically in 3 files \u2014 crates/dbx-core/src/admin/consul/client.rs, crates/dbx-core/src/connection/mod.rs, crates/dbx-drivers/src/db/cloudflare_d1/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/client.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba66e07c435f9b3895e6fd03c955016b72d85e45bf3ac673734c9be58832c2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060quote_index == 1 || !(bytes[quote_index - 2].is_ascii_alphanumeric() || bytes[quote_index - 2] == b\u0027_\u0027)\u0060 appears character-identically in 2 files \u2014 agents/drivers/duckdb/src/sql.rs, crates/dbx-drivers/src/db/duckdb_sql.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":"agents/drivers/duckdb/src/sql.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"566434c1accf75d88c3710ca68777c20ee4e09fd44a1c39ac166a87a3bcc8701"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record.lifecycle == RoutineOperationLifecycle::Terminal \u0026\u0026 !record.dispatched\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/schema/oracle_routines/execution/tests.rs, crates/dbx-core/src/schema/oracle_routines/operations.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/execution/tests.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e01115a92a9ee1482cfe86f1d26b92a00d72034aa1ba0ef7ab2e0d18e8e8a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060select.projection.len() == 1 \u0026\u0026 matches!(select.projection.first(), Some(SelectItem::Wildcard(_)))\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/data/query_result_export.rs, crates/dbx-driver-support/src/elasticsearch_sql.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/query_result_export.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5ec5a32cd82d346b7f16f810e8a985147553ebdd507c29364591ae73032260"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sql.contains(\u0022ALL_OBJECTS\u0022) || sql.contains(\u0022DBA_OBJECTS\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/schema/oracle_routines/plan/tests.rs, crates/dbx-core/src/schema/oracle_routines/references/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/oracle_routines/plan/tests.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebadb66a03f6c5c3867df20c43de0a6131eefb7c4dfab023f6fc5b9d87d0c58"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_table == table \u0026\u0026 request.preserves_column_names()\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/data/transfer/ddl_plan.rs, crates/dbx-core/src/data/transfer/structure_plan.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/ddl_plan.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"594559b10c5a1a25d35a16cfbe86bcd4a413a56e6b9a65e95d1116f510cc3f4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.is_empty() || token.contains(char::is_whitespace)\u0060 appears character-identically in 2 files \u2014 crates/dbx-mcp/src/http_auth.rs, crates/dbx-web/src/web_mcp.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/http_auth.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d331fc54d524230b8ed87339e1d88483dc76874648288a20d643c861ac87e545"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.contains(\u0022://\u0022) || trimmed.starts_with(\u0022//\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/admin/mq/adapters/pulsar.rs, crates/dbx-core/src/admin/nacos/http.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/mq/adapters/pulsar.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8a6220c99d359d062c683f5f8692f1fb377fc52f88c93135b4a406580bc715"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.starts_with(\u0022((\u0022) \u0026\u0026 trimmed.ends_with(\u0022))\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-sql-schema/src/schema_diff.rs, crates/dbx-sql-schema/src/table_structure_sql/indexes.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/schema_diff.rs"},"region":{"startLine":4758}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9a656427b14ffc9128caf32abb8221912823ee775a591d26ae08cd22e76bea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.starts_with(\u0022http://\u0022) || trimmed.starts_with(\u0022https://\u0022)\u0060 appears character-identically in 3 files \u2014 crates/dbx-drivers/src/db/couchdb_driver.rs, crates/dbx-drivers/src/db/salesforce_driver.rs, crates/dbx-types/src/models/connection.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/couchdb_driver.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0076f4e8e3371fff76eb67176ad747e8ed6ef75db34122079ffdbdd429283062"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060upper.contains(\u0022CHAR\u0022) || upper.contains(\u0022CLOB\u0022) || upper.contains(\u0022TEXT\u0022)\u0060 appears character-identically in 2 files \u2014 crates/dbx-drivers/src/db/sqlite.rs, crates/dbx-sqlite-worker/src/runtime.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":3025}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f5e4006c111388e41ca74ea3d11f69ddc1fbcfe87f6127bd1c958113aa75a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060username.is_empty() || password.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/connection/mod.rs, crates/dbx-drivers/src/salesforce_oauth.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":5512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d13c3543f20a0a8d6cc4b835a5bff1bdcb6faf61eb5846faf5689b59fe9d70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.contains(\u0027.\u0027) || value.contains(\u0027e\u0027) || value.contains(\u0027E\u0027)\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/data/mongodb_import_export.rs, crates/dbx-core/src/data/table_import.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/mongodb_import_export.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69be0736ead59beae79c1ef3ce6aef1fd8899bf6af8542aace3f4b07e0937d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.eq_ignore_ascii_case(\u0022false\u0022) || value == \u00220\u0022\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/schema/native_jobs/details.rs, crates/dbx-sql-schema/src/native_job_changes/transitions.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/details.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b995042369f81fcbd97c6d2f46366431a4d930aa5b66520299bc535a26a7f98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.eq_ignore_ascii_case(\u0022true\u0022) || value == \u00221\u0022\u0060 appears character-identically in 2 files \u2014 crates/dbx-core/src/schema/native_jobs/details.rs, crates/dbx-sql-schema/src/native_job_changes/transitions.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/native_jobs/details.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8a631b6b59187682ec225b25ae6c9091b13d69ce1d528c01a26cf30eeba214"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060w.quote_style.is_none() \u0026\u0026 w.value.eq_ignore_ascii_case(expected)\u0060 appears character-identically in 4 files \u2014 crates/dbx-core/src/data/transfer/xugu_objects.rs, crates/dbx-sql-core/src/object_source_sql.rs, crates/dbx-sql-core/src/oracle_view_rename.rs, crates/dbx-sql-schema/src/schema_diff/mysql_charset.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/transfer/xugu_objects.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e546b3ee146b648f7dc84b10ebeb00712b9cbddf4dc8dd65f22ad0c391e43f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060word.quote_style.is_none() \u0026\u0026 word.value.eq_ignore_ascii_case(expected)\u0060 appears character-identically in 5 files \u2014 crates/dbx-core/src/data/sql_file_import/table_restore.rs, crates/dbx-core/src/data/transfer/oracle_table_contract.rs, crates/dbx-sql-core/src/object_source_sql.rs, crates/dbx-sql-core/src/query_execution_sql.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import/table_restore.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"97063a58fc546d086935567ad3d52732de6810c1358c0c82b6a36aad676645cf"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060column_count\u0060 is read from the bytes being parsed at line 417 (\u0060u32::from_be_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 433 \u2014 and nowhere in its scope is \u0060column_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060column_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/navicat_mysql_tunnel.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fcdcd11e6d500b994f91a2dd295127a1ef29c970f20925b9c35336ffa4de76"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 3434 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 3436 \u2014 and nowhere in its scope is \u0060len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/table_import.rs"},"region":{"startLine":3436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9af8ee8c7e8c0ce7f8659cb191369af633639f8ae68b673e9bd34e27a621a4"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept a context.Context or an AbortSignal: Only 17/72 functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http; net/http, net.Dial) accept a context.Context or an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a \u0060signal\u0060 (Go: \u0060ctx context.Context\u0060) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"577196fe89725f9b0e6c2faf89eceb8eb245919bd44e4439e0b0d649c1ee1c53"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: finishOAuth: \u0060finishOAuth\u0060 holds an AbortSignal but calls \u0060fetch(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060fetch(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/worker.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a6a3a648b70f8f4a4527db9d0ed9ccd434b21a66401e6375a721cb1719570e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: contributorAvatar: \u0060contributorAvatar\u0060 holds an AbortSignal but calls \u0060fetch(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060fetch(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/worker.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbfc21594a6fd656e393b9e0a81ae86fb2173b9042f1316a1dd57fd0856cf2e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: agentReleaseAsset: \u0060agentReleaseAsset\u0060 holds an AbortSignal but calls \u0060fetch(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060fetch(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/worker.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d4f5ab96a909e3f0d83410c37222d92cf2e72e279e7a81dd5358ace7a3c1fc"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: request: \u0060request\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/scripts/update-contributors.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a173adb20ca3cc3e0735843b0ef83acf565b2f907f0402ac50691bfc6c308ba"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchRegistry: \u0060fetchRegistry\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/lib/agentRegistrySource.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2794ab6b25616f74d5a27d6095bd4d9e78e64599712b8baa260cccd781427407"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: requestDraft: \u0060requestDraft\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/issues/IssueSubmissionClient.tsx"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec8b12cd68860e922ca902916b073b624cf3bfb04b989888e8246a46178d2a1"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchDailyUniques: \u0060fetchDailyUniques\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf04a25577cd1ba31a32c8e8224ee7affe93ebb81239a19184beb83c54af493"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchDownloadCounts: \u0060fetchDownloadCounts\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2126d05ae38f5791b851c1dd33e397535d814e972435bd2aa030c356f77b51a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchWindowCounts: \u0060fetchWindowCounts\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/worker.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"174c88a1c0f850af09ca1ec209e592a28b4c668cd726d21ed194c480cb87639e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: tokenFromWrangler: \u0060tokenFromWrangler\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/migrate-archive.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cd5bd4798e6352e9ee234e485cde2f5d4e08657e405875e4ee2e224614616e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: api: \u0060api\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/migrate-archive.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"288cf6084bcf2ccc8fbe6d8d57b8a16dc9f86af6c6b9eb09aee7b1b99af2296e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: apiText: \u0060apiText\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/plugin-stats-worker/migrate-archive.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4e73feed1989fadcf9c79e091d75930197c4521f43e14f2dc134609b666c45"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: writeRemoteRuntimeCache: \u0060writeRemoteRuntimeCache\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6e1d09b23a41f4ce26a89c647bf8894b13dec3dd5315e239bd9d37759a004a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: listRemoteRuntimeCacheMetadata: \u0060listRemoteRuntimeCacheMetadata\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"432ef9ef4b8757f587228cf82037b299b6675c188b3a24713224295b8902d588"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: pruneRemoteRuntimeCache: \u0060pruneRemoteRuntimeCache\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92b98ec9e8bb7c7073e2a7ecd5f95a971ee983388652171d30491583ba1b521"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: deleteRemoteRuntimeCacheOwner: \u0060deleteRemoteRuntimeCacheOwner\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"841773d64f6bed9d40984b8c6fcee38d66c59000f420b6003d82de6f5d262d22"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: readRemoteRuntimeCache: \u0060readRemoteRuntimeCache\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1154ca6ca2918d768962ef82d09e2ee4b758c99c1193dc5f5819c8eef0ab732"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: deleteRemoteRuntimeCache: \u0060deleteRemoteRuntimeCache\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a11853e269ec56f276ce40bdbe8ff3cc7949455362d5ddef5ad63cf0b2e2a7"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: logoutWeb: \u0060logoutWeb\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/startup/startupAuthentication.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf73ebd7aea90eb7c796d60febaa1111e80c0ce7be41f7afe86e104a5a50d6db"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: dataUrlToBlob: \u0060dataUrlToBlob\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5269b8a2358d0f340e42cd2bd1a0ae8a8bc2abfe122dac514bf5193240a6aa48"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: post: \u0060post\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cded008a502ac5c1f98ca747e6db2d42bab4048f0979bfb458b6c21e2a81af1"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: postQueryWithDiagnostics: \u0060postQueryWithDiagnostics\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7a60fb8777caf46ca466d7c7661d3bc9a1ad4421624e779f96e2022749364d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: get: \u0060get\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cf87c1678046206c356d95891573db67991884500762be94cbefa319bc24cf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: del: \u0060del\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"935cde59c1826646884c2f03ddc5fc9fa34b47d90385e9411a8cac3003b7c168"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: put: \u0060put\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5191dacc1875fdeb6ac790cbb8fb86da6eac4e4a06da6fda905d8e47a347f31"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: testConnectionWithInfo: \u0060testConnectionWithInfo\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acf938ca1c253768d1ec5ca563e4f46d498cb86a980fe72852edca740a32b45"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: installPluginPackage: \u0060installPluginPackage\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4a155d52fcc6dafef173253bf0f4d4b6228fe5faac1b48ab541c5078391de3"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: installPluginPackageFromUrl: \u0060installPluginPackageFromUrl\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92fcdf98e4926a51b7ff37eab8c2a1adea6ad062f74d69d0f4bb673418e64f5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: pluginAssetPayload: \u0060pluginAssetPayload\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac184e14a88ef2da876465f1ca5da5d509cf35092bd1392d98166b7cb6f5637"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: importJdbcDrivers: \u0060importJdbcDrivers\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe46e40194e837fc7cd50c5844e700709954f8dae52c6eb3298f5cf8ee8d6a6"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: installJdbcPluginLocal: \u0060installJdbcPluginLocal\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba665400325d10db5d019392afc877d9ef6156b33e09930fa27b7a8df23fe46"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: importAgentsFromZip: \u0060importAgentsFromZip\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d23e2b0183207ddeba3e0a4f736e4efe5389a7dd5a206fb799a704c4c900fb"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: importAgentDriver: \u0060importAgentDriver\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3157a1db190202845d576dbba66dd9f20a84316777849727c3662bf024248a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: aiStream: \u0060aiStream\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"8070fdb9662b598c5df8b2e8b593359e0c7e64560a7e63941c68f027cd4cef73"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: setMcpPluginScopeRule: \u0060setMcpPluginScopeRule\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2643}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5e713b9516cf0c29ed3831991a5bbe819220e57b0fccdacc4a555f17ad14dd"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: savePluginMcpGrant: \u0060savePluginMcpGrant\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2665}}}],"partialFingerprints":{"codehealthFindingId/v1":"3593c2570bd33154c67a573afd3ca80cffc5cb0b473a8febb6337a85f70292a5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: saveMcpGlobalPolicy: \u0060saveMcpGlobalPolicy\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2675}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab309df3cc2e1dd0099c8b4e7a378cd8adb7957e4ee31acdc469d1c406e52d09"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: saveWebMcpHttpSettings: \u0060saveWebMcpHttpSettings\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f163b1f2661be1e81115d802168cb7d017fac66d152f6f7e359c7595c4ffe1a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: rotateWebMcpToken: \u0060rotateWebMcpToken\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"16929dc6960abd1982dcd2b8e5dc61c5bd771b810ee7cf67bfcbb7850bb34b97"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: saveSqlFileUploadMaxMb: \u0060saveSqlFileUploadMaxMb\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3909e04addb5dc3c754f18d5f8783b3ee06c15148ac19370db27daedab3b509"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: saveMaxAgentTurns: \u0060saveMaxAgentTurns\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f6e8f7c2e70d3dd66fdaf8f8e35ff339601bc066773034356a9de0acea0dea"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: saveHistoryRetentionLimit: \u0060saveHistoryRetentionLimit\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f38a6d0e50326db2ce50540934e5e2e7e553515f071dc1d5f5752039aa18b67"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: saveMcpHistoryRetentionLimit: \u0060saveMcpHistoryRetentionLimit\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"962eaa8d6b7fc0225131f7639717898d59dc6dcd3498ffab624d01c5d8799ac0"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: saveMaxRetries: \u0060saveMaxRetries\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2780}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd17c1a78f06147c3ba0a569680e493cd376443afef05ee86a0cb11a882ea221"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: previewSqlFile: \u0060previewSqlFile\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6869c529638c45cafcd7b5b9f08b1697ac55fca729f4f5e620ff6c8b956afe7e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: previewTableImportFile: \u0060previewTableImportFile\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3448}}}],"partialFingerprints":{"codehealthFindingId/v1":"21889d189f5a54c8dbddbbf2c3266a5a1cdc4a72d5363141b635faceea4a8058"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: previewMongodbImportFile: \u0060previewMongodbImportFile\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3672}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff5b570b76102c33321ed1d0cf7349363a2418648740cf127b4f953a2775c0b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: nacosSearchConfigContent: \u0060nacosSearchConfigContent\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4918}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2ab84a638048c436f664fc4fd69275e3b3224a9b8930b19815a1d32d944dee"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: nacosExportConfigs: \u0060nacosExportConfigs\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4965}}}],"partialFingerprints":{"codehealthFindingId/v1":"4333cccd08c24eddf804ee0c5787f3aa47c9d49930b758bb65e66575ee2545fe"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: nacosPreviewConfigImport: \u0060nacosPreviewConfigImport\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4981}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d2e0e6a9523244909dd13f1181b2c8d59196c85970fb8c66b42d78a18c974a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: documentDownloadGridFsFile: \u0060documentDownloadGridFsFile\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5410}}}],"partialFingerprints":{"codehealthFindingId/v1":"506c97a98bea99d1593b3897ac9e362e06f39c5f51a0fce4bf248bef51c98506"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: documentUploadGridFsFile: \u0060documentUploadGridFsFile\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":5421}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc911a8633e578cdb78e0dcbc5d50520f15b1c40e67af70456553d00383aaa4f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: post: \u0060post\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/mq-http.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c0a02eae4a431054a7ecf41f8886bb702cc03dd4385472ca5b8bbaba5966f9"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: dialRemote: \u0060dialRemote\u0060 calls \u0060DialContext(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/routing.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a1ed57d684aea86ded3650665972887ee12bb1b149411a1f3c69764dffbffc"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: managementRequestOnce: \u0060managementRequestOnce\u0060 calls \u0060http.NewRequestWithContext(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/management.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"179382e61e4ce1eff49626667f15eead4300290283c2a4b4f9754d85cd1e318d"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedGrantsSql\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a8714f4ac358ab52dfd995d87e0644ef2ad7026e65033875977445523a519d"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(oracleVisibleSql)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DatabaseUserAdmin.vue"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"54866971a39bbfd0a28f2854d1609f2917915f08e28a10c729b8d9f90a0b334f"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(directSql || t(incomplete ? \u0027oracleSecurity.incomplete\u0027 : \u0027oracleSecurity.noGrants\u0027))\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/OracleSecurityDetails.vue"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"54118416ae1e3bda87dd83e28239929071aea2560f0562dd6c56ff59a1be4317"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060snapshotHtml\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3da8e52e20489e629bbc963a06f60b96876557c08193a286b34947dee2cf23"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedRawResponse\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/ElasticsearchJsonResponsePanel.vue"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd0bd7ba0715ac38be9d324714694aa85e78027ad3397c07ca0b65bbcb6a28e"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedJson(jsonTreeKeyText(node), node, \u0027key\u0027)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/JsonTree.vue"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25c8dbb9206afef0e031e1aa4a619718e77bea138bdc2371b058c89f3ccb97e"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedJson(scalarText(node.value), node, \u0027value\u0027)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/JsonTree.vue"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8570a81576461e857106673f64ab6b2f2c23e675d2431d64bcc453fb0d8130"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060seg.html\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":7167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0169715d638433393fd464a4d11781e55ab9d137784e4ebe7bbbdd384973c43"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060seg.html\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":7216}}}],"partialFingerprints":{"codehealthFindingId/v1":"badc3f9463a61761061dd9edbca236df2843190ff65c7235fa84bfd715aeb683"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedHead\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DangerConfirmDialog.vue"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"38db59413afd7c39e5fccd589eccc1475953b0101c9777357eda74d32a2cbcd1"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedTail\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DangerConfirmDialog.vue"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ca44c6a259c16cbcf6ab49ba6d128b0e340cf7d5c7b4cebd0bde417c38af68"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060selectedAiPartnerDescriptionHtml\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":12843}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ced62bffb729f0b2f85fd0fd6b3a6c2cb8b49600df02f923828663e58ab9e70"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(selectedEntry.sql)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daaec2036b17148e1ac87f2f0030ffe877f23082605806665f0326021686d7c"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(selectedEntry.rollback_sql || \u0027\u0027)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bab09d770e0ff6684eb3a35332694ec8e02da2960b7eabd6e8be9b353caa2c"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedSql\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlParameterDialog.vue"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc8b6ce201509fa7264484558a2de7b9efbcf4f79e551af95e7b6f75318d82e"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedHtml\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/SqlPreviewPanel.vue"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c223b344279a5fcd1b5672e79a104f45dad900095bd7c73908a3f972a7a2f5d"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060hoverSqlHighlighter(sqlContent,isDark.value?\u0022dark\u0022:\u0022light\u0022)\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorHoverContent.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e44193fd6d6df865355316d9ed34b561856868d8627256dfd24ad26893f06d"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedCode\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/ModelGenerateDialog.vue"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0183e63b028b939878a7d2452ef51d5c1be413ed951a572671eb8821c9affc31"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedDdlContent\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":17518}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac9cc199bd7f5cfacca393f74155dc888b1c027f8bb1d9a95c6086712dc7061"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060snapshotHtml\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/GridSnapshotDialog.vue"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"961f596756ca8713c88455e8ef6efe88d503a7589fa1e95de95c7f249aea31cc"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060escapeHtml(href)\u0060 is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here \u2014 a \u0060javascript:\u0060 URL contains nothing it changes; allow only http(s) or a relative path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/UpdateDialog.vue"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e270ec5bccb2db39671196fdc735b96a1f1d4581909393323b3c3b1de920f0"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060renderedNotes\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/UpdateDialog.vue"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"f029417c45cc7255f5852898b4b957803c30c955d463d18e531552480a714842"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(item.sqlSnippet)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/lineage/FieldLineageDialog.vue"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ae6c7acd52d039784b55909f072173784b2241d02ed812f1459aef09001e4c"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060markCellHtml(hit, column)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"98209ba76028ff3730c7f630da2ceded76ebecfb729654da1ef08424ad70f4af"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060markCellHtml(hit, key)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2159e2d8532b3dde4b089bbeebebfe6f3def8e64e74d318e4351746c64f0b50"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedTableDdlContent\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":7467}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a3322e311b0beb553cfec8940806cc5f4a3f021bfcba6527669cc381f1f15c"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(renamePreviewSqlText)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":7748}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc5a3cc9c420c826bb85e612887b97d2c32394114e3662129552098d76d9f1c"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060sortIndicator(\u0027id\u0027)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"836ac32a5325436e49af143697fad716d5b3420aaada428b36efae4f15e86573"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060sortIndicator(\u0027timestamp\u0027)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b37c6361add4b5a77a5113fb588bd0a6abe7a2d965ff916898827077a756be8"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060sortIndicator(\u0027duration_micros\u0027)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"276b63e82eb902ee9d2d6880c3fa367cf2e22aa55938acb4e3d7792c6352a24a"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060sortIndicator(\u0027command\u0027)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea63675f4e67b4675dada2354681c29685783bb0471b7668ea321679b15b877d"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060sortIndicator(\u0027client_addr\u0027)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7bb7efb81bc34b6ec211844b2975b07adefa61b0ee97616e32d4e178cda02a"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060sortIndicator(\u0027client_name\u0027)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b241f4e13df2eb2238497f289ae0ce2d4e7101574ac9d03acef21027df329ff"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060formatChangelogItemHtml(item)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/ChangelogPanel.vue"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d971c56e2213e20ad2c51ee8c76dfe6bcdc88c7f4fb4c6d3372deaa8019d8d40"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(renameObjectPreviewSql)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7a93579048f255987d6dbacfa8f5c619ccaaf6e018e50a179ffb22c425790a"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(structurePreviewSql)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42ffca8941cebbaac55c9646e452581ca30ddfad153c2cbec9e32950f09e944"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(createDatabasePreviewSql)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"524a158c239dcb1f59200ba6ead2a8e665d9219a35a6ba2603fdec1bfd26efa7"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(editDatabasePropertiesPreviewSql)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6972f0ac89402b4d48f7c10d5094370300b64e0dfee2eafba7ff076e6609aea"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlight(schemaCommentPreviewSql)\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeItemDialogs.vue"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4d717bc4d255f363ef36c065021be31b925e11c685fa4c955f1d4c3cd735c0"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060activePreviewHtml\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b5e2aebad20e720d66650ac660a18490bb8f134a66ab331cac586d51c93606"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060highlightedSql\u0060 is text this program did not author, and it is written into the text of an element through Vue\u0027s \u0060v-html\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":10089}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca2b569a072771caf4c59b40ed39d4fc4b3ee3773149a026c42e58f8c2d94ca"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060escapeHtml(safeHref)\u0060 is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here \u2014 a \u0060javascript:\u0060 URL contains nothing it changes; allow only http(s) or a relative path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiMarkdown.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5637efa246fc714e28b9412dbdaecb7f3e9d50df997c1285a130e73bb479e2e"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060alignAttr\u0060 is text this program did not author, and it is written into an unquoted attribute through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML text encoding does not help in an unquoted attribute \u2014 whitespace ends it; quote the attribute and encode the value."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiMarkdown.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2f5796e6528136b811d6219571f8b50857d93e1f67433fbe16a5d908e4702c"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060originalHtml\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlHoverSearch.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"560c8a972ae197de473b2a72cd24e29696b5668eba603cd4da297ef8aa9e974a"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060originalHtml\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlHoverSearch.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7752f0015636c22c690d6bb29398d4b5eee92cdb550dac44b6914c3f7c8e721b"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060originalHtml\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlHoverSearch.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf156650fd09cbb55af2a7bacc54162cc6c9f2e6ac2ebee5ea6b696e3b134d03"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060originalHtml\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlHoverSearch.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c1be0ae934b029d77120bc3c4e8763647a4dba49b6934e5e54a5a511da55db"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060escapeHtmlAttribute(options.baseUrl)\u0060 is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here \u2014 a \u0060javascript:\u0060 URL contains nothing it changes; allow only http(s) or a relative path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginHostBridge.ts"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b85956470fb36e27092ecad69a872e3761881f97bd19a1a6c0af5b7ed7aec8"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: This condition tests \u0060tokens\u0060 for emptiness and then indexes it on a branch that test does not reach. \u0060tokens[0].Quoted\u0060 is evaluated whenever the guarded half is false \u2014 which includes the case the guard exists to anticipate, \u0060tokens\u0060 being empty \u2014 so an empty \u0060tokens\u0060 indexes position 0 of nothing and throws. This same condition already shows the intended bracketing: \u0060tokens[1].word(\u0022 \u0022)\u0060 sits INSIDE the guard. Either the guard is load-bearing, in which case this access escapes it and crashes, or \u0060tokens\u0060 cannot be empty here, in which case the guard beside it is dead code \u2014 the condition is wrong under both readings. Move the parenthesis so the emptiness test brackets every access to \u0060tokens\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_declarations.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3cff1634a5346aa87fa03d2ee6dadb178d33570fa550f0854e321bc7a5dd38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/runtime.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1a69f245fcdf224b54069f4fa3e7f634db86226ce5c88bf72d3a46c48daf9e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.then(\u2026, () =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/runtime.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a073fc31e5f1e7bd5185db30548f92bcbae3ae790f5144cdcf1f926007f56c96"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01ff86901716f3e1d92fd76db1c87da033778ad186444f3c5f0e55f150229ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e09aec341933b9d5935c9ee0e70e58fc0eb464af438d330f788b2310cd2a919"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sdk/dev-host/ui/App.vue"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"4098d789d6fc01d1a011a46ef003e9464568042e707c08b67c8abcc75ab610ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (RuntimeException)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"675ab7d748c90668f0d9a90f9cb903396b66c5acff8b2406e2b93bb6ee1ece8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8018cea2a576c87ea76b16b16706a8257576b1d65b6c9214dbdb15a79af148"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b026faea45f7108e276f3540a43bcd97a5be4a1ab612c0d2f63b0e6d5b22bb0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edfd704e315c1443d3bf48f1d2d2e041397a6ca68dcecd9fbeb426d3c86e1eb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedbea771830bae4d355d06ffb83ebf35101e23ac8e149af26409aab8c688876"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0c27e235ca6773c694aa28a8c8c8e284650560c3fc4f67cd0ff3b59d6592cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e7a4ecd8fa5cfa632e0d7dde472be0617af9a8cc35fe8477daffce35355bb3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ed5846815720cf9c0b2b3c3bbe0728e2f4bddb34a3387786f87fe5e614e113"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0933d2dae13f77fd5ef416a2c38daf312f534a44da3c0ae6907898e3eb6c3717"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":4257}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4926c15d633eaea467c8b7cf45afde71cb4ad9cc614328eba5d8ffb696149c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (SQLException | RuntimeException)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":6525}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd646b45f2ab88062e16e9625d8d62e4cdb64b37f90f4a219817e6c0c9fc12c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (SQLException | RuntimeException)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":6560}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f69ba0f57db33d500ab8efc9a5d6a6fd321ee5562bfee34cff43dd06d96840e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/assets/pi-mcp-bridge.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"865aa545e3d3e63e84eb88c09fb73438d34084dd047d206765889edde2622efa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/main.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab45fea787a108ceb7b47d61a827401728a3552ecb3b471ba7860308d148207"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/main.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce7aeff1a6699784b7de708559549f47536b23970127c9e5e3a10f0ee41b0cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be0596f3cc62d4a1316c8ff738e50a771e7922bc6e29fa8037cbcfa90b53d82"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe4d1bd9b3f8464aca89ded32f8ebde300eabce2a9bdd7be0cea4a225c50206"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"e938a6011cf6add6d860f126dccf529af5643e6239a6db009654d3e2367bc7e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd29e83726fe05bb01e5e49f72f640fac3eeb9095aaa83a76117fa869e6947a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae86f730a6b330125e37ed34454d4915a604b7d3c4298d13b7eb11209ffb2c47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2514bf3642af502cb758d0977ffc8b06f7fbabd5dea3afccafcbee14ca34bded"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3131}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e1bb54deed901acb5480dc55685cf25e4a56f93acd195a7c6183c9e0f54b86"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb1fd07b39ea27c92ae421c52113cfcadf7ab9ab18dee2fb6505b6d3ddb26d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3178}}}],"partialFingerprints":{"codehealthFindingId/v1":"813d3193f04e8fb4271d89f052dd5fb8fa6a7fce225e5be77218aedc218c786f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc31fd3c29ce0698049a5bcc13d517e6321923c083fdf198ccd48a2c74b49b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7178dc52b6f0c07f116d676219dd3eeff50e6d7657ac26f46d0b720a631d1ceb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2e26100bd87a5c38c4072e909800e448bf1b2a10cb213d04187c9bed15b28c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2020d9cd7e40a21b4fde729cae7ffb2cac281dc61f9e658c660838768f8da4b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3502}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c53d4c12c6a1ec980b4693cb10805625b5a76ad1fca0c247bb8f7c52ce83dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3584}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc16560a47ae82190362542c063a6dd0ef2affedd7db976f166697857ddf1b12"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":3787}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc5238cca0c8d9b9df75cf504e9ba421a832bb18ee6d0453eb5622b99978aa6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":5257}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f5ee71d612d251895b2bec35086485e9222b4b8bf16d2c3fed37ba827c70d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":5477}}}],"partialFingerprints":{"codehealthFindingId/v1":"e618b0398f0b1da584f27cbd64c2b3186916ae420a6c27e5d50371bc6cefc275"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":5490}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf2e796e54dfd45432ce557d7d4ceb0fab4e0c544332cd93bb3883278d32569"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":5498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97299f1e315a5c4699ac648a34860ac27422be7f6f7444c0ba601c880cf973e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/App.vue"},"region":{"startLine":5510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7caf605abb3e23b2ab698569e2fd7fec26d75bc6f5c201029f5467efcb92afc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3d6972f7f9d3fdd91714d6dc331dcf7e890dc3bb70f69db739fd91019416e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"62034ef4d5530e51e86151c77e7adbcf2540458e13fb4294d5ba5daec71ea3ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00ed8ca5f18aa10ab68169fbd540fdc7db244b60144784305e5b44936cc37bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae01b23182e89245c70fefefc20e02b950ebec5b8183570a6e82806e32b488a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":3807}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ad173d27ee626af988adaf1f17c86eef5f7bf78260b023b2c8441ea4b61367"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":4936}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c75100ad5067cf94805d19977cdd18460cd707458f52ab95ac1f150f5a3e65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcd4d41a34d441c59018264ff143d06f386674f963f3ba04c08fed969b5f346"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":5393}}}],"partialFingerprints":{"codehealthFindingId/v1":"750b9d6e65166d06fa5607ef952ab10df24aa7dd715ac81caff4b9da823796c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":6902}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b840c255ffc7bc92d4e922d532b32a9fd50342ac1f75906b8851de10234fbbc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10182}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b92cdd44235b7c983e6e647e202b20cb3c9fabcb9fb5f12b49f27ad5d5c007"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4335982dad407355c16c65d7a691a7c6252159ead1c0f52c551c79930008843e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10411}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3eb7d9dc1ea9574fbae7d56354e5320ea33785650c8716935366985dacb0d5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10551}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5c79d4b15788cbc66ee5be30dca98f3d4b8b716e96219f51732f9e6258584c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10731}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c8ce006c37056aff2634784e1d65722d3234891e9b4faec83f2c0c0c686465"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d81f7ff0ccbb982371945a097b0f3e875947067630311f375c34da8e786ba0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ade00a8cd7a4815e30087fdb2f543673ba4676de9b44310819fcbcad6bdb8bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11209}}}],"partialFingerprints":{"codehealthFindingId/v1":"801b88c0b7a05873d2efced65e910d9de8ad1ebbf6af2a6473ee2f29f51a5eac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":11220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c152a74776974f18b1e4aafa7253474948827b45c68da8b9dfc6dc0f184a256"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/historyStore.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb26a7390f7acc96f7a46e0639a31ae12274c71f23dc5ff749cff3092534b6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/historyStore.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8613e4c3e6fe7e4a85f454d6412a4c0d4d9a05d5ac96feac822f03146b96b8a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/historyStore.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0defddacb401212412193c88742c3a0f67eddc4ac5d173fb94f3e07b9907b9d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/historyStore.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaffe2cce5b93c54252063e354f8466406e2d9e8ab4685ce8044307aeb8cd81"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":2945}}}],"partialFingerprints":{"codehealthFindingId/v1":"2159c359e29399b22cfe1581ee8fe7c0039e66b3a6b2b85ef184714fcc3bdb1c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3032}}}],"partialFingerprints":{"codehealthFindingId/v1":"44442f101392f955e7bdd4eee223ca8f91f0e47d8a242c9d611e3280587d5ee2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad04b6ca67e9be2750210d7ea8928394cc9f403a8fe9a885544740f4c8180511"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":3505}}}],"partialFingerprints":{"codehealthFindingId/v1":"be96f4de00846e5b745869a770c832c2621844715d63c97c535a3175a1b94e2e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":6051}}}],"partialFingerprints":{"codehealthFindingId/v1":"1770285ceeb6add7d30a25e051535527abd4922ec6b100d482798dbdc7e35aca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/readOnlyUnlockStore.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"181340101f8f574017a8fb7df790d94a8d12aaf9945c89fc0c6a88e6b908302f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/readOnlyUnlockStore.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6575903cdf2c3a0b8476fcf50b9842837626943bfe2820a6bbfa1cea6bb31a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/savedSqlStore.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"759634489281b98dbc922f1d2b3caa6ecac654922f7377dc3dfcb8b9b24d7401"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2648}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c1e51f079a765cb195b8c3b224be9b30de84be3e388dbe0ff7ac8f41d18620"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"6287f556316bef755062b01e38b2edbbe49039f6046e35ccb3c9f1a298fce423"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4cb469c49ecbca17f89ab4a34ebb66df472e11006878dfe58829e055781d1c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/settingsStore.ts"},"region":{"startLine":3090}}}],"partialFingerprints":{"codehealthFindingId/v1":"881e4dd5cba5f1ba1584d8132dce897fe246082f2658157d041bcbc565553491"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/tunnelProfileStore.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f5cf0195f71f0850dcc7eaebc24652cf50fd1cab5528131d4831896fdb3c1d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/webdav/webdavAutoUploadConfig.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fcc8bd5d7794a1476a66e1e69d330686acab65b5127de2ec902b98f3588919"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fb4ef6ab6d3881cbf78cbaca8e1c604a30b289c55b97a52da9967d7c27b3e0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/tabs/tabResultCache.ts"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad48a19c9be45259b2536dbae46fa5ccbcc3817fc97fe8618e3f19af97c31cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/objectSourceLoad.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb50a27f0bdf02d4f7250ea7ebbc5e64a25c7114cdb54d70a6d34c5f335a454"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineOperationReferences.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c61f372dd790a2eeba739e369e54586293da1b67156955b55604905a29eebd3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineOperationReferences.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77afea2697b290c8ab14dbcc9db7d448a0d777c579e4b278393b6cbe7310d20"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineOperationReferences.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cf2b41dab385309d47d661bda074c9917d4193d9e3b585cac83f55faf7a9e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleRoutineWrite.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"af57bb70f96678eb9744b56208456baa6be7b4f4c014eb2f2d9294d9bad4409e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTableRename.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe464771cbc0a62ea87b6252ff3e425ab1086de0057387db171f512f32452043"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/oracleTypeManagement.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"122f99836cb81298dbfb783f3e5406366b7e51576b83c4f53d1421d021ee9691"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/table/tableDataExport.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"527942e53baf8e7704e1dda59ec2a64a8289e65535ca169decdb7d5268d3ffda"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/startup/startupPreloadRecovery.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4de81731954a4b2d994e0ca4fc942f6db2f8ca42e1ace2fad11aba11c6d90a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sqlserver/sqlServerActivityTraceRuntime.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3b01b612f1d481b8f88bf40f867485f528d8c074ed0b1fbc5de1ac2eacaf98"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sqlFile/sqlFileOrder.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb5145f3b751884d4b176f86f8bea434724e7587f2c877033d0ebcea02d0794"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/contextMenuExportSql.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6d19de6fbf934d5768dcc87513bcd3bdb4ddca4c11942b2fb0ab6449d29d19"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/externalSqlFileTarget.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41d7b3ffa846b94a348d8bf88303d50f2502d5b72dc4daf80d6c40f8cb60d95"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlDiagnosticKeywordRecovery.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfd05d8b1719cd8cb926860d8cf4d0d11fc9735b3c38523a7986e937da8ea2b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFileExecutionOptions.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e168de9e75705c38c502cab0100c75aec79e68f4b11e932dd40f6741a70e479b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sql/sqlFormatter.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb456e1eb9d543b2703c4a432027c5c0d7fb00f8208e80b7c1fc0c9c6b07ba5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarConnectionSelection.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7713a92a6be1240f6b057fa9a5103e65d40eeac53f86f568171e3fb675c1145e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f68326224202b4952c6981b951e8e91e5c276d22ab954d9af886db82e82eddb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/sidebar/sidebarLayoutMonitor.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"180cbc1b357ba4b03a9ae863acfdfd86f4dfabdc66781f336493c5cd4cb06c58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisCommandPreview.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6517496be9d173abc4a0d8e300edf919d2e3ab05aae30657e100d1a8b3c51f6f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/redisValuePresentation.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"26069b90a920f0ba85b18cd947e9faf89ad7bdd20e8fbe526d7debecf25f3910"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/codec/protobuf.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"122dabbf4f17b48ef361ecf6f50aa9d1a670455e2432baea3236d986e493ff49"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/redis/codec/protobuf.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3588ec14d158c9523e8aa527262f2486cf663d8c8ce61cb76eb39e71aca97b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginMarketplace.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"330bf04904b7184c8dccb98b79d56803dc1b43520ec2df7a3258f9561c9d8e8c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginOpenUrl.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bc06aeccaaf1a4fbebab3c5e6c4b3e71037cb5ccdcb807d304ba363f971619"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginPinning.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"944a582e41c7c13258623f204989c75cef4f10d29474c0aa842f7ca9220b74c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mq/thriftBinary.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7ad99fbc931a3fe4e81442e39253bebde9d5fac3dcfb76eacbb1ae8e8f03f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/objectDdlCache.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cdc3bc89cf176972660402b703cdbd7203d35d10b671e1e8fc461e11f605b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/metadata/objectMetadataCache.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b92d006995ac716c242acddfb24fb1c211af4dad3022903079a94ce3365c3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/datagripImport.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddff610566ee6053c4404de1a6907e25ed11f10fbbe52caa993df8f0e54e36d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/history/historyRestoreTarget.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e726d2f6ea1fa100b28be2babb30ea187c4926c8d8323bc02c385c27ecc8c5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/graph/neo4jGraph.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6011df2636fa37309ec24316276a3533090fe99176178a2dcff106a0c94812e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/globalSearch/globalSearchSettings.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7acfcfb75ba4b84853cb0a72f32693f037f639192833804384b0390cd0b384"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/globalSearch/globalSearchSettings.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a118bab60c760dcced8698981437ac71c4e7384eb71aae6006c4bf8d3c4d3332"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/globalSearch/globalSearchSettings.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fdec8c721ce1438fd548d5b5389efe6f278c8154d8bc526bda2189e09c489b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/databaseExportOptions.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e824dbd9788327f1ea55dfce2057658f0ce809fb2643e836a0d470f9d8b755f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/exportPath.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e51b8fa75bc3a5fe4ba8ccf0aa13f502ab920776c503c846a6e82668b02a75"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/exportPath.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"51182ed1c25755ab27a702490e0ab6ccb28a0a7d2d7188f629a9ba49f8291a24"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/exportPath.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07602e13d5a75d9f1988905f82e9b072a1f85b5a49fbb853f7c00a5bcb67b82"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/exportPath.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb2da7121c09e58a142c78398e53a5e8382d2d9af2ee40073f90931427715a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/exportPath.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3634cb73c3224d0a678e29d386623cd869f7f92b4ca5465dea30943c4dbc8820"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorNativeSelection.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c2996d8fffac6572b5e7581eafcb03f71bb003eee33d818e86fedc0cc13a9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/queryEditorNativeSelection.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fde3cab06583b003c77a4f7cdd2f73b65791636775798b1051f48fe59e8cf35"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/editor/sqlIntentionActions.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bf6a14d743ff7fc17fd236e186d798f8cc8af0aafe680edae43d4deca4f918"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseSearchColumns.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b943f2c2e57975a54e159f88999a88f48acc8d515221adf5bbcfbad8ce622f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/databaseStructureSearch.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b315f11d12c2de81da53e7de9e215212189386d8f7dbc5d08e2a9ac5c59cec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/database/oracleTriggerPlan.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c24247b57e0046f008866c6fb6f26d37f84083dd9227291cf55ba63a5f25274"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/binaryCellDownload.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3395ddd24b963f3b64c2a4c44d8ab3f1ed484ab026b51ac5aa9c9289b07d05e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellDetailPresentation.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece674d26562e8a034aeb1713dfa0ed0b4b843bcea06527f6de238010dcfec3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/cellDetailPresentation.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f5f6d38ab02df422a8956d7d2602489ea937d7c016b040860964fcb5799cc7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"15353e34d8e0cfc175ad943a89837a29319ae08ecebf17a827d97129a451efd8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/dataGridCellCoercion.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1537a98fa1fd595aa0a51caa7b9dfc2c84b275b9a0261073051c90add17cc5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/regexGenerate.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf2cf738cf86a38e098993537e45e35321c943eb7b6c1349a2d059c00a1a0c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/connectionDeepLink.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"2936427b49d4b058b1bc2b7bc481c8d1dbb27a6dbea2cdccc8e1d2f41a56448c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/timeoutInheritanceBackup.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9830faef60c77f7c5d61c751cae830ed4c038f9e7bcf22eb187ab72cb3577e95"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/connection/visibleDatabasesPickerLoad.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a1fcb0965a6c2dd776a01bcd4fc14bae1e136421f404079bc5df76a29318e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbf1faab6157be48d6a95fe82af3292acee18c3ebfc2368e688e5939e08950a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbba44dfd47bd91c87a71dcffead93872d56463410e217eb285c6e92cbec7b7c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"44efac13978a65e540797260930747bad884dc441c5a224990769b38b8489cc9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f5815837d9721e8abaa919e28387f6eb7b950c61eb313b4d3626f22b9d6e7e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec37ba040b8124398ee739af02db9ad8786d23edc586b5bc2c992dd5349e909"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad04689201e508562bb9a7301d8a8600de27138876f71ca508e067720b78fa72"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/common/clipboard.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c63b0e0b7c1a4b8906e664692a0c32c6d2ebac2bac895696eb7aefb6d7305c1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/codeSnapshot/codeSnapshot.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"808b11a21d8ec157f01cc5db3b337297847216c9a3556f06d3bf5d210231d8cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/debugLog.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1ae3014b144e32493e6b2142ffb60240f7dfe8ea8d575566aafdff2dfa8ad0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/debugLog.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9456aebf03cc245a985cdcc2e068113d51e33423932c10e4e32a2e3b4fe6e1b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/debugLog.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe6653a3a3d3d0be090a011bb27e4755fdf9cab3d82c5b588e557d2f7488191"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/errorUtils.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"692686e161cedbddea459dbaeed53c6a2970892161e29e9909558776887e16d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ce6bad13de35272e3f882404ba3868e8a53e1ba10407163c6530b9741d070a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d9abf70cc593e67bbee45271b5e78dd5b95182d09ca903c7f069651d64434f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e895c99dc6007048c17326009428188678a4336fc59593fcce0a960df490ee5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a73c4b3d5485e5f3c8ed6e6e699ad7cb27bd7ab58e9b141d549c68ccfef89b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":3665}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36e4ee8c53d34126c5d48f31c8d6fa354d49ccbd2ca086e00d8e5a1c6e26c52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/backend/http.ts"},"region":{"startLine":4956}}}],"partialFingerprints":{"codehealthFindingId/v1":"9589772014a94b0b57c8e846025ee864b419358387f9d4ca85ee34c34b37b8ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/appAppearance.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"142b3e71e550ab5f9a87358ba0324f08d70431871d8de5c25134d9cffbe9dda6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/documentStoreProvider.ts"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"e410e69153e2591d2256b89af84e2758ac1f186d85be7c692b48cc039624f425"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/panelResizeState.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d62cdc9ee914f310355c3a5e2ae209c0308cab957b7680513bc27d23ba713e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/savedSqlEditorPosition.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b827ece5ad2cd5f26ff975833f49ff1fa73c48d3c17c86a6851400d0b96a54b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/app/savedSqlEditorPosition.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc573e9d6a78955ec68caf38398e3580bde563a6776446f65df8c94cb2aba112"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiConversationLifecycle.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a407a926836526d172d96a32f5904618817938a7bdb89f45a39a042b83516e6e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/desktopAiRunSnapshotScheduler.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"abafc761a99990d2fc916d3229ea82585feceb2127c99e5440f2c2eb6a0079c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff4d022c4e29076eefe0a21526b3f8b6c4b6d174f5425a6e16033dcb45a2a94"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f78d0aac07f86589cd742fac661ccc82c87f18d8dbc9aa2d201f401be9f10b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useAppUpdater.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"078028ac900a358c0375f52aeba66924a5d87d4c843d56f5af4a9e64820daea1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataCompareConfig.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"296e6d57ade566c0cc9d92397c6439558cf15d5a6024358dbfe64edcf4012880"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridActions.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a927a7169166701b2fe6ed2b4f5accb433d722e923f1356b56ea800a762ec84"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridExport.ts"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"950d81369507fec19c23612029e47aa5c3ee622fb12dfdcd8f4b68cf6b875cdf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useDataGridLargeValues.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1182e9811daa83a3429b57d7f1a4e0146bcb05df06243aa7641bed06c49b2cf9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExportTracker.ts"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"c868c813491286a7fa54f43e7a38d8bf0c12fe3a54e178c70f0e21f609f5c62d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useExternalSqlFileChanges.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cc46ab58cef38da4c61037f2fc8baa51ff5b599de82a0dfe6c3f582e31ffc0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useMcpUpdateBadge.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"87baf82ce16bc67b228e22e70740e80e4e8a0545d0e49f0e05d716dbf1652dda"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useMqTopicColumnResize.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2879c031ac94d2b6770b03d2832cda8f22f7073aa115a52ec99bce24313a78db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useMultiDbExecution.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9c27c37716413f384eeec43d5acf29cdd40e5eb4a826a2dde6d125ca202388"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useMultiDbExecution.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5d16d642f2522e56a72af58ece68375a556ccdf6cc5e7e2ddd819e473eaee2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac08c0e35de8438f8ec4d3ffa61b9155913f4d988a0844c8f8e9db7c5e3a401"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useNavigationTargets.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c9fb9ee92ccea703bb23d1d3822c083b970fdf50f2b27de556259840574893"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/usePluginShortcutPreferences.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d40f98006f9dff3572c21ea9e870436dbeeeb24be56a0b5fc608ef5de9bb333"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"76adcfd1199e5d6e98807f9ff442cd79fbdd47682a52bae49c4a1c454157a8f4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a396a7e48cef5cd76fcfb76971437ad8767abf05caaf549b9b139abfab3f231"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef19407eef587a5eb0c0da787e02137232390fa650f039f85eb8a916e4221f5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"3606dc7fa13bc72c1c75d55e63a8a34c2fb1e3267f3ac5b7e5445936c461932c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useQuickOpen.ts"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"3168749e34cee89ca56da93dac91747072cd8ebd76458de28ea236e69ecf9cc6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useScheduledDatabaseBackups.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e882a91bb13ba988a73f65fa542d26545a0d32ec4d502420e034d63497a3a7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useScheduledDatabaseBackups.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b246de1b6d997f383f75263d2f565d51f2f60b457ff1e0ea3016abaecf36c12"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useScheduledDatabaseBackups.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9185a32d449be001af494197c1232bb129f537b83dee5b339e97f58bdc6fa90d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDataOpenRuntime.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d06f654bd8a36fba68e7fe73d7569b274b52ddfe31381cae502496a3d90cb76"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce28226a2fde46dec6bbaa3859b22fc0847019ce50918656757690c76a638e70"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"d465e7cabc38ffb888e08726c842e31cec20c8a0193da80d6b7d6710fce065d3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarDatabaseSpecificMutationRuntime.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbf662c90bec7b490b60eaf17a35d3e5d2f5bd65e8371fbd0fe4f777ab49e7b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useSidebarTreeExportRuntime.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"0974e27771f21f74db2acdb00c4d558116346a182ebe333e641b68783b72457f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"88df65ca3924b56ac01391e7435e8b84daded7f7d3c8816ee87758095108b46a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTauriEvents.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acd24b32ca2a46c98f8bfb721b469d1488f7c9b47ad12327144f847e3a5ca00"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTheme.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"94987c884afa12238db9c6aca55e82e3ce4b28fcad973b8b3df4a892cab0cf9e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useTheme.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a68821a34663e07a540a8badf4278b7d543c733026317d94ecd96e71c0feb47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/composables/useVisibilityChange.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6e920e9c2a16f2489c61abb0ead737336991f28165b397e946107f01478544"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/dialog/DialogOverlay.vue"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca219145b4cfeea3c67e4096a114e7115fdc042c0c220aed09da3bb1228796f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ui/dialog/DialogOverlay.vue"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"52465d876fa3ee855da059abfd9214dc235501096fd319a588fb8efc5334b969"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":3210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9380a81f8bffe630a9296d476519bdd92e1ad1f2c59e8a34966a445078d31c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":4365}}}],"partialFingerprints":{"codehealthFindingId/v1":"373219c1a02bb2c15ad3fff2f4e4aead6a239e0dc5b6fdbb8557a96be98ffe38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/structure/TableStructureEditor.vue"},"region":{"startLine":7579}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4df22dffa3837d25c88432a836d391654cc822018049ff7a8a675646789af9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cde94cccf13c78140dffd2f1d71014faf759154004280954df34d59606dff7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ssh/SshHostKeyPromptDialog.vue"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e50e49e10417924c8217d97653e527527ec8f9eec9b19a365365e55f1e29d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9accd97f1deb9c96b9284fea5bdc4cece9254ca5bac620051946dd2752519249"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sql-file/SqlFileExecutionDialog.vue"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe463005b6cd22a2a3f94bbb43a87431383e641eaccd3b75f29e5007d5a9251"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/solr/SolrAdmin.vue"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"65360a76cb47057122df5280b4039092eb8f63c80ff2231ee76293e229ad9002"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/sidebarSearchTaskRunner.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f269fa29b9fe6cc9a5c1a70dc7ff69c55621fa0ebe370eae83e071bf6e624f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb15fb86ecbb48f222998e5ca446d16e474ba44895c5a32a4f5a5d83e28cc808"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb124e65f3e3353b15cdd3ce004a5c4c7fb0629545999f292c080bc7434833cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"011b621602edf2ac0d74fa182d5cd662e2cf72bb90196f053b23222c0e0bf620"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"8326043464f8ef8e11ba9a90b75bb7228698b334d8709d80add970dd8ec5c142"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"88beff7b6e2ba6c6d599e3561cf9c9a73b3918d7b81e3c2c32826d04c6e0ea90"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/ConnectionTree.vue"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b49e4ed413897dbbb3e1bb147539e9edfa56d772207c6161cab6be142fdcfbc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b838a520f45894526e94b47da4ca87316db018461c120e9dc7dcbfab4142e39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db2d99faf6dc87b2c1f1708a9db323996eca2e919c14279bb6e3fb4d808613a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7420ee92a3e15dd57c897b1588b84a86fd59be80bae90471597c338466a8ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"2168524ebc561b927509ab425fa64139fdca7bd444374fb831b456136df2ca34"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":3087}}}],"partialFingerprints":{"codehealthFindingId/v1":"241fc175f134eb0fd9828743e8ec3fec3fea0afde5ad48b7d9e02d95d1c91ea3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/SidebarTreeRuntimeHost.vue"},"region":{"startLine":4601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6141f289802c29f83a6e4f3012f2c9e6039b8d5d2982efea2877b2aaaba7c0c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleDatabasesDialog.vue"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d6c88f4b7176f2fd79876fdd5c388516407880001979a328a569e361d49288"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/sidebar/VisibleSchemasDialog.vue"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a0acafe69d83b3fdbca36945779e1209fcd9a33dffaa59d2b21b6745e73821"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/SettingsTransferPanel.vue"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5b53397d5dd276451b27b4bd37407a4470e70e68344bd7fe94d7931ceae6b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/WebLoginCaptchaSetting.vue"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93c85bb3e75a18f9474bf5efac2d4066499bd4453c047ed028fcc94ad30b071"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/search/DatabaseSearchPanel.vue"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c601c21c7910a1c6ca4e4a5cb2c2c134665f03e2160cadae7864a2b5299afc7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisPubSubPanel.vue"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d32168517de8c737fd12b1a3ddbdd1a90b27c6dcf9ba4f8cae9b946a0ed784e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4b71d1adc17027e6c3e916c67d83871ff391ce3b85543035b57109ab1781d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"df373a544fb5d43cfc55099c474e6f7d073d46f9a0e94b50e489d1fc2f90d91f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d89b31595375436dca989b7b39a3e84670d42e0471ae33f57853ada568c3cf8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9384e766a80d434db4e34af8588eb5fdbcd573be905ae895a9b6b8e48ce8ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"916f957c358d45d9c11d8e103ee188d0cb93ee0e391b4acc6c38fb1fe4949830"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisValueViewer.vue"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a9a66e4e82a45d2e8fe32e43ea991edc667a09950aa2d28accd7dcc7d1fb97"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/quick-open/QuickOpenDialog.vue"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc879746a65651d53f20768ea7f76b3791de4674d88bd9ea9c56732538ef279"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/quick-open/QuickOpenFilePreview.vue"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa86e8b9536bb98bd821827dca78278d1e1ec422c9e1b162001770e90c5063d5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginBottomDock.vue"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a843dfc27913839b879518494f484c44e71409b5dc8fc1bc98502998e6bc6dc8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginBottomDock.vue"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1eb17e5a5415e1fc6e8f3cfcd61adef4532598582e2529bf0782e961637ead"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"8336619c6d9bef329b5db881d6ee61ad833d02d91cf13e833d60e9a3595d694c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae37598b9bca0fb9ff46bc647241714f2897d7e668c282310545ac9ddd5c0ae7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e9906d9dc2479425aa0858b153ec6638e5b3b3b130a23e67fbbbca09f76177"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/plugins/PluginContributionsPanel.vue"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f1de7459b0b896a63d5326f52d4ca055d0e5b62031a987684668958b01aef1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DatabaseBrowser.vue"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aa32dd65f7de07eb1a571d84b13bb8b2b6e2d59eb1d38f9269b366f95f8f29"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd85f7131ef732be66d211bd0b61e1e501f8c928ffee376f5791fe18eff680d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/DdlViewDialog.vue"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"af69b0c08e50bf2442e6b23ec81e5a834f20b8cfc99316332971baa0213d51a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d53a7691c7edaff6f50eb3df2b5657926532cb01b4c0d9830bbf70c3980c154"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daa1dfe6d575dbe3a2f2e40a5fd93531b149216bec85a09b234013885854d45"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":2885}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd13cae9ecff691d34c38f1ee647299f62cbb2a866e56bd7d934c26617669bd3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/ObjectBrowser.vue"},"region":{"startLine":4217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad284cc66f6065fb20b4d91c9f24e5aadc1911df3dba4baf3ce62d7546450093"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/objects/OracleInvalidObjectsDialog.vue"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9c44c7b8a713854b0c12d882f37f2a2644f3bfd5af1d5f8d64e64f903c3124"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"072f98b0cb3c7e49f76b996b027205fafeec4c1a075b87bd5c330a5674addc6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a759ce405a17e74e32661f70a112ab512a5016da03f01d63c18f1a1b75b09aaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde481cdd945e29a5e0b723453b996ae246c5883085b17ccbffa3a4fa56fe98f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/nacos/NacosAdminConsole.vue"},"region":{"startLine":2567}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf909656f1d53d63e10fe5123c936d802580db7c15170978c9a76b49a6dab585"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e401c30d09d78744e606644992c90443097e54179f937cafafc2f91710facb1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttAdminConsole.vue"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78695baf5d61104b185c77b8ab33398dc00e102166f8e1fba640f2a3d46d9cc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc0b9e1e64ad9e7d4350f59574967b0a6207f82a0164840f05f5d2a95297a38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mqtt/MqttPublishDialog.vue"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a7401457c8b2532ee5e69759b0a9b10588ca10eaac7da9da6bbdce93d5cd2b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mq/SendMessagePanel.vue"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"08138af7d9e025f02c5bea65e202d0cc98e0e8b89dde687b3086be994d5096c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/migration/SecurityMigrationWizard.vue"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec3e100be86a869e2e16bd8950184f1bdff15a596aa289b1ab9fbbc3ffd59a9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/migration/SecurityMigrationWizard.vue"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d00e2ca6543dfe16827ef46bd58d2ffc80adc0633ad4445768769a1d3db4b09"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/migration/SecurityMigrationWizard.vue"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f2ccbd25af660ef80f2ceb1fb4e2c4d7c5910fd4a76104a266ea21bc238451"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd7e14fd3354871bb9666359f70e97f56cd35cbf876ab91e08b5b40d2f3eb71"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchDocumentsPage.vue"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"1501bec3cb79a88b6055c8003be605c21cab22b0e8e1d53a639d8275198855b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchIndexView.vue"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ebf2f5064e9cb66d38ef8b8db0071f06cf3aed25aee31c7de042b1228f53a9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/meilisearch/MeilisearchTasksPage.vue"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"674557da68311f832374e97c4a223472d5bac948d98b324807843d353b1cfac0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/mcp/McpSqlApprovalDialog.vue"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde22c5b7f79f9c71e4055dfcad1fc928c018e4aa5bde819be9e16c0da6c9f55"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/ContentArea.vue"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"091b2c1ff1b94d7fffa732bd4de61d657de54f0259117cf3ad4d17a248bab16d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorToolbar.vue"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3277181c5b5f2b2efc291b7380be35b36099efde6d686e61a2a9b1eb4f284db9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorToolbar.vue"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e6d28cbcbaeb104e6d2d129ac0e20f09084e84309d313af5fd75c5697f5b71"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/EditorToolbar.vue"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1e32753208806bfa031fa93fb31aa289e7079f72a3c0a48872ea95ae8847ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/QueryResultToolbarActions.vue"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bff4f7201e480c93fc6ec5b10d56f46ba9fd835cb42adf46440406c01709891"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlFilePanel.vue"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"73926c842f297b53ca1430636d566b2910f83e8f4be90f3b9af5ecd15f628ac8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"534e05f041767b885612cea8429958ebd6134c83bfadba9da0d42ae521f19bb2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bda79db0c6a4d382e7ef78c77af2288148547d3de1dd485a739b2143d280c6d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/WindowControls.vue"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b59c8b46b3328a5434fd7af4f9138eb955aa425b0b08350c8d5b03d326de38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3deb8ee937d1e9e9bee0721b2bd4123d24ce08e811e973a955671f7c4025901"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f98fdcaf31bf47a007a0a6c176437f3aa750b2fb135ae8b0e76c295433aad3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/kv/KvKeyBrowser.vue"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f172a36ee0f613a2472fe2378de978c6c2f242da5e5269a9ea245607e9f87f4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":2974}}}],"partialFingerprints":{"codehealthFindingId/v1":"260e17300affe5d65e5ec3d182a2a1e428aea97853ba4b2260f52a35a8cb1aa6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":4577}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7224f0dc748c33f7613db165a1bbe8dab0b308ccbfeaee3f68b2465e4944a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGrid.vue"},"region":{"startLine":6585}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f3d5c2898f75df659674d89aac9afeaf8bda1da432aa5ba198dbc04ee2741b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/grid/DataGridBulkEditDialog.vue"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d4f27a87f96ed5db0f438c840ee4235825b9da7ba9d638fd15e00da1fb1320"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5819c433c46a8e8167f20aa7861e79f5fa944802657615832bd8516acf50f0b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cabe059ecc9ec0d0b139baf718d483ea5d721b6863ed77705bbee904ccc8ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d450c47ba8cac90ba1eaadf12f91aebc1194020ce07ec5e0e4815680739a5d65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30d5e13a0b594bfa3856178606b4aebb1b39cdf30f40033bc29172699c08fbe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/generate/DataGenerateDialog.vue"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"705e6a037d7f249a7038d5fe8218618a4c1131901cb10481c57e3e3e3b05c54f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdAccessControl.vue"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"71289e3f3db7bd2a5abe4ce7de35f1955ea931c8bcfba7b1d185d4ccca0c0a3a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9caf9326d009e3e1d01e57a663e9f02e1858263a400428bc8ef09ff05822bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/etcd/EtcdKeyBrowser.vue"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"59abfcb0b7a7ad9fe0cb004dedd6003f2c6b088353d71b02da02f4bf66eb3fec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/queryEditorHoverContent.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"857f8f1b8e16e2c52921ad4d2f6cbc98b2a2a87bb69743ae0eb8e9242d68a392"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"033b3adfcf8a304431db6c569f0fecc210b3d5482937f374718d5460a7c1d784"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3652862b74f671696a8f5f29253aac3b5a8d45a2cda96f42d74551348650fc1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d690746916cabcffdaaaa0735ed52581640761c2d18c85aef28c21c7dbcd3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcfc1d92eb78d92a5b5167fce7aeb0964e4e925f9e8afe5a39d88d8125b4652"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e0691f05af99bc8aa4eee24585903b053cc80cb2eecff3c252794b870c9cc4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"f092afeff7d6b5ace0e61d600959b4334d0753b863d1d9caa5c11effff24808d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed939a2ccdb3637243edc9da4229520efce6e3548b9e4440703423e65082a69"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"db72a19d958bc3b533db29dcb1b8da4f1a60fccf453a25388995cc6bb8c56956"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b62e993b6dfd242c8b12324cb98b9a6d15a37075d3f875d6e22be502fd127ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"978f55c3e2c083f35d182dcf9a254fe5899344ac7216db59e82aa73f92029a3d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe9ba8324ff066f49b33700d165192496b1d7a9bdde9e495cca8a68d45b2f13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletion.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede332109ca991d9a4b7d35add5a965187182b9b13f519e0bba90d48838956ac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"972d546e9a090cfddbfc8dab711b3a5bc58f2d54e898c909d26d6c6c8b477def"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorCompletionMetadata.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f000a03160f142a0eab4c9c0faadcb1817510367743db8d11de9ab9c767cbb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorIntentions.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec47adf98bae5690924bd336e99c64064c6c205eeabc07af889eca49cdfd2bc6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/useQueryEditorObjectNavigation.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba708e6adde922b10438c0552286ff281d6b637f0e5de250c58cea798a8a77e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fa6de9e541addb85010b001dac60808428c222f7452f8aa5adfded21c5dc65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abca7ac5dcfdb022079cc2e6bae4e96b825ff5d429bf6864ae10ebc1533aa7e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":2682}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a67f2b952f4fa4abb08fb3d884725f71390f48a08ddad7d0146ba545869167"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e3ed4e5d8f577d9caea73dc5cdd4249ac2a2766d6034a6a8610311ef3a6bcc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":3640}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8575ee44c67827326c5730063ad2f4449f9186ac32ebf51a795d3704d9dd0ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":5271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39e317169b19c4444a783bb42f87c6fdcdd3fcc5fbefa3638695168bbf2d902"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":5678}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8d69277bbce1adbcacb06dfcb280d0eb5e3da012e1e64ffb0d184ca0a58aac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":5705}}}],"partialFingerprints":{"codehealthFindingId/v1":"825d218ac6a2066300734c5a2e4ed3581ccaae5b7af7cbe693c8e8e7c317fad5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":5811}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af0d393bfb47a9480ec0856e9571e7497f17f5dd1efeb2301f67b9514adfea8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6052}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bafe9a6d84ed16b03adb37c0760a3cbee9cbed4807eb2dc2bdcaaa2a4522e6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ed15701f54098fa3cbd8ec4ea09c1e0291e1b5d310f767c8ae10fe70243bae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6287}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb5f251a5f4b56cdc870d049b58f8a72e700ce0470773af4671c6d837fb3aa1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/AiAssistant.vue"},"region":{"startLine":6300}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b0e2489bd973a392bffdad4ec542573e3b5e246d9a29982ac108ecd1969668"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"39773ce2e2178b0fb955ec9f0c5a6cd4216c2c6415684d7b425bff01a07307d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/DelimitedListDialog.vue"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ebc8399e189c0d911df4bd8ca79b6ed0c03016e703ac11572150f038409979"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f87e7b231e9134e887d0a19f32c572f5cac563537e5220a0dd0d32855d4ac47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/EditorSettingsDialog.vue"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"361539fd733abb5a547e8a87435b1f60e70bde6066bd6b0a89fcb188ead37bfb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb33ba9d9a971bbd7031d84385db9199aca304ab7c27dce630701d000207078"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3da61c3fc4ca1034a861607761fa0c9386cf49965d664338139ac02cbb1ee26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa80aa60cb5bbe208d0f083ec2bea40943776350ddf55cf413c9785ce14d030"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"83aed0982b9569482772baf5168da1cc8be912604f721265e3624caa253a4ab5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"342485d1f53b7c5e7f183d39d79048459046b578a02c0175c06235424a2717d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"917ec837b8fa0174832e52a0d14f92d5687adc55dad9ab915ca933a9894dea1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"891e081687e024ad0d7d5b8f006ccf222efe6bb662f4a65aea597966495f3e4a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"7319771cf3c82e327de1b5225a1643943996ecfeddf156b732892bf81b6ad6c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a3d8da072a6601a05e32b78ee79d409ee3141e309602deab8e9c1343a79862"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec70456fda486d2376963c5a2ac1fe3733c339089dc2b9dc48d43d9f53a573a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c4407e0e5c23e3fbd75bd1c127c05f8c14dcfa96e0ec86cbe61362841cc890"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f53e0a9906389fed0f0aa8836f46598329046610b0f1f8a432893547d3a81c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"3560f5bebf24ef996714e5820b7a361c841ebd5ff1c104c6a0fce28b4b9ca6db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba59add6b17416be6c5b2c6d5a9eb899934d70f5e0da9c15aa43d89981485e3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/MultiDbExecuteDialog.vue"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa58558b5d9ec4dce7e9b343855b5670d38f20762962fba5c12561d6b6a98b1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryEditor.vue"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fb178fac15f6d368cc21fc23bb0467afda8ab8468da38cde49face2c3caa64"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"440a1e6e66597f2d295554739ef898d09bf480b505bf48a7fe258e6eed896ee8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/QueryHistory.vue"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fb1126e1b35ca19445a531591ec46f1fb50725a69b356f0320ae624f7af425"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/TableStructurePeekDialog.vue"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa50d2c531b74b6dc758d853b9eef708f5375f5fe6c896c56031c2b7bfc2a6b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/editor/ThemeCustomizerDialog.vue"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0601c51a7278bbfcb57bb757228b3217110683ecc3a4f86483f0362a4bbc0a44"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/document/DocumentBrowser.vue"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d528ea89ecc355804daed4cff9582a9dddeeb1e2638f6bf90b35170e4f2f69b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f20479ab7cc33048db87762becb0174f08b7b684997b6bd8ed7770e8a3e434"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffConfigStep.vue"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"91692fda0e95a6a9fc6716bc06f12938dd5abfa0eebb804789b8855aebbabcd7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diff/SchemaDiffDialog.vue"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eddbb0592c435cd3f6a7f07e964066d31db7ea5d14fdfddfb20503a60a0330"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/DebugToolbar.vue"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2819dea44daa139db73721b0e6732309aeaa27828bbeaba39143473783231cb4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/DebugToolbar.vue"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4604e4f985f5fc3005f0ca3b10fc366b649d7251d845a92778ab1b610bc25b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugPanel.vue"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d1c4d8cd993bdade198c385d6684c748c98f9fe7ebc66bd322109fdef8070d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugSourceEditor.vue"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1075e5af254671e9e30c5d771390ab5b54b6ab9f7c559a2c3149f6bd4db1ec7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/StackTracePanel.vue"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceb80077208afc5192b2cc8311800da6d0d68195e74c566344b51118f7f5f11"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/consul/ConsulKeyBrowser.vue"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"043d71753c96bd4df7c1ceb229d8e754b075865b3b8f0b62a36f56c26fe62767"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"6168bd3309007e0f01ef7e30d73737beaa162234f56249abc5d850867cf1d322"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e45a3394b5fdaccdd5914b9394c454ccab9fa1b539fbc3daa540989d2bfcd6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde56d94d1a8643b0f84f1b7dbbadc36495ad2de493ada8c75629bf642cc9bc6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":2782}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80ebe54a418d1f1204eebbabbaaf58233cf0f3da5e93a2aada8e389fc0c72d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":4998}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c20a658e873d18858d89fc3e69182df893a5e8005821f3aecf97dd91f075204"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6028}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cf9040902f18e6f87ee60cc784e617bde7179fa9c8d275e5e53bcbaa754c85"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6452}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2361894d4b190810d40aa37e143e806fa22b9de38530fb2666df049208ca3b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":6966}}}],"partialFingerprints":{"codehealthFindingId/v1":"8704761bcc05b8f36b8758e3f8b1f6a9aafa3bb65d98c299602264665c501d2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/ConnectionDialog.vue"},"region":{"startLine":7610}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f66804ced61c9def531b2e15b7430a1675a69630ebfdf789ce05aa97b77c01a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/connection/TunnelProfileManager.vue"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"45123e94398a76c4345ab168a5ffaf5176e1ec68311aee1cb247ef3c1aff9539"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c28af049d969b2ebfa1bbf5d690eee1c92c52f8c7d3d08b6d3a3746691aaa9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/config/DriverStoreDialog.vue"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcc232d3ddb334330b012133e179ba86de05616f23f4acab7caeba9b1e568bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/TextContentSearchBar.vue"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4de3358793f8fec5982c1f30d78cc2927f57f13ed08ca8044853c6479fb4b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"80df55e534a6df12e60e3dcc107f4838a740b372a15a14b39fdf18292b4af0cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/codeSnapshot/CodeSnapshotDialog.vue"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10d6e3aa1a35696658dea977c1e59c1a6cecd977fc0d0d764a57ff698d141ac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/chart/QueryChart.vue"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2396db45913363cefeeded000a94b86adb8b2d3d5182e6b5bed45ebb6ab43615"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/backup/ScheduledDatabaseBackupSettings.vue"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacdd94234fc5b959a31bede512bb517b4f765674b5f11f15deb9081105c3684"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/auth/LoginPage.vue"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26ed7d9df1c1910d492af8d0b1e7b07b0c0af7eb086e66be5684fc4ccf1c698"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/ai/rich/AiChartRenderer.vue"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03192080329c9e6897c20e1f319d7e509caf899161248e8b1b4285da6c5b66e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/DamengUserAdmin.vue"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f075bbc71f0ae49906b5a7ac7d1d82db918c49b6462ae42a1106fc48ceebcb5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/MySqlDashboard.vue"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5c82b0d59777fbc966b4d9a7eb5959c6e524dfb6e597982482b8d094231275"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/PostgresDashboard.vue"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11c78f8dbf961c056a19b328181d9b01d360b1d112041899d9d8c3c36a7c2f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/ProcessListPanel.vue"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3116fe235198d5f27144ed1dbf4fabdac788ff089d040d6cebd59799ec8706e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc3c06ef4e50881cafd3cf9d0258471df92b152609d28bb04969ad51e0f63c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"91eabd3514bfc031f4df83d343c77f8da5d19760c3018d5da799efc7e1b94b0a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/admin/XuguUserPermissions.vue"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"58111cd06ddbca50c6155abf9aee327fce86bf27350e8d5e44cd16a634fadb71"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if v, err := s.curTsBlock.GetColumn(index).GetBoolean(s.tsBlockIndex); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/go-common/iotdb-client-go/client/rpcdataset.go"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c337a79deb99894779b826e11959524f1deeb6562d6b7267afba3732c8fecbfb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"840aebc11b4a2e31cabeed3c22dc93ff801cec906a430b232d0739e9a1a9e01f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"432123ffe47905456acdc7c80d55e9008a132f4eceb9416d743d506c0a353938"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"249a7b40d391d2405561b088a9ad33cc269e9f51ac5c187024ee1f5e0642e43e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad12e4f23efc79ae4984a59f08b074f2a45d59ae65a033c7960442386826a5f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c4382b7b245fd6ca153b4fc1cfc5daef2636021d907bb489ada41f88af5f31"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/connection.go"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc949bf4418d572ae2a2289f8d6ff76584d2fab5628e1ca003b6eafef9b8853"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/zookeeper/tls.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce71ac7fe14b51a120ce29b9ead3928c0dc6810e5cc213754bf87ad4bceb232"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":2994}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a71c3cfdb3b609cd480033158ba1a0778389372495d8328e3c7f735617b9589"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := rows.Scan(\u0026name, \u0026local, \u0026partitionType, \u0026partitionCount, \u0026partitionKey, \u0026subpartitionType, \u0026subpartitionCount, \u0026subpartitionKey); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":3002}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb71b47dc8ab339443dcc6165c30e95ceb5d5d5973e575ac56c2cf235ce58bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"79206e79ad7bf0778531cbeb1b78d3a81731fa134cd00390edf4c38f0e1305fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := rows.Scan(\u0026name, \u0026position, \u0026partitionName, \u0026partitionValue); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":3028}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4912236f7e711f5487d4ff7bf8e9aa1b0a8516e2ed5a07e895c4ab8b373dcf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"799d2dd5d0479a9ec41d8ba88813eedd5952912ad17dc3952ab4267debccaa21"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := rows.Scan(\u0026name, \u0026position, \u0026partitionName, \u0026partitionValue); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"5266c9069fda97142b513d9cafb823324d62ad1e53cddf07c8387ef43a3765b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/driver.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cac870d6f2c6397c90b89503401b41f183f6ff54ab63481eec7deb62123c78"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b2f7053fd3c04f20ff0c3396b18db50a9f0875475597f0569c8956eaf2490e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d77858b60cc84684fe411a1739bb75ee719f0ca9cd8c05c86d12f16c996237c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"34553b11dc86f9419bc48c09571b1dd1b2dfd0d0cc6d75c871e617ee49fc0d1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/vastbase_metadata.go"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c17bb1a01846d361cc9dc8f3eb64e9e17bca860913c95e2497053f752b66be7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spark/src/main/java/com/dbx/agent/spark/SparkAgent.java"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c6fa8f8760fa7b36e909f28f0ca08ef09eb20fd5ca2bbc8c2d17d43b811159"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa9046368189c9bc9d859f2571c4dafbf3ca433bba7da536a72398aaa699db8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd199ae18d1c02bd4db355e2be86cad1587bb2d1dab393dc3a477510b5e345ed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cdc027d3cf996b6069eaf11207176ab0e90ab5c6b54dccca1cac7dcee37d0a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/consumers.go"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"9251b60d856c09f3f1140e3cd1171ee48dde1a9647d1f39c79a37d6f74c5f489"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := strconv.Atoi(trimmed[colon\u002B1:]); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/helpers.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f938efd311d6313140a204ef6532114e339a066f82238928702d254c1c762cff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if tableErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be7451650758e13e36a40d2de0a0664be186d52ca9f97755185807491f1c4ed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"374f146657c156108ef774625303229c1558f5bc5bf6db3f432e33eb3bfd8aad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if pullErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/messages.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee616edef6eeb24d1dc3a35b0d8986328340a3467aa857f7cdf79fba648d6fd5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/routing.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a83b7f531f27417423f1e1f1135f8854d671e34f8579d8d3062b7b135bed61"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/routing.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dec0f7d405260514703b703af52a39045d74ab3223c33baa0358967b50f02d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(body, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/routing.go"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb16457e540069576b3437778adcd0486f4ac7f57c7d1f2ba377664864e4aced"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if fetchErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/topics.go"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf20683ea928fe605a75752dd5bd953ffcf5b8eb78feef3b5b3a20c96907cb16"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/helpers.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd5e00cc82305f948624ac2a599b073a3008316118fd94b593d4ef78cd14aee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := decodeJSON(encoded, \u0026copy); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/helpers.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"16658c6b81899340e3c1c2b47543199d3c841b48a724fcf52d6785f4f87b9dc6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/helpers.go"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5f04ea9fdeb3bcae74fd30e1d385f72dc2e298a8841633cae600b8fb15a432"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/thrift_binary.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"586ccc3f7962dd4fcf8acbc91a642f4ed222df182e7bc692e839f47b0b55c542"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := enc.Encode(value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/thrift_binary.go"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5000d5013d788c87d9911a66967cbb28013e30cd794b9b70b0448cf50a6fbc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dd311ecece6196f6a7db18906aae3a4c54cfadae0c622b0bdedd9d849a1975"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := conn.Raw(func(driverConn any) error { majorVersion, versionKnown = oracleServerMajorVersionFromDriverConn(driverConn) return nil }); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f47198dcb2f08e4e443c39847a85d9f35f8b4c8bcc103d882c6914f52b9425"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4768b96313b379755dfbbdc53ec0618bc294ae9a982e94e1e7ba644e4f62f1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef20d5acc23190979bfc7de3493e644109dae58b189b08389d009437e7683799"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10309acfd5d9759248d091ce8ef89c3cde22f8980068bc0b56aeacbb5ed4a44"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if parseErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"5492d983a3959627e3f443f5e6e099661cdf060baaaa084afb6883b58266e3e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db03c1199b5b30717b350c2098409938858c7943ff076056194f9da1a934210"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := rows.Scan(\u0026owner, \u0026actualTableOwner, \u0026actualTable, \u0026indexType, \u0026uniqueness, \u0026status, \u0026partitioned, \u0026visibility, \u0026secondary, \u0026column, \u0026descend, \u0026expression, \u0026position); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3542}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cbf233529ea8a4f75af5c99bfcf12922676b38c5eb336894b95bcbb1facd69"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9696aef6ac4e5f7e7ae04b182550e4fccc8f3c564de5d62da837442bad0d102f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := conn.QueryRowContext(ctx, probe).Scan(\u0026sessionOwner, \u0026sessionName, \u0026publicOwner, \u0026publicName); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4514}}}],"partialFingerprints":{"codehealthFindingId/v1":"efef6796abe4d33b34d308af7f1d6caea147e4c2d5dce2a5d7efe057bbf2c144"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(params[key], \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6464}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fde2516b8584a5dafa8da3ea763b64ceabad8ed2998d93039f115861d6f5ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6491}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dbd4b8d21861cbdcc14c56588ef00da092b05dbc3aff509768de8f3bf66510"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":6679}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4db27e90d3963fab77c4844e6a1e173c9a590ca6610b580979a0c093e02336"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/nls.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4477aebabfe295d2afc4ee8147e1c8c94a88ac675d15b773ed8e83f8f24ae3b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_call.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e9ee592b9e62783f820fe2c9fc5f4d30118689a70eabe477b967e1237742f4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_legacy_type_graph.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"33667273bbdbfcbc43a8c92defb314be4ced87babcc6239e68a3f5a26003894a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_rows.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f098c78dd656b35232f7c6df11eb5c02372465cf38e0ec385c6741942a08f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_statement.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e79199011c9401a82bd5b44a6656f443bf1f2978e5ccca58ae73c3257b40eb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca70b3ade8a4b4a44de2b90fe98f4dbecdc960c55a3e29b21ac4936ed9f5219"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := plDebugNativeTemporal(fieldValue.String, a.Type == \u0022 \u0022); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36f2fb81546e689736dc6a39c22467c5382190788415dd639bed9f860063f91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if executionErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_target_invoke.go"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a26961b69834698f0599879ed34983ea03f5cafdac62686140d37f88b52565"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/pldebug_unicode.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6528379bffefbd3b055123c0dca3deadaf293e162c6e68ccdabb4cfdfde8cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugOutput.java"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f86facd13b717629c8eed454d5bee1754b521565152a40752fb54b484b7871"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c460fd90470581b6715b6a5ce67e2aeccfada865180d7670cb7becd0088786"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugSession.java"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fbb137b415ec51c80ba18bf6c8ec496e42426078445c0849ded25a5f9f0692"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/driver.go"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e991a3497fb1697137a423deca9934b228705326edd44e036c3254fb95e463"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if columnErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/neo4j-go/metadata.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"579805bf5f04ba704c6e7d2a921cd3ef104ea7221642ea367a45c4a00c026496"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/nebula-go/query.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab17432b933ea71e807c8a4a5074004c4eb4b7fc28a92b0bcf6c3dab77c3c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"77969760795debe5f9ad51a79633acbd5194661c6aa7c463a07f480c2173e9e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5e3a7826aed496fb46509c55860340008c29f10bc0abd1cc4a9e0d2180d577"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"d006de359532c97780dbda3e8443703adb496ae170957f749a2b8fd14e5df1b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a341458e8ce61bd55a975c2f327a24c51dd40906467e2ac7521c7d1360eac203"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := db.QueryRowContext(ctx, \u0022 \u0022).Scan(\u0026version); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1d6898d390caf2dc7086c1be0d988636371fbdcabb71626f522a919bd9014f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"140f9c5627783a146cd221f0e7f278ff16fad260afc17c9ea9592de25e2ccd58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ee544d0b3d07e29d5c700d67e5e5c47e90840ad7c3ec55efebf0a17a08e449"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cff5ba056cc5ca96f934f62221edd61365dfd0c77fbbd4314828f27a6eabb53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/kingbase_metadata.go"},"region":{"startLine":3349}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a688acfa7fe9655769e868ab16bdc899454504ef0d0478f034351454be3b2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b75a45a25a9865eca2cc3f958785fcee17fd945476623cbd4f193cf6d16bd4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e87ceeb3e808e2b3bc650b02662573f78ecca4fd336f38e55528e742b05d41"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"927021d653b2279a6e8f5f7dbdd9fa882a8a74a9e2a8e955776648dfa13e5488"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/iris/src/main/java/com/dbx/agent/iris/IrisAgent.java"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6310450dd91634ad339edf113f74181b4c9daabd90ff56681ab4c48afeef104"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/hive-go/metadata.go"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5e8469e372abcc49f7d7d7140dabc645a83b8d9b80984e5f3391af8c0e104e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (RuntimeException)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/h2/src/main/java/com/dbx/agent/h2/H2FileFormatDetector.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"14420f36ff50613498fee42d30127f1d7c429ef8e254f7a84d2aac603d9e7937"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"015e1ff8b9358dbd6d295ab7622dc2d15d7e95c6032e4e1dc94127991018e2a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"de67a25fbf58352a59dd1e387ef2f08194ea229959578ea3a3b2edfe5a5f05d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"016c6df8b58e8616ece54270c652e22841bbb2c0fbcbd18a2345becbcb533540"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/client.go"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"487fb33da6f4c5f8e1b15411e4dd56b76c54717a0d69881d7268f22103f2c6ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/kv.go"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6ff523eb8140dde68b5f74db7eb65aa977ea25a1d75b41509678b2920634ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/kv.go"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c69d0e98f0e8c5bfd9f72c8a03c7c2232a11f383425691ba679eefe52787c1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/kv.go"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d0cbb76ef5784ba97ad6506527df9d202703085fef22e78dc22eadae755108"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/kv.go"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d1033afda34d0ff38131804fdfdb8bfde4c111c93dbcea0f69447ef84974b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/status.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0b2c27631f8cd241fd68dc9b36ddd48bc31fcd93905d84e11d0f9b1049d8d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/client.go"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"30900dcdd9015321682340de4c62939a2cf3cb5dd9eadd651bee27d2e720f88d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/client.go"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a740467c59f54ed2118f98df568e40b6b271513e5e1d3f9651c741df544d349"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97b8c4d07dcc9905c96689d64a3f0a0b3d90242b161f0c60c97b08b048a21ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4f74a78a6935345afa8c5dae0f44b312f3286f71832461cbd21c69ee9120d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44448c719daaa4b858b3d4fd5f69bac8a885d64fe170115899dd0bbd4345f17"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026value); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/kv.go"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b1b36c17eb8d89575b337ced337164e3b14506f69f0ddcbceefb2ee88080a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/databend/src/main/java/com/dbx/agent/databend/DatabendAgent.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fb786536b2092eceb977a7d146d4fccf3ae8b40416f21aca73e66cbf423373"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bf97a1e35787e0fa7db4e51298c7ae297b444a1af09177ec40f99ef8da4fbe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception | AbstractMethodError)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54a45439e4d97599bed0d49ecc83af748dae504ac72aeb1b82f06a5349b0205"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception | AbstractMethodError)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"728a9957a343ed4cc6e885468488421a9552cb8add6db16eed6b73517e0610a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"9335f0e70195a87c324d7d80e252d97cd5be92601c4494a3d047a8a8667f2025"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa8f6e4cf72f30e04383804e2b40325d2985fec83ba1ab63debf9950089fbae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3029}}}],"partialFingerprints":{"codehealthFindingId/v1":"b650f2e556de94a154e2c5a096e954d838fdd54d3510fc733d08474b684c132e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3036}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2c61e3aaa3663c6414935f6be1e27fefcada1f25d46e5d31109f432b6480c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3217}}}],"partialFingerprints":{"codehealthFindingId/v1":"26798b3053f27fb577d998e7036e065d15b91d8cd06d2bb39e5358d62c54bdfa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd414275316f258ed3de43be8ff5873f381c99e5c5d48f757f4e46c8354a0e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3390}}}],"partialFingerprints":{"codehealthFindingId/v1":"242b3a3b8c63ee5c26e466bbc9356556604dd4622377f5437d7de026cae7c054"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3575}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5279ef61dbab113ba563d2af354bc4ce88cf894bfe5cbf07389c4438674756"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3579}}}],"partialFingerprints":{"codehealthFindingId/v1":"5194dda87e84ae79a57c02652b1b29b22983aa31dc5dbc04b128cc3d9924f3fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6080024321f563acb753b14fcda2e58421e3a3b99437fb2d15c66a77bafaed6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"3362180178b7fa313e07162685b33754da6248963fbadf79abdf8fc0fa52cb4b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3610}}}],"partialFingerprints":{"codehealthFindingId/v1":"175713083c47a6e58bbefcfabefd433f82235e8cbc0875a8fe0727e6ae476414"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"299f8a7efe2aa738ee54f6d0e2c461a5f7bec6c243ea0dad68b9f9d36c978432"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/cache/src/main/java/com/dbx/agent/cache/CacheAgent.java"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e145c2a9fc033bb5e1e47995a9a63069925ea394febcdf395e695aebe04e9047"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/argo-go/metadata.go"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc36d195a87f57ea23d99319c2dfe76f6d1fd8eabb6d646a3db10dc2ba0fe7f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"e846dd4dc3cb9c061b0a12118f1fdfc810d0c7e369d0a5e5b16285d97b184556"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception | AbstractMethodError)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc122c39a7c4871ffa87c8a0e97f779b443d480af26354a432c9f5ca3a87b41"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c149e0f546c8ea43feb9f9d841ea33ab116752fcc6a81bcf9f2eb728ed5eea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ac2fa847e14d9ff76677d4635690272805667766289d0778c0668f88d80eb7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d675b14640ba870a609c7a13b667638e690d8acce81a20a6077b3c82823d9a9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"df03ec6d5114bacde87005086283380eb2780231d18b134bcaa3231d637a9fb4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5e3b9f3b64d72964e07efcf41f7920ec836893f4e51b52d0c9971c7058be8b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"923a78af9755f9f3777f525a1e7e0c31be2f1f89df4c9359afbcbf5405053876"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b1a60bd5c914213e5ec4f4cd643a75822bfee849072e0ba0822911e56ecde9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac44b0bfb3d49f94d245d94cd7dbe246d7e011759f77d724e6e9f9e46981447"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JdbcExecutor.java"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f777fd6578e85d3d6f29f91454759289814c1e80a786fec92ff3e4715dc75d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95f0a75476849443dbb7e8cea8061523617a5ee22c4d477c0308f29efafe8b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdf558f3d17697ca259cded78128661a8a211569300c9c1f98c729e530ea96f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5ee3327455fbc80ee3132925ce0113108e6ed4d7b7c6640a36e8cb8569839d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"d324a6d424b0f90d6200f51e5e6dfeabce1060d9e1155f014a5a57136e18d369"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"134960aabbba53d6f80ea223e52f3d6c60fe031bb47870a61ec3075ef7d00c5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (RuntimeException)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e32461f0bdd164f03e02257630b9e0debb3d593426989694ffe93458b74001"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/JsonRpcServer.java"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a1c731b93dbaab5332a936a071b56f85f4c5571a54cf5270e32615ca7e45c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"11837cdfb5e0a70d861d1c4dfea8be7d7811781bc2372ddc9a3d8a4e1100c174"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5b1281152c35b62f3975e386bb2b268c3eb5fe3639ee92a64d28a3a224a68d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4e6e8779b509a8d71e1bb277b4b0e8fd57d7a674f09465dd4d649b42ea5505"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of \u0060close()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/MultiSessionJsonRpcServer.java"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"88434c9429dfbb547b71b85f53da568a5e428c02aab6c5be1872bc47c59eaf3a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1668e412514ad8b9ddd0a678c67b0d2f51256af0cf37f34da8fc43552cef75"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c51b9eae6d06bac82e0c6f90cbee14d596b576bea685405d8c4708527e7e5ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0772de340fa83c88d8415be4878f7e7b0010bed8edafd2eeb928740fcdd42ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41ec26939901d619a5cfcf65634dfdd2134c936eb4635ddd60d6c7f4a61a695"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd87afde47f292e10b91090770f4a5a4630a775d2086362f150d058511ff9fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception | AbstractMethodError)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2ded14ae4b9a2fccd57a2739c2c2c6ef60f9a1f517ec44b0b1b5460547bc2b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85517f2ca1d163242d7f3c5e92384cc0362dd8c2a8566a9b7c8d6cbfdfee700"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f949ed88b31e104dfc34038762dd166bef477e2157abdc041cdac74c130e71"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6b0ac71c945eb0d850a4aab3117ef2b0e0e56bcca5d7595aebcfd6279fcdd1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"291a68d10cb88fa58ccc30f9a8fc904abce5fb14c3b939c6caa72408dc6634ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"26099e15d7398ed719ccad68807eeae3faa63a1134b7d7d5833d39d688e743a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception | AbstractMethodError)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7800bc8541837559a937825a1f51c0c9eb51f2a4103cae740b5be69e032f64"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/StandardJdbcMetadata.java"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f95afd617984639ae5301e6ba404fa865bdf62d7bdb67fbc69a255de6d1f2c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/TransactionExecutor.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb01f9575944ee03b80e2b4b316cc7b2e14f8758aadaa35baafade4b5cd2910"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1655 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6b6acc9f68d3fe1de706e50e45d96973b59b9abf4d458f8d8dcc8b4848b7b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1657 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"891e7ebae001f54d8f5fbfc850158c3b2a8c5d10385925b27c761d70f388a1ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1665 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d2d84a4eaa6b46327497a0da3c4abba4782dc9351a4a4cb7f9b13a8c85c80a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1685 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"b762ca2202a5ec5db9a1183ffe8cb899840604780464c716ba01e0888f201c46"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1692 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"39810dac74f57405a3167a23ceffd22511c8e170bf0155db5dbaa2bf270b4ab5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1712 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec301a7b910f5a8de270cc07dac2d7ccbf32e6c8c88316c546dd57aa53705d4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1733 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-web/src/main.rs"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f17a116070c821726e8d69f51c91c99ad5492fa78292c4a7046f80938c8d474"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 3/4 of this repository\u0027s type-checking configuration(s) turn on strict null checking (\u0060\u0022strict\u0022: true\u0060, or \u0060\u0022strictNullChecks\u0022: true\u0060). A configuration that states neither is counted as OFF, because off is tsc\u0027s own default; a solution-style one whose \u0060\u0022files\u0022\u0060 is empty and whose \u0060\u0022references\u0022\u0060 point at other projects is in neither number, because it checks no source itself. Where it is off, \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060: passing a value that is null compiles silently and throws on the first property access."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~2.5 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 1272 assertion(s) across the 517454 source line(s) of the 1580 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: apps/desktop/src/stores/queryStore.ts (92), apps/desktop/src/components/transfer/queryResultTransferDdl.ts (39), apps/desktop/src/stores/connectionStore.ts (36). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/model/modelCodeHighlighter.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4207c6b288c8dbf3311d6180970f30d66b820d67f20c6bea1c6b5fc07abb02f6"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiCodeHighlighter.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c6e3576abaac062029e7ca5dec07744097e3c395d4f752037aecef05d0075f"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003CLoader2 v-if=\u0022exporting\u0022 class=\u0022mr-1 h-3.5 w-3.5 animate-spin\u0022 /\u003E\u0060 under \u0060exporting\u0060, but \u0060exporting\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/SettingsTransferPanel.vue"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f509bc9496ec139ebaefa4aead28912cb146ba6b7661c13dc561e6bf882c572"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003CLoader2 v-if=\u0022importing\u0022 class=\u0022mr-1 h-3.5 w-3.5 animate-spin\u0022 /\u003E\u0060 under \u0060importing\u0060, but \u0060importing\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/settings/SettingsTransferPanel.vue"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a2962e39e18df93fe30f32651018ec45206cce91f9dc7840754687f8eecb02"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003CLoader2 v-if=\u0022loading\u0022 class=\u0022size-3.5 animate-spin\u0022 /\u003E\u0060 under \u0060loading\u0060, but \u0060loading\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66a1b70a2918dc3c33bc27ebc1480f1a44cd122ce209ce0d36c1defc96b0760"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003Cdiv v-if=\u0022loading\u0022 class=\u0022absolute inset-0 flex items-center justify-center bg-background/60 z-10\u0022\u003E\u0060 under \u0060loading\u0060, but \u0060loading\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/redis/RedisSlowlogPanel.vue"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f19d1731bad763933b598902b156a65801ad006185e7bd4ed23c581196854f"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003CLoader2 v-if=\u0022changingTarget\u0022 class=\u0022mr-1.5 h-3.5 w-3.5 animate-spin\u0022 /\u003E\u0060 under \u0060changingTarget\u0060, but \u0060changingTarget\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/layout/SqlLibraryPanel.vue"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b291dccf5ea49e63238b45f39e183b9ba23e515351666876b6887177af41b23"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060{{ loadingText }}\u0060 under \u0060loadingDiagram \u0026\u0026 tables.length === 0\u0060, but \u0060loadingDiagram\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/diagram/SchemaDiagramDialog.vue"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da82008e0cb2ec8658548a044e7534b3977a07e3fc9e6387da179b18d1e3503"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060{{ t(\u0022plDebug.source.loading\u0022) }}\u0060 under \u0060loading\u0060, but \u0060loading\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/debug/PlDebugSourceEditor.vue"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c52b1296eaa4556a71659296c4a5e1df523bd3e25d1f9371d32624ea09fe0e"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060{{ entry.message }} {{ entry.action.label }}\u0060 under \u0060persistentMessages.length\u0060, but \u0060persistentMessages\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/components/common/ToastHost.vue"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"72af2849258add4480daa7183be79d4e50750f742d5bdaece67aaf3fd41d3bb5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060connectionUrl\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d00fa18ba16b35e1c0d1b760f501b756d6976da570141fc15cd885530a7dcad"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060resolveIdentifierQuote\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/common/src/main/java/com/dbx/agent/AbstractJdbcAgent.java"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17e880890624ab13f42f78ab832b50b8088e52e594e76b017041576f298ed68"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060bitColumnPrecision\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":6560}}}],"partialFingerprints":{"codehealthFindingId/v1":"7305c2ae6676068c54b8a278ac13feb72e122eb7e22a3e24f558039a8bc7b500"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060columnTypeName\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":6525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87731c500e8db9abf4cad82ed18c0b85885d92411e467467cf04f1221269c09"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060statementPrintMessages\u0060 swallows every exception into \u0060return List.of()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"633ee908980bc5af52e57141a7ae7e4d2b03bfb9e2c19bdc6328163e2a8afad0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060triggerColumnText\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/dameng/src/main/java/com/dbx/agent/dameng/DamengAgent.java"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aba3414657095a87f5a95f2c0f0a9bfad6677b0b8ae6f11678f5754b83c30a9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060currentCatalog\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff512d9a1126ed7d6699cbec8bc5f529630b3b133e6ab3fa27b0ff56c0c931f2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060queryDatabaseNamesFromSysmaster\u0060 swallows every exception into \u0060return Collections.emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/gbase8s/src/main/java/com/dbx/agent/gbase8s/Gbase8sAgent.java"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"31417d626463090de1b36c303f69e4b75eb134392b055def644090663547e8be"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060authorizedDatabaseNames\u0060 swallows every exception into \u0060return Collections.emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/mongodb/src/main/java/com/dbx/agent/mongodb/MongoAgent.java"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"f824d7efad3214d132cda2b8594f25c9a233e989340a40f79caf5372be80647e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060matchNativeNames\u0060 returns \u0060List.of()\u0060 when \u0060NumberFormatException\u0060 is thrown, 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 rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oceanbase-oracle/src/main/java/com/dbx/agent/oceanbaseoracle/PlDebugNative.java"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f252a7439028355cb8488297f7545ab9b258dbcd74eba2ec4e79a84948b16821"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listForeignKeys\u0060 swallows every exception into \u0060return Collections.emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/snowflake/src/main/java/com/dbx/agent/snowflake/SnowflakeAgent.java"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a569e121ac5c91182f588833f7f97cbbb9a72500f2e178782eb46e8f1fe9c365"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060configuredDatabaseName\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95acd19c97df02f7e51de9ae545d705384efa011d6e502e1d58198fe22cc4e9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060spannerIndexTypes\u0060 swallows every exception into \u0060return Collections.emptyMap()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/spanner/src/main/java/com/dbx/agent/spanner/SpannerAgent.java"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d8fbddd5a44f93daa4bc93032b7c45d123b26325e6456b407fcc7304946695"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060endpointHost\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd-go/client.go"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c18efcfe9b2a71c76f71c90bcb1627f07acbedbe1a166fbf5ec1ef85292301"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060endpointHost\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/etcd2-go/client.go"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aa7de786aec06801233d7657b04a9f23196fe827755b9db7805a00e09c1f2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060readRSSKB\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/bench/agent_compare.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"483eb68a0ac600e7abd06f5b3a2c26f78349d3afde6ae9209e2a5f97724d9f93"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060columnTypeNames\u0060 turns a non-nil \u0060err\u0060 into \u0060return []string{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/kingbase-go/main.go"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b93e667a434f836cd5d1b4c56aaea521575bb2d3ec2c9d232efe15beae8434"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060oracleExplainPlanTableName\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022PLAN_TABLE\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":4514}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b69a3ef0ad562f18ec5a6ef439670d71544e30b30a326bb5e37398d13552890"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060columnTypeNames\u0060 turns a non-nil \u0060err\u0060 into \u0060return []string{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/oracle-go/main.go"},"region":{"startLine":5197}}}],"partialFingerprints":{"codehealthFindingId/v1":"618e1ba45b7f58c85488b72bb18afe0c63a6ae09508a07afe1bc6dce1eaebb45"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060readRSSKB\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rabbitmq/bench/agent_compare.go"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c557764ca39f2ad3c0172a0cbb319b5f604f1a919d827a3e19965f15ce1a4b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060readRSSKB\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/bench/agent_compare.go"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea19db2f0af293bbd054e449bdaa49b41a359681df101a4f02b72c6474215b86"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060fileSize\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/bench/agent_compare.go"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4abcc3ea0cacc90103c3451aae6bc59aac2715a41fdeccf6843abd56d20a7b6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060columnTypeNames\u0060 turns a non-nil \u0060err\u0060 into \u0060return []string{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/vastbase-go/main.go"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc7551525e74a1d9b6edaea7ed88078c243cd87917b5958bb20c5a4fbfff68e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060columnTypeNames\u0060 turns a non-nil \u0060err\u0060 into \u0060return []string{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/xugu/main.go"},"region":{"startLine":4214}}}],"partialFingerprints":{"codehealthFindingId/v1":"639dfdc82c52f833114e765b27ae5db3513d557281a11861afcad60b6d1af5e1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060duckdb_execute_with_max_rows\u0060 turns every \u0060Err\u0060 into \u0060\u0022?\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/query.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f306fda0a7475ecd934948a21d901ffc69dcd2cb480ec4be4d182fdde997902"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060duckdb_column_comments\u0060 turns every \u0060Err\u0060 into \u0060HashMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/duckdb/src/schema.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f3c3fd6b7a34cdc7a078dee19c8c3070f3fcfd0f36175af20183530ea4cb43"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_retry_after_secs\u0060 turns every \u0060Err\u0060 into \u0060Some(0)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai.rs"},"region":{"startLine":3587}}}],"partialFingerprints":{"codehealthFindingId/v1":"038cb30fdbf2bd6d301eca73a791ec2495c9336328bb7e2e9d3cf54e111125fb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060toml_string\u0060 turns every \u0060Err\u0060 into \u0060\u0022\\\u0022\\\u0022\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"01da25fa184312f2daa6ec740514339d8ca8cd8c912e62a66daf8c5c8e2dc4f8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_codex_jsonl_line\u0060 turns every \u0060Err\u0060 into \u0060ParsedCliAgentEvent::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d6d5479c4fcf813c5642b8e222c664c8fc0ddaf49ac683b886e3fdd66375f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_claude_compatible_jsonl_line\u0060 turns every \u0060Err\u0060 into \u0060ParsedCliAgentEvent::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"606bc231179a8e8a01d24942ac3429f18e8a6ead9b07f4a7e2547022d584042c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_open_code_jsonl_line\u0060 turns every \u0060Err\u0060 into \u0060ParsedCliAgentEvent::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ddcecb9c0573ebba6506d32cc42a8515ebe5382d1d87b216ff1daa384c859b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_cursor_jsonl_line\u0060 turns every \u0060Err\u0060 into \u0060ParsedCliAgentEvent::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79a7afc59dfd6fdb0bc883f067bdb8eb931abe45a2fb2d638fb71f1dacbdd8b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_grok_streaming_json_line\u0060 turns every \u0060Err\u0060 into \u0060ParsedCliAgentEvent::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_cli_agent.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cd42802b8e20a38499ef32e3bfa69b3cceaa4973e97d3631387683e9348b6a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060oracle_oci_defaults\u0060 turns every \u0060Err\u0060 into \u0060OracleOciDefaults::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"158728458882aec8d77c0fe7e3089da80a1da3452975200443831a9af69bff5a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060active_paths\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import/failure_log.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dfcc976baddadd0ff5acd3fb707799896aa8053dcf9d1f0a6d65073613b8f8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060remove_owner\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/sql_file_import/failure_log.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"26484bc6980b46447fda329caeb061ac2de9bbd4de6950b4793d08577b19d251"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060probe_agent\u0060 turns every \u0060Err\u0060 into \u0060ConsulCapabilities::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/consul/capabilities.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acff4b981410c5d9fc311008d701c9cefc05b333e45f99fc2ad2acd01253ed6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060endpoint_candidates\u0060 turns every \u0060Err\u0060 into \u0060true\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/admin/nacos/prometheus.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f90f45bef69ec0c3f84df2bae3548aa44d39e05a0a6f36e246fed6d008974df"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060configured_etcd_metrics_urls\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"0388b735efc521711834de49e5f2da2fe0d5a31a9586bf4b7071740a6d9b17cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sanitize_metrics_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022configured metrics endpoint\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/ai/agent_kv.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bae5c159346e7643c6c342717fc5e3eda58ec72a14ce863a7fd5c50ae0aa6e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060redact_transport_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cinvalid-url\u003E\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/mod.rs"},"region":{"startLine":7871}}}],"partialFingerprints":{"codehealthFindingId/v1":"1711760d32af3006a9365b5245b37e8f8849b199aa37c1703e4c0a53f0a48b6b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_system_fonts\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/connection/jdbc.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ce7f0a6ce71abbfd61b014a8d98c7104e89b3dd7d8ae282a58b5df8124e519"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060json_stringify\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/data/data_compare.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cf8d4db7e682462112cbf025a13a7081bcf56ff18fe0c7296efbbcfed90032"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060postgres_object_source_catalog_caps\u0060 turns every \u0060Err\u0060 into \u0060PostgresCatalogCaps::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/schema/mod.rs"},"region":{"startLine":14692}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17ded6626e0ffb1b473ab9bdfaf32cbc9612ffa06c73ed22bc371a6397aa12b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060path_size_bytes\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-agent/src/agent_manager.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f42a4cf1ec3e6363f1e7606605b168c150e51a424583e111dab07be2af9b54f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060elasticsearch_base_url_fallbacks\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"2698d81aca0d764a82e298956df70ebd55c0f0dfd2fa0a4c8c1c1c71dd2781a4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060alias_map_or_empty\u0060 turns every \u0060Err\u0060 into \u0060BTreeMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-elasticsearch/src/lib.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b2627d495d8aea8b40294a207f6ed3efec185876501d0c9c8ff2fb893d0282"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060redacted_tunnel_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cinvalid-url\u003E\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-support/src/http_tunnel.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"787f68c3dfb1838d361f9c581b0a7b6ecfad1468afd096036c657a0f82ea3adf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060json_cell_i32\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-drivers/src/db/sqlite.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63da58daaf288236d8739bfc6cafcb86971984ef79aece12aca4a7591e075a5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_group_paths_for_policy\u0060 turns every \u0060Err\u0060 into \u0060Ok(HashMap::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":4808}}}],"partialFingerprints":{"codehealthFindingId/v1":"054dbff2b9b1f159d6bb1051c5d1b9064e09d49a97c141d12fc07a50b1aaa1c5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060mcp_sql_operation\u0060 turns every \u0060Err\u0060 into \u0060\u0022DML\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":6265}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ac4fae0bc9a51f5e00ddde64d43bae09c8df53298d4d646c5f5f014b0a60dc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060salesforce_write_label\u0060 turns every \u0060Err\u0060 into \u0060\u0022Salesforce write\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-mcp/src/server.rs"},"region":{"startLine":7084}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef17171a88d20d08da8096affe489b50eccd42e40f9eaca481863b7974e89066"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_version\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-platform/src/version.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed2f9b62ececc02ab83c218ca3ed6a72fb5a28a90c7d7436edd9118e74bb783"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sqlserver_decimal_type\u0060 turns every \u0060Err\u0060 into \u0060\u0022DECIMAL\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-dialect/src/sql_dialect/type_rewrite.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e8a5d34e6ba087ba8cc6ccd1c744edc9dc124fd4acc3af1ee3ca550046d9fe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060linux_drm_render_devices_from_paths\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lib.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"5924293fc47ca6e1b3c7e16cb29a3b2265fda0495d67f24c924c32505aa0108d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060activate_links\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/deep_link.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a2a79fa8c7e8061aa51f7e6d82c974d4e93472c467fc3c705707b3286d2cfe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060search_root\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/global_search.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24974338851c574ec76d9ab86ac6c4dbee79612f226ddf6d9f64465e5a685a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060withAssetLoader\u0060 turns every \u0060Err\u0060 into \u0060false.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/wry/src/android/binding.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d0f6d09175c3ee3cf0e04235df9bdd48dca275e3acbe13c002d72c5bc347d7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadConfigsFromStorage\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":"apps/desktop/src/composables/useDataCompareConfig.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"623438694ecc9c6c124ee962a5fcc9ef137c4773248ee8a337303cabe9514c10"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadNacosConfigListHiddenColumns\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":"apps/desktop/src/composables/useNacosConfigListColumnResize.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29158e99687ae8df9b06efb78d903c6ee119580bc79173a40ad17e5cf8e2759"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadConfigsFromStorage\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":"apps/desktop/src/composables/useSchemaDiffConfig.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e366c852fe00fad953a051211d9d4e21ba1b5535a5140025386c45224f95f45"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadHistoryFromStorage\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":"apps/desktop/src/composables/useSchemaDiffConfig.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e688cb5c7e822f01043b9e87ffd38bcc2a3f53561434e915324e5830cc8f5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060resolveTextAttachmentEncoding\u0060 swallows every exception into \u0060return \u0022gbk\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/ai/aiAttachments.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9678016c206ff66c4b867a1b4fbddd5c427adea488a3ec2621cf78fa0edb2a5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseLegacySavedPositions\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":"apps/desktop/src/lib/app/savedSqlEditorPosition.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9f14e5fa47733b74139493365707f098476920f9e0082658279eb670ff183a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseEntries\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":"apps/desktop/src/lib/backend/debugLog.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d26fa5acf7d4cdeadfebb27502037d76308af8fa7299083b2e91d0a1ab07f11"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseStoredArray\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":"apps/desktop/src/lib/backup/scheduledDatabaseBackup.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b91d7b5607f915edae220eab30c6930fafa11c6b9a9c282b64005826afa5fb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseRecentConnectionIds\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":"apps/desktop/src/lib/connection/recentConnections.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"be115323ebef2a4a4be6b85e061aeaa97ddcce5135da1fe4911955e4a41983aa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseIndex\u0060 swallows every exception into \u0060return 0n\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":"apps/desktop/src/lib/consul/watchState.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9130fd72bcc4f09b1283cb2abc7bb307a3494acedede8b9eedea584015298f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060iotdbTimestampTimeZone\u0060 swallows every exception into \u0060return \u0022Asia/Shanghai\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/dataGrid/columnFormatter.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecac0df68f9e4999e5800739161c64eef8a18f94e747b8c45d4c05ee4d2180ef"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadStorageIndex\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":"apps/desktop/src/lib/dataGrid/dataGridColumnWidthState.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b54ced60a306d62377938114ad75c06569a31d5d170e1907fdb726c6b2ec1c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readOrders\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":"apps/desktop/src/lib/dataGrid/dataGridFilterModeOrder.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada44b4c7057b4d66f4d66a40b7a58c9efbb295f3fee9e74d40b206ea33e115c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060decodeXuguAuthority\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":"apps/desktop/src/lib/database/xuguUserPermissions.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb8664bd93bec5339b40b6beb2fbe002e0cbbc55711029a64ea951948b4747e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadMatchConfirms\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":"apps/desktop/src/lib/diagram/match-storage.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e113c083d5aa5308410c32ff129c588d47e3566cb1f4699cbd076d4e67561941"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadMatchIgnores\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":"apps/desktop/src/lib/diagram/match-storage.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"83026bd73a5c025627fc0e538b6cac9d70dfc2f61a98b1a0f0ae26606a275a80"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadMatchRules\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":"apps/desktop/src/lib/diagram/match-storage.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b9023e75567030c0a4cd7f1f020d0e49f29c66a6a1a6e5a8bfb56795c171ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060currentGridFsBucketSortDirection\u0060 swallows every exception into \u0060return \u0022none\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/document/gridFsBrowser.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"41178d7521c076282c3061755e36c3636b74a3eb2578a73fbd4b961daed97476"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getLastExportDirectory\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/exportPath.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d806a39bbd2f5f767d5fe9c4fb4856de84f0abea022d227ca220b4e3438a42b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getLastBackupDirectory\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/export/exportPath.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32323b7cbd32078aff204fa5f602e8e862a6abdf2394ff2dc686153edb2e306"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getGlobalSearchRoots\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":"apps/desktop/src/lib/globalSearch/globalSearchSettings.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1cfa3759ebc8d2a52b632099248aacbf1508915dfe6af117b87b72ebf25aa5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060decryptCredentialsFile\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":"apps/desktop/src/lib/imports/dbeaverImport.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"098e8f5e732dada564f89adb8408570dad911d119779484c4fb04b1c80d7cd41"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060decryptNavicatPassword\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/imports/navicatImport.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3243003f8bc1ce4bec187858e862973f76e6633a3eca519a6a349bb27ad164d2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060validateBulkWriteOperations\u0060 swallows every exception into \u0060return \u0022bulkWrite() requires an array of operations.\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5bbeca24b9a1a7a31e6bc269fba34d6162042be74f2a14fe9e907defb21817"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060bulkWriteFilters\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":"apps/desktop/src/lib/mongo/mongoShellCommand.ts"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2255e3b2d015c2db51f5c756637cf3c85ba5b1a78c9d1cc4060113e8609e3a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060installationClientId\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/lib/plugins/pluginMarketplace.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae986589e630ece3cf9df8b307004167c0fa34e84bd1a7a23912d273e6f5c59"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadPinnedPluginIds\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":"apps/desktop/src/lib/plugins/pluginPinning.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"63aa6be335de52e7d24a95e03f367835347aa5edfedb16978b3ec08e041fcbf2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadExternalSqlFileTargets\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":"apps/desktop/src/lib/sql/externalSqlFileTarget.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"804b5e53b290bf6bd2613b54ec918e36925a8a0e40c8df88ea804551a9844906"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseSqlParameterList\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":"apps/desktop/src/lib/sql/sqlParameters.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e16fa2a0fca0f1b662e053b148622763ef8a5c81507d63dc75493b2421c7e76"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getSqlFileFolderPaths\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":"apps/desktop/src/lib/sqlFile/sqlFileFolders.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e7f1125a9034c594031fcee06bedc8a77d0437ad291001df9db188ddd74c51"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getSqlFileFoldersUiState\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":"apps/desktop/src/lib/sqlFile/sqlFileUiState.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fd8a4613003059c858a9f1bad9992883a39affe38e8457c6d0b391a6cfd6ca"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readPendingSessions\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":"apps/desktop/src/lib/sqlserver/sqlServerActivityTraceRuntime.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde81db687c51caccaccf6f6e27a48aa2d3b1b998ea47b1a97c64994b42ecfdd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadSidebarTableNameFilters\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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e823f0dbe089d38c169a5dcd34c1ad0e3f2b02e177f5a88cb9f0b548dc1c8018"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060useConnectionStore.loadPinnedTreeNodeOrderFromLocalStorage\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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c146ba3162a128523f1ac62b7cc0ce7b49270cbddcf345db05070cd8196435"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060useConnectionStore.listSchemaAwareCompletionObjects\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":"apps/desktop/src/stores/connectionStore.ts"},"region":{"startLine":10607}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5728948fdf1916d4ab5eed07592068bcd6a2e18d69dccd4a0223dbfaa6ce4f2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060useQueryStore.cancelTabExplain\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/desktop/src/stores/queryStore.ts"},"region":{"startLine":10853}}}],"partialFingerprints":{"codehealthFindingId/v1":"3743ffb650ac268304bf489c3ecdadd525508a2216b9f7b4e0669be7e58f25c8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060detectArchitecture\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/lib/platformDetection.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d101264c877ba6e91a56ed2a80dcfe41af08207c35962f67f2b99f6d90646607"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMockHost.readSettings\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":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"08adc7f6bf8021a512d3a3460e3fd3c5545348a2a4c06857e33425587364cc64"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMockHost.readUiStorage\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":"plugins/sdk/dev-host/server.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"375a2a3bf34688f4fb0b56088993af8c398e5d3ea0259ec3962ea8b19c0d7165"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060stderr.contains(\u0022The specified item could not be found\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060stderr.contains(\u0022The specified item could not be found\u0022)\u0060 also satisfies \u0060stderr.contains(\u0022could not be found\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands/keychain.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26fb480153fba5779f492b1e6c399e276c5035a5318e9c115dd922ed7f074e6"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060normalized.startsWith(\u0022bit varying\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060normalized.startsWith(\u0022bit varying\u0022)\u0060 also satisfies \u0060normalized.startsWith(\u0022bit \u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/jdbc/src/main/java/app/dbx/jdbc/DbxJdbcPlugin.java"},"region":{"startLine":6515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0d695e3e2b81af804c87b3daacbe0e044f4aeadf176ca330f0ac205b4ec144"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.starts_with(\u0022character varying\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.starts_with(\u0022character varying\u0022)\u0060 also satisfies \u0060lower.starts_with(\u0022character\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-sql-schema/src/table_structure_sql/validation.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"92580d419dad93b02fe33a0a21a46ddae896e8e41e99051a6b7498d62de062c0"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022this command is not supported in the prepared statement protocol yet\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022this command is not supported in the prepared statement protocol yet\u0022)\u0060 also satisfies \u0060lower.contains(\u0022prepared statement protocol\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-driver-mysql/src/mysql.rs"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f68e360a1feea8a32bdf563ccb559837d5b0cbc66e6af84294de03baea255a4"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060missing.contains(\u0022ns not found\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060missing.contains(\u0022ns not found\u0022)\u0060 also satisfies \u0060missing.contains(\u0022not found\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/tests/live_mongodb_legacy_agent_commands.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e327717341258174f422bcc62c2bd8fbae8f34b091b1602825f3c352cb08b9"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060normalized.contains(\u0022clientsecret\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060normalized.contains(\u0022clientsecret\u0022)\u0060 also satisfies \u0060normalized.contains(\u0022secret\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-core/src/persistence/cloud_sync.rs"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84c3d18e1435a27f8ef5e2b5201b4214f531bb1505290db2600410233955e41"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022the filename or extension is too long\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022the filename or extension is too long\u0022)\u0060 also satisfies \u0060lower.contains(\u0022filename or extension is too long\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e87ebf9f176f3fb7dbbfe27d35cc353c041044376ac7bcb18803c2f50f2043"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022not authenticated\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022not authenticated\u0022)\u0060 also satisfies \u0060lower.contains(\u0022auth\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dbx-ai-provider/src/ai_codex_cli.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"9693d2139b25124384cc11ca1e49835adf04f046479975ecc7e26862cea78da2"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.HasPrefix(topic, \u0022%RETRY%\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060strings.HasPrefix(topic, \u0022%RETRY%\u0022)\u0060 also satisfies \u0060strings.HasPrefix(topic, \u0022%R\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/topics.go"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c110cfd8f77876333f2c39f2fbd06250e65c991b4c70c266a7168a261d820e2"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.HasPrefix(topic, \u0022%DLQ%\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060strings.HasPrefix(topic, \u0022%DLQ%\u0022)\u0060 also satisfies \u0060strings.HasPrefix(topic, \u0022%D\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/drivers/rocketmq/topics.go"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2a92a9f141670199d094b750a790fba93be0910408cfb91a8703ad6cd8ce00"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060file.startsWith(\u0022packages/mcp-server/\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060file.startsWith(\u0022packages/mcp-server/\u0022)\u0060 also satisfies \u0060file.startsWith(\u0022packages/mcp-\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/label-pull-request.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"036134cb219df76d779c72e51c3435b095634516945d9bbee405e67ea5dd1620"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1188","guid":"90b5d93c-2e8f-7d58-b831-915e7ee4a150","name":"CWE-1188","shortDescription":{"text":"CWE-1188"},"helpUri":"https://cwe.mitre.org/data/definitions/1188.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-252","guid":"78915dc5-e486-f858-bc3c-aa570ad9010d","name":"Unchecked Return Value","shortDescription":{"text":"Unchecked Return Value"},"helpUri":"https://cwe.mitre.org/data/definitions/252.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-295","guid":"a706c4e2-1232-8859-ae2e-17aa2d41f8e2","name":"Improper Certificate Validation","shortDescription":{"text":"Improper Certificate Validation"},"helpUri":"https://cwe.mitre.org/data/definitions/295.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"Reversible One-Way Hash","shortDescription":{"text":"Reversible One-Way Hash"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-338","guid":"e89b7604-c3f7-8b53-bc8c-4d4718c28617","name":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)","shortDescription":{"text":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)"},"helpUri":"https://cwe.mitre.org/data/definitions/338.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-391","guid":"d9ef5687-8d79-9b51-b509-b83411fbcdc3","name":"Unchecked Error Condition","shortDescription":{"text":"Unchecked Error Condition"},"helpUri":"https://cwe.mitre.org/data/definitions/391.html"},{"id":"CWE-400","guid":"ca529a89-676d-8857-aac1-84359c77bb6c","name":"CWE-400","shortDescription":{"text":"CWE-400"},"helpUri":"https://cwe.mitre.org/data/definitions/400.html"},{"id":"CWE-476","guid":"df404eaf-4a12-445c-9306-241412f65220","name":"NULL Pointer Dereference","shortDescription":{"text":"NULL Pointer Dereference"},"helpUri":"https://cwe.mitre.org/data/definitions/476.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-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.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-668","guid":"e2cb99db-6d24-b056-b0d0-885a733ec403","name":"Exposure of Resource to Wrong Sphere","shortDescription":{"text":"Exposure of Resource to Wrong Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/668.html"},{"id":"CWE-703","guid":"fa730aa9-95e4-845e-83fa-8169f2cf339e","name":"Improper Check or Handling of Exceptional Conditions","shortDescription":{"text":"Improper Check or Handling of Exceptional Conditions"},"helpUri":"https://cwe.mitre.org/data/definitions/703.html"},{"id":"CWE-704","guid":"50bd74b4-a921-5159-8671-99fd7e78c810","name":"CWE-704","shortDescription":{"text":"CWE-704"},"helpUri":"https://cwe.mitre.org/data/definitions/704.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/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":866,"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."]}]}